{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NXJTL43RGEFUUVXVTQPZWOBWN5","short_pith_number":"pith:NXJTL43R","schema_version":"1.0","canonical_sha256":"6dd335f371310b4a56f59c1f9b38366f4a69db49edd97a11ff792329440a2533","source":{"kind":"arxiv","id":"1512.08861","version":1},"attestation_state":"computed","paper":{"title":"Sharp Computational-Statistical Phase Transitions via Oracle Computational Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Han Liu, Quanquan Gu, Zhaoran Wang","submitted_at":"2015-12-30T06:16:46Z","abstract_excerpt":"We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound that explicitly connects the minimum testing risk under computational budget constraints with the intrinsic probabilistic and combinatorial structures of statistical problems. This lower bound mirrors the classical statistical lower bound by Le Cam (1986) and allows us to quantify t"},"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":"1512.08861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-12-30T06:16:46Z","cross_cats_sorted":[],"title_canon_sha256":"8d76317ba91a749136f1b740bb4b745531da5e0bee2257e8d4ee1b6f044479a6","abstract_canon_sha256":"3f67b063d8232c99a5abb827890db6888294ebefd67a06112bef897d9cb03423"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:34.662146Z","signature_b64":"tLtBgRBGGm162rmQrqcv/5msWT9PyMgrSLv50P/PYOagsf2LYqONuOjTB4Ccbbwp0DU/2kJGdM/JwP6uZBz/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dd335f371310b4a56f59c1f9b38366f4a69db49edd97a11ff792329440a2533","last_reissued_at":"2026-05-18T01:23:34.661588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:34.661588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Computational-Statistical Phase Transitions via Oracle Computational Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Han Liu, Quanquan Gu, Zhaoran Wang","submitted_at":"2015-12-30T06:16:46Z","abstract_excerpt":"We study the fundamental tradeoffs between computational tractability and statistical accuracy for a general family of hypothesis testing problems with combinatorial structures. Based upon an oracle model of computation, which captures the interactions between algorithms and data, we establish a general lower bound that explicitly connects the minimum testing risk under computational budget constraints with the intrinsic probabilistic and combinatorial structures of statistical problems. This lower bound mirrors the classical statistical lower bound by Le Cam (1986) and allows us to quantify t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08861","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":""},"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":"1512.08861","created_at":"2026-05-18T01:23:34.661674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08861v1","created_at":"2026-05-18T01:23:34.661674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08861","created_at":"2026-05-18T01:23:34.661674+00:00"},{"alias_kind":"pith_short_12","alias_value":"NXJTL43RGEFU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"NXJTL43RGEFUUVXV","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"NXJTL43R","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":102,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05076","citing_title":"High-Dimensional Statistics: Reflections on Progress and Open Problems","ref_index":102,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5","json":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5.json","graph_json":"https://pith.science/api/pith-number/NXJTL43RGEFUUVXVTQPZWOBWN5/graph.json","events_json":"https://pith.science/api/pith-number/NXJTL43RGEFUUVXVTQPZWOBWN5/events.json","paper":"https://pith.science/paper/NXJTL43R"},"agent_actions":{"view_html":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5","download_json":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5.json","view_paper":"https://pith.science/paper/NXJTL43R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08861&json=true","fetch_graph":"https://pith.science/api/pith-number/NXJTL43RGEFUUVXVTQPZWOBWN5/graph.json","fetch_events":"https://pith.science/api/pith-number/NXJTL43RGEFUUVXVTQPZWOBWN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5/action/storage_attestation","attest_author":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5/action/author_attestation","sign_citation":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5/action/citation_signature","submit_replication":"https://pith.science/pith/NXJTL43RGEFUUVXVTQPZWOBWN5/action/replication_record"}},"created_at":"2026-05-18T01:23:34.661674+00:00","updated_at":"2026-05-18T01:23:34.661674+00:00"}