{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/blue","entry":"blue","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":9,"n_papers_ran":7,"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":4,"n_samples_ran":3,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":1,"unverified":1},"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.17465","paper":"/paper/arxiv-2605-17465","title":"TriOpt: A Scalable Algorithm for Linear Causal Discovery","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"E2real/CaPS","path":"train_order.py","file_url":"https://github.com/E2real/CaPS/blob/HEAD/train_order.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4500faa4c34b7e06","mcp_get_code":{"code_sha256":"4500faa4c34b7e06"}},{"arxiv_id":"2410.05890","paper":"/paper/ordering-based-causal-discovery-for-linear","title":"Ordering-Based Causal Discovery for Linear and Nonlinear Relations","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"e2real/caps","path":"train_order.py","file_url":"https://github.com/e2real/caps/blob/HEAD/train_order.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4500faa4c34b7e06","mcp_get_code":{"code_sha256":"4500faa4c34b7e06"}},{"arxiv_id":"2310.04870","paper":"/paper/lemur-integrating-large-language-models-in","title":"Lemur: Integrating Large Language Models in Automated Program Verification","date":"2023-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wu-haoze/lemur-program-verification","path":"lemur/src/verifier.py","file_url":"https://github.com/wu-haoze/lemur-program-verification/blob/HEAD/lemur/src/verifier.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6d7d415003223ca9","mcp_get_code":{"code_sha256":"6d7d415003223ca9"}},{"arxiv_id":"2310.00108","paper":"/paper/practical-membership-inference-attacks-1","title":"Practical Membership Inference Attacks Against Large-Scale Multi-Modal Models: A Pilot Study","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruoxi-jia-group/clip-mia","path":"util.py","file_url":"https://github.com/ruoxi-jia-group/clip-mia/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"831ff3e5265f6557","mcp_get_code":{"code_sha256":"831ff3e5265f6557"}},{"arxiv_id":"2303.01751","paper":"/paper/deep-momentum-multi-marginal-schrodinger","title":"Deep Momentum Multi-Marginal Schrödinger Bridge","date":"2023-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TianrongChen/DMSB","path":"util.py","file_url":"https://github.com/TianrongChen/DMSB/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"831ff3e5265f6557","mcp_get_code":{"code_sha256":"831ff3e5265f6557"}},{"arxiv_id":"2110.11291","paper":"/paper/likelihood-training-of-schrodinger-bridge-1","title":"Likelihood Training of Schrödinger Bridge using Forward-Backward SDEs Theory","date":"2021-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghliu/sb-fbsde","path":"util.py","file_url":"https://github.com/ghliu/sb-fbsde/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"831ff3e5265f6557","mcp_get_code":{"code_sha256":"831ff3e5265f6557"}},{"arxiv_id":"2104.06405","paper":"/paper/barf-bundle-adjusting-neural-radiance-fields","title":"BARF: Bundle-Adjusting Neural Radiance Fields","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/bundle-adjusting-NeRF","path":"util.py","file_url":"https://github.com/chenhsuanlin/bundle-adjusting-NeRF/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a69081f447e7ba0","mcp_get_code":{"code_sha256":"2a69081f447e7ba0"}},{"arxiv_id":"2010.10505","paper":"/paper/sdf-srn-learning-signed-distance-3d-object","title":"SDF-SRN: Learning Signed Distance 3D Object Reconstruction from Static Images","date":"2020-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/signed-distance-SRN","path":"util.py","file_url":"https://github.com/chenhsuanlin/signed-distance-SRN/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2a69081f447e7ba0","mcp_get_code":{"code_sha256":"2a69081f447e7ba0"}},{"arxiv_id":"1903.08642","paper":"/paper/photometric-mesh-optimization-for-video","title":"Photometric Mesh Optimization for Video-Aligned 3D Object Reconstruction","date":"2019-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenhsuanlin/photometric-mesh-optim","path":"util.py","file_url":"https://github.com/chenhsuanlin/photometric-mesh-optim/blob/HEAD/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"831ff3e5265f6557","mcp_get_code":{"code_sha256":"831ff3e5265f6557"}}]}