{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3754QYGDWM2WBMQV733RTZZFPD","short_pith_number":"pith:3754QYGD","schema_version":"1.0","canonical_sha256":"dffbc860c3b33560b215fef719e72578dc2c670b37ef901b4ac5a67c494d2f39","source":{"kind":"arxiv","id":"1806.07508","version":2},"attestation_state":"computed","paper":{"title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Guy Bresler, Matthew Brennan, Wasim Huleihel","submitted_at":"2018-06-19T23:48:25Z","abstract_excerpt":"The prototypical high-dimensional statistics problem entails finding a structured signal in noise. Many of these problems exhibit an intriguing phenomenon: the amount of data needed by all known computationally efficient algorithms far exceeds what is needed for inefficient algorithms that search over all possible structures. A line of work initiated by Berthet and Rigollet in 2013 has aimed to explain these statistical-computational gaps by reducing from conjecturally hard average-case problems in computer science. However, the delicate nature of average-case reductions has limited the applic"},"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":"1806.07508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-19T23:48:25Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"title_canon_sha256":"c7f35b542843d536b088b9efb02264eb2ccd498a3807be45aad5398b8da469b0","abstract_canon_sha256":"08ea455b8468bc2fa063404e38b060e4630c562636b454874b04e1f6fbca139f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:52.214089Z","signature_b64":"hhuVVjdYsHXo2ukOLeAO3Kcy0ZOvMCg4OZj/IB7mC0kN21eS5NNRi05u78fk2QSvTcfzcfoyhHnkf/gpTI14Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dffbc860c3b33560b215fef719e72578dc2c670b37ef901b4ac5a67c494d2f39","last_reissued_at":"2026-07-05T00:19:52.213574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:52.213574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","math.ST","stat.TH"],"primary_cat":"cs.CC","authors_text":"Guy Bresler, Matthew Brennan, Wasim Huleihel","submitted_at":"2018-06-19T23:48:25Z","abstract_excerpt":"The prototypical high-dimensional statistics problem entails finding a structured signal in noise. Many of these problems exhibit an intriguing phenomenon: the amount of data needed by all known computationally efficient algorithms far exceeds what is needed for inefficient algorithms that search over all possible structures. A line of work initiated by Berthet and Rigollet in 2013 has aimed to explain these statistical-computational gaps by reducing from conjecturally hard average-case problems in computer science. However, the delicate nature of average-case reductions has limited the applic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07508","kind":"arxiv","version":2},"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/1806.07508/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":"1806.07508","created_at":"2026-07-05T00:19:52.213635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07508v2","created_at":"2026-07-05T00:19:52.213635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07508","created_at":"2026-07-05T00:19:52.213635+00:00"},{"alias_kind":"pith_short_12","alias_value":"3754QYGDWM2W","created_at":"2026-07-05T00:19:52.213635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3754QYGDWM2WBMQV","created_at":"2026-07-05T00:19:52.213635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3754QYGD","created_at":"2026-07-05T00:19:52.213635+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD","json":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD.json","graph_json":"https://pith.science/api/pith-number/3754QYGDWM2WBMQV733RTZZFPD/graph.json","events_json":"https://pith.science/api/pith-number/3754QYGDWM2WBMQV733RTZZFPD/events.json","paper":"https://pith.science/paper/3754QYGD"},"agent_actions":{"view_html":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD","download_json":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD.json","view_paper":"https://pith.science/paper/3754QYGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07508&json=true","fetch_graph":"https://pith.science/api/pith-number/3754QYGDWM2WBMQV733RTZZFPD/graph.json","fetch_events":"https://pith.science/api/pith-number/3754QYGDWM2WBMQV733RTZZFPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD/action/storage_attestation","attest_author":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD/action/author_attestation","sign_citation":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD/action/citation_signature","submit_replication":"https://pith.science/pith/3754QYGDWM2WBMQV733RTZZFPD/action/replication_record"}},"created_at":"2026-07-05T00:19:52.213635+00:00","updated_at":"2026-07-05T00:19:52.213635+00:00"}