{"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/content-hash","entry":"content_hash","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":0,"n_papers_ran_instrument_only":7,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":8,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":8,"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":8,"ran_fixture":0,"ran":0,"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":"2609.12653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12653","title":"SWARM: A Multilingual Human-Annotated Dataset for Russian Propaganda Detection in Search Engine Results","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"manueltonneau/swarm","path":"swarm/build_eval_9lang.py","file_url":"https://github.com/manueltonneau/swarm/blob/HEAD/swarm/build_eval_9lang.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"815c86272550ffe1","code_sha256_prefix":"815c86272550ffe1","mcp_get_code":{"code_sha256":"815c86272550ffe1"}},{"arxiv_id":"2609.12653","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12653","title":"SWARM: A Multilingual Human-Annotated Dataset for Russian Propaganda Detection in Search Engine Results","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"manueltonneau/swarm","path":"swarm/prepare_from_hf.py","file_url":"https://github.com/manueltonneau/swarm/blob/HEAD/swarm/prepare_from_hf.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4988bcffc3b2d2a9","code_sha256_prefix":"4988bcffc3b2d2a9","mcp_get_code":{"code_sha256":"4988bcffc3b2d2a9"}},{"arxiv_id":"2608.24188","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24188","title":"Paritok-4B: Intent-Conditioned Context Compression for Coding Agents","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"Paritok-official/paritok-4b-v1","path":"paritok/storage.py","file_url":"https://github.com/Paritok-official/paritok-4b-v1/blob/HEAD/paritok/storage.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcaf987a228b2052","code_sha256_prefix":"dcaf987a228b2052","mcp_get_code":{"code_sha256":"dcaf987a228b2052"}},{"arxiv_id":"2608.01358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01358","title":"HopRefusalBench: Diagnosing Refusal Failures in Search-Augmented Agents for Multi-Hop Reasoning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"JiananXie/HopRefusalBench","path":"src/artifacts.py","file_url":"https://github.com/JiananXie/HopRefusalBench/blob/HEAD/src/artifacts.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, JiananXie/HopRefusalBench when it was checked","code_sha256":"ec07799bcdb92981","code_sha256_prefix":"ec07799bcdb92981","mcp_get_code":{"code_sha256":"ec07799bcdb92981"}},{"arxiv_id":"2607.15557","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-15557","title":"SkillCorpus: Consolidating and Evaluating the Open Skill Ecosystem for Real-World LLM Agents","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"EverMind-AI/SkillCorpus","path":"skillcorpus/core/hashing.py","file_url":"https://github.com/EverMind-AI/SkillCorpus/blob/HEAD/skillcorpus/core/hashing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e60c4342a5d78b9","code_sha256_prefix":"0e60c4342a5d78b9","mcp_get_code":{"code_sha256":"0e60c4342a5d78b9"}},{"arxiv_id":"2607.09691","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-09691","title":"What Context Does a Coding Agent Actually Need to Act?","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"integrallis/act-context","path":"src/dhcm_ng/model.py","file_url":"https://github.com/integrallis/act-context/blob/HEAD/src/dhcm_ng/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89ffdb3e66416cdb","code_sha256_prefix":"89ffdb3e66416cdb","mcp_get_code":{"code_sha256":"89ffdb3e66416cdb"}},{"arxiv_id":"2606.09751","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-09751","title":"Collaborative Human-Agent Protocol (CHAP) An open protocol for auditable, structured multi-human and multi-agent collaboration","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"BrightbeamAI/chap","path":"packages/coordinator-py/chap_coordinator/canonical.py","file_url":"https://github.com/BrightbeamAI/chap/blob/HEAD/packages/coordinator-py/chap_coordinator/canonical.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"feec9349999bf3a9","code_sha256_prefix":"feec9349999bf3a9","mcp_get_code":{"code_sha256":"feec9349999bf3a9"}},{"arxiv_id":"2605.03824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-03824","title":"Reproducing Complex Set-Compositional Information Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"informagi/Complex-Set-Compositional-IR","path":"code/baselines/contriever/contriever.py","file_url":"https://github.com/informagi/Complex-Set-Compositional-IR/blob/HEAD/code/baselines/contriever/contriever.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, informagi/Complex-Set-Compositional-IR when it was checked","code_sha256":"cb72de2a79da99b8","code_sha256_prefix":"cb72de2a79da99b8","mcp_get_code":{"code_sha256":"cb72de2a79da99b8"}}],"record_sha256":"c121c72151a37b9ed14127c3bf4fd13bd8cf040a66a1d8465138ef38dbb5cde7","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}