{"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/sample-sphere","entry":"sample_sphere","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":10,"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":11,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":10,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":4,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":7,"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":"2609.01311","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-01311","title":"One-Layer Transformer Provably Learns Multiclass One-Nearest Neighbor in Context","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"skandaka/onenn-multiclass","path":"onenn.py","file_url":"https://github.com/skandaka/onenn-multiclass/blob/HEAD/onenn.py","status":"ran","verification_level":1,"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, skandaka/onenn-multiclass when it was checked","code_sha256":"94682ab9262296b7","code_sha256_prefix":"94682ab9262296b7","mcp_get_code":{"code_sha256":"94682ab9262296b7"}},{"arxiv_id":"2605.25127","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-25127","title":"PQDT: Pseudo-Query Dual Transformer for Robust Point Cloud Restoration","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"ins-uni-bonn/PQDT","path":"pqdt/models/pq_transformer.py","file_url":"https://github.com/ins-uni-bonn/PQDT/blob/HEAD/pqdt/models/pq_transformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ins-uni-bonn/PQDT when it was checked","code_sha256":"96a813a13280fee5","code_sha256_prefix":"96a813a13280fee5","mcp_get_code":{"code_sha256":"96a813a13280fee5"}},{"arxiv_id":"2605.18933","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-18933","title":"A Geometric Analysis of Sign-Magnitude Asymmetry in a ReLU + RMSNorm Block under Ternary Quantization","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"donglei628/sign-magnitude-pre-norm","path":"experiments/exp5_multilayer_toy.py","file_url":"https://github.com/donglei628/sign-magnitude-pre-norm/blob/HEAD/experiments/exp5_multilayer_toy.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":"6bd3e54f06121c07","code_sha256_prefix":"6bd3e54f06121c07","mcp_get_code":{"code_sha256":"6bd3e54f06121c07"}},{"arxiv_id":"2602.12105","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-12105","title":"Iskra: A System for Inverse Geometry Processing","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"anadodik/iskra","path":"iskra/random.py","file_url":"https://github.com/anadodik/iskra/blob/HEAD/iskra/random.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":"1d1068147bd71301","code_sha256_prefix":"1d1068147bd71301","mcp_get_code":{"code_sha256":"1d1068147bd71301"}},{"arxiv_id":"2511.02101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-02101","title":"Measuring the Intrinsic Dimension of Earth Representations","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"arjunarao619/GeoINRID","path":"src/intrinsic_dimension/calculate_global_id.py","file_url":"https://github.com/arjunarao619/GeoINRID/blob/HEAD/src/intrinsic_dimension/calculate_global_id.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, arjunarao619/GeoINRID when it was checked","code_sha256":"e569c1d09624b618","code_sha256_prefix":"e569c1d09624b618","mcp_get_code":{"code_sha256":"e569c1d09624b618"}},{"arxiv_id":"2311.16054","arxiv_id_is_arxiv":true,"paper":"/paper/metric-space-magnitude-for-evaluating","title":"Metric Space Magnitude for Evaluating the Diversity of Latent Representations","date":"2023-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidos-lab/magnipy","path":"magnipy/utils/datasets.py","file_url":"https://github.com/aidos-lab/magnipy/blob/HEAD/magnipy/utils/datasets.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"206ca962357ee7ca","code_sha256_prefix":"206ca962357ee7ca","mcp_get_code":{"code_sha256":"206ca962357ee7ca"}},{"arxiv_id":"2309.14648","arxiv_id_is_arxiv":true,"paper":"/paper/learning-the-uncertainty-sets-for-control","title":"Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysis","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jy-cds/non-asymptotic-set-membership","path":"figure2/figure2_a_and_c.py","file_url":"https://github.com/jy-cds/non-asymptotic-set-membership/blob/HEAD/figure2/figure2_a_and_c.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jy-cds/non-asymptotic-set-membership when it was checked","code_sha256":"54d17b49c30d415d","code_sha256_prefix":"54d17b49c30d415d","mcp_get_code":{"code_sha256":"54d17b49c30d415d"}},{"arxiv_id":"2212.07383","arxiv_id_is_arxiv":true,"paper":"/paper/sequential-kernelized-independence-testing","title":"Sequential Kernelized Independence Testing","date":"2022-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"a-podkopaev/sequential-kernelized-independence-testing","path":"utils/data_gen.py","file_url":"https://github.com/a-podkopaev/sequential-kernelized-independence-testing/blob/HEAD/utils/data_gen.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":"5cd39310657dcb9f","code_sha256_prefix":"5cd39310657dcb9f","mcp_get_code":{"code_sha256":"5cd39310657dcb9f"}},{"arxiv_id":"2210.06036","arxiv_id_is_arxiv":true,"paper":"/paper/guaranteed-conservation-of-momentum-for","title":"Guaranteed Conservation of Momentum for Learning Particle-based Fluid Dynamics","date":"2022-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tum-pbs/dmcf","path":"datasets/free_fall_gen.py","file_url":"https://github.com/tum-pbs/dmcf/blob/HEAD/datasets/free_fall_gen.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":"8efa0beb5787dff2","code_sha256_prefix":"8efa0beb5787dff2","mcp_get_code":{"code_sha256":"8efa0beb5787dff2"}},{"arxiv_id":"2105.03211","arxiv_id_is_arxiv":true,"paper":"/paper/nerd-neural-3d-reflection-symmetry-detector","title":"NeRD: Neural 3D Reflection Symmetry Detector","date":"2021-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhou13/nerd","path":"sym/datasets.py","file_url":"https://github.com/zhou13/nerd/blob/HEAD/sym/datasets.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":"7cce33ddd68a3664","code_sha256_prefix":"7cce33ddd68a3664","mcp_get_code":{"code_sha256":"7cce33ddd68a3664"}},{"arxiv_id":"1910.06316","arxiv_id_is_arxiv":true,"paper":"/paper/neurvps-neural-vanishing-point-scanning-via","title":"NeurVPS: Neural Vanishing Point Scanning via Conic Convolution","date":"2019-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhou13/neurvps","path":"neurvps/models/vanishing_net.py","file_url":"https://github.com/zhou13/neurvps/blob/HEAD/neurvps/models/vanishing_net.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":"b8d943097acd0396","code_sha256_prefix":"b8d943097acd0396","mcp_get_code":{"code_sha256":"b8d943097acd0396"}}],"record_sha256":"11ef893659606578b1860579608f3dd13633ea53bb9fb8c49225c6823657dd2e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}