{"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/edges-to-adj","entry":"edges_to_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":5,"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":4,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":1,"unverified":0},"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":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/Pair-Align","path":"data_process/pre_datasets.py","file_url":"https://github.com/Graph-COM/Pair-Align/blob/HEAD/data_process/pre_datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b303d995f3e0d28e","mcp_get_code":{"code_sha256":"b303d995f3e0d28e"}},{"arxiv_id":"2407.11052","paper":"/paper/revisiting-benchmarking-and-understanding-1","title":"Revisiting, Benchmarking and Understanding Unsupervised Graph Domain Adaptation","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/Pair-Align","path":"data_process/prepare_pileup.py","file_url":"https://github.com/Graph-COM/Pair-Align/blob/HEAD/data_process/prepare_pileup.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"adad8a0f35142eb0","mcp_get_code":{"code_sha256":"adad8a0f35142eb0"}},{"arxiv_id":"2403.01092","paper":"/paper/pairwise-alignment-improves-graph-domain","title":"Pairwise Alignment Improves Graph Domain Adaptation","date":"2024-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/pair-align","path":"data_process/pre_datasets.py","file_url":"https://github.com/graph-com/pair-align/blob/HEAD/data_process/pre_datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b303d995f3e0d28e","mcp_get_code":{"code_sha256":"b303d995f3e0d28e"}},{"arxiv_id":"2402.08907","paper":"/paper/tackling-negative-transfer-on-graphs","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zehong-wang/subgraph-pooling","path":"pre_data/datasets.py","file_url":"https://github.com/zehong-wang/subgraph-pooling/blob/HEAD/pre_data/datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"98148369810a06c2","mcp_get_code":{"code_sha256":"98148369810a06c2"}},{"arxiv_id":"2306.03221","paper":"/paper/structural-re-weighting-improves-graph-domain","title":"Structural Re-weighting Improves Graph Domain Adaptation","date":"2023-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/StruRW","path":"Utils/pre_data/datasets.py","file_url":"https://github.com/Graph-COM/StruRW/blob/HEAD/Utils/pre_data/datasets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"98148369810a06c2","mcp_get_code":{"code_sha256":"98148369810a06c2"}},{"arxiv_id":"2208.10364","paper":"/paper/scaling-up-dynamic-graph-representation","title":"Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks","date":"2022-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edisonleeeee/spikenet","path":"spikenet/dataset.py","file_url":"https://github.com/edisonleeeee/spikenet/blob/HEAD/spikenet/dataset.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b1802b951363e658","mcp_get_code":{"code_sha256":"b1802b951363e658"}}]}