{"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/parse-log","entry":"parse_log","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":8,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"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":"2505.20840","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.20840","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"dooho00/agg-buffer","path":"evaluate/summarize.py","file_url":"https://github.com/dooho00/agg-buffer/blob/HEAD/evaluate/summarize.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":"501fc81334d9c0ba","code_sha256_prefix":"501fc81334d9c0ba","mcp_get_code":{"code_sha256":"501fc81334d9c0ba"}},{"arxiv_id":"2502.17041","arxiv_id_is_arxiv":true,"paper":"/paper/privaci-bench-evaluating-privacy-with","title":"PrivaCI-Bench: Evaluating Privacy with Contextual Integrity and Legal Compliance","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUST-KnowComp/PrivaCI-Bench","path":"search_content_for_answer.py","file_url":"https://github.com/HKUST-KnowComp/PrivaCI-Bench/blob/HEAD/search_content_for_answer.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":"58431336c8d2ad48","code_sha256_prefix":"58431336c8d2ad48","mcp_get_code":{"code_sha256":"58431336c8d2ad48"}},{"arxiv_id":"2408.01952","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01952","title":"CACE-Net: Co-guidance Attention and Contrastive Enhancement for Effective Audio-Visual Event Localization","date":"2024-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-cog-lab/cace-net","path":"CACE/plt_fig.py","file_url":"https://github.com/brain-cog-lab/cace-net/blob/HEAD/CACE/plt_fig.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8ccf5c65f536b8a8","code_sha256_prefix":"8ccf5c65f536b8a8","mcp_get_code":{"code_sha256":"8ccf5c65f536b8a8"}},{"arxiv_id":"2403.16218","arxiv_id_is_arxiv":true,"paper":"/paper/coverup-coverage-guided-llm-based-test","title":"CoverUp: Effective High Coverage Test Generation for Python","date":"2024-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"plasma-umass/coverup","path":"src/coverup/logreader.py","file_url":"https://github.com/plasma-umass/coverup/blob/HEAD/src/coverup/logreader.py","status":"unverified","verification_level":0,"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":"f5192e3a7fcb2025","code_sha256_prefix":"f5192e3a7fcb2025","mcp_get_code":{"code_sha256":"f5192e3a7fcb2025"}},{"arxiv_id":"2004.10924","arxiv_id_is_arxiv":true,"paper":"/paper/polylanenet-lane-estimation-via-deep","title":"PolyLaneNet: Lane Estimation via Deep Polynomial Regression","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucastabelini/PolyLaneNet","path":"utils/plot_log.py","file_url":"https://github.com/lucastabelini/PolyLaneNet/blob/HEAD/utils/plot_log.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":"d1c3c14d98baf762","code_sha256_prefix":"d1c3c14d98baf762","mcp_get_code":{"code_sha256":"d1c3c14d98baf762"}},{"arxiv_id":"2001.01920","arxiv_id_is_arxiv":true,"paper":"/paper/feddane-a-federated-newton-type-method","title":"FedDANE: A Federated Newton-Type Method","date":"2020-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litian96/FedDANE","path":"plot.py","file_url":"https://github.com/litian96/FedDANE/blob/HEAD/plot.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1dc8b48ea84cc7e2","code_sha256_prefix":"1dc8b48ea84cc7e2","mcp_get_code":{"code_sha256":"1dc8b48ea84cc7e2"}},{"arxiv_id":"1905.05393","arxiv_id_is_arxiv":true,"paper":"/paper/190505393","title":"Population Based Augmentation: Efficient Learning of Augmentation Policy Schedules","date":"2019-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arcelien/pba","path":"pba/utils.py","file_url":"https://github.com/arcelien/pba/blob/HEAD/pba/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, arcelien/pba, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"363604d5223dc581","code_sha256_prefix":"363604d5223dc581","mcp_get_code":{"code_sha256":"363604d5223dc581"}},{"arxiv_id":"1812.06127","arxiv_id_is_arxiv":true,"paper":"/paper/federated-optimization-for-heterogeneous","title":"Federated Optimization in Heterogeneous Networks","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litian96/FedProx","path":"plot_fig2.py","file_url":"https://github.com/litian96/FedProx/blob/HEAD/plot_fig2.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":"3d95adf387c731eb","code_sha256_prefix":"3d95adf387c731eb","mcp_get_code":{"code_sha256":"3d95adf387c731eb"}},{"arxiv_id":"1812.06127","arxiv_id_is_arxiv":true,"paper":"/paper/federated-optimization-for-heterogeneous","title":"Federated Optimization in Heterogeneous Networks","date":"2018-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"litian96/FedProx","path":"plot_final_e20.py","file_url":"https://github.com/litian96/FedProx/blob/HEAD/plot_final_e20.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":"5391ae7139f5e1e0","code_sha256_prefix":"5391ae7139f5e1e0","mcp_get_code":{"code_sha256":"5391ae7139f5e1e0"}},{"arxiv_id":"1805.11462","arxiv_id_is_arxiv":true,"paper":"/paper/opennmt-neural-machine-translation-toolkit","title":"OpenNMT: Neural Machine Translation Toolkit","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/OpenNMT-entmax","path":"read_translation_log.py","file_url":"https://github.com/deep-spin/OpenNMT-entmax/blob/HEAD/read_translation_log.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":"f00183431131cace","code_sha256_prefix":"f00183431131cace","mcp_get_code":{"code_sha256":"f00183431131cace"}}],"record_sha256":"8c028c70e0e42f5756066d32b679c1d6ee9cbdf0a383dde55d6a13b6ba5eec42","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}