{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PNLI6LAOQHHHWQY3XFOGME6MMV","short_pith_number":"pith:PNLI6LAO","schema_version":"1.0","canonical_sha256":"7b568f2c0e81ce7b431bb95c6613cc656962e9762d9c7434a713dcccd6c9d84a","source":{"kind":"arxiv","id":"2507.13222","version":1},"attestation_state":"computed","paper":{"title":"Computational-Statistical Tradeoffs from NP-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Caleb Koch, Carmen Strassle, Guy Blanc, Li-Yang Tan","submitted_at":"2025-07-17T15:35:36Z","abstract_excerpt":"A central question in computer science and statistics is whether efficient algorithms can achieve the information-theoretic limits of statistical problems. Many computational-statistical tradeoffs have been shown under average-case assumptions, but since statistical problems are average-case in nature, it has been a challenge to base them on standard worst-case assumptions.\n  In PAC learning where such tradeoffs were first studied, the question is whether computational efficiency can come at the cost of using more samples than information-theoretically necessary. We base such tradeoffs on $\\ma"},"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":"2507.13222","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-07-17T15:35:36Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"fde95b5d466a168f9822cd573424be90894cc1ba227b4c755819c1b0ce607641","abstract_canon_sha256":"2a5d53cdaca144903daa56cb0269eab23936f00515ae53506260aa1dc6260dfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:56.627890Z","signature_b64":"v/yuAPcjZWdc2evWU64iwf9ByaosvjUweE8uqNbjgSbjBw2jdlZ6DGn2D+D6VZSKrzYea6qVz6Cuy6Y7eN79CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b568f2c0e81ce7b431bb95c6613cc656962e9762d9c7434a713dcccd6c9d84a","last_reissued_at":"2026-07-05T11:38:56.627415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:56.627415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational-Statistical Tradeoffs from NP-hardness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Caleb Koch, Carmen Strassle, Guy Blanc, Li-Yang Tan","submitted_at":"2025-07-17T15:35:36Z","abstract_excerpt":"A central question in computer science and statistics is whether efficient algorithms can achieve the information-theoretic limits of statistical problems. Many computational-statistical tradeoffs have been shown under average-case assumptions, but since statistical problems are average-case in nature, it has been a challenge to base them on standard worst-case assumptions.\n  In PAC learning where such tradeoffs were first studied, the question is whether computational efficiency can come at the cost of using more samples than information-theoretically necessary. We base such tradeoffs on $\\ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.13222","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/2507.13222/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":"2507.13222","created_at":"2026-07-05T11:38:56.627485+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.13222v1","created_at":"2026-07-05T11:38:56.627485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.13222","created_at":"2026-07-05T11:38:56.627485+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNLI6LAOQHHH","created_at":"2026-07-05T11:38:56.627485+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNLI6LAOQHHHWQY3","created_at":"2026-07-05T11:38:56.627485+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNLI6LAO","created_at":"2026-07-05T11:38:56.627485+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/PNLI6LAOQHHHWQY3XFOGME6MMV","json":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV.json","graph_json":"https://pith.science/api/pith-number/PNLI6LAOQHHHWQY3XFOGME6MMV/graph.json","events_json":"https://pith.science/api/pith-number/PNLI6LAOQHHHWQY3XFOGME6MMV/events.json","paper":"https://pith.science/paper/PNLI6LAO"},"agent_actions":{"view_html":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV","download_json":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV.json","view_paper":"https://pith.science/paper/PNLI6LAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.13222&json=true","fetch_graph":"https://pith.science/api/pith-number/PNLI6LAOQHHHWQY3XFOGME6MMV/graph.json","fetch_events":"https://pith.science/api/pith-number/PNLI6LAOQHHHWQY3XFOGME6MMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV/action/storage_attestation","attest_author":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV/action/author_attestation","sign_citation":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV/action/citation_signature","submit_replication":"https://pith.science/pith/PNLI6LAOQHHHWQY3XFOGME6MMV/action/replication_record"}},"created_at":"2026-07-05T11:38:56.627485+00:00","updated_at":"2026-07-05T11:38:56.627485+00:00"}