{"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/tensor","entry":"tensor","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":7,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":9,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":1,"ran_fixture":1,"ran":4,"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":"2403.06075","arxiv_id_is_arxiv":true,"paper":"/paper/multisize-dataset-condensation","title":"Multisize Dataset Condensation","date":"2024-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"he-y/multisize-dataset-condensation","path":"reg_ipcx.py","file_url":"https://github.com/he-y/multisize-dataset-condensation/blob/HEAD/reg_ipcx.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"230a4230e487b4ae","code_sha256_prefix":"230a4230e487b4ae","mcp_get_code":{"code_sha256":"230a4230e487b4ae"}},{"arxiv_id":"2401.08550","arxiv_id_is_arxiv":true,"paper":"/paper/expanding-hardware-efficiently-manipulable","title":"Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding","date":null,"month_inferred_from_arxiv_id":"2024-01","title_source":"archive","repo":"jiaqileng/hamiltonian-embedding","path":"src/utils.py","file_url":"https://github.com/jiaqileng/hamiltonian-embedding/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"15a909ca2a88d57f","code_sha256_prefix":"15a909ca2a88d57f","mcp_get_code":{"code_sha256":"15a909ca2a88d57f"}},{"arxiv_id":"2204.10555","arxiv_id_is_arxiv":true,"paper":"/paper/kala-knowledge-augmented-language-model-1","title":"KALA: Knowledge-Augmented Language Model Adaptation","date":"2022-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rusty1s/pytorch_scatter","path":"torch_scatter/testing.py","file_url":"https://github.com/rusty1s/pytorch_scatter/blob/HEAD/torch_scatter/testing.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":"5299d175b3a523b3","code_sha256_prefix":"5299d175b3a523b3","mcp_get_code":{"code_sha256":"5299d175b3a523b3"}},{"arxiv_id":"2111.02056","arxiv_id_is_arxiv":true,"paper":"/paper/curriculum-offline-imitation-learning","title":"Curriculum Offline Imitation Learning","date":"2021-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apexrl/coil","path":"rlkit/torch/coil/coil.py","file_url":"https://github.com/apexrl/coil/blob/HEAD/rlkit/torch/coil/coil.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":"e98f92e9afd0ddda","code_sha256_prefix":"e98f92e9afd0ddda","mcp_get_code":{"code_sha256":"e98f92e9afd0ddda"}},{"arxiv_id":"1902.10250","arxiv_id_is_arxiv":true,"paper":"/paper/diagnosing-bottlenecks-in-deep-q-learning","title":"Diagnosing Bottlenecks in Deep Q-learning Algorithms","date":"2019-02-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"justinjfu/diagnosing_qlearning","path":"debugq/pytorch_util.py","file_url":"https://github.com/justinjfu/diagnosing_qlearning/blob/HEAD/debugq/pytorch_util.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":"8f062b4b0c962b27","code_sha256_prefix":"8f062b4b0c962b27","mcp_get_code":{"code_sha256":"8f062b4b0c962b27"}},{"arxiv_id":"1812.00804","arxiv_id_is_arxiv":true,"paper":"/paper/deep-inverse-optimization","title":"Deep Inverse Optimization","date":"2018-12-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tankconcordia/deep_inv_opt","path":"deep_inv_opt/util.py","file_url":"https://github.com/tankconcordia/deep_inv_opt/blob/HEAD/deep_inv_opt/util.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":"5311ce7af258b366","code_sha256_prefix":"5311ce7af258b366","mcp_get_code":{"code_sha256":"5311ce7af258b366"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmiu-shell/deeprl-shell","path":"deep_rl/agent/PPO_agent.py","file_url":"https://github.com/dmiu-shell/deeprl-shell/blob/HEAD/deep_rl/agent/PPO_agent.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"03b48449f3d4d675","code_sha256_prefix":"03b48449f3d4d675","mcp_get_code":{"code_sha256":"03b48449f3d4d675"}},{"arxiv_id":"1707.06347","arxiv_id_is_arxiv":true,"paper":"/paper/proximal-policy-optimization-algorithms","title":"Proximal Policy Optimization Algorithms","date":"2017-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DMIU-ShELL/MOSAIC","path":"deep_rl/agent/PPO_agent.py","file_url":"https://github.com/DMIU-ShELL/MOSAIC/blob/HEAD/deep_rl/agent/PPO_agent.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":"8e103b8cabd1203c","code_sha256_prefix":"8e103b8cabd1203c","mcp_get_code":{"code_sha256":"8e103b8cabd1203c"}},{"arxiv_id":"1202.1056","arxiv_id_is_arxiv":true,"paper":"/paper/building-a-framework-for-predictive-science","title":"Building a Framework for Predictive Science","date":null,"month_inferred_from_arxiv_id":"2012-02","title_source":"archive","repo":"vdods/vorpy","path":"vorpy/symbolic.py","file_url":"https://github.com/vdods/vorpy/blob/HEAD/vorpy/symbolic.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":"995101d37cdc8bb5","code_sha256_prefix":"995101d37cdc8bb5","mcp_get_code":{"code_sha256":"995101d37cdc8bb5"}}],"record_sha256":"6c8f0c8d0f003f17dd5f32bd91732880ad78603686cc4be8ec0955d626cff5fe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}