{"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/psi","entry":"psi","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":8,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":4,"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":7,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":5,"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":2,"ran_fixture":1,"ran":1,"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":"2608.24046","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24046","title":"Algorithmic Impact Reveals the Hidden Social Choice Structure of Alignment","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"michelleeesi/hiddenstructure","path":"src/hiddenstructure/impact.py","file_url":"https://github.com/michelleeesi/hiddenstructure/blob/HEAD/src/hiddenstructure/impact.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, michelleeesi/hiddenstructure when it was checked","code_sha256":"ad53af4b4aa644f6","code_sha256_prefix":"ad53af4b4aa644f6","mcp_get_code":{"code_sha256":"ad53af4b4aa644f6"}},{"arxiv_id":"2604.08438","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-08438","title":"Adalina: Adaptive Linear Approximation for the Shapley Value and Beyond","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"watml/TreeGrad","path":"linearTreeShap/linearTreeShap.py","file_url":"https://github.com/watml/TreeGrad/blob/HEAD/linearTreeShap/linearTreeShap.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, watml/TreeGrad when it was checked","code_sha256":"46acbf9bb07cb485","code_sha256_prefix":"46acbf9bb07cb485","mcp_get_code":{"code_sha256":"46acbf9bb07cb485"}},{"arxiv_id":"2505.02308","arxiv_id_is_arxiv":true,"paper":"/paper/enabling-local-neural-operators-to-perform","title":"Enabling Local Neural Operators to perform Equation-Free System-Level Analysis","date":"2025-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"centrum-intelliphysics/time-stepper","path":"Bratu/EulerTimestepper.py","file_url":"https://github.com/centrum-intelliphysics/time-stepper/blob/HEAD/Bratu/EulerTimestepper.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":"1b4c2406b8506bf4","code_sha256_prefix":"1b4c2406b8506bf4","mcp_get_code":{"code_sha256":"1b4c2406b8506bf4"}},{"arxiv_id":"2410.02810","arxiv_id_is_arxiv":true,"paper":"/paper/stateact-state-tracking-and-reasoning-for","title":"StateAct: State Tracking and Reasoning for Acting and Planning with Large Language Models","date":"2024-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ai-nikolai/stateact","path":"textcraft_runs/run_textcraft_thread.py","file_url":"https://github.com/ai-nikolai/stateact/blob/HEAD/textcraft_runs/run_textcraft_thread.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ai-nikolai/stateact when it was checked","code_sha256":"142de1580a8559de","code_sha256_prefix":"142de1580a8559de","mcp_get_code":{"code_sha256":"142de1580a8559de"}},{"arxiv_id":"2407.10448","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-representation-for-causal-estimation","title":"Spectral Representation for Causal Estimation with Hidden Confounders","date":"2024-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haotiansun14/SpecIV","path":"dataset/demand_design_dataset.py","file_url":"https://github.com/haotiansun14/SpecIV/blob/HEAD/dataset/demand_design_dataset.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, haotiansun14/SpecIV when it was checked","code_sha256":"de92d7d3120fb7c7","code_sha256_prefix":"de92d7d3120fb7c7","mcp_get_code":{"code_sha256":"de92d7d3120fb7c7"}},{"arxiv_id":"2407.09926","arxiv_id_is_arxiv":true,"paper":"/paper/metric-learning-for-clifford-group","title":"Metric Learning for Clifford Group Equivariant Neural Networks","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rick-ali/Metric-Learning-for-CGENNs","path":"models/lorentz_cggnn.py","file_url":"https://github.com/rick-ali/Metric-Learning-for-CGENNs/blob/HEAD/models/lorentz_cggnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb8ab1e8e209f7b1","code_sha256_prefix":"eb8ab1e8e209f7b1","mcp_get_code":{"code_sha256":"eb8ab1e8e209f7b1"}},{"arxiv_id":"2405.17402","arxiv_id_is_arxiv":true,"paper":"/paper/thread-thinking-deeper-with-recursive","title":"THREAD: Thinking Deeper with Recursive Spawning","date":"2024-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"philipmit/thread","path":"alfworld/run_alfworld.py","file_url":"https://github.com/philipmit/thread/blob/HEAD/alfworld/run_alfworld.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, philipmit/thread when it was checked","code_sha256":"142de1580a8559de","code_sha256_prefix":"142de1580a8559de","mcp_get_code":{"code_sha256":"142de1580a8559de"}},{"arxiv_id":"1804.00099","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmzou/SCAT","path":"scat.py","file_url":"https://github.com/dmzou/SCAT/blob/HEAD/scat.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"695ac1f1935f8e7c","code_sha256_prefix":"695ac1f1935f8e7c","mcp_get_code":{"code_sha256":"695ac1f1935f8e7c"}}],"record_sha256":"45bdaea774448623e2d738be8788722195b152b97610ee1c6ec8a5d646e2cdad","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}