{"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/shannon-entropy","entry":"shannon_entropy","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":5,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":7,"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":4,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":1,"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":"2606.22728","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-22728","title":"When Confidence Takes the Wrong Path: Diagnosing Retrieval-State Lock-In in RAG","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"julka01/OntoGraphRAG","path":"ontographrag/rag/graph_state.py","file_url":"https://github.com/julka01/OntoGraphRAG/blob/HEAD/ontographrag/rag/graph_state.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3742500c9838c323","code_sha256_prefix":"3742500c9838c323","mcp_get_code":{"code_sha256":"3742500c9838c323"}},{"arxiv_id":"2603.11382","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-11382","title":"Detecting Intrinsic and Instrumental Self-Preservation in Autonomous Agents: The Unified Continuation-Interest Protocol","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"christopher-altman/persistence-signal-detector","path":"src/persistence_detector.py","file_url":"https://github.com/christopher-altman/persistence-signal-detector/blob/HEAD/src/persistence_detector.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, christopher-altman/persistence-signal-detector (NOASSERTION)","code_sha256":"42f6c0e68240c188","code_sha256_prefix":"42f6c0e68240c188","mcp_get_code":{"code_sha256":"42f6c0e68240c188"}},{"arxiv_id":"2412.08160","arxiv_id_is_arxiv":true,"paper":"/paper/dg-mamba-robust-and-efficient-dynamic-graph","title":"DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/DG-Mamba","path":"REDGSL.py","file_url":"https://github.com/RingBDStack/DG-Mamba/blob/HEAD/REDGSL.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2ae1ba362d8227fc","code_sha256_prefix":"2ae1ba362d8227fc","mcp_get_code":{"code_sha256":"2ae1ba362d8227fc"}},{"arxiv_id":"2404.13696","arxiv_id_is_arxiv":true,"paper":"/paper/clio-real-time-task-driven-open-set-3d-scene","title":"Clio: Real-time Task-Driven Open-Set 3D Scene Graphs","date":null,"month_inferred_from_arxiv_id":"2024-04","title_source":"archive","repo":"mit-spark/clio","path":"clio_batch/information_metrics.py","file_url":"https://github.com/mit-spark/clio/blob/HEAD/clio_batch/information_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"31fec44a12e1775a","code_sha256_prefix":"31fec44a12e1775a","mcp_get_code":{"code_sha256":"31fec44a12e1775a"}},{"arxiv_id":"2308.11669","arxiv_id_is_arxiv":true,"paper":"/paper/class-label-aware-graph-anomaly-detection","title":"Class Label-aware Graph Anomaly Detection","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhkim611/clad","path":"utils.py","file_url":"https://github.com/jhkim611/clad/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jhkim611/clad when it was checked","code_sha256":"369d2274e7edddf5","code_sha256_prefix":"369d2274e7edddf5","mcp_get_code":{"code_sha256":"369d2274e7edddf5"}},{"arxiv_id":"2211.14363","arxiv_id_is_arxiv":true,"paper":"/paper/homology-constrained-vector-quantization","title":"Homology-constrained vector quantization entropy regularizer","date":"2022-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"st4cks1defl0w/hcvq","path":"models/vq_vae.py","file_url":"https://github.com/st4cks1defl0w/hcvq/blob/HEAD/models/vq_vae.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2454f2b4b360670c","code_sha256_prefix":"2454f2b4b360670c","mcp_get_code":{"code_sha256":"2454f2b4b360670c"}},{"arxiv_id":"2025.naacl-long.612","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.naacl-long.612","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"romsto/HARP","path":"harp.py","file_url":"https://github.com/romsto/HARP/blob/HEAD/harp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"50464f53f36aa54c","code_sha256_prefix":"50464f53f36aa54c","mcp_get_code":{"code_sha256":"50464f53f36aa54c"}}],"record_sha256":"ad549e144ba9f6247f8afa5134a643440a83a6f3f6cf021ea07ff53fff7f1254","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}