{"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/read-graph","entry":"read_graph","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":11,"n_papers_ran":5,"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":11,"n_samples_ran":5,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":6},"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":"2408.08754","paper":"/paper/se-sgformer-a-self-explainable-signed-graph","title":"Self-Explainable Graph Transformer for Link Sign Prediction","date":"2024-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liule66/SE-SGformer","path":"reader.py","file_url":"https://github.com/liule66/SE-SGformer/blob/HEAD/reader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"e96f1e60a87dfb52","mcp_get_code":{"code_sha256":"e96f1e60a87dfb52"}},{"arxiv_id":"2210.07500","paper":"/paper/touplegdd-a-fine-designed-solution-of","title":"ToupleGDD: A Fine-Designed Solution of Influence Maximization by Deep Reinforcement Learning","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Dtrycode/ToupleGDD","path":"utils/graph_utils.py","file_url":"https://github.com/Dtrycode/ToupleGDD/blob/HEAD/utils/graph_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3d9f075d6bbf9b23","mcp_get_code":{"code_sha256":"3d9f075d6bbf9b23"}},{"arxiv_id":"2207.08189","paper":"/paper/supplementing-recurrent-neural-networks-with","title":"Supplementing Recurrent Neural Networks with Annealing to Solve Combinatorial Optimization Problems","date":"2022-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rnn-vca-co/rnn-vca-co","path":"SA/SA_Maxcut.py","file_url":"https://github.com/rnn-vca-co/rnn-vca-co/blob/HEAD/SA/SA_Maxcut.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"67921beb3d209764","mcp_get_code":{"code_sha256":"67921beb3d209764"}},{"arxiv_id":"2104.01528","paper":"/paper/sgcn-sparse-graph-convolution-network-for","title":"SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyqcom/sgcn","path":"src/ms_utils.py","file_url":"https://github.com/lyqcom/sgcn/blob/HEAD/src/ms_utils.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":"39a9b9592269ee51","mcp_get_code":{"code_sha256":"39a9b9592269ee51"}},{"arxiv_id":"2011.01302","paper":"/paper/ios-inter-operator-scheduler-for-cnn","title":"IOS: Inter-Operator Scheduler for CNN Acceleration","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mit-han-lab/inter-operator-scheduler","path":"python/ios/models/randwire.py","file_url":"https://github.com/mit-han-lab/inter-operator-scheduler/blob/HEAD/python/ios/models/randwire.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ec2d99fa16d8fb57","mcp_get_code":{"code_sha256":"ec2d99fa16d8fb57"}},{"arxiv_id":"2007.02007","paper":"/paper/nested-subspace-arrangement-for","title":"Nested Subspace Arrangement for Representation of Relational Data","date":"2020-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KyushuUniversityMathematics/DANCAR","path":"graphUtil.py","file_url":"https://github.com/KyushuUniversityMathematics/DANCAR/blob/HEAD/graphUtil.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"951ee6eeb764072b","mcp_get_code":{"code_sha256":"951ee6eeb764072b"}},{"arxiv_id":"2004.00221","paper":"/paper/nbdt-neural-backed-decision-trees","title":"NBDT: Neural-Backed Decision Trees","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XAVILLA/nbdt","path":"nbdt/model.py","file_url":"https://github.com/XAVILLA/nbdt/blob/HEAD/nbdt/model.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7ef704b1f90df1c8","mcp_get_code":{"code_sha256":"7ef704b1f90df1c8"}},{"arxiv_id":"1809.02721","paper":"/paper/learning-to-solve-np-complete-problems-a","title":"Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP","date":"2018-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Panichito/GNN-Decision-TSP","path":"gen/instance_loader.py","file_url":"https://github.com/Panichito/GNN-Decision-TSP/blob/HEAD/gen/instance_loader.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":"9eecc9d4528992bd","mcp_get_code":{"code_sha256":"9eecc9d4528992bd"}},{"arxiv_id":"1806.07464","paper":"/paper/exploring-the-semantic-content-of","title":"Exploring the Semantic Content of Unsupervised Graph Embeddings: An Empirical Study","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sbonner0/unsupervised-graph-embedding","path":"src/get_features.py","file_url":"https://github.com/sbonner0/unsupervised-graph-embedding/blob/HEAD/src/get_features.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4043b350c07f28f3","mcp_get_code":{"code_sha256":"4043b350c07f28f3"}},{"arxiv_id":"1603.05027","paper":"/paper/identity-mappings-in-deep-residual-networks","title":"Identity Mappings in Deep Residual Networks","date":"2016-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-bzh/MCNN","path":"graph_processing/translation_search.py","file_url":"https://github.com/brain-bzh/MCNN/blob/HEAD/graph_processing/translation_search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"043a08fc8f5dbadb","mcp_get_code":{"code_sha256":"043a08fc8f5dbadb"}},{"arxiv_id":"aaai_16605","paper":null,"title":"arXiv:aaai_16605","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RingBDStack/DGGAN","path":"code/utils.py","file_url":"https://github.com/RingBDStack/DGGAN/blob/HEAD/code/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1b0b10551cfabec3","mcp_get_code":{"code_sha256":"1b0b10551cfabec3"}}]}