{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TD52JMR3C4KNBTLRTABODXCTRA","short_pith_number":"pith:TD52JMR3","schema_version":"1.0","canonical_sha256":"98fba4b23b1714d0cd719802e1dc5388307736f1cd9800ceccd22d3fec26c9a1","source":{"kind":"arxiv","id":"2403.07862","version":1},"attestation_state":"computed","paper":{"title":"Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dmitriy Kunisky","submitted_at":"2024-03-12T17:52:35Z","abstract_excerpt":"We study when low coordinate degree functions (LCDF) -- linear combinations of functions depending on small subsets of entries of a vector -- can hypothesis test between high-dimensional probability measures. These functions are a generalization, proposed in Hopkins' 2018 thesis but seldom studied since, of low degree polynomials (LDP), a class widely used in recent literature as a proxy for all efficient algorithms for tasks in statistics and optimization. Instead of the orthogonal polynomial decompositions used in LDP calculations, our analysis of LCDF is based on the Efron-Stein or ANOVA de"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2403.07862","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2024-03-12T17:52:35Z","cross_cats_sorted":["cs.DS","math.PR","stat.ML","stat.TH"],"title_canon_sha256":"c949920d63d55d2a023c8b8d61ee55855edb6135c3eb93183b827e11e4d3f415","abstract_canon_sha256":"4468e7d73c8ef67a0c5a426af97615517ef718b8c9c67dde8009ebb558a24ceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:55:16.531808Z","signature_b64":"oxa/kPedROYo+ttW5fEKYhAw/XSNCrOS210ZBVWTakLMAMlWx2bA5nVJFzkh3MHS1RF/ju1amcoV/3N2Ztz4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98fba4b23b1714d0cd719802e1dc5388307736f1cd9800ceccd22d3fec26c9a1","last_reissued_at":"2026-07-05T07:55:16.531341Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:55:16.531341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low coordinate degree algorithms I: Universality of computational thresholds for hypothesis testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Dmitriy Kunisky","submitted_at":"2024-03-12T17:52:35Z","abstract_excerpt":"We study when low coordinate degree functions (LCDF) -- linear combinations of functions depending on small subsets of entries of a vector -- can hypothesis test between high-dimensional probability measures. These functions are a generalization, proposed in Hopkins' 2018 thesis but seldom studied since, of low degree polynomials (LDP), a class widely used in recent literature as a proxy for all efficient algorithms for tasks in statistics and optimization. Instead of the orthogonal polynomial decompositions used in LDP calculations, our analysis of LCDF is based on the Efron-Stein or ANOVA de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.07862","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.07862/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.07862","created_at":"2026-07-05T07:55:16.531400+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.07862v1","created_at":"2026-07-05T07:55:16.531400+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.07862","created_at":"2026-07-05T07:55:16.531400+00:00"},{"alias_kind":"pith_short_12","alias_value":"TD52JMR3C4KN","created_at":"2026-07-05T07:55:16.531400+00:00"},{"alias_kind":"pith_short_16","alias_value":"TD52JMR3C4KNBTLR","created_at":"2026-07-05T07:55:16.531400+00:00"},{"alias_kind":"pith_short_8","alias_value":"TD52JMR3","created_at":"2026-07-05T07:55:16.531400+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.17360","citing_title":"The Quasi-Polynomial Low-Degree Conjecture is False","ref_index":67,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA","json":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA.json","graph_json":"https://pith.science/api/pith-number/TD52JMR3C4KNBTLRTABODXCTRA/graph.json","events_json":"https://pith.science/api/pith-number/TD52JMR3C4KNBTLRTABODXCTRA/events.json","paper":"https://pith.science/paper/TD52JMR3"},"agent_actions":{"view_html":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA","download_json":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA.json","view_paper":"https://pith.science/paper/TD52JMR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.07862&json=true","fetch_graph":"https://pith.science/api/pith-number/TD52JMR3C4KNBTLRTABODXCTRA/graph.json","fetch_events":"https://pith.science/api/pith-number/TD52JMR3C4KNBTLRTABODXCTRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA/action/storage_attestation","attest_author":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA/action/author_attestation","sign_citation":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA/action/citation_signature","submit_replication":"https://pith.science/pith/TD52JMR3C4KNBTLRTABODXCTRA/action/replication_record"}},"created_at":"2026-07-05T07:55:16.531400+00:00","updated_at":"2026-07-05T07:55:16.531400+00:00"}