{"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/normal-pdf","entry":"normal_pdf","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":5,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2606.02232","paper":"/paper/arxiv-2606-02232","title":"A Doeblin-Anchored Contrastive Chart for Learning Markov Transition Kernels","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Ao-Xu/doeblin_exp_2026","path":"experiments/run_experiments.py","file_url":"https://github.com/Ao-Xu/doeblin_exp_2026/blob/HEAD/experiments/run_experiments.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8556b4f6bd8a5bb7","mcp_get_code":{"code_sha256":"8556b4f6bd8a5bb7"}},{"arxiv_id":"2405.00318","paper":"/paper/covariant-spatio-temporal-receptive-fields","title":"Covariant spatio-temporal receptive fields for spiking neural networks","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jegp/nrf","path":"loss.py","file_url":"https://github.com/jegp/nrf/blob/HEAD/loss.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"f863845aedc9e3e2","mcp_get_code":{"code_sha256":"f863845aedc9e3e2"}},{"arxiv_id":"2204.10872","paper":"/paper/learning-to-rank-at-the-speed-of-sampling","title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"harrieo/2022-sigir-plackett-luce","path":"algorithms/stochasticrank.py","file_url":"https://github.com/harrieo/2022-sigir-plackett-luce/blob/HEAD/algorithms/stochasticrank.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0430a54e2ef560d","mcp_get_code":{"code_sha256":"e0430a54e2ef560d"}},{"arxiv_id":"2003.12908","paper":"/paper/coping-with-simulators-that-don-t-always","title":"Coping With Simulators That Don't Always Return","date":"2020-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plai-group/stdr","path":"src/Util/util.py","file_url":"https://github.com/plai-group/stdr/blob/HEAD/src/Util/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7cb88fae5723574a","mcp_get_code":{"code_sha256":"7cb88fae5723574a"}},{"arxiv_id":"1912.12976","paper":"/paper/incorporating-physical-constraints-in-a-deep","title":"Incorporating physical constraints in a deep probabilistic machine learning framework for coarse-graining dynamical systems","date":"2019-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SebastianKaltenbach/PhysicalConstraints_ProbabilisticCG","path":"Pendulum/model.py","file_url":"https://github.com/SebastianKaltenbach/PhysicalConstraints_ProbabilisticCG/blob/HEAD/Pendulum/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"51ee0995719af9ec","mcp_get_code":{"code_sha256":"51ee0995719af9ec"}}]}