{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KHAT3RTUPC7V37MFVFNFHD6W2Z","short_pith_number":"pith:KHAT3RTU","schema_version":"1.0","canonical_sha256":"51c13dc67478bf5dfd85a95a538fd6d65865074baa09cf5239b0d25056dcfe27","source":{"kind":"arxiv","id":"1803.11132","version":2},"attestation_state":"computed","paper":{"title":"Notes on computational-to-statistical gaps: predictions using statistical physics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry","submitted_at":"2018-03-29T16:10:04Z","abstract_excerpt":"In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances. The methods we describe here are based on mature, albeit non-rigorous, tools from statistical physics.\n  These notes are based on a lecture series given by the authors at the Courant Institute of Mathematical Sciences in New York City, on May 16th, 2017."},"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":"1803.11132","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-29T16:10:04Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"d7880fb33d00a3f99509df59b255af4b267bd68807903912a39da56de8f795cf","abstract_canon_sha256":"ba2fa57953f0734246f8580ce9ab8ccb27d5b625299e43fc0f6220c10ecc134d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:59.442838Z","signature_b64":"6/5hWo201aKig2E7nSF7SQ0w90Px1oVG41ZFEGuCbpDYPU+kARhpqRKatKVN6GgyoEAR9Mvo025/IS5sxV3ZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c13dc67478bf5dfd85a95a538fd6d65865074baa09cf5239b0d25056dcfe27","last_reissued_at":"2026-05-18T00:17:59.442210Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:59.442210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Notes on computational-to-statistical gaps: predictions using statistical physics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"stat.ML","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Amelia Perry","submitted_at":"2018-03-29T16:10:04Z","abstract_excerpt":"In these notes we describe heuristics to predict computational-to-statistical gaps in certain statistical problems. These are regimes in which the underlying statistical problem is information-theoretically possible although no efficient algorithm exists, rendering the problem essentially unsolvable for large instances. The methods we describe here are based on mature, albeit non-rigorous, tools from statistical physics.\n  These notes are based on a lecture series given by the authors at the Courant Institute of Mathematical Sciences in New York City, on May 16th, 2017."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.11132","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":""},"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":"1803.11132","created_at":"2026-05-18T00:17:59.442293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.11132v2","created_at":"2026-05-18T00:17:59.442293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.11132","created_at":"2026-05-18T00:17:59.442293+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHAT3RTUPC7V","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHAT3RTUPC7V37MF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHAT3RTU","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05618","citing_title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z","json":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z.json","graph_json":"https://pith.science/api/pith-number/KHAT3RTUPC7V37MFVFNFHD6W2Z/graph.json","events_json":"https://pith.science/api/pith-number/KHAT3RTUPC7V37MFVFNFHD6W2Z/events.json","paper":"https://pith.science/paper/KHAT3RTU"},"agent_actions":{"view_html":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z","download_json":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z.json","view_paper":"https://pith.science/paper/KHAT3RTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.11132&json=true","fetch_graph":"https://pith.science/api/pith-number/KHAT3RTUPC7V37MFVFNFHD6W2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/KHAT3RTUPC7V37MFVFNFHD6W2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z/action/storage_attestation","attest_author":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z/action/author_attestation","sign_citation":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z/action/citation_signature","submit_replication":"https://pith.science/pith/KHAT3RTUPC7V37MFVFNFHD6W2Z/action/replication_record"}},"created_at":"2026-05-18T00:17:59.442293+00:00","updated_at":"2026-05-18T00:17:59.442293+00:00"}