{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHCBBVY7IEPVGYI2ODEIVAPYP4","short_pith_number":"pith:KHCBBVY7","canonical_record":{"source":{"id":"1703.01474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:13:41Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"40e35c1c26a0ae816078236525d1b539bfdbcaeea6a8f1f3fe9fd0e6e73baba0","abstract_canon_sha256":"524a02c6f41a8ce062a32f1396c71d0b4d4bb463787f8a948e69da8eeacaf25a"},"schema_version":"1.0"},"canonical_sha256":"51c410d71f411f53611a70c88a81f87f35ab41e198e389bf825120e3a74ec51c","source":{"kind":"arxiv","id":"1703.01474","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01474","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01474v1","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01474","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"KHCBBVY7IEPV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHCBBVY7IEPVGYI2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHCBBVY7","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHCBBVY7IEPVGYI2ODEIVAPYP4","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:13:41Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"40e35c1c26a0ae816078236525d1b539bfdbcaeea6a8f1f3fe9fd0e6e73baba0","abstract_canon_sha256":"524a02c6f41a8ce062a32f1396c71d0b4d4bb463787f8a948e69da8eeacaf25a"},"schema_version":"1.0"},"canonical_sha256":"51c410d71f411f53611a70c88a81f87f35ab41e198e389bf825120e3a74ec51c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:30.612839Z","signature_b64":"2EacIouJIOsLZuIETwkJLgkN/FGVYHNF62ajZJ+Rt5VzE6xzndomGT4IzFRQCxwdsuJ1k+603dIfNStKzQ4eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51c410d71f411f53611a70c88a81f87f35ab41e198e389bf825120e3a74ec51c","last_reissued_at":"2026-05-18T00:49:30.612154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:30.612154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01474","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvZtXDlPGETPiG41ITYkpiptvEUUGUeXdRICIMoXSe0rOa55TjU/w7RwsTY/IzSHI9UeQ/S0D86V5NzBDZxCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:48:46.416792Z"},"content_sha256":"3bdcf4a08bee4968c8caad60e337eddcc3e3632dcbd0b14c0cb551f02c3ae92f","schema_version":"1.0","event_id":"sha256:3bdcf4a08bee4968c8caad60e337eddcc3e3632dcbd0b14c0cb551f02c3ae92f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHCBBVY7IEPVGYI2ODEIVAPYP4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp bounds for population recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","submitted_at":"2017-03-04T15:13:41Z","abstract_excerpt":"The population recovery problem is a basic problem in noisy unsupervised learning that has attracted significant research attention in recent years [WY12,DRWY12, MS13, BIMP13, LZ15,DST16]. A number of different variants of this problem have been studied, often under assumptions on the unknown distribution (such as that it has restricted support size). In this work we study the sample complexity and algorithmic complexity of the most general version of the problem, under both bit-flip noise and erasure noise model. We give essentially matching upper and lower sample complexity bounds for both n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01474","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:49:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/06mkIYDe2JFoqNvInPtLMp1LrfVme3TJNtAgybqMXnRfOl5geBPdhaF8u0MYq5eCCe7oZ+ORGWj+2XJD+P0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:48:46.417537Z"},"content_sha256":"4803a9a0c81d4a83babe28700a80c7d6f15794cfa8955bf2cef27ba8efb358c7","schema_version":"1.0","event_id":"sha256:4803a9a0c81d4a83babe28700a80c7d6f15794cfa8955bf2cef27ba8efb358c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/bundle.json","state_url":"https://pith.science/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T06:48:46Z","links":{"resolver":"https://pith.science/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4","bundle":"https://pith.science/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/bundle.json","state":"https://pith.science/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHCBBVY7IEPVGYI2ODEIVAPYP4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHCBBVY7IEPVGYI2ODEIVAPYP4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"524a02c6f41a8ce062a32f1396c71d0b4d4bb463787f8a948e69da8eeacaf25a","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:13:41Z","title_canon_sha256":"40e35c1c26a0ae816078236525d1b539bfdbcaeea6a8f1f3fe9fd0e6e73baba0"},"schema_version":"1.0","source":{"id":"1703.01474","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01474","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01474v1","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01474","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"KHCBBVY7IEPV","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHCBBVY7IEPVGYI2","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHCBBVY7","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4803a9a0c81d4a83babe28700a80c7d6f15794cfa8955bf2cef27ba8efb358c7","target":"graph","created_at":"2026-05-18T00:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"The population recovery problem is a basic problem in noisy unsupervised learning that has attracted significant research attention in recent years [WY12,DRWY12, MS13, BIMP13, LZ15,DST16]. A number of different variants of this problem have been studied, often under assumptions on the unknown distribution (such as that it has restricted support size). In this work we study the sample complexity and algorithmic complexity of the most general version of the problem, under both bit-flip noise and erasure noise model. We give essentially matching upper and lower sample complexity bounds for both n","authors_text":"Anindya De, Rocco Servedio, Ryan O'Donnell","cross_cats":["cs.LG","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:13:41Z","title":"Sharp bounds for population recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01474","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3bdcf4a08bee4968c8caad60e337eddcc3e3632dcbd0b14c0cb551f02c3ae92f","target":"record","created_at":"2026-05-18T00:49:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"524a02c6f41a8ce062a32f1396c71d0b4d4bb463787f8a948e69da8eeacaf25a","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-04T15:13:41Z","title_canon_sha256":"40e35c1c26a0ae816078236525d1b539bfdbcaeea6a8f1f3fe9fd0e6e73baba0"},"schema_version":"1.0","source":{"id":"1703.01474","kind":"arxiv","version":1}},"canonical_sha256":"51c410d71f411f53611a70c88a81f87f35ab41e198e389bf825120e3a74ec51c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51c410d71f411f53611a70c88a81f87f35ab41e198e389bf825120e3a74ec51c","first_computed_at":"2026-05-18T00:49:30.612154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:30.612154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2EacIouJIOsLZuIETwkJLgkN/FGVYHNF62ajZJ+Rt5VzE6xzndomGT4IzFRQCxwdsuJ1k+603dIfNStKzQ4eDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:30.612839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01474","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bdcf4a08bee4968c8caad60e337eddcc3e3632dcbd0b14c0cb551f02c3ae92f","sha256:4803a9a0c81d4a83babe28700a80c7d6f15794cfa8955bf2cef27ba8efb358c7"],"state_sha256":"cd38d48a2f3e42db54bd9203f2b75829971f594f46871dd296abe4a0f5ff3781"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCMlAMwEXSG0R7eqcYHocL5Wejhhu0wSugyW8/Fw38jqHdHv8+1DGAB1E9efN8mk2+/5OnJA489xkGyfVQs2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:48:46.421457Z","bundle_sha256":"8ca1b689cd239cbef504b1b321b365f3dae2a7f6d8d671cde59f71c80d1084e4"}}