{"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/dict-to-str","entry":"dict_to_str","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":9,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":5,"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":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"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":3,"ran_fixture":0,"ran":4,"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":"2505.18726","arxiv_id_is_arxiv":true,"paper":"/paper/audio-geolocation-a-natural-sounds-benchmark","title":"Audio Geolocation: A Natural Sounds Benchmark","date":"2025-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvl-umass/nat-sound2loc-code","path":"src/utils.py","file_url":"https://github.com/cvl-umass/nat-sound2loc-code/blob/HEAD/src/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":"d8051bea50031a00","code_sha256_prefix":"d8051bea50031a00","mcp_get_code":{"code_sha256":"d8051bea50031a00"}},{"arxiv_id":"2412.12225","arxiv_id_is_arxiv":true,"paper":"/paper/dlf-disentangled-language-focused-multimodal","title":"DLF: Disentangled-Language-Focused Multimodal Sentiment Analysis","date":"2024-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pwang322/dlf","path":"utils/functions.py","file_url":"https://github.com/pwang322/dlf/blob/HEAD/utils/functions.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":"c8423ee1916002d8","code_sha256_prefix":"c8423ee1916002d8","mcp_get_code":{"code_sha256":"c8423ee1916002d8"}},{"arxiv_id":"2405.08363","arxiv_id_is_arxiv":true,"paper":"/paper/unmarker-a-universal-attack-on-defensive","title":"UnMarker: A Universal Attack on Defensive Image Watermarking","date":"2024-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andrekassis/ai-watermark","path":"attack.py","file_url":"https://github.com/andrekassis/ai-watermark/blob/HEAD/attack.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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, andrekassis/ai-watermark (NOASSERTION)","code_sha256":"310ee02a872957c1","code_sha256_prefix":"310ee02a872957c1","mcp_get_code":{"code_sha256":"310ee02a872957c1"}},{"arxiv_id":"2106.07802","arxiv_id_is_arxiv":true,"paper":"/paper/geomol-torsional-geometric-generation-of","title":"GeoMol: Torsional Geometric Generation of Molecular 3D Conformer Ensembles","date":"2021-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PattanaikL/GeoMol","path":"utils.py","file_url":"https://github.com/PattanaikL/GeoMol/blob/HEAD/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":"27e50d18e39112b5","code_sha256_prefix":"27e50d18e39112b5","mcp_get_code":{"code_sha256":"27e50d18e39112b5"}},{"arxiv_id":"2106.03765","arxiv_id_is_arxiv":true,"paper":"/paper/on-inductive-biases-for-heterogeneous","title":"On Inductive Biases for Heterogeneous Treatment Effect Estimation","date":"2021-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nlokeshiisc/pairnet_release","path":"experiments/experiments_benchmarks_NeurIPS21/ihdp_experiments_catenets.py","file_url":"https://github.com/nlokeshiisc/pairnet_release/blob/HEAD/experiments/experiments_benchmarks_NeurIPS21/ihdp_experiments_catenets.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f76e1a21707c2931","code_sha256_prefix":"f76e1a21707c2931","mcp_get_code":{"code_sha256":"f76e1a21707c2931"}},{"arxiv_id":"2105.03418","arxiv_id_is_arxiv":true,"paper":"/paper/deep-learning-hamiltonian-monte-carlo","title":"Deep Learning Hamiltonian Monte Carlo","date":"2021-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"saforem2/l2hmc-qcd","path":"src/l2hmc/common.py","file_url":"https://github.com/saforem2/l2hmc-qcd/blob/HEAD/src/l2hmc/common.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":"2d5f8e2abbc109f7","code_sha256_prefix":"2d5f8e2abbc109f7","mcp_get_code":{"code_sha256":"2d5f8e2abbc109f7"}},{"arxiv_id":"2101.10943","arxiv_id_is_arxiv":true,"paper":"/paper/nonparametric-estimation-of-heterogeneous","title":"Nonparametric Estimation of Heterogeneous Treatment Effects: From Theory to Learning Algorithms","date":"2021-01-26","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":"f76e1a21707c2931","code_sha256_prefix":"f76e1a21707c2931","mcp_get_code":{"code_sha256":"f76e1a21707c2931"}},{"arxiv_id":"2002.05257","arxiv_id_is_arxiv":true,"paper":"/paper/shortest-path-distance-approximation-using","title":"Shortest path distance approximation using deep learning techniques","date":"2020-02-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nayash/shortest-distance-approx-deep-learning","path":"src/utils.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/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":"4ce03fc053708d03","code_sha256_prefix":"4ce03fc053708d03","mcp_get_code":{"code_sha256":"4ce03fc053708d03"}},{"arxiv_id":"Wang_Distribution-Consistent_Modal_Recovering_for_Incomplete_Multimodal_Learning_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Distribution-Consistent_Modal_Recovering_for_Incomplete_Multimodal_Learning_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mdswyz/DiCMoR","path":"utils/functions.py","file_url":"https://github.com/mdswyz/DiCMoR/blob/HEAD/utils/functions.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":"c8423ee1916002d8","code_sha256_prefix":"c8423ee1916002d8","mcp_get_code":{"code_sha256":"c8423ee1916002d8"}}],"record_sha256":"1d3bce5e24b21767b57e549fdd31c4bc951e4520a93e7b49af91e44c960fb4d1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}