{"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/get-bounds","entry":"get_bounds","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":5,"n_papers_ran_instrument_only":3,"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":5,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":4,"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":3,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":2,"ran":2,"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":"2601.17103","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-17103","title":"Performance uncertainty in medical image analysis: a large-scale investigation of confidence intervals","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"aramis-lab/CIs_Medical_Imaging","path":"src/intervals_and_metrics/metrics_bounds_and_continuity.py","file_url":"https://github.com/aramis-lab/CIs_Medical_Imaging/blob/HEAD/src/intervals_and_metrics/metrics_bounds_and_continuity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, aramis-lab/CIs_Medical_Imaging when it was checked","code_sha256":"1af7683d986baffa","code_sha256_prefix":"1af7683d986baffa","mcp_get_code":{"code_sha256":"1af7683d986baffa"}},{"arxiv_id":"2406.00288","arxiv_id_is_arxiv":true,"paper":"/paper/neural-optimal-transport-with-lagrangian","title":"Neural Optimal Transport with Lagrangian Costs","date":"2024-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/lagrangian-ot","path":"lagrangian_ot/data.py","file_url":"https://github.com/facebookresearch/lagrangian-ot/blob/HEAD/lagrangian_ot/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, facebookresearch/lagrangian-ot (NOASSERTION)","code_sha256":"71a6cf96a8d75736","code_sha256_prefix":"71a6cf96a8d75736","mcp_get_code":{"code_sha256":"71a6cf96a8d75736"}},{"arxiv_id":"2404.00848","arxiv_id_is_arxiv":true,"paper":"/paper/predictive-performance-comparison-of-decision","title":"Predictive Performance Comparison of Decision Policies Under Confounding","date":"2024-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lguerdan/icml24_predictive_performance_comparison_dps","path":"bounds.py","file_url":"https://github.com/lguerdan/icml24_predictive_performance_comparison_dps/blob/HEAD/bounds.py","status":"unverified","verification_level":0,"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, lguerdan/icml24_predictive_performance_comparison_dps when it was checked","code_sha256":"3d538d5232e8d9eb","code_sha256_prefix":"3d538d5232e8d9eb","mcp_get_code":{"code_sha256":"3d538d5232e8d9eb"}},{"arxiv_id":"2302.12247","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-modeling-multimodal-interactions-1","title":"Quantifying & Modeling Multimodal Interactions: An Information Decomposition Framework","date":"2023-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pliang279/pid","path":"bounds/bounds.py","file_url":"https://github.com/pliang279/pid/blob/HEAD/bounds/bounds.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6de22f9453a75297","code_sha256_prefix":"6de22f9453a75297","mcp_get_code":{"code_sha256":"6de22f9453a75297"}},{"arxiv_id":"2111.01460","arxiv_id_is_arxiv":true,"paper":"/paper/geometry-aware-bayesian-optimization-in","title":"Geometry-aware Bayesian Optimization in Robotics using Riemannian Matérn Kernels","date":"2021-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noemiejaquier/materngabo","path":"examples/bo_manifolds_benchmark_examples/bo_sphere.py","file_url":"https://github.com/noemiejaquier/materngabo/blob/HEAD/examples/bo_manifolds_benchmark_examples/bo_sphere.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":"497840b7481a16b1","code_sha256_prefix":"497840b7481a16b1","mcp_get_code":{"code_sha256":"497840b7481a16b1"}},{"arxiv_id":"2007.04154","arxiv_id_is_arxiv":true,"paper":"/paper/robust-pricing-and-hedging-via-neural-sdes","title":"Robust pricing and hedging via neural SDEs","date":"2020-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ericavanee/bicausal_wasserstein_mtglproj","path":"src/adapted_mtgl/mtgl_test/mtgl.py","file_url":"https://github.com/ericavanee/bicausal_wasserstein_mtglproj/blob/HEAD/src/adapted_mtgl/mtgl_test/mtgl.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":"44a386d5b2fad448","code_sha256_prefix":"44a386d5b2fad448","mcp_get_code":{"code_sha256":"44a386d5b2fad448"}},{"arxiv_id":"1801.08379","arxiv_id_is_arxiv":true,"paper":"/paper/deepwriting-making-digital-ink-editable-via","title":"DeepWriting: Making Digital Ink Editable via Deep Generative Modeling","date":"2018-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"emreaksan/deepwriting","path":"visualize_hw.py","file_url":"https://github.com/emreaksan/deepwriting/blob/HEAD/visualize_hw.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f49efd14b981602d","code_sha256_prefix":"f49efd14b981602d","mcp_get_code":{"code_sha256":"f49efd14b981602d"}},{"arxiv_id":"1611.03068","arxiv_id_is_arxiv":true,"paper":"/paper/incremental-sequence-learning","title":"Incremental Sequence Learning","date":"2016-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"edwin-de-jong/incremental-sequence-learning","path":"utils.py","file_url":"https://github.com/edwin-de-jong/incremental-sequence-learning/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":"bf183031cbfcd737","code_sha256_prefix":"bf183031cbfcd737","mcp_get_code":{"code_sha256":"bf183031cbfcd737"}},{"arxiv_id":"1505.07376","arxiv_id_is_arxiv":true,"paper":"/paper/texture-synthesis-using-convolutional-neural","title":"Texture Synthesis Using Convolutional Neural Networks","date":"2015-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"swift-n-brutal/syntex","path":"gatys/synthesizer.py","file_url":"https://github.com/swift-n-brutal/syntex/blob/HEAD/gatys/synthesizer.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, swift-n-brutal/syntex when it was checked","code_sha256":"70c160d69608ec3e","code_sha256_prefix":"70c160d69608ec3e","mcp_get_code":{"code_sha256":"70c160d69608ec3e"}}],"record_sha256":"d65dc76ea03b413611f064bade4b28ecea7d9753e10150ba4183a48624b8059b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}