{"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/default-collate","entry":"default_collate","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":7,"n_papers_ran_no_instrument_failure":7,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":1,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":0},"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":"2004.10566","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neighbourhood-consensus-networks","title":"Efficient Neighbourhood Consensus Networks via Submanifold Sparse Convolutions","date":"2020-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignacio-rocco/sparse-ncnet","path":"lib/dataloader.py","file_url":"https://github.com/ignacio-rocco/sparse-ncnet/blob/HEAD/lib/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb5ca9515b0fe778","code_sha256_prefix":"eb5ca9515b0fe778","mcp_get_code":{"code_sha256":"eb5ca9515b0fe778"}},{"arxiv_id":"2003.12059","arxiv_id_is_arxiv":true,"paper":"/paper/correspondence-networks-with-adaptive","title":"Correspondence Networks with Adaptive Neighbourhood Consensus","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ActiveVisionLab/ANCNet","path":"lib/dataloader.py","file_url":"https://github.com/ActiveVisionLab/ANCNet/blob/HEAD/lib/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb5ca9515b0fe778","code_sha256_prefix":"eb5ca9515b0fe778","mcp_get_code":{"code_sha256":"eb5ca9515b0fe778"}},{"arxiv_id":"2003.11963","arxiv_id_is_arxiv":true,"paper":"/paper/tldr-token-loss-dynamic-reweighting-for","title":"TLDR: Token Loss Dynamic Reweighting for Reducing Repetitive Utterance Generation","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShaojieJiang/tldr","path":"parlai/core/pytorch_data_teacher.py","file_url":"https://github.com/ShaojieJiang/tldr/blob/HEAD/parlai/core/pytorch_data_teacher.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ShaojieJiang/tldr, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"bf6f8d5ab5c677aa","code_sha256_prefix":"bf6f8d5ab5c677aa","mcp_get_code":{"code_sha256":"bf6f8d5ab5c677aa"}},{"arxiv_id":"1909.05863","arxiv_id_is_arxiv":true,"paper":"/paper/finding-generalizable-evidence-by-learning-to","title":"Finding Generalizable Evidence by Learning to Convince Q&A Models","date":"2019-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanjperez/convince","path":"ParlAI/parlai/core/pytorch_data_teacher.py","file_url":"https://github.com/ethanjperez/convince/blob/HEAD/ParlAI/parlai/core/pytorch_data_teacher.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9ef7e3192d9397e","code_sha256_prefix":"a9ef7e3192d9397e","mcp_get_code":{"code_sha256":"a9ef7e3192d9397e"}},{"arxiv_id":"1810.10510","arxiv_id_is_arxiv":true,"paper":"/paper/neighbourhood-consensus-networks","title":"Neighbourhood Consensus Networks","date":"2018-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiwonCocoder/matching1","path":"lib/dataloader.py","file_url":"https://github.com/JiwonCocoder/matching1/blob/HEAD/lib/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb5ca9515b0fe778","code_sha256_prefix":"eb5ca9515b0fe778","mcp_get_code":{"code_sha256":"eb5ca9515b0fe778"}},{"arxiv_id":"1803.09877","arxiv_id_is_arxiv":true,"paper":"/paper/draco-byzantine-resilient-distributed","title":"DRACO: Byzantine-resilient Distributed Training via Redundant Gradients","date":"2018-03-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwang595/Draco","path":"src/data_loader_ops/my_data_loader.py","file_url":"https://github.com/hwang595/Draco/blob/HEAD/src/data_loader_ops/my_data_loader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb5ca9515b0fe778","code_sha256_prefix":"eb5ca9515b0fe778","mcp_get_code":{"code_sha256":"eb5ca9515b0fe778"}},{"arxiv_id":"1703.05593","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-network-architecture-for","title":"Convolutional neural network architecture for geometric matching","date":"2017-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ignacio-rocco/cnngeometric_pytorch","path":"util/dataloader.py","file_url":"https://github.com/ignacio-rocco/cnngeometric_pytorch/blob/HEAD/util/dataloader.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb5ca9515b0fe778","code_sha256_prefix":"eb5ca9515b0fe778","mcp_get_code":{"code_sha256":"eb5ca9515b0fe778"}}],"record_sha256":"e9a9fa39a0f183ead95ab0f668074ae81919ad402de1893a2c921027c4edc835","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}