{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/setup-seed","entry":"setup_seed","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":7,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":0,"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_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1df2a80e7e9a33fb","code_sha256_prefix":"1df2a80e7e9a33fb","mcp_get_code":{"code_sha256":"1df2a80e7e9a33fb"}},{"arxiv_id":"2605.14252","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, KaiSUN1/SeAl when it was checked","code_sha256":"d7690d8a36f26fd4","code_sha256_prefix":"d7690d8a36f26fd4","mcp_get_code":{"code_sha256":"d7690d8a36f26fd4"}},{"arxiv_id":"2410.11488","arxiv_id_is_arxiv":true,"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Tab-ct/rate-based-backpropagation when it was checked","code_sha256":"d7690d8a36f26fd4","code_sha256_prefix":"d7690d8a36f26fd4","mcp_get_code":{"code_sha256":"d7690d8a36f26fd4"}},{"arxiv_id":"2410.06652","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hkuedl/Task-Oriented-Imputation when it was checked","code_sha256":"2227980b4625355e","code_sha256_prefix":"2227980b4625355e","mcp_get_code":{"code_sha256":"2227980b4625355e"}},{"arxiv_id":"2305.18405","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7060a5d3da293868","code_sha256_prefix":"7060a5d3da293868","mcp_get_code":{"code_sha256":"7060a5d3da293868"}},{"arxiv_id":"2305.18405","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ca9fb001e7b5067","code_sha256_prefix":"3ca9fb001e7b5067","mcp_get_code":{"code_sha256":"3ca9fb001e7b5067"}},{"arxiv_id":"2210.12651","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"744baf77bf3238d4","code_sha256_prefix":"744baf77bf3238d4","mcp_get_code":{"code_sha256":"744baf77bf3238d4"}},{"arxiv_id":"aaai_20726","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id 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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7060a5d3da293868","code_sha256_prefix":"7060a5d3da293868","mcp_get_code":{"code_sha256":"7060a5d3da293868"}}],"record_sha256":"4b6de55edca889617fc212bc2f940d4ea8acea61dcd5b330086377f7e04dc2f5","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}