{"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/cpu","entry":"cpu","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":4,"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":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":6,"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":1,"ran_fixture":0,"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":"2010.03159","arxiv_id_is_arxiv":true,"paper":"/paper/where-are-the-facts-searching-for-fact","title":"Where Are the Facts? Searching for Fact-checked Information to Alleviate the Spread of Fake News","date":"2020-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenvo09/EMNLP2020","path":"torch_utils.py","file_url":"https://github.com/nguyenvo09/EMNLP2020/blob/HEAD/torch_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a4a700c8335a075","code_sha256_prefix":"3a4a700c8335a075","mcp_get_code":{"code_sha256":"3a4a700c8335a075"}},{"arxiv_id":"1912.12510","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-out-of-distribution-examples-with","title":"Detecting Out-of-Distribution Examples with In-distribution Examples and Gram Matrices","date":"2019-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"48a9e0f0fbcaf665","code_sha256_prefix":"48a9e0f0fbcaf665","mcp_get_code":{"code_sha256":"48a9e0f0fbcaf665"}},{"arxiv_id":"1905.03960","arxiv_id_is_arxiv":true,"paper":"/paper/priority-based-parameter-propagation-for","title":"Priority-based Parameter Propagation for Distributed DNN Training","date":"2019-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anandj91/p3","path":"python/mxnet/context.py","file_url":"https://github.com/anandj91/p3/blob/HEAD/python/mxnet/context.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":"1ea6312d0bf05ca2","code_sha256_prefix":"1ea6312d0bf05ca2","mcp_get_code":{"code_sha256":"1ea6312d0bf05ca2"}},{"arxiv_id":"1512.01274","arxiv_id_is_arxiv":true,"paper":"/paper/mxnet-a-flexible-and-efficient-machine","title":"MXNet: A Flexible and Efficient Machine Learning Library for Heterogeneous Distributed Systems","date":"2015-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apache/incubator-mxnet","path":"python/mxnet/device.py","file_url":"https://github.com/apache/incubator-mxnet/blob/HEAD/python/mxnet/device.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":"a73c6e46c328c419","code_sha256_prefix":"a73c6e46c328c419","mcp_get_code":{"code_sha256":"a73c6e46c328c419"}},{"arxiv_id":"1511.06939","arxiv_id_is_arxiv":true,"paper":"/paper/session-based-recommendations-with-recurrent","title":"Session-based Recommendations with Recurrent Neural Networks","date":"2015-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maciejkula/spotlight","path":"spotlight/torch_utils.py","file_url":"https://github.com/maciejkula/spotlight/blob/HEAD/spotlight/torch_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a4a700c8335a075","code_sha256_prefix":"3a4a700c8335a075","mcp_get_code":{"code_sha256":"3a4a700c8335a075"}},{"arxiv_id":"1508.06576","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joelsimonoff/gram-adversary-detection","path":"new-work/model-training/utils/detector.py","file_url":"https://github.com/joelsimonoff/gram-adversary-detection/blob/HEAD/new-work/model-training/utils/detector.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joelsimonoff/gram-adversary-detection when it was checked","code_sha256":"48a9e0f0fbcaf665","code_sha256_prefix":"48a9e0f0fbcaf665","mcp_get_code":{"code_sha256":"48a9e0f0fbcaf665"}}],"record_sha256":"122774aa827ccf583e133ce144df1707800b0ba94e4d04fa2843595f5479ab9c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}