{"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/bootstrap","entry":"bootstrap","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":10,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"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":1,"ran_fixture":0,"ran":7,"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":"2605.08863","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-08863","title":"Max-pooling Network Revisited: Analyzing the Role of Semantic Probability in Multiple Instance Learning for Hallucination Detection","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"FUJI1229/Hallucination_Detection","path":"gen/generation/uncertainty/utils/eval_utils.py","file_url":"https://github.com/FUJI1229/Hallucination_Detection/blob/HEAD/gen/generation/uncertainty/utils/eval_utils.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":"4b00bf597ecfdaac","code_sha256_prefix":"4b00bf597ecfdaac","mcp_get_code":{"code_sha256":"4b00bf597ecfdaac"}},{"arxiv_id":"2406.15927","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-entropy-probes-robust-and-cheap","title":"Semantic Entropy Probes: Robust and Cheap Hallucination Detection in LLMs","date":"2024-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oatml/semantic-entropy-probes","path":"semantic_uncertainty/uncertainty/utils/eval_utils.py","file_url":"https://github.com/oatml/semantic-entropy-probes/blob/HEAD/semantic_uncertainty/uncertainty/utils/eval_utils.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":"4b00bf597ecfdaac","code_sha256_prefix":"4b00bf597ecfdaac","mcp_get_code":{"code_sha256":"4b00bf597ecfdaac"}},{"arxiv_id":"2310.19677","arxiv_id_is_arxiv":true,"paper":"/paper/moca-measuring-human-language-model-alignment-1","title":"MoCa: Measuring Human-Language Model Alignment on Causal and Moral Judgment Tasks","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cicl-stanford/moca","path":"experiments/causal_effect_analysis.py","file_url":"https://github.com/cicl-stanford/moca/blob/HEAD/experiments/causal_effect_analysis.py","status":"ran","verification_level":1,"contract_check":null,"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, cicl-stanford/moca when it was checked","code_sha256":"fd056bb65f483c64","code_sha256_prefix":"fd056bb65f483c64","mcp_get_code":{"code_sha256":"fd056bb65f483c64"}},{"arxiv_id":"2309.11028","arxiv_id_is_arxiv":true,"paper":"/paper/the-topology-and-geometry-of-neural","title":"The Topology and Geometry of Neural Representations","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"doerlbh/topologicalrsa","path":"utils_stats.py","file_url":"https://github.com/doerlbh/topologicalrsa/blob/HEAD/utils_stats.py","status":"ran","verification_level":1,"contract_check":null,"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, doerlbh/topologicalrsa when it was checked","code_sha256":"593a327fd9465d8e","code_sha256_prefix":"593a327fd9465d8e","mcp_get_code":{"code_sha256":"593a327fd9465d8e"}},{"arxiv_id":"2307.06422","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2307.06422","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":null,"repo":"thupchnsky/dp-gnn","path":"core/utils.py","file_url":"https://github.com/thupchnsky/dp-gnn/blob/HEAD/core/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3083dc7c7310cba3","code_sha256_prefix":"3083dc7c7310cba3","mcp_get_code":{"code_sha256":"3083dc7c7310cba3"}},{"arxiv_id":"2203.00949","arxiv_id_is_arxiv":true,"paper":"/paper/gap-differentially-private-graph-neural","title":"GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation","date":"2022-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sisaman/gap","path":"core/utils.py","file_url":"https://github.com/sisaman/gap/blob/HEAD/core/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3083dc7c7310cba3","code_sha256_prefix":"3083dc7c7310cba3","mcp_get_code":{"code_sha256":"3083dc7c7310cba3"}},{"arxiv_id":"2104.08202","arxiv_id_is_arxiv":true,"paper":"/paper/q-2-evaluating-factual-consistency-in","title":"$Q^{2}$: Evaluating Factual Consistency in Knowledge-Grounded Dialogues via Question Generation and Question Answering","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orhonovich/q-squared","path":"system_level.py","file_url":"https://github.com/orhonovich/q-squared/blob/HEAD/system_level.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":"be95edb39d85841d","code_sha256_prefix":"be95edb39d85841d","mcp_get_code":{"code_sha256":"be95edb39d85841d"}},{"arxiv_id":"1909.03772","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-on-reproducibility-by-evaluating","title":"A Survey on Reproducibility by Evaluating Deep Reinforcement Learning Algorithms on Real-World Robots","date":"2019-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dti-research/SenseActExperiments","path":"evaluate/evaluate.py","file_url":"https://github.com/dti-research/SenseActExperiments/blob/HEAD/evaluate/evaluate.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":"72d7383d8fc116f0","code_sha256_prefix":"72d7383d8fc116f0","mcp_get_code":{"code_sha256":"72d7383d8fc116f0"}},{"arxiv_id":"1811.09393","arxiv_id_is_arxiv":true,"paper":"/paper/temporally-coherent-gans-for-video-super","title":"Learning Temporal Coherence via Self-Supervision for GAN-based Video Generation","date":"2018-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunil/TecoGAN","path":"LPIPSmodels/util.py","file_url":"https://github.com/thunil/TecoGAN/blob/HEAD/LPIPSmodels/util.py","status":"unverified","verification_level":0,"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":"e5bd7d84ecd3318d","code_sha256_prefix":"e5bd7d84ecd3318d","mcp_get_code":{"code_sha256":"e5bd7d84ecd3318d"}},{"arxiv_id":"1509.05778","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-approach-to-linear-regression-in","title":"A Bayesian approach to linear regression in astronomy","date":null,"month_inferred_from_arxiv_id":"2015-09","title_source":"archive","repo":"rsnemmen/BCES","path":"bces/bces.py","file_url":"https://github.com/rsnemmen/BCES/blob/HEAD/bces/bces.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ade06d7c5c714e50","code_sha256_prefix":"ade06d7c5c714e50","mcp_get_code":{"code_sha256":"ade06d7c5c714e50"}},{"arxiv_id":"1411.5039","arxiv_id_is_arxiv":true,"paper":"/paper/introduction-to-astroml-machine-learning-for","title":"Introduction to astroML: Machine Learning for Astrophysics","date":null,"month_inferred_from_arxiv_id":"2014-11","title_source":"archive","repo":"LBJ-Wade/astroML","path":"astroML/resample.py","file_url":"https://github.com/LBJ-Wade/astroML/blob/HEAD/astroML/resample.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a73f1eddaa803ee","code_sha256_prefix":"5a73f1eddaa803ee","mcp_get_code":{"code_sha256":"5a73f1eddaa803ee"}}],"record_sha256":"4b8a438f402e5e6495eebb5f815df97064eab6dd6df952f43447c941a098cf6b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}