{"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/get-output-shape","entry":"get_output_shape","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":4,"n_papers_ran_instrument_only":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":3,"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":"2505.04579","arxiv_id_is_arxiv":true,"paper":"/paper/implicitly-aligning-humans-and-autonomous","title":"Implicitly Aligning Humans and Autonomous Agents through Shared Task Abstractions","date":"2025-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HIRO-group/HA2","path":"oai_agents/common/networks.py","file_url":"https://github.com/HIRO-group/HA2/blob/HEAD/oai_agents/common/networks.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":"99ea6ca6b4ffdecb","code_sha256_prefix":"99ea6ca6b4ffdecb","mcp_get_code":{"code_sha256":"99ea6ca6b4ffdecb"}},{"arxiv_id":"2407.09100","arxiv_id_is_arxiv":true,"paper":"/paper/retrospective-for-the-dynamic-sensorium","title":"Retrospective for the Dynamic Sensorium Competition for predicting large-scale mouse primary visual cortex activity from videos","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bryanlimy/ViV1T","path":"src/viv1t/model/critic.py","file_url":"https://github.com/bryanlimy/ViV1T/blob/HEAD/src/viv1t/model/critic.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":"2387de91debc2c22","code_sha256_prefix":"2387de91debc2c22","mcp_get_code":{"code_sha256":"2387de91debc2c22"}},{"arxiv_id":"2308.13177","arxiv_id_is_arxiv":true,"paper":"/paper/how-to-evaluate-the-generalization-of","title":"How to Evaluate the Generalization of Detection? A Benchmark for Comprehensive Open-Vocabulary Detection","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"om-ai-lab/OmDet","path":"omdet/inference/base_engine.py","file_url":"https://github.com/om-ai-lab/OmDet/blob/HEAD/omdet/inference/base_engine.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":"9c966a0badf6f168","code_sha256_prefix":"9c966a0badf6f168","mcp_get_code":{"code_sha256":"9c966a0badf6f168"}},{"arxiv_id":"2103.15545","arxiv_id_is_arxiv":true,"paper":"/paper/drop-the-gan-in-defense-of-patches-nearest","title":"Drop the GAN: In Defense of Patches Nearest Neighbors as Single Image Generative Models","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ariel415el/Efficient-GPNN","path":"GPNN.py","file_url":"https://github.com/ariel415el/Efficient-GPNN/blob/HEAD/GPNN.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2519da9c8c5f8b95","code_sha256_prefix":"2519da9c8c5f8b95","mcp_get_code":{"code_sha256":"2519da9c8c5f8b95"}},{"arxiv_id":"2025.emnlp-main.1281","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.1281","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"HIRO-group/ReSEED","path":"reseed/modelling/utils.py","file_url":"https://github.com/HIRO-group/ReSEED/blob/HEAD/reseed/modelling/utils.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":"99ea6ca6b4ffdecb","code_sha256_prefix":"99ea6ca6b4ffdecb","mcp_get_code":{"code_sha256":"99ea6ca6b4ffdecb"}}],"record_sha256":"c1900be75a72aa92d636f18ea605028fdd0e55a6662b8df847c71df48544409c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}