{"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/isin","entry":"isin","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":6,"n_papers_ran":3,"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":3,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":3},"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","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,"code_sha256_prefix":"9234f56543bcaf25","mcp_get_code":{"code_sha256":"9234f56543bcaf25"}},{"arxiv_id":"2309.15575","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,"code_sha256_prefix":"1b618c5871d8bcda","mcp_get_code":{"code_sha256":"1b618c5871d8bcda"}},{"arxiv_id":"2305.07888","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b34edff3ffec4fa0","mcp_get_code":{"code_sha256":"b34edff3ffec4fa0"}},{"arxiv_id":"2104.11212","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"e4b0b520246f1eb3","mcp_get_code":{"code_sha256":"e4b0b520246f1eb3"}},{"arxiv_id":"2012.04201","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,"code_sha256_prefix":"a527da03f9a57f62","mcp_get_code":{"code_sha256":"a527da03f9a57f62"}},{"arxiv_id":"2001.02152","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"6e89c26e38e57ef1","mcp_get_code":{"code_sha256":"6e89c26e38e57ef1"}}]}