{"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/isin","entry":"isin","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"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":"2403.00143","arxiv_id_is_arxiv":true,"paper":"/paper/ensemble-based-unsupervised-discontinuous","title":"Tree-Averaging Algorithms for Ensemble-Based Unsupervised Discontinuous Constituency Parsing","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manga-uofa/taa4eudcp","path":"casestudies/to_discobracket.py","file_url":"https://github.com/manga-uofa/taa4eudcp/blob/HEAD/casestudies/to_discobracket.py","status":"ran","verification_level":1,"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, manga-uofa/taa4eudcp when it was checked","code_sha256":"9234f56543bcaf25","code_sha256_prefix":"9234f56543bcaf25","mcp_get_code":{"code_sha256":"9234f56543bcaf25"}},{"arxiv_id":"2309.15575","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-based-visual-dispersal-for-few-1","title":"Confidence-based Visual Dispersal for Few-shot Unsupervised Domain Adaptation","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bostoncake/C-VisDiT","path":"src/utils/torchutils.py","file_url":"https://github.com/Bostoncake/C-VisDiT/blob/HEAD/src/utils/torchutils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1b618c5871d8bcda","code_sha256_prefix":"1b618c5871d8bcda","mcp_get_code":{"code_sha256":"1b618c5871d8bcda"}},{"arxiv_id":"2305.07888","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-domain-generalization-via-logit","title":"Consistency Regularization for Domain Generalization with Logit Attribution Matching","date":"2023-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaohan123/lam","path":"copy_paste_aug/select_bg.py","file_url":"https://github.com/gaohan123/lam/blob/HEAD/copy_paste_aug/select_bg.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":"b34edff3ffec4fa0","code_sha256_prefix":"b34edff3ffec4fa0","mcp_get_code":{"code_sha256":"b34edff3ffec4fa0"}},{"arxiv_id":"2104.11212","arxiv_id_is_arxiv":true,"paper":"/paper/imagining-the-road-ahead-multi-agent","title":"Imagining The Road Ahead: Multi-Agent Trajectory Prediction via Differentiable Simulation","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"inverted-ai/torchdrivesim","path":"torchdrivesim/utils.py","file_url":"https://github.com/inverted-ai/torchdrivesim/blob/HEAD/torchdrivesim/utils.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":"e4b0b520246f1eb3","code_sha256_prefix":"e4b0b520246f1eb3","mcp_get_code":{"code_sha256":"e4b0b520246f1eb3"}},{"arxiv_id":"2012.04201","arxiv_id_is_arxiv":true,"paper":"/paper/gpu-accelerated-exhaustive-search-for-optimal","title":"GPU Accelerated Exhaustive Search for Optimal Ensemble of Black-Box Optimization Algorithms","date":"2020-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daxiongshu/rapids-ai-bbo-2nd-place-solution","path":"run_one_opt.py","file_url":"https://github.com/daxiongshu/rapids-ai-bbo-2nd-place-solution/blob/HEAD/run_one_opt.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, daxiongshu/rapids-ai-bbo-2nd-place-solution when it was checked","code_sha256":"a527da03f9a57f62","code_sha256_prefix":"a527da03f9a57f62","mcp_get_code":{"code_sha256":"a527da03f9a57f62"}},{"arxiv_id":"2001.02152","arxiv_id_is_arxiv":true,"paper":"/paper/parot-a-practical-framework-for-robust-deep","title":"PaRoT: A Practical Framework for Robust Deep Neural Network Training","date":"2020-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fiveai/parot","path":"parot/utils/graph.py","file_url":"https://github.com/fiveai/parot/blob/HEAD/parot/utils/graph.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e89c26e38e57ef1","code_sha256_prefix":"6e89c26e38e57ef1","mcp_get_code":{"code_sha256":"6e89c26e38e57ef1"}}],"record_sha256":"85a61336ba8eb8464f825532aaff91f7127f2ce9e26ad2c9d32a870a4bb2c6ad","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}