{"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/setup-seed","entry":"setup_seed","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":7,"n_papers_ran":2,"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":6,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2606.22975","paper":"/paper/arxiv-2606-22975","title":"TALK: Text-attributed Graph Dataset Distillation via Coupling Language Model with Graph-Aware Kernel","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"thisis05/TaLK","path":"pipelines/distillation_pipeline.py","file_url":"https://github.com/thisis05/TaLK/blob/HEAD/pipelines/distillation_pipeline.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1df2a80e7e9a33fb","mcp_get_code":{"code_sha256":"1df2a80e7e9a33fb"}},{"arxiv_id":"2605.14252","paper":"/paper/arxiv-2605-14252","title":"Not All Timesteps Matter Equally: Selective Alignment Knowledge Distillation for Spiking Neural Networks","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"KaiSUN1/SeAl","path":"util/util.py","file_url":"https://github.com/KaiSUN1/SeAl/blob/HEAD/util/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7690d8a36f26fd4","mcp_get_code":{"code_sha256":"d7690d8a36f26fd4"}},{"arxiv_id":"2410.11488","paper":"/paper/advancing-training-efficiency-of-deep-spiking","title":"Advancing Training Efficiency of Deep Spiking Neural Networks through Rate-based Backpropagation","date":"2024-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tab-ct/rate-based-backpropagation","path":"util/util.py","file_url":"https://github.com/Tab-ct/rate-based-backpropagation/blob/HEAD/util/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d7690d8a36f26fd4","mcp_get_code":{"code_sha256":"d7690d8a36f26fd4"}},{"arxiv_id":"2410.06652","paper":"/paper/task-oriented-time-series-imputation","title":"Task-oriented Time Series Imputation Evaluation via Generalized Representers","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkuedl/Task-Oriented-Imputation","path":"utils.py","file_url":"https://github.com/hkuedl/Task-Oriented-Imputation/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2227980b4625355e","mcp_get_code":{"code_sha256":"2227980b4625355e"}},{"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/rand/random_seed.py","file_url":"https://github.com/yueliu1999/awesome-deep-graph-clustering/blob/HEAD/dgc/rand/random_seed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7060a5d3da293868","mcp_get_code":{"code_sha256":"7060a5d3da293868"}},{"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/dink-net","path":"utils.py","file_url":"https://github.com/yueliu1999/dink-net/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":"3ca9fb001e7b5067","mcp_get_code":{"code_sha256":"3ca9fb001e7b5067"}},{"arxiv_id":"2210.12651","paper":"/paper/unsupervised-non-transferable-text","title":"Unsupervised Non-transferable Text Classification","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chaoscodes/untl","path":"UNTL.py","file_url":"https://github.com/chaoscodes/untl/blob/HEAD/UNTL.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"744baf77bf3238d4","mcp_get_code":{"code_sha256":"744baf77bf3238d4"}},{"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/rand/random_seed.py","file_url":"https://github.com/yueliu1999/Awesome-Deep-Graph-Clustering/blob/HEAD/dgc/rand/random_seed.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7060a5d3da293868","mcp_get_code":{"code_sha256":"7060a5d3da293868"}}]}