{"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/chunker","entry":"chunker","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":9,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"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":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"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":"2510.21891","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-21891","title":"Embedding Trust: Semantic Isotropy Predicts Nonfactuality in Long-Form Text Generation","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"dhrupadb/semantic_isotropy","path":"lib/python/semantic_isotropy/metrics/luq.py","file_url":"https://github.com/dhrupadb/semantic_isotropy/blob/HEAD/lib/python/semantic_isotropy/metrics/luq.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"2501.13302","arxiv_id_is_arxiv":true,"paper":"/paper/watching-the-ai-watchdogs-a-fairness-and","title":"Watching the AI Watchdogs: A Fairness and Robustness Analysis of AI Safety Moderation Classifiers","date":"2025-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acharaakshit/FairMod","path":"utils.py","file_url":"https://github.com/acharaakshit/FairMod/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"2405.10974","arxiv_id_is_arxiv":true,"paper":"/paper/bottleneck-minimal-indexing-for-generative","title":"Bottleneck-Minimal Indexing for Generative Document Retrieval","date":"2024-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kduxin/Bottleneck-Minimal-Indexing","path":"BMIndexing/bert_embedding.py","file_url":"https://github.com/kduxin/Bottleneck-Minimal-Indexing/blob/HEAD/BMIndexing/bert_embedding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf90b576db7b4cc6","code_sha256_prefix":"cf90b576db7b4cc6","mcp_get_code":{"code_sha256":"cf90b576db7b4cc6"}},{"arxiv_id":"2212.10496","arxiv_id_is_arxiv":true,"paper":"/paper/precise-zero-shot-dense-retrieval-without","title":"Precise Zero-Shot Dense Retrieval without Relevance Labels","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snexus/llm-search","path":"src/llmsearch/chroma.py","file_url":"https://github.com/snexus/llm-search/blob/HEAD/src/llmsearch/chroma.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"2012.01837","arxiv_id_is_arxiv":true,"paper":"/paper/phonetic-posteriorgrams-based-many-to-many","title":"Phonetic Posteriorgrams based Many-to-Many Singing Voice Conversion via Adversarial Training","date":"2020-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hhguo/EA-SVC","path":"inference.py","file_url":"https://github.com/hhguo/EA-SVC/blob/HEAD/inference.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e320118f3d626b7","code_sha256_prefix":"0e320118f3d626b7","mcp_get_code":{"code_sha256":"0e320118f3d626b7"}},{"arxiv_id":"1906.12269","arxiv_id_is_arxiv":true,"paper":"/paper/certifiable-robustness-and-robust-training","title":"Certifiable Robustness and Robust Training for Graph Convolutional Networks","date":"2019-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danielzuegner/robust-gcn","path":"robust_gcn/robust_gcn.py","file_url":"https://github.com/danielzuegner/robust-gcn/blob/HEAD/robust_gcn/robust_gcn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"1902.00613","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-composition-of-word-embeddings","title":"Understanding Composition of Word Embeddings via Tensor Decomposition","date":"2019-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"abefrandsen/syntactic-rand-walk","path":"train_from_triplecounts.py","file_url":"https://github.com/abefrandsen/syntactic-rand-walk/blob/HEAD/train_from_triplecounts.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, abefrandsen/syntactic-rand-walk when it was checked","code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"1703.04046","arxiv_id_is_arxiv":true,"paper":"/paper/deepsleepnet-a-model-for-automatic-sleep","title":"DeepSleepNet: a Model for Automatic Sleep Stage Scoring based on Raw Single-Channel EEG","date":"2017-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVxTz/EEG_classification","path":"code/utils.py","file_url":"https://github.com/CVxTz/EEG_classification/blob/HEAD/code/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":"a21257d9277c7df3","code_sha256_prefix":"a21257d9277c7df3","mcp_get_code":{"code_sha256":"a21257d9277c7df3"}},{"arxiv_id":"1702.07825","arxiv_id_is_arxiv":true,"paper":"/paper/deep-voice-real-time-neural-text-to-speech","title":"Deep Voice: Real-time Neural Text-to-Speech","date":"2017-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NVIDIA/nv-wavenet","path":"pytorch/inference.py","file_url":"https://github.com/NVIDIA/nv-wavenet/blob/HEAD/pytorch/inference.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":"1130729f85801be6","code_sha256_prefix":"1130729f85801be6","mcp_get_code":{"code_sha256":"1130729f85801be6"}},{"arxiv_id":"1507.05717","arxiv_id_is_arxiv":true,"paper":"/paper/an-end-to-end-trainable-neural-network-for","title":"An End-to-End Trainable Neural Network for Image-based Sequence Recognition and Its Application to Scene Text Recognition","date":"2015-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}},{"arxiv_id":"2024.findings-emnlp.33","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.findings-emnlp.33","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"boudinfl/silk","path":"inference-keybart.py","file_url":"https://github.com/boudinfl/silk/blob/HEAD/inference-keybart.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec7977b6ec96dce1","code_sha256_prefix":"ec7977b6ec96dce1","mcp_get_code":{"code_sha256":"ec7977b6ec96dce1"}}],"record_sha256":"36734d53225d1a73269bb8491a3eae8ed8ae95bd0e68d0edb30959882638b923","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}