{"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/make-summary","entry":"make_summary","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":6,"n_papers_ran":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":5,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":0,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":5},"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":"2201.09802","paper":"/paper/constrained-policy-optimization-via-bayesian-1","title":"Constrained Policy Optimization via Bayesian World Models","date":"2022-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yardenas/la-mbda","path":"experiments/train_utils.py","file_url":"https://github.com/yardenas/la-mbda/blob/HEAD/experiments/train_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0dd6945d470eaed0","mcp_get_code":{"code_sha256":"0dd6945d470eaed0"}},{"arxiv_id":"2106.11959","paper":"/paper/revisiting-deep-learning-models-for-tabular","title":"Revisiting Deep Learning Models for Tabular Data","date":"2021-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Yura52/tabular-dl-revisiting-models","path":"lib/metrics.py","file_url":"https://github.com/Yura52/tabular-dl-revisiting-models/blob/HEAD/lib/metrics.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9fb7a99bb9386bb6","mcp_get_code":{"code_sha256":"9fb7a99bb9386bb6"}},{"arxiv_id":"2005.07150","paper":"/paper/named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juntaoy/biaffine-ner","path":"util.py","file_url":"https://github.com/juntaoy/biaffine-ner/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"304ac22fbc54657a","mcp_get_code":{"code_sha256":"304ac22fbc54657a"}},{"arxiv_id":"1902.04103","paper":"/paper/bag-of-freebies-for-training-object-detection","title":"Bag of Freebies for Training Object Detection Neural Networks","date":"2019-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wizyoung/YOLOv3_TensorFlow","path":"utils/misc_utils.py","file_url":"https://github.com/wizyoung/YOLOv3_TensorFlow/blob/HEAD/utils/misc_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"ff97bfe78626bb8e","mcp_get_code":{"code_sha256":"ff97bfe78626bb8e"}},{"arxiv_id":"1804.05392","paper":"/paper/higher-order-coreference-resolution-with","title":"Higher-order Coreference Resolution with Coarse-to-fine Inference","date":"2018-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Filter-Bubble/e2e-Dutch","path":"e2edutch/util.py","file_url":"https://github.com/Filter-Bubble/e2e-Dutch/blob/HEAD/e2edutch/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"01664a0b4c74a36e","mcp_get_code":{"code_sha256":"01664a0b4c74a36e"}},{"arxiv_id":"2022.acl-long.56","paper":null,"title":"arXiv:2022.acl-long.56","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"juntaoy/dali-bridging","path":"util.py","file_url":"https://github.com/juntaoy/dali-bridging/blob/HEAD/util.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"304ac22fbc54657a","mcp_get_code":{"code_sha256":"304ac22fbc54657a"}}]}