{"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/to-binary-bag-of-words","entry":"to_binary_bag_of_words","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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"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":"2308.02117","paper":"/paper/vqgraph-graph-vector-quantization-for","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YangLing0818/VQGraph","path":"data_preprocess.py","file_url":"https://github.com/YangLing0818/VQGraph/blob/HEAD/data_preprocess.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":"c1b14a7851940dca","mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"arxiv_id":"2306.05628","paper":"/paper/quantifying-the-knowledge-in-gnns-for","title":"Quantifying the Knowledge in GNNs for Reliable Distillation into MLPs","date":"2023-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lirongwu/rkd","path":"src/data_preprocess.py","file_url":"https://github.com/lirongwu/rkd/blob/HEAD/src/data_preprocess.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":"c1b14a7851940dca","mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"arxiv_id":"2110.08727","paper":"/paper/graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-research/graphless-neural-networks","path":"data_preprocess.py","file_url":"https://github.com/snap-research/graphless-neural-networks/blob/HEAD/data_preprocess.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"c1b14a7851940dca","mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c1b14a7851940dca","mcp_get_code":{"code_sha256":"c1b14a7851940dca"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c1b14a7851940dca","mcp_get_code":{"code_sha256":"c1b14a7851940dca"}}]}