{"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/test-batch","entry":"test_batch","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":7,"n_papers_ran":2,"n_papers_ran_no_instrument_failure":2,"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":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":2,"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":0,"ran":2,"unverified":5},"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":"2405.00754","arxiv_id_is_arxiv":true,"paper":"/paper/clipartt-light-weight-adaptation-of-clip-to","title":"CLIPArTT: Adaptation of CLIP to New Domains at Test Time","date":"2024-05-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dosowiechi/clipartt","path":"utils/utils.py","file_url":"https://github.com/dosowiechi/clipartt/blob/HEAD/utils/utils.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, dosowiechi/clipartt when it was checked","code_sha256":"077971bc206bae40","code_sha256_prefix":"077971bc206bae40","mcp_get_code":{"code_sha256":"077971bc206bae40"}},{"arxiv_id":"2402.00397","arxiv_id_is_arxiv":true,"paper":"/paper/multi-scale-traffic-pattern-bank-for-cross","title":"Multi-scale Traffic Pattern Bank for Cross-city Few-shot Traffic Forecasting","date":"2024-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyliu00/mtpb","path":"pretrain.py","file_url":"https://github.com/zhyliu00/mtpb/blob/HEAD/pretrain.py","status":"unverified","verification_level":0,"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, zhyliu00/mtpb when it was checked","code_sha256":"9f831f20d2bd7f32","code_sha256_prefix":"9f831f20d2bd7f32","mcp_get_code":{"code_sha256":"9f831f20d2bd7f32"}},{"arxiv_id":"2308.09727","arxiv_id_is_arxiv":true,"paper":"/paper/cross-city-few-shot-traffic-forecasting-via","title":"Cross-city Few-Shot Traffic Forecasting via Traffic Pattern Bank","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyliu00/tpb","path":"pretrain.py","file_url":"https://github.com/zhyliu00/tpb/blob/HEAD/pretrain.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2392280edd64e578","code_sha256_prefix":"2392280edd64e578","mcp_get_code":{"code_sha256":"2392280edd64e578"}},{"arxiv_id":"2004.06015","arxiv_id_is_arxiv":true,"paper":"/paper/toward-subgraph-guided-knowledge-graph","title":"Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/Graph2Seq-for-KGQG","path":"src/core/model.py","file_url":"https://github.com/hugochan/Graph2Seq-for-KGQG/blob/HEAD/src/core/model.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":"3273420bc0af48c1","code_sha256_prefix":"3273420bc0af48c1","mcp_get_code":{"code_sha256":"3273420bc0af48c1"}},{"arxiv_id":"1911.12436","arxiv_id_is_arxiv":true,"paper":"/paper/ar-net-a-simple-auto-regressive-neural","title":"AR-Net: A simple Auto-Regressive Neural Network for time-series","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ourownstory/AR-Net","path":"v0_1/training.py","file_url":"https://github.com/ourownstory/AR-Net/blob/HEAD/v0_1/training.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":"5c858795ca664e3c","code_sha256_prefix":"5c858795ca664e3c","mcp_get_code":{"code_sha256":"5c858795ca664e3c"}},{"arxiv_id":"1908.04942","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-based-graph-to","title":"Reinforcement Learning Based Graph-to-Sequence Model for Natural Question Generation","date":"2019-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugochan/RL-based-Graph2Seq-for-NQG","path":"src/core/model.py","file_url":"https://github.com/hugochan/RL-based-Graph2Seq-for-NQG/blob/HEAD/src/core/model.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":"5cfc39a70aa4f147","code_sha256_prefix":"5cfc39a70aa4f147","mcp_get_code":{"code_sha256":"5cfc39a70aa4f147"}},{"arxiv_id":"aaai_29391","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29391","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Jiahuiqu/LDS2AE","path":"util_CNN.py","file_url":"https://github.com/Jiahuiqu/LDS2AE/blob/HEAD/util_CNN.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7d7069319753a99c","code_sha256_prefix":"7d7069319753a99c","mcp_get_code":{"code_sha256":"7d7069319753a99c"}}],"record_sha256":"00dbed080b7e9c1c8e784b628f972e49e3277522fdab9fcdc5642076acaff55a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}