{"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-variable","entry":"get_variable","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":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":9,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":3,"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":1,"ran_fixture":1,"ran":2,"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":"2604.16821","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-16821","title":"R&F-Inventory: A Large-Scale Dataset for Monotonic Inventory Estimation in Reach and Frequency Advertising","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"pengyunshan/RF-Inventory","path":"models/tf_igcm_model.py","file_url":"https://github.com/pengyunshan/RF-Inventory/blob/HEAD/models/tf_igcm_model.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, pengyunshan/RF-Inventory when it was checked","code_sha256":"8b94f5bbb04cd182","code_sha256_prefix":"8b94f5bbb04cd182","mcp_get_code":{"code_sha256":"8b94f5bbb04cd182"}},{"arxiv_id":"2106.09305","arxiv_id_is_arxiv":true,"paper":"/paper/time-series-is-a-special-sequence-forecasting","title":"SCINet: Time Series Modeling and Forecasting with Sample Convolution and Interaction","date":"2021-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cure-lab/SCINet","path":"models/SCINet.py","file_url":"https://github.com/cure-lab/SCINet/blob/HEAD/models/SCINet.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4796d7c5da2f9ca","code_sha256_prefix":"f4796d7c5da2f9ca","mcp_get_code":{"code_sha256":"f4796d7c5da2f9ca"}},{"arxiv_id":"1910.13051","arxiv_id_is_arxiv":true,"paper":"/paper/rocket-exceptionally-fast-and-accurate-time","title":"ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sktime/sktime","path":"sktime/networks/scinet.py","file_url":"https://github.com/sktime/sktime/blob/HEAD/sktime/networks/scinet.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":"4ee92647441c7e9c","code_sha256_prefix":"4ee92647441c7e9c","mcp_get_code":{"code_sha256":"4ee92647441c7e9c"}},{"arxiv_id":"1906.05226","arxiv_id_is_arxiv":true,"paper":"/paper/continual-and-multi-task-architecture-search","title":"Continual and Multi-Task Architecture Search","date":"2019-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ramakanth-pasunuru/CAS-MAS","path":"utils.py","file_url":"https://github.com/ramakanth-pasunuru/CAS-MAS/blob/HEAD/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":"c48d94b0552cefe0","code_sha256_prefix":"c48d94b0552cefe0","mcp_get_code":{"code_sha256":"c48d94b0552cefe0"}},{"arxiv_id":"1904.02957","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-adapt-for-stereo","title":"Learning to Adapt for Stereo","date":"2019-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CVLAB-Unibo/Learning2AdaptForStereo","path":"Nets/sharedLayers.py","file_url":"https://github.com/CVLAB-Unibo/Learning2AdaptForStereo/blob/HEAD/Nets/sharedLayers.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":"945ad47f08483c8b","code_sha256_prefix":"945ad47f08483c8b","mcp_get_code":{"code_sha256":"945ad47f08483c8b"}},{"arxiv_id":"1810.08575","arxiv_id_is_arxiv":true,"paper":"/paper/supervising-strong-learners-by-amplifying","title":"Supervising strong learners by amplifying weak experts","date":"2018-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rmoehn/amplification","path":"amplification/tf_utils.py","file_url":"https://github.com/rmoehn/amplification/blob/HEAD/amplification/tf_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, rmoehn/amplification, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"dff55d08c6c73aca","code_sha256_prefix":"dff55d08c6c73aca","mcp_get_code":{"code_sha256":"dff55d08c6c73aca"}},{"arxiv_id":"1806.09055","arxiv_id_is_arxiv":true,"paper":"/paper/darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoyongcs/NATv2","path":"search_model.py","file_url":"https://github.com/guoyongcs/NATv2/blob/HEAD/search_model.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, guoyongcs/NATv2 when it was checked","code_sha256":"6082264c825e7da5","code_sha256_prefix":"6082264c825e7da5","mcp_get_code":{"code_sha256":"6082264c825e7da5"}},{"arxiv_id":"1611.07725","arxiv_id_is_arxiv":true,"paper":"/paper/icarl-incremental-classifier-and","title":"iCaRL: Incremental Classifier and Representation Learning","date":"2016-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"srebuffi/iCaRL","path":"iCaRL-Tensorflow/utils_resnet.py","file_url":"https://github.com/srebuffi/iCaRL/blob/HEAD/iCaRL-Tensorflow/utils_resnet.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":"573afeddc57bd6d5","code_sha256_prefix":"573afeddc57bd6d5","mcp_get_code":{"code_sha256":"573afeddc57bd6d5"}},{"arxiv_id":"1607.03597","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-eulerian-fluid-simulation-with","title":"Accelerating Eulerian Fluid Simulation With Convolutional Networks","date":"2016-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiaoMochen/Google-FluidNet-Reproduce-Python","path":"code/FluidNet_Simulation_Repo.py","file_url":"https://github.com/LiaoMochen/Google-FluidNet-Reproduce-Python/blob/HEAD/code/FluidNet_Simulation_Repo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"772ef35a7d1ca143","code_sha256_prefix":"772ef35a7d1ca143","mcp_get_code":{"code_sha256":"772ef35a7d1ca143"}}],"record_sha256":"d32384184f6c8337a11de1fc486b7d17262fc79fcda3180b373f1b8692717532","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}