{"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-colors","entry":"get_colors","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":13,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":13,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":13,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"unverified":2},"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":"2607.16987","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-16987","title":"Twisted Schrödinger Bridge Matching","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"maxencenoble/twisted-sb-matching","path":"bridge/runners/plotters.py","file_url":"https://github.com/maxencenoble/twisted-sb-matching/blob/HEAD/bridge/runners/plotters.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"241ac1670aa7bf23","code_sha256_prefix":"241ac1670aa7bf23","mcp_get_code":{"code_sha256":"241ac1670aa7bf23"}},{"arxiv_id":"2606.26071","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-26071","title":"Model Forensics: Investigating Whether Concerning Behavior Reflects Misalignment","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"gkroiz/model_forensics_paper","path":"src/model_incrimination_paper/plotting.py","file_url":"https://github.com/gkroiz/model_forensics_paper/blob/HEAD/src/model_incrimination_paper/plotting.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, gkroiz/model_forensics_paper when it was checked","code_sha256":"d134fa1b3032ebc7","code_sha256_prefix":"d134fa1b3032ebc7","mcp_get_code":{"code_sha256":"d134fa1b3032ebc7"}},{"arxiv_id":"2412.05435","arxiv_id_is_arxiv":true,"paper":"/paper/uniscene-unified-occupancy-centric-driving","title":"UniScene: Unified Occupancy-centric Driving Scene Generation","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arlo0o/uniscene-unified-occupancy-centric-driving-scene-generation","path":"occupancy_gen/map_visualizer.py","file_url":"https://github.com/arlo0o/uniscene-unified-occupancy-centric-driving-scene-generation/blob/HEAD/occupancy_gen/map_visualizer.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":"bcc7fc71a1ced4e3","code_sha256_prefix":"bcc7fc71a1ced4e3","mcp_get_code":{"code_sha256":"bcc7fc71a1ced4e3"}},{"arxiv_id":"2410.11061","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-optimize-for-mixed-integer-non","title":"Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees","date":"2024-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pnnl/neuromancer","path":"src/neuromancer/plot.py","file_url":"https://github.com/pnnl/neuromancer/blob/HEAD/src/neuromancer/plot.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, pnnl/neuromancer (NOASSERTION)","code_sha256":"f7718aa07053729c","code_sha256_prefix":"f7718aa07053729c","mcp_get_code":{"code_sha256":"f7718aa07053729c"}},{"arxiv_id":"2406.03697","arxiv_id_is_arxiv":true,"paper":"/paper/superpoint-gaussian-splatting-for-real-time","title":"Superpoint Gaussian Splatting for Real-Time High-Fidelity Dynamic Scene Reconstruction","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dnvtmf/SP_GS","path":"gui_edit.py","file_url":"https://github.com/dnvtmf/SP_GS/blob/HEAD/gui_edit.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":"1424b4f89bc83042","code_sha256_prefix":"1424b4f89bc83042","mcp_get_code":{"code_sha256":"1424b4f89bc83042"}},{"arxiv_id":"2405.12182","arxiv_id_is_arxiv":true,"paper":"/paper/nearest-neighbors-gparareal-improving","title":"Nearest Neighbors GParareal: Improving Scalability of Gaussian Processes for Parallel-in-Time Solvers","date":null,"month_inferred_from_arxiv_id":"2024-05","title_source":"archive","repo":"Parallel-in-Time-Differential-Equations/Nearest-Neighbors-GParareal","path":"Figure_1.py","file_url":"https://github.com/Parallel-in-Time-Differential-Equations/Nearest-Neighbors-GParareal/blob/HEAD/Figure_1.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3b7dc7e3ead52d15","code_sha256_prefix":"3b7dc7e3ead52d15","mcp_get_code":{"code_sha256":"3b7dc7e3ead52d15"}},{"arxiv_id":"2403.11807","arxiv_id_is_arxiv":true,"paper":"/paper/how-far-are-we-on-the-decision-making-of-llms","title":"How Far Are We on the Decision-Making of LLMs? Evaluating LLMs' Gaming Ability in Multi-Agent Environments","date":"2024-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUHK-ARISE/GAMABench","path":"analysis/analysis.py","file_url":"https://github.com/CUHK-ARISE/GAMABench/blob/HEAD/analysis/analysis.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, CUHK-ARISE/GAMABench, is not in the permissive set Syntology serves inline","code_sha256":"64fc07382b37576a","code_sha256_prefix":"64fc07382b37576a","mcp_get_code":{"code_sha256":"64fc07382b37576a"}},{"arxiv_id":"2210.01948","arxiv_id_is_arxiv":true,"paper":"/paper/game-theoretic-statistics-and-safe-anytime","title":"Game-theoretic statistics and safe anytime-valid inference","date":null,"month_inferred_from_arxiv_id":"2022-10","title_source":"archive","repo":"yjchoe/ComparingForecasters","path":"comparecast/plotting.py","file_url":"https://github.com/yjchoe/ComparingForecasters/blob/HEAD/comparecast/plotting.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":"375a4934fe59f491","code_sha256_prefix":"375a4934fe59f491","mcp_get_code":{"code_sha256":"375a4934fe59f491"}},{"arxiv_id":"2109.11418","arxiv_id_is_arxiv":true,"paper":"/paper/layered-neural-atlases-for-consistent-video","title":"Layered Neural Atlases for Consistent Video Editing","date":"2021-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ykasten/layered-neural-atlases","path":"evaluate.py","file_url":"https://github.com/ykasten/layered-neural-atlases/blob/HEAD/evaluate.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":"b517b213dc8155a1","code_sha256_prefix":"b517b213dc8155a1","mcp_get_code":{"code_sha256":"b517b213dc8155a1"}},{"arxiv_id":"1911.12247","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/c-swm","path":"utils.py","file_url":"https://github.com/tkipf/c-swm/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":"cc674952bed89380","code_sha256_prefix":"cc674952bed89380","mcp_get_code":{"code_sha256":"cc674952bed89380"}},{"arxiv_id":"1906.01401","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-emergence-of-egocentric-spatial","title":"Unsupervised Emergence of Egocentric Spatial Structure from Sensorimotor Prediction","date":"2019-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alaflaquiere/learn-spatial-structure","path":"gqn_renderer/bullet_tools.py","file_url":"https://github.com/alaflaquiere/learn-spatial-structure/blob/HEAD/gqn_renderer/bullet_tools.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":"f449c1a2566eada5","code_sha256_prefix":"f449c1a2566eada5","mcp_get_code":{"code_sha256":"f449c1a2566eada5"}},{"arxiv_id":"1612.04337","arxiv_id_is_arxiv":true,"paper":"/paper/fast-patch-based-style-transfer-of-arbitrary","title":"Fast Patch-based Style Transfer of Arbitrary Style","date":"2016-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sylvielee/style-swap-819","path":"evaluate_k_usage.py","file_url":"https://github.com/sylvielee/style-swap-819/blob/HEAD/evaluate_k_usage.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":"0a1c9327c082bad6","code_sha256_prefix":"0a1c9327c082bad6","mcp_get_code":{"code_sha256":"0a1c9327c082bad6"}},{"arxiv_id":"1507.06594","arxiv_id_is_arxiv":true,"paper":"/paper/neural-nilm-deep-neural-networks-applied-to","title":"Neural NILM: Deep Neural Networks Applied to Energy Disaggregation","date":"2015-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JackKelly/neuralnilm_prototype","path":"neuralnilm/plot.py","file_url":"https://github.com/JackKelly/neuralnilm_prototype/blob/HEAD/neuralnilm/plot.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":"4888c794edf157be","code_sha256_prefix":"4888c794edf157be","mcp_get_code":{"code_sha256":"4888c794edf157be"}}],"record_sha256":"74003edcd1521118c609ae12aabcd820259bc9ed8f9f8ae68abd0e7546df051a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}