{"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/is-tensor","entry":"is_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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"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":9,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":7,"n_places":9,"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":3,"ran_draft_wrong":0,"ran_fixture":0,"ran":5,"unverified":1},"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":"2606.27596","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-27596","title":"Dismantling Pathological Shortcuts: A Causal Framework for Faithful LVLM Decoding","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Cc2021start/Fox","path":"vcd_sample.py","file_url":"https://github.com/Cc2021start/Fox/blob/HEAD/vcd_sample.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, Cc2021start/Fox when it was checked","code_sha256":"084b92aa6253ae13","code_sha256_prefix":"084b92aa6253ae13","mcp_get_code":{"code_sha256":"084b92aa6253ae13"}},{"arxiv_id":"2506.13366","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-goal-oriented-proactive-dialogue","title":"Enhancing Goal-oriented Proactive Dialogue Systems via Consistency Reflection and Correction","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyidi/CRC","path":"model/Planner.py","file_url":"https://github.com/zhyidi/CRC/blob/HEAD/model/Planner.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d53bcfa3d5abcf4d","code_sha256_prefix":"d53bcfa3d5abcf4d","mcp_get_code":{"code_sha256":"d53bcfa3d5abcf4d"}},{"arxiv_id":"2506.08388","arxiv_id_is_arxiv":true,"paper":"/paper/reinforcement-learning-teachers-of-test-time","title":"Reinforcement Learning Teachers of Test Time Scaling","date":"2025-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SakanaAI/RLT","path":"trainers/teacher_base.py","file_url":"https://github.com/SakanaAI/RLT/blob/HEAD/trainers/teacher_base.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"090ebd62480b897f","code_sha256_prefix":"090ebd62480b897f","mcp_get_code":{"code_sha256":"090ebd62480b897f"}},{"arxiv_id":"2409.12753","arxiv_id_is_arxiv":true,"paper":"/paper/drivingforward-feed-forward-3d-gaussian","title":"DrivingForward: Feed-forward 3D Gaussian Splatting for Driving Scene Reconstruction from Flexible Surround-view Input","date":"2024-09-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fangzhou2000/drivingforward","path":"dataset/nuscenes_dataset.py","file_url":"https://github.com/fangzhou2000/drivingforward/blob/HEAD/dataset/nuscenes_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a89932040fdda13","code_sha256_prefix":"8a89932040fdda13","mcp_get_code":{"code_sha256":"8a89932040fdda13"}},{"arxiv_id":"2407.10775","arxiv_id_is_arxiv":true,"paper":"/paper/last-iterate-global-convergence-of-policy","title":"Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MontenegroAlessandro/MagicRL","path":"algorithms/utils.py","file_url":"https://github.com/MontenegroAlessandro/MagicRL/blob/HEAD/algorithms/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93e3802d361f950d","code_sha256_prefix":"93e3802d361f950d","mcp_get_code":{"code_sha256":"93e3802d361f950d"}},{"arxiv_id":"2308.06160","arxiv_id_is_arxiv":true,"paper":"/paper/datasetdm-synthesizing-data-with-perception-1","title":"DatasetDM: Synthesizing Data with Perception Annotations Using Diffusion Models","date":"2023-08-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"showlab/datasetdm","path":"model/outputs.py","file_url":"https://github.com/showlab/datasetdm/blob/HEAD/model/outputs.py","status":"ran","verification_level":1,"contract_check":null,"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, showlab/datasetdm when it was checked","code_sha256":"0a5faf5529408221","code_sha256_prefix":"0a5faf5529408221","mcp_get_code":{"code_sha256":"0a5faf5529408221"}},{"arxiv_id":"1912.10824","arxiv_id_is_arxiv":true,"paper":"/paper/differentiable-reasoning-on-large-knowledge","title":"Differentiable Reasoning on Large Knowledge Bases and Natural Language","date":"2019-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uclnlp/ntp","path":"ntp/prover.py","file_url":"https://github.com/uclnlp/ntp/blob/HEAD/ntp/prover.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":"86a13149d6073483","code_sha256_prefix":"86a13149d6073483","mcp_get_code":{"code_sha256":"86a13149d6073483"}},{"arxiv_id":"1909.05863","arxiv_id_is_arxiv":true,"paper":"/paper/finding-generalizable-evidence-by-learning-to","title":"Finding Generalizable Evidence by Learning to Convince Q&A Models","date":"2019-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ethanjperez/convince","path":"ParlAI/parlai/core/thread_utils.py","file_url":"https://github.com/ethanjperez/convince/blob/HEAD/ParlAI/parlai/core/thread_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9fec83adf9b3df46","code_sha256_prefix":"9fec83adf9b3df46","mcp_get_code":{"code_sha256":"9fec83adf9b3df46"}},{"arxiv_id":"openreview_YXEXsGHwpq","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_YXEXsGHwpq","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SakanaAI/sparser-faster-llms","path":"trainers/logging_trainer.py","file_url":"https://github.com/SakanaAI/sparser-faster-llms/blob/HEAD/trainers/logging_trainer.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":"c59d21297a01ea64","code_sha256_prefix":"c59d21297a01ea64","mcp_get_code":{"code_sha256":"c59d21297a01ea64"}}],"record_sha256":"63d215004d09d43ff0dbe9bc6a152241a7e6aecaea0230a67acb63d7be374b03","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}