{"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/zero","entry":"zero","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":7,"n_papers_ran_no_instrument_failure":7,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":3,"n_places_pointer_only_link_open":2,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2407.06334","arxiv_id_is_arxiv":true,"paper":"/paper/double-ended-synthesis-planning-with-goal","title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","date":"2024-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"coleygroup/desp","path":"desp/DESP.py","file_url":"https://github.com/coleygroup/desp/blob/HEAD/desp/DESP.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c00e9e173caa15b","code_sha256_prefix":"3c00e9e173caa15b","mcp_get_code":{"code_sha256":"3c00e9e173caa15b"}},{"arxiv_id":"2308.07571","arxiv_id_is_arxiv":true,"paper":"/paper/ske2grid-skeleton-to-grid-representation","title":"Ske2Grid: Skeleton-to-Grid Representation Learning for Action Recognition","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OSVAI/Ske2Grid","path":"models/gcns/stgcn2cn_upsamp_grid_progressive.py","file_url":"https://github.com/OSVAI/Ske2Grid/blob/HEAD/models/gcns/stgcn2cn_upsamp_grid_progressive.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hyer/HDFormer, and GitHub detected no licence in that repository when it was checked","code_sha256":"cf1326f21a3b15f8","code_sha256_prefix":"cf1326f21a3b15f8","mcp_get_code":{"code_sha256":"cf1326f21a3b15f8"}},{"arxiv_id":"2307.10635","arxiv_id_is_arxiv":true,"paper":"/paper/scibench-evaluating-college-level-scientific","title":"SciBench: Evaluating College-Level Scientific Problem-Solving Abilities of Large Language Models","date":"2023-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mandyyyyii/scibench","path":"eval/eval_zero.py","file_url":"https://github.com/mandyyyyii/scibench/blob/HEAD/eval/eval_zero.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":"45b3b645002b576f","code_sha256_prefix":"45b3b645002b576f","mcp_get_code":{"code_sha256":"45b3b645002b576f"}},{"arxiv_id":"2302.01825","arxiv_id_is_arxiv":true,"paper":"/paper/hdformer-high-order-directed-transformer-for","title":"HDFormer: High-order Directed Transformer for 3D Human Pose Estimation","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyer/HDFormer","path":"models/hd_former.py","file_url":"https://github.com/hyer/HDFormer/blob/HEAD/models/hd_former.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, hyer/HDFormer when it was checked","code_sha256":"cf1326f21a3b15f8","code_sha256_prefix":"cf1326f21a3b15f8","mcp_get_code":{"code_sha256":"cf1326f21a3b15f8"}},{"arxiv_id":"1808.09357","arxiv_id_is_arxiv":true,"paper":"/paper/rational-recurrences","title":"Rational Recurrences","date":"2018-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Noahs-ARK/rational-recurrences","path":"semiring.py","file_url":"https://github.com/Noahs-ARK/rational-recurrences/blob/HEAD/semiring.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":"43b57409cd1e6b6f","code_sha256_prefix":"43b57409cd1e6b6f","mcp_get_code":{"code_sha256":"43b57409cd1e6b6f"}},{"arxiv_id":"1804.06055","arxiv_id_is_arxiv":true,"paper":"/paper/co-occurrence-feature-learning-from-skeleton","title":"Co-occurrence Feature Learning from Skeleton Data for Action Recognition and Detection with Hierarchical Aggregation","date":"2018-04-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hikvision-research/skelact","path":"skelact/models/backbones/dgcn.py","file_url":"https://github.com/hikvision-research/skelact/blob/HEAD/skelact/models/backbones/dgcn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from hyer/HDFormer, and GitHub detected no licence in that repository when it was checked","code_sha256":"cf1326f21a3b15f8","code_sha256_prefix":"cf1326f21a3b15f8","mcp_get_code":{"code_sha256":"cf1326f21a3b15f8"}},{"arxiv_id":"1801.07455","arxiv_id_is_arxiv":true,"paper":"/paper/spatial-temporal-graph-convolutional-networks-1","title":"Spatial Temporal Graph Convolutional Networks for Skeleton-Based Action Recognition","date":"2018-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"open-mmlab/mmskeleton","path":"mmskeleton/models/backbones/st_gcn_aaai18.py","file_url":"https://github.com/open-mmlab/mmskeleton/blob/HEAD/mmskeleton/models/backbones/st_gcn_aaai18.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0a17b477ccbcee05","code_sha256_prefix":"0a17b477ccbcee05","mcp_get_code":{"code_sha256":"0a17b477ccbcee05"}},{"arxiv_id":"1612.08000","arxiv_id_is_arxiv":true,"paper":"/paper/161208000","title":"Efficient tomography of a quantum many-body system","date":null,"month_inferred_from_arxiv_id":"2016-12","title_source":"archive","repo":"dseuss/mpnum","path":"mpnum/factory.py","file_url":"https://github.com/dseuss/mpnum/blob/HEAD/mpnum/factory.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"91f6e476b96a966b","code_sha256_prefix":"91f6e476b96a966b","mcp_get_code":{"code_sha256":"91f6e476b96a966b"}},{"arxiv_id":"1507.05333","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-models-for-causal-transfer-learning","title":"Invariant Models for Causal Transfer Learning","date":"2015-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mrojascarulla/causal_transfer_learning","path":"code/data.py","file_url":"https://github.com/mrojascarulla/causal_transfer_learning/blob/HEAD/code/data.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b1e26fe487284e3b","code_sha256_prefix":"b1e26fe487284e3b","mcp_get_code":{"code_sha256":"b1e26fe487284e3b"}}],"record_sha256":"682979b30541a62f21bbe5a46c7c57470e7b5193f6d51d2657271153e6f2d21c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}