{"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/build-conv","entry":"build_conv","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":7,"n_papers_ran":3,"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":2,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":3},"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.11730","paper":"/paper/rethinking-optimal-verification-granularity","title":"Rethinking Optimal Verification Granularity for Compute-Efficient Test-Time Scaling","date":"2025-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hmarkc/VG-Search","path":"src/sal/search/utils.py","file_url":"https://github.com/hmarkc/VG-Search/blob/HEAD/src/sal/search/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"code_sha256_prefix":"fcb58cf3620ba3fa","mcp_get_code":{"code_sha256":"fcb58cf3620ba3fa"}},{"arxiv_id":"2408.03314","paper":"/paper/2408-03314","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","date":"2024-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/search-and-learn","path":"src/sal/search/utils.py","file_url":"https://github.com/huggingface/search-and-learn/blob/HEAD/src/sal/search/utils.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":"fcb58cf3620ba3fa","mcp_get_code":{"code_sha256":"fcb58cf3620ba3fa"}},{"arxiv_id":"2405.19119","paper":"/paper/can-graph-learning-improve-task-planning","title":"Can Graph Learning Improve Planning in LLM-based Agents?","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wxxshirley/gnn4taskplan","path":"GraphToken/gnn.py","file_url":"https://github.com/wxxshirley/gnn4taskplan/blob/HEAD/GraphToken/gnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd424c203b1493ae","mcp_get_code":{"code_sha256":"dd424c203b1493ae"}},{"arxiv_id":"2212.13824","paper":"/paper/multi-realism-image-compression-with-a","title":"Multi-Realism Image Compression with a Conditional Generator","date":"2022-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nikolai10/MRIC","path":"src/elic.py","file_url":"https://github.com/Nikolai10/MRIC/blob/HEAD/src/elic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"24226e51f5b91550","mcp_get_code":{"code_sha256":"24226e51f5b91550"}},{"arxiv_id":"2203.10886","paper":"/paper/elic-efficient-learned-image-compression-with","title":"ELIC: Efficient Learned Image Compression with Unevenly Grouped Space-Channel Contextual Adaptive Coding","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Nikolai10/ELIC","path":"elic_transforms.py","file_url":"https://github.com/Nikolai10/ELIC/blob/HEAD/elic_transforms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"24226e51f5b91550","mcp_get_code":{"code_sha256":"24226e51f5b91550"}},{"arxiv_id":"2110.10538","paper":"/paper/anisotropic-separable-set-abstraction-for","title":"ASSANet: An Anisotropic Separable Set Abstraction for Efficient Point Cloud Representation Learning","date":"2021-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guochengqian/assanet","path":"models/encoder/assanet_encoder.py","file_url":"https://github.com/guochengqian/assanet/blob/HEAD/models/encoder/assanet_encoder.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"aa2b4144b6138f9f","mcp_get_code":{"code_sha256":"aa2b4144b6138f9f"}},{"arxiv_id":"1611.05267","paper":"/paper/temporal-convolutional-networks-for-action","title":"Temporal Convolutional Networks for Action Segmentation and Detection","date":"2016-11-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coderSkyChen/Action_Recognition_Zoo","path":"model_zoo/bninception/layer_factory.py","file_url":"https://github.com/coderSkyChen/Action_Recognition_Zoo/blob/HEAD/model_zoo/bninception/layer_factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"be05a6e3e87f6f10","mcp_get_code":{"code_sha256":"be05a6e3e87f6f10"}}]}