{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/normalize-adj","entry":"normalize_adj","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":55,"n_papers_ran":39,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":34,"n_samples_ran":19,"n_samples_fingerprinted":6,"n_places":59,"n_places_pointer_only":19,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":1,"ran":10,"unverified":15},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2605.11622","paper":"/paper/arxiv-2605-11622","title":"RNA-FM: Flow-Matching Generative Model for Genome-wide RNA-Seq Prediction","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"YXSong000/RNA-FM","path":"src/model_RNAFM.py","file_url":"https://github.com/YXSong000/RNA-FM/blob/HEAD/src/model_RNAFM.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"88bc506f694fd184","mcp_get_code":{"code_sha256":"88bc506f694fd184"}},{"arxiv_id":"2602.08322","paper":"/paper/arxiv-2602-08322","title":"A Generative Model for Joint Multiple Intent Detection and Slot Filling","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"LooperXX/AGIF","path":"models/module.py","file_url":"https://github.com/LooperXX/AGIF/blob/HEAD/models/module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-2.0","inline_ok":false,"code_sha256_prefix":"a48a6def3e0d4ae5","mcp_get_code":{"code_sha256":"a48a6def3e0d4ae5"}},{"arxiv_id":"2602.05358","paper":"/paper/arxiv-2602-05358","title":"Bayesian Neighborhood Adaptation for Graph Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"paribeshregmi/BNA-GNN","path":"utils/utils.py","file_url":"https://github.com/paribeshregmi/BNA-GNN/blob/HEAD/utils/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"96159c4927e6eceb","mcp_get_code":{"code_sha256":"96159c4927e6eceb"}},{"arxiv_id":"2506.05019","paper":"/paper/finmultitime-a-four-modal-bilingual-dataset","title":"FinMultiTime: A Four-Modal Bilingual Dataset for Financial Time-Series Analysis","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":"archive","repo":"marigoldwu/pydgc","path":"pydgc/models/dcrn.py","file_url":"https://github.com/marigoldwu/pydgc/blob/HEAD/pydgc/models/dcrn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c4e018bdf71a1f35","mcp_get_code":{"code_sha256":"c4e018bdf71a1f35"}},{"arxiv_id":"2407.16863","paper":"/paper/balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/bmgc","path":"BMGC/utils/load_data.py","file_url":"https://github.com/zxlearningdeep/bmgc/blob/HEAD/BMGC/utils/load_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2407.16863","paper":"/paper/balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/bmgc","path":"BMGC/module/preprocess.py","file_url":"https://github.com/zxlearningdeep/bmgc/blob/HEAD/BMGC/module/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c5ffb6ba7ad635ec","mcp_get_code":{"code_sha256":"c5ffb6ba7ad635ec"}},{"arxiv_id":"2406.17281","paper":"/paper/distance-recomputator-and-topology","title":"Distance Recomputator and Topology Reconstructor for Graph Neural Networks","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NoakLiu/Distance-Recomputator-and-Topology-Reconstructor","path":"APPNP_GDRA/data_preprocesing.py","file_url":"https://github.com/NoakLiu/Distance-Recomputator-and-Topology-Reconstructor/blob/HEAD/APPNP_GDRA/data_preprocesing.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ff338d1faf4dc138","mcp_get_code":{"code_sha256":"ff338d1faf4dc138"}},{"arxiv_id":"2405.14246","paper":"/paper/gcondenser-benchmarking-graph-condensation","title":"GCondenser: Benchmarking Graph Condensation","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"superallen13/GCondenser","path":"graph_condenser/models/gdem.py","file_url":"https://github.com/superallen13/GCondenser/blob/HEAD/graph_condenser/models/gdem.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d46497ac0b764f2f","mcp_get_code":{"code_sha256":"d46497ac0b764f2f"}},{"arxiv_id":"2403.17259","paper":"/paper/diffusion-based-negative-sampling-on-graphs","title":"Diffusion-based Negative Sampling on Graphs for Link Prediction","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ntkien1904/dmns","path":"utils.py","file_url":"https://github.com/ntkien1904/dmns/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"28558e82fd389184","mcp_get_code":{"code_sha256":"28558e82fd389184"}},{"arxiv_id":"2403.15520","paper":"/paper/gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phd-lanyu/gtc","path":"code/self_tools/data_tools.py","file_url":"https://github.com/phd-lanyu/gtc/blob/HEAD/code/self_tools/data_tools.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2403.15520","paper":"/paper/gtc-gnn-transformer-co-contrastive-learning","title":"GTC: GNN-Transformer Co-contrastive Learning for Self-supervised Heterogeneous Graph Representation","date":"2024-03-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phd-lanyu/gtc","path":"code/self_tools/adj_utils.py","file_url":"https://github.com/phd-lanyu/gtc/blob/HEAD/code/self_tools/adj_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"65d2b8adf7c40867","mcp_get_code":{"code_sha256":"65d2b8adf7c40867"}},{"arxiv_id":"2403.10978","paper":"/paper/entity-alignment-with-unlabeled-dangling","title":"Lambda: Learning Matchable Prior For Entity Alignment with Unlabeled Dangling Cases","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Handon112358/NeurIPS_2024_Learning-Matchable-Prior-For-Entity-Alignment-with-Unlabeled-Dangling-Cases","path":"EA/utils.py","file_url":"https://github.com/Handon112358/NeurIPS_2024_Learning-Matchable-Prior-For-Entity-Alignment-with-Unlabeled-Dangling-Cases/blob/HEAD/EA/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"cdd6d0ebbcb75d8f","mcp_get_code":{"code_sha256":"cdd6d0ebbcb75d8f"}},{"arxiv_id":"2402.04924","paper":"/paper/two-trades-is-not-baffled-condense-graph-via","title":"Two Trades is not Baffled: Condensing Graph via Crafting Rational Gradient Matching","date":"2024-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nus-hpc-ai-lab/ctrl","path":"models/mycheby.py","file_url":"https://github.com/nus-hpc-ai-lab/ctrl/blob/HEAD/models/mycheby.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6cb1d9f84efa094","mcp_get_code":{"code_sha256":"f6cb1d9f84efa094"}},{"arxiv_id":"2312.14066","paper":"/paper/upper-bounding-barlow-twins-a-novel-filter","title":"Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering","date":"2023-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XweiQ/BTGF","path":"load_data.py","file_url":"https://github.com/XweiQ/BTGF/blob/HEAD/load_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2312.02708","paper":"/paper/provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RobustGraph/RoboGraph","path":"robograph/model/gcn_conv.py","file_url":"https://github.com/RobustGraph/RoboGraph/blob/HEAD/robograph/model/gcn_conv.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c55badf69fe079ef","mcp_get_code":{"code_sha256":"c55badf69fe079ef"}},{"arxiv_id":"2310.13822","paper":"/paper/adversarial-attacks-on-fairness-of-graph","title":"Adversarial Attacks on Fairness of Graph Neural Networks","date":"2023-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangbinchi/g-fairattack","path":"GFA.py","file_url":"https://github.com/zhangbinchi/g-fairattack/blob/HEAD/GFA.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8ed824fa0667c6a6","mcp_get_code":{"code_sha256":"8ed824fa0667c6a6"}},{"arxiv_id":"2310.09192","paper":"/paper/does-graph-distillation-see-like-vision","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","date":"2023-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/SGDD","path":"models/mycheby.py","file_url":"https://github.com/RingBDStack/SGDD/blob/HEAD/models/mycheby.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"298ffeb9a59ab721","mcp_get_code":{"code_sha256":"298ffeb9a59ab721"}},{"arxiv_id":"2309.04694","paper":"/paper/redundancy-free-self-supervised-relational","title":"Redundancy-Free Self-Supervised Relational Learning for Graph Clustering","date":"2023-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yisiyu95/r2fgc","path":"utils.py","file_url":"https://github.com/yisiyu95/r2fgc/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21166a1f4a719817","mcp_get_code":{"code_sha256":"21166a1f4a719817"}},{"arxiv_id":"2307.16210","paper":"/paper/rethinking-uncertainly-missing-and-ambiguous","title":"Rethinking Uncertainly Missing and Ambiguous Visual Modality in Multi-Modal Entity Alignment","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/umaea","path":"UMAEA/src/utils.py","file_url":"https://github.com/zjukg/umaea/blob/HEAD/UMAEA/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2306.09104","paper":"/paper/on-strengthening-and-defending-graph","title":"On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/mc-gra","path":"MC-GRA/topology_attack.py","file_url":"https://github.com/tmlr-group/mc-gra/blob/HEAD/MC-GRA/topology_attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6002a1395bc2b25d","mcp_get_code":{"code_sha256":"6002a1395bc2b25d"}},{"arxiv_id":"2305.18758","paper":"/paper/task-equivariant-graph-few-shot-learning","title":"Task-Equivariant Graph Few-shot Learning","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sung-won-kim/teg","path":"utils.py","file_url":"https://github.com/sung-won-kim/teg/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2305.18457","paper":"/paper/learning-strong-graph-neural-networks-with","title":"Learning Strong Graph Neural Networks with Weak Information","date":"2023-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yixinliu233/d2pt","path":"utils.py","file_url":"https://github.com/yixinliu233/d2pt/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"904545d90e5de9f7","mcp_get_code":{"code_sha256":"904545d90e5de9f7"}},{"arxiv_id":"2305.18405","paper":"/paper/dink-net-neural-clustering-on-large-graphs","title":"Dink-Net: Neural Clustering on Large Graphs","date":"2023-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yueliu1999/awesome-deep-graph-clustering","path":"dgc/utils/data_processor.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/utils/data_processor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16475ba069d5a2cd","mcp_get_code":{"code_sha256":"16475ba069d5a2cd"}},{"arxiv_id":"2305.02200","paper":"/paper/deep-graph-representation-learning-and","title":"Deep Graph Representation Learning and Optimization for Influence Maximization","date":"2023-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"triplej0079/DeepIM","path":"genim.py","file_url":"https://github.com/triplej0079/DeepIM/blob/HEAD/genim.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2302.02941","paper":"/paper/on-over-squashing-in-message-passing-neural","title":"On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrnzgiusti/on-oversquashing","path":"utils/utils.py","file_url":"https://github.com/lrnzgiusti/on-oversquashing/blob/HEAD/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2301.02708","paper":"/paper/few-shot-node-classification-with-extremely","title":"Few-shot Node Classification with Extremely Weak Supervision","date":"2023-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songw-sw/x-fnc","path":"train_xfnc.py","file_url":"https://github.com/songw-sw/x-fnc/blob/HEAD/train_xfnc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2212.14454","paper":"/paper/meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjukg/MEAformer","path":"src/utils.py","file_url":"https://github.com/zjukg/MEAformer/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2211.12875","paper":"/paper/a-survey-of-deep-graph-clustering-taxonomy","title":"A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resource","date":"2022-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering","path":"pydgc/models/dcrn.py","file_url":"https://github.com/marigoldwu/a-unified-framework-for-deep-attribute-graph-clustering/blob/HEAD/pydgc/models/dcrn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c4e018bdf71a1f35","mcp_get_code":{"code_sha256":"c4e018bdf71a1f35"}},{"arxiv_id":"2210.14016","paper":"/paper/shortest-edit-path-crossover-a-theory-driven","title":"Shortest Edit Path Crossover: A Theory-driven Solution to the Permutation Problem in Evolutionary Neural Architecture Search","date":"2022-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"automl/NASLib","path":"naslib/predictors/bonas.py","file_url":"https://github.com/automl/NASLib/blob/HEAD/naslib/predictors/bonas.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"8316e25dc7e10a44","mcp_get_code":{"code_sha256":"8316e25dc7e10a44"}},{"arxiv_id":"2209.00891","paper":"/paper/multi-modal-contrastive-representation","title":"Multi-modal Contrastive Representation Learning for Entity Alignment","date":"2022-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzxlin/mclea","path":"src/utils.py","file_url":"https://github.com/lzxlin/mclea/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2207.10049","paper":"/paper/pretraining-a-neural-network-before-knowing","title":"Pretraining a Neural Network before Knowing Its Architecture","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaya-yns/tart","path":"experiments/neural_predictor.py","file_url":"https://github.com/yaya-yns/tart/blob/HEAD/experiments/neural_predictor.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dfa62dfebede20fc","mcp_get_code":{"code_sha256":"dfa62dfebede20fc"}},{"arxiv_id":"2207.00012","paper":"/paper/reliable-representations-make-a-stronger","title":"Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"likuanppd/stable","path":"robcon.py","file_url":"https://github.com/likuanppd/stable/blob/HEAD/robcon.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2206.11972","paper":"/paper/task-adaptive-few-shot-node-classification","title":"Task-Adaptive Few-shot Node Classification","date":"2022-06-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2206.07423","paper":"/paper/zero-shot-object-goal-visual-navigation","title":"Zero-shot object goal visual navigation","date":"2022-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pioneer-innovation/zero-shot-object-navigation","path":"models/egnn.py","file_url":"https://github.com/pioneer-innovation/zero-shot-object-navigation/blob/HEAD/models/egnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3a3398f34669aea","mcp_get_code":{"code_sha256":"f3a3398f34669aea"}},{"arxiv_id":"2204.05351","paper":"/paper/graph-ordering-attention-networks","title":"Graph Ordering Attention Networks","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michailchatzianastasis/goat","path":"utils.py","file_url":"https://github.com/michailchatzianastasis/goat/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2203.03315","paper":"/paper/deep-reinforcement-learning-for-entity-1","title":"Deep Reinforcement Learning for Entity Alignment","date":"2022-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guolingbing/RLEA","path":"run/runRLEA.py","file_url":"https://github.com/guolingbing/RLEA/blob/HEAD/run/runRLEA.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2112.05195","paper":"/paper/context-aware-health-event-prediction-via","title":"Context-aware Health Event Prediction via Transition Functions on Dynamic Disease Graphs","date":"2021-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luchang-cs/chet","path":"preprocess/auxiliary.py","file_url":"https://github.com/luchang-cs/chet/blob/HEAD/preprocess/auxiliary.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7dbe9902db65aa9d","mcp_get_code":{"code_sha256":"7dbe9902db65aa9d"}},{"arxiv_id":"2110.08450","paper":"/paper/accelerating-training-and-inference-of-graph","title":"Accelerating Training and Inference of Graph Neural Networks with Fast Sampling and Pipelining","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gmancino/fastgcn-pytorch","path":"models/helper_functions.py","file_url":"https://github.com/gmancino/fastgcn-pytorch/blob/HEAD/models/helper_functions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45993d10da87cea","mcp_get_code":{"code_sha256":"d45993d10da87cea"}},{"arxiv_id":"2109.14285","paper":"/paper/be-confident-towards-trustworthy-graph-neural","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Diego999/pyGAT","path":"utils.py","file_url":"https://github.com/Diego999/pyGAT/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2109.14285","paper":"/paper/be-confident-towards-trustworthy-graph-neural","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BUPT-GAMMA/CaGCN","path":"utils.py","file_url":"https://github.com/BUPT-GAMMA/CaGCN/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"21b0199200507ff0","mcp_get_code":{"code_sha256":"21b0199200507ff0"}},{"arxiv_id":"2109.02066","paper":"/paper/hierarchical-object-to-zone-graph-for-object","title":"Hierarchical Object-to-Zone Graph for Object Navigation","date":"2021-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sx-zhang/hoz","path":"models/hoz.py","file_url":"https://github.com/sx-zhang/hoz/blob/HEAD/models/hoz.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3a3398f34669aea","mcp_get_code":{"code_sha256":"f3a3398f34669aea"}},{"arxiv_id":"2107.01830","paper":"/paper/arm-net-adaptive-relation-modeling-network","title":"ARM-Net: Adaptive Relation Modeling Network for Structured Data","date":"2021-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nusdbsystem/ARM-Net","path":"models/gcn.py","file_url":"https://github.com/nusdbsystem/ARM-Net/blob/HEAD/models/gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"35c5ab8762f0203a","mcp_get_code":{"code_sha256":"35c5ab8762f0203a"}},{"arxiv_id":"2104.09807","paper":"/paper/visual-navigation-with-spatial-attention","title":"Visual Navigation with Spatial Attention","date":"2021-04-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"barmayo/spatial_attention","path":"models/gcn.py","file_url":"https://github.com/barmayo/spatial_attention/blob/HEAD/models/gcn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f3a3398f34669aea","mcp_get_code":{"code_sha256":"f3a3398f34669aea"}},{"arxiv_id":"2011.01623","paper":"/paper/learning-on-attribute-missing-graphs","title":"Learning on Attribute-Missing Graphs","date":"2020-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuChenSJTU/SAT-master-link-prediction","path":"data/process.py","file_url":"https://github.com/xuChenSJTU/SAT-master-link-prediction/blob/HEAD/data/process.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a7bd63e06a7e21d1","mcp_get_code":{"code_sha256":"a7bd63e06a7e21d1"}},{"arxiv_id":"2010.05851","paper":"/paper/graph-neural-networks-for-an-accurate-and","title":"Graph Neural Networks for an Accurate and Interpretable Prediction of the Properties of Polycrystalline Materials","date":null,"month_inferred_from_arxiv_id":"2020-10","title_source":"archive","repo":"mehmetfdemirel/PolycrystalGraph","path":"data.py","file_url":"https://github.com/mehmetfdemirel/PolycrystalGraph/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e95f9c8d09fe81ec","mcp_get_code":{"code_sha256":"e95f9c8d09fe81ec"}},{"arxiv_id":"2009.13603","paper":"/paper/visual-pivoting-for-unsupervised-entity","title":"Visual Pivoting for (Unsupervised) Entity Alignment","date":"2020-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cambridgeltl/eva","path":"src/utils.py","file_url":"https://github.com/cambridgeltl/eva/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"2006.16499","paper":"/paper/sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szzhang17/Sparsest-Cut-Network-Embedding","path":"preprocess.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/preprocess.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3fdc9f593c684be4","mcp_get_code":{"code_sha256":"3fdc9f593c684be4"}},{"arxiv_id":"2006.16499","paper":"/paper/sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szzhang17/Sparsest-Cut-Network-Embedding","path":"utils.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ef3bae1c388522c4","mcp_get_code":{"code_sha256":"ef3bae1c388522c4"}},{"arxiv_id":"2003.07493","paper":"/paper/deep-relational-reasoning-graph-network-for","title":"Deep Relational Reasoning Graph Network for Arbitrary Shape Text Detection","date":"2020-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GXYM/DRRG","path":"layers/utils.py","file_url":"https://github.com/GXYM/DRRG/blob/HEAD/layers/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"24f7f39f00d6d777","mcp_get_code":{"code_sha256":"24f7f39f00d6d777"}},{"arxiv_id":"2003.06749","paper":"/paper/target-driven-visual-navigation-exploiting","title":"Learning hierarchical relationships for object-goal navigation","date":"2020-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cassieqiuyd/MJOLNIR","path":"models/mjolnir_o.py","file_url":"https://github.com/cassieqiuyd/MJOLNIR/blob/HEAD/models/mjolnir_o.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f3a3398f34669aea","mcp_get_code":{"code_sha256":"f3a3398f34669aea"}},{"arxiv_id":"1912.00848","paper":"/paper/neural-predictor-for-neural-architecture","title":"Neural Predictor for Neural Architecture Search","date":"2019-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ultmaster/neuralpredictor.pytorch","path":"model.py","file_url":"https://github.com/ultmaster/neuralpredictor.pytorch/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8316e25dc7e10a44","mcp_get_code":{"code_sha256":"8316e25dc7e10a44"}},{"arxiv_id":"1905.05178","paper":"/paper/graph-u-nets","title":"Graph U-Nets","date":"2019-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hujilin1229/gUNet","path":"ops.py","file_url":"https://github.com/hujilin1229/gUNet/blob/HEAD/ops.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"597b9f2e337f0d63","mcp_get_code":{"code_sha256":"597b9f2e337f0d63"}},{"arxiv_id":"1812.00971","paper":"/paper/learning-to-learn-how-to-learn-self-adaptive","title":"Learning to Learn How to Learn: Self-Adaptive Visual Navigation Using Meta-Learning","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/savn","path":"models/gcn.py","file_url":"https://github.com/allenai/savn/blob/HEAD/models/gcn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"f3a3398f34669aea","mcp_get_code":{"code_sha256":"f3a3398f34669aea"}},{"arxiv_id":"1810.05749","paper":"/paper/graph-hypernetworks-for-neural-architecture","title":"Graph HyperNetworks for Neural Architecture Search","date":"2018-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"dfa62dfebede20fc","mcp_get_code":{"code_sha256":"dfa62dfebede20fc"}},{"arxiv_id":"1710.10903","paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Anak2016/GAT","path":"utils.py","file_url":"https://github.com/Anak2016/GAT/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d45f434d25f2e870","mcp_get_code":{"code_sha256":"d45f434d25f2e870"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/keras-gcn","path":"kegra/utils.py","file_url":"https://github.com/tkipf/keras-gcn/blob/HEAD/kegra/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"835dff62cae2e799","mcp_get_code":{"code_sha256":"835dff62cae2e799"}},{"arxiv_id":"ijcai2024_0715","paper":null,"title":"arXiv:ijcai2024_0715","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LightChen233/DPF","path":"common/module_utils/graph_utils.py","file_url":"https://github.com/LightChen233/DPF/blob/HEAD/common/module_utils/graph_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a48a6def3e0d4ae5","mcp_get_code":{"code_sha256":"a48a6def3e0d4ae5"}},{"arxiv_id":"aaai_25573","paper":null,"title":"arXiv:aaai_25573","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yixinliu233/GREET","path":"utils.py","file_url":"https://github.com/yixinliu233/GREET/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc141c09862f16a5","mcp_get_code":{"code_sha256":"fc141c09862f16a5"}},{"arxiv_id":"aaai_20726","paper":null,"title":"arXiv:aaai_20726","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"yueliu1999/Awesome-Deep-Graph-Clustering","path":"dgc/utils/data_processor.py","file_url":"https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering/blob/HEAD/dgc/utils/data_processor.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"16475ba069d5a2cd","mcp_get_code":{"code_sha256":"16475ba069d5a2cd"}}]}