{"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/regressor","entry":"Regressor","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":4,"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":8,"n_samples_ran":4,"n_samples_constructed":3,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":8,"n_places_pointer_only":4,"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":4,"unverified":4},"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":"2410.05711","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-auto-regressive-transformer-for","title":"Diffusion Auto-regressive Transformer for Effective Self-supervised Time Series Forecasting","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyue-cheng/timemae","path":"model/TimeMAE.py","file_url":"https://github.com/mingyue-cheng/timemae/blob/HEAD/model/TimeMAE.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, mingyue-cheng/timemae when it was checked","code_sha256":"46aa10294e194266","code_sha256_prefix":"46aa10294e194266","mcp_get_code":{"code_sha256":"46aa10294e194266"}},{"arxiv_id":"2406.04340","arxiv_id_is_arxiv":true,"paper":"/paper/glace-global-local-accelerated-coordinate","title":"GLACE: Global Local Accelerated Coordinate Encoding","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cvg/glace","path":"ace_network.py","file_url":"https://github.com/cvg/glace/blob/HEAD/ace_network.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, cvg/glace (NOASSERTION)","code_sha256":"de851bc0f33122ca","code_sha256_prefix":"de851bc0f33122ca","mcp_get_code":{"code_sha256":"de851bc0f33122ca"}},{"arxiv_id":"2303.15724","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-detailed-and-mask-free-universal","title":"Scalable, Detailed and Mask-Free Universal Photometric Stereo","date":"2023-03-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"satoshi-ikehata/sdm-unips-cvpr2023","path":"sdm_unips/modules/model/model.py","file_url":"https://github.com/satoshi-ikehata/sdm-unips-cvpr2023/blob/HEAD/sdm_unips/modules/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, satoshi-ikehata/sdm-unips-cvpr2023 (NOASSERTION)","code_sha256":"215a8657c68da22c","code_sha256_prefix":"215a8657c68da22c","mcp_get_code":{"code_sha256":"215a8657c68da22c"}},{"arxiv_id":"2201.02331","arxiv_id_is_arxiv":true,"paper":"/paper/idecode-in-distribution-equivariance-for","title":"iDECODe: In-distribution Equivariance for Conformal Out-of-distribution Detection","date":"2022-01-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramneetk/iDECODe","path":"vision/SOTA/avt_wrn.py","file_url":"https://github.com/ramneetk/iDECODe/blob/HEAD/vision/SOTA/avt_wrn.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, ramneetk/iDECODe when it was checked","code_sha256":"61077e89790c73f6","code_sha256_prefix":"61077e89790c73f6","mcp_get_code":{"code_sha256":"61077e89790c73f6"}},{"arxiv_id":"2108.06819","arxiv_id_is_arxiv":true,"paper":"/paper/eventhpe-event-based-3d-human-pose-and-shape","title":"EventHPE: Event-based 3D Human Pose and Shape Estimation","date":"2021-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jimmyzou/eventhpe","path":"event_pose_estimation/model.py","file_url":"https://github.com/jimmyzou/eventhpe/blob/HEAD/event_pose_estimation/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"57a649d3f633b7ee","code_sha256_prefix":"57a649d3f633b7ee","mcp_get_code":{"code_sha256":"57a649d3f633b7ee"}},{"arxiv_id":"2107.05855","arxiv_id_is_arxiv":true,"paper":"/paper/automated-learning-rate-scheduler-for-large","title":"Automated Learning Rate Scheduler for Large-batch Training","date":"2021-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/autowu","path":"autowu.py","file_url":"https://github.com/kakaobrain/autowu/blob/HEAD/autowu.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d83e715fb85e9189","code_sha256_prefix":"d83e715fb85e9189","mcp_get_code":{"code_sha256":"d83e715fb85e9189"}},{"arxiv_id":"2104.03866","arxiv_id_is_arxiv":true,"paper":"/paper/smd-nets-stereo-mixture-density-networks","title":"SMD-Nets: Stereo Mixture Density Networks","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabiotosi92/SMD-Nets","path":"lib/model/SMDHead.py","file_url":"https://github.com/fabiotosi92/SMD-Nets/blob/HEAD/lib/model/SMDHead.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c2896a15e4b9aa7d","code_sha256_prefix":"c2896a15e4b9aa7d","mcp_get_code":{"code_sha256":"c2896a15e4b9aa7d"}},{"arxiv_id":"1703.03400","arxiv_id_is_arxiv":true,"paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"psh150204/MAML","path":"model.py","file_url":"https://github.com/psh150204/MAML/blob/HEAD/model.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":"a8f78f0cacf4d49a","code_sha256_prefix":"a8f78f0cacf4d49a","mcp_get_code":{"code_sha256":"a8f78f0cacf4d49a"}}],"record_sha256":"200ddbd719dcdef780692d8b5875c6b376f08e869ea40f6f2e3148b6e7e83eb1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}