{"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/isfloat","entry":"isfloat","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":9,"n_places_pointer_only":3,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2410.05162","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-the-interplay-of-parametric-and","title":"Deciphering the Interplay of Parametric and Non-parametric Memory in Retrieval-augmented Language Models","date":"2024-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m3hrdadfi/rag-memory-interplay","path":"src/causal_trace.py","file_url":"https://github.com/m3hrdadfi/rag-memory-interplay/blob/HEAD/src/causal_trace.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, m3hrdadfi/rag-memory-interplay when it was checked","code_sha256":"bb1041c0bde2033c","code_sha256_prefix":"bb1041c0bde2033c","mcp_get_code":{"code_sha256":"bb1041c0bde2033c"}},{"arxiv_id":"2403.04050","arxiv_id_is_arxiv":true,"paper":"/paper/belief-enriched-pessimistic-q-learning","title":"Belief-Enriched Pessimistic Q-Learning against Adversarial State Perturbations","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SliencerX/Belief-enriched-robust-Q-learning","path":"argparser.py","file_url":"https://github.com/SliencerX/Belief-enriched-robust-Q-learning/blob/HEAD/argparser.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, SliencerX/Belief-enriched-robust-Q-learning when it was checked","code_sha256":"2f8e524a282482b9","code_sha256_prefix":"2f8e524a282482b9","mcp_get_code":{"code_sha256":"2f8e524a282482b9"}},{"arxiv_id":"2207.05849","arxiv_id_is_arxiv":true,"paper":"/paper/contextual-bandits-with-smooth-regret","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","date":"2022-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmineiro/smoothcb","path":"contextualbanditexperiment/tune-fastcbcorral.py","file_url":"https://github.com/pmineiro/smoothcb/blob/HEAD/contextualbanditexperiment/tune-fastcbcorral.py","status":"unverified","verification_level":0,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fea89a181c2123e3","code_sha256_prefix":"fea89a181c2123e3","mcp_get_code":{"code_sha256":"fea89a181c2123e3"}},{"arxiv_id":"2108.08420","arxiv_id_is_arxiv":true,"paper":"/paper/d3d-hoi-dynamic-3d-human-object-interactions","title":"D3D-HOI: Dynamic 3D Human-Object Interactions from Videos","date":"2021-08-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/d3d-hoi","path":"optimization/evaluate.py","file_url":"https://github.com/facebookresearch/d3d-hoi/blob/HEAD/optimization/evaluate.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/d3d-hoi (NOASSERTION)","code_sha256":"55630163a1e87842","code_sha256_prefix":"55630163a1e87842","mcp_get_code":{"code_sha256":"55630163a1e87842"}},{"arxiv_id":"2105.02486","arxiv_id_is_arxiv":true,"paper":"/paper/a-generative-symbolic-model-for-more-general","title":"Towards General Natural Language Understanding with Probabilistic Worldbuilding","date":"2021-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asaparov/fictionalgeoqa","path":"run_boxer.py","file_url":"https://github.com/asaparov/fictionalgeoqa/blob/HEAD/run_boxer.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8e524a282482b9","code_sha256_prefix":"2f8e524a282482b9","mcp_get_code":{"code_sha256":"2f8e524a282482b9"}},{"arxiv_id":"2103.14023","arxiv_id_is_arxiv":true,"paper":"/paper/agentformer-agent-aware-transformers-for","title":"AgentFormer: Agent-Aware Transformers for Socio-Temporal Multi-Agent Forecasting","date":"2021-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Khrylx/AgentFormer","path":"utils/utils.py","file_url":"https://github.com/Khrylx/AgentFormer/blob/HEAD/utils/utils.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":"664e282ebf0d3ef6","code_sha256_prefix":"664e282ebf0d3ef6","mcp_get_code":{"code_sha256":"664e282ebf0d3ef6"}},{"arxiv_id":"2008.06081","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-training-and-provable-robustness","title":"Adversarial Training and Provable Robustness: A Tale of Two Objectives","date":"2020-08-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JmfanBU/AdvIBP","path":"IBP_Adv_Training/utils/argparser.py","file_url":"https://github.com/JmfanBU/AdvIBP/blob/HEAD/IBP_Adv_Training/utils/argparser.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8e524a282482b9","code_sha256_prefix":"2f8e524a282482b9","mcp_get_code":{"code_sha256":"2f8e524a282482b9"}},{"arxiv_id":"2002.12920","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-perturbation-analysis-on-general","title":"Automatic Perturbation Analysis for Scalable Certified Robustness and Beyond","date":"2020-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/CROWN-IBP","path":"argparser.py","file_url":"https://github.com/huanzhang12/CROWN-IBP/blob/HEAD/argparser.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8e524a282482b9","code_sha256_prefix":"2f8e524a282482b9","mcp_get_code":{"code_sha256":"2f8e524a282482b9"}},{"arxiv_id":"1712.07629","arxiv_id_is_arxiv":true,"paper":"/paper/superpoint-self-supervised-interest-point","title":"SuperPoint: Self-Supervised Interest Point Detection and Description","date":"2017-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gabriel-sgama/semantic-superpoint","path":"evaluation.py","file_url":"https://github.com/gabriel-sgama/semantic-superpoint/blob/HEAD/evaluation.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f8e524a282482b9","code_sha256_prefix":"2f8e524a282482b9","mcp_get_code":{"code_sha256":"2f8e524a282482b9"}}],"record_sha256":"af96a9fffb63ec4a3f78116f72b7ab3896c59afdb7fa389d00d8ad6d0218d06c","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}