{"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/make-pool-layer","entry":"make_pool_layer","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":0},"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":"2304.02173","arxiv_id_is_arxiv":true,"paper":"/paper/chartreader-a-unified-framework-for-chart","title":"ChartReader: A Unified Framework for Chart Derendering and Comprehension without Heuristic Rules","date":"2023-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqic/ChartReader","path":"models/py_utils/kp.py","file_url":"https://github.com/zhiqic/ChartReader/blob/HEAD/models/py_utils/kp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhiqic/ChartReader when it was checked","code_sha256":"9e52b93fcd8b5b4e","code_sha256_prefix":"9e52b93fcd8b5b4e","mcp_get_code":{"code_sha256":"9e52b93fcd8b5b4e"}},{"arxiv_id":"2104.05269","arxiv_id_is_arxiv":true,"paper":"/paper/glance-and-gaze-inferring-action-aware-points","title":"Glance and Gaze: Inferring Action-aware Points for One-Stage Human-Object Interaction Detection","date":"2021-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SherlockHolmes221/GGNet","path":"src/lib/models/networks/ggnet_hourglass_s1.py","file_url":"https://github.com/SherlockHolmes221/GGNet/blob/HEAD/src/lib/models/networks/ggnet_hourglass_s1.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":"c2515898895b1abb","code_sha256_prefix":"c2515898895b1abb","mcp_get_code":{"code_sha256":"c2515898895b1abb"}},{"arxiv_id":"1904.08900","arxiv_id_is_arxiv":true,"paper":"/paper/190408900","title":"CornerNet-Lite: Efficient Keypoint Based Object Detection","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Arno3165229/CornerNet_Traffic_Light","path":"core/models/CornerNet_Squeeze_traffic_light.py","file_url":"https://github.com/Arno3165229/CornerNet_Traffic_Light/blob/HEAD/core/models/CornerNet_Squeeze_traffic_light.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2515898895b1abb","code_sha256_prefix":"c2515898895b1abb","mcp_get_code":{"code_sha256":"c2515898895b1abb"}},{"arxiv_id":"1901.08043","arxiv_id_is_arxiv":true,"paper":"/paper/bottom-up-object-detection-by-grouping","title":"Bottom-up Object Detection by Grouping Extreme and Center Points","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xingyizhou/ExtremeNet","path":"models/ExtremeNet.py","file_url":"https://github.com/xingyizhou/ExtremeNet/blob/HEAD/models/ExtremeNet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2515898895b1abb","code_sha256_prefix":"c2515898895b1abb","mcp_get_code":{"code_sha256":"c2515898895b1abb"}},{"arxiv_id":"1808.01244","arxiv_id_is_arxiv":true,"paper":"/paper/cornernet-detecting-objects-as-paired","title":"CornerNet: Detecting Objects as Paired Keypoints","date":"2018-08-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-vl/CornerNet","path":"models/CornerNet.py","file_url":"https://github.com/princeton-vl/CornerNet/blob/HEAD/models/CornerNet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2515898895b1abb","code_sha256_prefix":"c2515898895b1abb","mcp_get_code":{"code_sha256":"c2515898895b1abb"}}],"record_sha256":"86691563f18657e4a064a24687c5a67fa5192dafb42180fd5354e7d80ab2ccfe","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}