{"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/merge-dict","entry":"merge_dict","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":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":2,"ran_fixture":0,"ran":7,"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":"2605.09907","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-09907","title":"RADAR: Redundancy-Aware Diffusion for Multi-Agent Communication Structure Generation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"bingreeky/MaAS","path":"maas/config2.py","file_url":"https://github.com/bingreeky/MaAS/blob/HEAD/maas/config2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, bingreeky/MaAS when it was checked","code_sha256":"b2eab098d73493e2","code_sha256_prefix":"b2eab098d73493e2","mcp_get_code":{"code_sha256":"b2eab098d73493e2"}},{"arxiv_id":"2602.01951","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01951","title":"Enabling Progressive Whole-slide Image Analysis with Multi-scale Pyramidal Network","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"mahmoodlab/CONCH","path":"conch/downstream/utils.py","file_url":"https://github.com/mahmoodlab/CONCH/blob/HEAD/conch/downstream/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mahmoodlab/CONCH (NOASSERTION)","code_sha256":"53108a9e6f4eb2c0","code_sha256_prefix":"53108a9e6f4eb2c0","mcp_get_code":{"code_sha256":"53108a9e6f4eb2c0"}},{"arxiv_id":"2512.16202","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-16202","title":"Open Ad-hoc Categorization with Contextualized Feature Learning","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"Wayne2Wang/OAK","path":"src/utils/configs.py","file_url":"https://github.com/Wayne2Wang/OAK/blob/HEAD/src/utils/configs.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":"c60159f61d71caa5","code_sha256_prefix":"c60159f61d71caa5","mcp_get_code":{"code_sha256":"c60159f61d71caa5"}},{"arxiv_id":"2502.12018","arxiv_id_is_arxiv":true,"paper":"/paper/atom-of-thoughts-for-markov-llm-test-time","title":"Atom of Thoughts for Markov LLM Test-Time Scaling","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FoundationAgents/MetaGPT","path":"metagpt/config2.py","file_url":"https://github.com/FoundationAgents/MetaGPT/blob/HEAD/metagpt/config2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from bingreeky/MaAS, and GitHub detected no licence in that repository when it was checked","code_sha256":"b2eab098d73493e2","code_sha256_prefix":"b2eab098d73493e2","mcp_get_code":{"code_sha256":"b2eab098d73493e2"}},{"arxiv_id":"2410.13842","arxiv_id_is_arxiv":true,"paper":"/paper/d-fine-redefine-regression-task-in-detrs-as","title":"D-FINE: Redefine Regression Task in DETRs as Fine-grained Distribution Refinement","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Peterande/D-FINE","path":"src/core/yaml_utils.py","file_url":"https://github.com/Peterande/D-FINE/blob/HEAD/src/core/yaml_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":"288efb4f48e3358a","code_sha256_prefix":"288efb4f48e3358a","mcp_get_code":{"code_sha256":"288efb4f48e3358a"}},{"arxiv_id":"2402.15048","arxiv_id_is_arxiv":true,"paper":"/paper/unlocking-the-power-of-large-language-models","title":"Unlocking the Power of Large Language Models for Entity Alignment","date":"2024-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jxh4945777/ChatEA","path":"tools_for_ChatEA.py","file_url":"https://github.com/jxh4945777/ChatEA/blob/HEAD/tools_for_ChatEA.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, jxh4945777/ChatEA when it was checked","code_sha256":"61ed2f33f2fd4a7f","code_sha256_prefix":"61ed2f33f2fd4a7f","mcp_get_code":{"code_sha256":"61ed2f33f2fd4a7f"}},{"arxiv_id":"2306.08832","arxiv_id_is_arxiv":true,"paper":"/paper/contrasting-intra-modal-and-ranking-cross","title":"Contrasting Intra-Modal and Ranking Cross-Modal Hard Negatives to Enhance Visio-Linguistic Compositional Understanding","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lezhang7/Enhance-FineGrained","path":"VALSE/clip_valse_eval.py","file_url":"https://github.com/lezhang7/Enhance-FineGrained/blob/HEAD/VALSE/clip_valse_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, lezhang7/Enhance-FineGrained (NOASSERTION)","code_sha256":"b9b00e978ac7417d","code_sha256_prefix":"b9b00e978ac7417d","mcp_get_code":{"code_sha256":"b9b00e978ac7417d"}},{"arxiv_id":"2111.06063","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-equivalence-between-neural-network-and","title":"On the Equivalence between Neural Network and Support Vector Machine","date":"2021-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leslie-CH/equiv-nn-svm","path":"functions/hparams.py","file_url":"https://github.com/leslie-CH/equiv-nn-svm/blob/HEAD/functions/hparams.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":"0cfe2baee7e49f75","code_sha256_prefix":"0cfe2baee7e49f75","mcp_get_code":{"code_sha256":"0cfe2baee7e49f75"}},{"arxiv_id":"2010.11607","arxiv_id_is_arxiv":true,"paper":"/paper/backdoor-attack-against-speaker-verification","title":"Backdoor Attack against Speaker Verification","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaitongqing233/Backdoor-attack-against-speaker-verification","path":"hparam.py","file_url":"https://github.com/zhaitongqing233/Backdoor-attack-against-speaker-verification/blob/HEAD/hparam.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":"0cfe2baee7e49f75","code_sha256_prefix":"0cfe2baee7e49f75","mcp_get_code":{"code_sha256":"0cfe2baee7e49f75"}},{"arxiv_id":"1710.10467","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-end-to-end-loss-for-speaker","title":"Generalized End-to-End Loss for Speaker Verification","date":"2017-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Aurora11111/speaker-recognition-pytorch","path":"hparam.py","file_url":"https://github.com/Aurora11111/speaker-recognition-pytorch/blob/HEAD/hparam.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cfe2baee7e49f75","code_sha256_prefix":"0cfe2baee7e49f75","mcp_get_code":{"code_sha256":"0cfe2baee7e49f75"}},{"arxiv_id":"1703.10135","arxiv_id_is_arxiv":true,"paper":"/paper/tacotron-towards-end-to-end-speech-synthesis","title":"Tacotron: Towards End-to-End Speech Synthesis","date":"2017-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andabi/deep-voice-conversion","path":"hparam.py","file_url":"https://github.com/andabi/deep-voice-conversion/blob/HEAD/hparam.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":"0cfe2baee7e49f75","code_sha256_prefix":"0cfe2baee7e49f75","mcp_get_code":{"code_sha256":"0cfe2baee7e49f75"}},{"arxiv_id":"1512.02325","arxiv_id_is_arxiv":true,"paper":"/paper/ssd-single-shot-multibox-detector","title":"SSD: Single Shot MultiBox Detector","date":"2015-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LanqingLi/Chromosome","path":"config/utils.py","file_url":"https://github.com/LanqingLi/Chromosome/blob/HEAD/config/utils.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":"38ae9c26e3d9df7c","code_sha256_prefix":"38ae9c26e3d9df7c","mcp_get_code":{"code_sha256":"38ae9c26e3d9df7c"}},{"arxiv_id":"Yun_Pano-AVQA_Grounded_Audio-Visual_Question_Answering_on_360deg_Videos_ICCV_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Yun_Pano-AVQA_Grounded_Audio-Visual_Question_Answering_on_360deg_Videos_ICCV_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"hs-yn/PanoAVQA","path":"code/utils.py","file_url":"https://github.com/hs-yn/PanoAVQA/blob/HEAD/code/utils.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":"ae62896c750ac9e6","code_sha256_prefix":"ae62896c750ac9e6","mcp_get_code":{"code_sha256":"ae62896c750ac9e6"}}],"record_sha256":"f4cf67e60b9e247e07a3a68bb58cd869e700c11d2be60479b2eca6701db83f57","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}