{"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/read-jsonl-lines","entry":"read_jsonl_lines","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"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":2,"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":"2404.07103","arxiv_id_is_arxiv":true,"paper":"/paper/graph-chain-of-thought-augmenting-large","title":"Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs","date":"2024-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petergriffinjin/graph-cot","path":"GPT/code/run_GPT_rag.py","file_url":"https://github.com/petergriffinjin/graph-cot/blob/HEAD/GPT/code/run_GPT_rag.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":"f23ab5a40ed92c5b","code_sha256_prefix":"f23ab5a40ed92c5b","mcp_get_code":{"code_sha256":"f23ab5a40ed92c5b"}},{"arxiv_id":"2403.07398","arxiv_id_is_arxiv":true,"paper":"/paper/complex-reasoning-over-logical-queries-on","title":"Complex Reasoning over Logical Queries on Commonsense Knowledge Graphs","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"e0cdb96e43c1c922","code_sha256_prefix":"e0cdb96e43c1c922","mcp_get_code":{"code_sha256":"e0cdb96e43c1c922"}},{"arxiv_id":"2010.05953","arxiv_id_is_arxiv":true,"paper":"/paper/comet-atomic-2020-on-symbolic-and-neural","title":"COMET-ATOMIC 2020: On Symbolic and Neural Commonsense Knowledge Graphs","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/comet-atomic-2020","path":"models/comet_atomic2020_gpt2/comet_gpt2.py","file_url":"https://github.com/allenai/comet-atomic-2020/blob/HEAD/models/comet_atomic2020_gpt2/comet_gpt2.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, allenai/comet-atomic-2020 when it was checked","code_sha256":"e0cdb96e43c1c922","code_sha256_prefix":"e0cdb96e43c1c922","mcp_get_code":{"code_sha256":"e0cdb96e43c1c922"}},{"arxiv_id":"1908.05739","arxiv_id_is_arxiv":true,"paper":"/paper/abductive-commonsense-reasoning","title":"Abductive Commonsense Reasoning","date":"2019-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/abductive-commonsense-reasoning","path":"utils/file_utils.py","file_url":"https://github.com/allenai/abductive-commonsense-reasoning/blob/HEAD/utils/file_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":"d0d8b8a41cf48c5e","code_sha256_prefix":"d0d8b8a41cf48c5e","mcp_get_code":{"code_sha256":"d0d8b8a41cf48c5e"}},{"arxiv_id":"aaai_21290","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21290","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jiangjiechen/EDUCAT","path":"src/eval_client/metrics.py","file_url":"https://github.com/jiangjiechen/EDUCAT/blob/HEAD/src/eval_client/metrics.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":"af2a7c113bc22225","code_sha256_prefix":"af2a7c113bc22225","mcp_get_code":{"code_sha256":"af2a7c113bc22225"}}],"record_sha256":"39aa656afc0c8847bd9111e233c0faa006202222af7123f2548c5efa03b1cd9f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}