{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ABOCQF77CFBFH7V4AB3WGQ7DJX","short_pith_number":"pith:ABOCQF77","schema_version":"1.0","canonical_sha256":"005c2817ff114253febc00776343e34dd6a47a02c64712b90aa5ecfce2c83365","source":{"kind":"arxiv","id":"2502.14407","version":3},"attestation_state":"computed","paper":{"title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander S. Wein, Youngtak Sohn","submitted_at":"2025-02-20T09:48:26Z","abstract_excerpt":"High-dimensional planted problems, such as finding a hidden dense subgraph within a random graph, often exhibit a gap between statistical and computational feasibility. While recovering the hidden structure may be statistically possible, it is conjectured to be computationally intractable in certain parameter regimes. A powerful approach to understanding this hardness involves proving lower bounds on the efficacy of low-degree polynomial algorithms. We introduce new techniques for establishing such lower bounds, leading to novel results across diverse settings: planted submatrix, planted dense"},"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":"2502.14407","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-02-20T09:48:26Z","cross_cats_sorted":["cs.CC","cs.DS","math.PR","stat.TH"],"title_canon_sha256":"f07103fec0caff5427cfd9d7281c2e41e5801bfd6866b97f5e9f9fe1310d5912","abstract_canon_sha256":"8e2d1b735964da21e35b19d85e6827b60b8af8d48f04016c0269b29e4701eda2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.496241Z","signature_b64":"n+eLY5/wQeWV6jeah0zCDU7JDJlM5LpgtnKh3l4kmuP7aUZSJ5gTEVlHNGUKjzblqhryhZLkm9G5vx+CFEchCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"005c2817ff114253febc00776343e34dd6a47a02c64712b90aa5ecfce2c83365","last_reissued_at":"2026-05-17T23:39:01.495510Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.495510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander S. Wein, Youngtak Sohn","submitted_at":"2025-02-20T09:48:26Z","abstract_excerpt":"High-dimensional planted problems, such as finding a hidden dense subgraph within a random graph, often exhibit a gap between statistical and computational feasibility. While recovering the hidden structure may be statistically possible, it is conjectured to be computationally intractable in certain parameter regimes. A powerful approach to understanding this hardness involves proving lower bounds on the efficacy of low-degree polynomial algorithms. We introduce new techniques for establishing such lower bounds, leading to novel results across diverse settings: planted submatrix, planted dense"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.14407","kind":"arxiv","version":3},"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":"2502.14407","created_at":"2026-05-17T23:39:01.495624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.14407v3","created_at":"2026-05-17T23:39:01.495624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.14407","created_at":"2026-05-17T23:39:01.495624+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABOCQF77CFBF","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABOCQF77CFBFH7V4","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABOCQF77","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX","json":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX.json","graph_json":"https://pith.science/api/pith-number/ABOCQF77CFBFH7V4AB3WGQ7DJX/graph.json","events_json":"https://pith.science/api/pith-number/ABOCQF77CFBFH7V4AB3WGQ7DJX/events.json","paper":"https://pith.science/paper/ABOCQF77"},"agent_actions":{"view_html":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX","download_json":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX.json","view_paper":"https://pith.science/paper/ABOCQF77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.14407&json=true","fetch_graph":"https://pith.science/api/pith-number/ABOCQF77CFBFH7V4AB3WGQ7DJX/graph.json","fetch_events":"https://pith.science/api/pith-number/ABOCQF77CFBFH7V4AB3WGQ7DJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX/action/storage_attestation","attest_author":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX/action/author_attestation","sign_citation":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX/action/citation_signature","submit_replication":"https://pith.science/pith/ABOCQF77CFBFH7V4AB3WGQ7DJX/action/replication_record"}},"created_at":"2026-05-17T23:39:01.495624+00:00","updated_at":"2026-05-17T23:39:01.495624+00:00"}