{"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/kappa","entry":"kappa","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":6,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":2,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":5,"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":1,"ran_violates":3,"ran_draft_wrong":1,"ran_fixture":2,"ran":0,"unverified":1},"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":"2608.23640","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23640","title":"Auditing the Synthetic Memoir: Measuring Scene-Level Confabulation in LLM-Generated Autobiography Against the Documented Record of the Life It Describes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"heathriel/synthetic-memoir-audit","path":"analysis/03_agreement.py","file_url":"https://github.com/heathriel/synthetic-memoir-audit/blob/HEAD/analysis/03_agreement.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, heathriel/synthetic-memoir-audit when it was checked","code_sha256":"d13b5d8b6bc6c68e","code_sha256_prefix":"d13b5d8b6bc6c68e","mcp_get_code":{"code_sha256":"d13b5d8b6bc6c68e"}},{"arxiv_id":"2608.23640","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-23640","title":"Auditing the Synthetic Memoir: Measuring Scene-Level Confabulation in LLM-Generated Autobiography Against the Documented Record of the Life It Describes","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"heathriel/synthetic-memoir-audit","path":"analysis/04_clean_agreement.py","file_url":"https://github.com/heathriel/synthetic-memoir-audit/blob/HEAD/analysis/04_clean_agreement.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, heathriel/synthetic-memoir-audit when it was checked","code_sha256":"56cb251aecba350d","code_sha256_prefix":"56cb251aecba350d","mcp_get_code":{"code_sha256":"56cb251aecba350d"}},{"arxiv_id":"2608.18116","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-18116","title":"You Are What You Prompt: Prompt Quality, Domain Shift, and Uncertainty in Agrifood Vision-Language Models Calidad de prompts, cambio de dominio e incertidumbre en modelos visión-lenguaje agroalimentarios","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ugritai/pid_agrifood","path":"analysis/pid.py","file_url":"https://github.com/ugritai/pid_agrifood/blob/HEAD/analysis/pid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed23358b68b11710","code_sha256_prefix":"ed23358b68b11710","mcp_get_code":{"code_sha256":"ed23358b68b11710"}},{"arxiv_id":"2608.10008","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10008","title":"Do LLM Recommenders Know When They're Hallucinating? Auditing Confidence Calibration in Catalog Faithfulness","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rsrijith/cikm26-catalog-faithfulness","path":"code/instrument_table.py","file_url":"https://github.com/rsrijith/cikm26-catalog-faithfulness/blob/HEAD/code/instrument_table.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, rsrijith/cikm26-catalog-faithfulness (NOASSERTION)","code_sha256":"d3106d9183a743bf","code_sha256_prefix":"d3106d9183a743bf","mcp_get_code":{"code_sha256":"d3106d9183a743bf"}},{"arxiv_id":"2410.06581","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-legal-case-retrieval-via-scaling","title":"Enhancing Legal Case Retrieval via Scaling High-quality Synthetic Query-Candidate Pairs","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/LEAD","path":"LeCaRD/metrics.py","file_url":"https://github.com/thunlp/LEAD/blob/HEAD/LeCaRD/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2244531c0f009dd7","code_sha256_prefix":"2244531c0f009dd7","mcp_get_code":{"code_sha256":"2244531c0f009dd7"}},{"arxiv_id":"2410.00169","arxiv_id_is_arxiv":true,"paper":"/paper/almost-smooth-sailing-towards-numerical","title":"(Almost) Smooth Sailing: Towards Numerical Stability of Neural Networks Through Differentiable Regularization of the Condition Number","date":"2024-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danedane-haider/Almost-Smooth-Sailing","path":"loss.py","file_url":"https://github.com/danedane-haider/Almost-Smooth-Sailing/blob/HEAD/loss.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, danedane-haider/Almost-Smooth-Sailing when it was checked","code_sha256":"ca1b61c0e922109e","code_sha256_prefix":"ca1b61c0e922109e","mcp_get_code":{"code_sha256":"ca1b61c0e922109e"}},{"arxiv_id":"2401.11687","arxiv_id_is_arxiv":true,"paper":"/paper/tim-an-efficient-temporal-interaction-module","title":"TIM: An Efficient Temporal Interaction Module for Spiking Transformer","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BrainCog-X/Brain-Cog","path":"braincog/model_zoo/qsnn.py","file_url":"https://github.com/BrainCog-X/Brain-Cog/blob/HEAD/braincog/model_zoo/qsnn.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ec18b3af081dcead","code_sha256_prefix":"ec18b3af081dcead","mcp_get_code":{"code_sha256":"ec18b3af081dcead"}},{"arxiv_id":"1610.00161","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deep-learning-with-segregated","title":"Towards deep learning with segregated dendrites","date":"2016-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jordan-g/segregated-dendrite-deep-learning","path":"deep_learning.py","file_url":"https://github.com/jordan-g/segregated-dendrite-deep-learning/blob/HEAD/deep_learning.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, jordan-g/segregated-dendrite-deep-learning, is not in the permissive set Syntology serves inline","code_sha256":"1ea7efb092e16bf4","code_sha256_prefix":"1ea7efb092e16bf4","mcp_get_code":{"code_sha256":"1ea7efb092e16bf4"}}],"record_sha256":"56e13b3e57338e933a32e82c078670052988b1c3036f53095b32cc6f3334d1e3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}