{"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/h-2","entry":"h","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":5,"n_papers_ran_no_instrument_failure":5,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":3,"n_places":8,"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":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"2502.00318","arxiv_id_is_arxiv":true,"paper":"/paper/sub-sequential-physics-informed-learning-with","title":"Sub-Sequential Physics-Informed Learning with State Space Model","date":"2025-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minihuihui/pinnmamba","path":"reaction_pinnmamba.py","file_url":"https://github.com/minihuihui/pinnmamba/blob/HEAD/reaction_pinnmamba.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":"1d94d4c45235539f","code_sha256_prefix":"1d94d4c45235539f","mcp_get_code":{"code_sha256":"1d94d4c45235539f"}},{"arxiv_id":"2410.06833","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-metastability-in-the-self-attention","title":"Dynamic metastability in the self-attention model","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hugokoubbi/2024-transformers-dotm","path":"staircase.py","file_url":"https://github.com/hugokoubbi/2024-transformers-dotm/blob/HEAD/staircase.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, hugokoubbi/2024-transformers-dotm when it was checked","code_sha256":"cd47e59104aa489e","code_sha256_prefix":"cd47e59104aa489e","mcp_get_code":{"code_sha256":"cd47e59104aa489e"}},{"arxiv_id":"2405.14369","arxiv_id_is_arxiv":true,"paper":"/paper/ropinn-region-optimized-physics-informed","title":"RoPINN: Region Optimized Physics-Informed Neural Networks","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/ropinn","path":"1d_reaction_point_optimization.py","file_url":"https://github.com/thuml/ropinn/blob/HEAD/1d_reaction_point_optimization.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":"1d94d4c45235539f","code_sha256_prefix":"1d94d4c45235539f","mcp_get_code":{"code_sha256":"1d94d4c45235539f"}},{"arxiv_id":"2307.07410","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-regularization-in-ai-meets","title":"Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johanwind/which_l1_minimizer","path":"figure3.py","file_url":"https://github.com/johanwind/which_l1_minimizer/blob/HEAD/figure3.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, johanwind/which_l1_minimizer when it was checked","code_sha256":"e25d700b5c0e8e43","code_sha256_prefix":"e25d700b5c0e8e43","mcp_get_code":{"code_sha256":"e25d700b5c0e8e43"}},{"arxiv_id":"2306.07255","arxiv_id_is_arxiv":true,"paper":"/paper/conditional-matrix-flows-for-gaussian-1","title":"Conditional Matrix Flows for Gaussian Graphical Models","date":"2023-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marcello-negri/cmf","path":"edge_detection/nflows/transforms/conditional.py","file_url":"https://github.com/marcello-negri/cmf/blob/HEAD/edge_detection/nflows/transforms/conditional.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, marcello-negri/cmf when it was checked","code_sha256":"0af1d1b4ac8adafb","code_sha256_prefix":"0af1d1b4ac8adafb","mcp_get_code":{"code_sha256":"0af1d1b4ac8adafb"}},{"arxiv_id":"2105.11645","arxiv_id_is_arxiv":true,"paper":"/paper/feature-space-targeted-attacks-by-statistic","title":"Feature Space Targeted Attacks by Statistic Alignment","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaya-cheng/PAA-GAA","path":"fp_attack_den121.py","file_url":"https://github.com/yaya-cheng/PAA-GAA/blob/HEAD/fp_attack_den121.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":"bfb638b15b8dce5b","code_sha256_prefix":"bfb638b15b8dce5b","mcp_get_code":{"code_sha256":"bfb638b15b8dce5b"}},{"arxiv_id":"2005.02575","arxiv_id_is_arxiv":true,"paper":"/paper/active-preference-based-gaussian-process","title":"Active Preference-Based Gaussian Process Regression for Reward Learning","date":"2020-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stanford-ILIAD/active-preference-based-gpr","path":"util.py","file_url":"https://github.com/Stanford-ILIAD/active-preference-based-gpr/blob/HEAD/util.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":"9f2e7b6ea6d69592","code_sha256_prefix":"9f2e7b6ea6d69592","mcp_get_code":{"code_sha256":"9f2e7b6ea6d69592"}},{"arxiv_id":"1906.09403","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-nash-equilibrium-in-first-price","title":"Bayesian Nash Equilibrium in First-Price Auction with Discrete Value Distributions","date":null,"month_inferred_from_arxiv_id":"2019-06","title_source":"archive","repo":"emersonswr/discrete_fpa_bne","path":"fpa_bne.py","file_url":"https://github.com/emersonswr/discrete_fpa_bne/blob/HEAD/fpa_bne.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":"62c40808cb67ef49","code_sha256_prefix":"62c40808cb67ef49","mcp_get_code":{"code_sha256":"62c40808cb67ef49"}}],"record_sha256":"fb742a3a8987a80e978eea326a6647cc43cb070a2f0590a27d0236fc3c40a928","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}