{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DS6CMHJ3T2QX3W7NLRUOTMHCF4","short_pith_number":"pith:DS6CMHJ3","canonical_record":{"source":{"id":"1302.1515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-06T20:53:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db63e360a1a91215e5b89495edf71e19bb843ca5efe5235859d667abd0d67b0f","abstract_canon_sha256":"9c7e7a3bbfcaeb594f0755031d6b5a0663840f43010e507eb24eb50f1050ff4a"},"schema_version":"1.0"},"canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","source":{"kind":"arxiv","id":"1302.1515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1515","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1515v2","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1515","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"DS6CMHJ3T2QX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS6CMHJ3T2QX3W7N","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS6CMHJ3","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DS6CMHJ3T2QX3W7NLRUOTMHCF4","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-06T20:53:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"db63e360a1a91215e5b89495edf71e19bb843ca5efe5235859d667abd0d67b0f","abstract_canon_sha256":"9c7e7a3bbfcaeb594f0755031d6b5a0663840f43010e507eb24eb50f1050ff4a"},"schema_version":"1.0"},"canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:51.452475Z","signature_b64":"OU567KNZ/7LooFRVX3VK2moLHP8IyYijZ+hMp09IU+YHBMF9r2YNgGarFYNUf19IAwiSWFkJYec38zQcGtGZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","last_reissued_at":"2026-05-18T03:18:51.451975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:51.451975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1515","source_version":2,"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-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3zD8SjwKuvRnvYUPwvbPR4Lv3wrfRrjhK67njGTmZk/efsSiSikLIc0+LpT8Ya2o/sr3F2e3h31BlOu4rH4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:56:57.375219Z"},"content_sha256":"0c6b01f0af5e54a01d030b91dfde446642e7ae2ed13a9c64cd0ae9826403d6c3","schema_version":"1.0","event_id":"sha256:0c6b01f0af5e54a01d030b91dfde446642e7ae2ed13a9c64cd0ae9826403d6c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DS6CMHJ3T2QX3W7NLRUOTMHCF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial Time Algorithm for Lossy Population Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Ankur Moitra, Michael Saks","submitted_at":"2013-02-06T20:53:35Z","abstract_excerpt":"We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length $n$ from lossy samples: for some parameter $\\mu$ each coordinate of the sample is preserved with probability $\\mu$ and otherwise is replaced by a `?'. The running time and number of samples needed for our algorithm is polynomial in $n$ and $1/\\varepsilon$ for each fixed $\\mu>0$. This improves on algorithm of Wigderson and Yehudayoff that runs in quasi-polynomial time for any $\\mu > 0$ and the polynomial time algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1515","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"},"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-18T03:18:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zcyvx9a/Ewl+931BX19FYS/nOzFf5pR/b+tORLWL5rqPFP+V05fCVu8VJG1R/eIBRc61nbbEJHkCeiEyVk4hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:56:57.375864Z"},"content_sha256":"8350161710610d3545b13d558ba8ecd5319fcaaaad4e6c3b8f1935b10dad46ab","schema_version":"1.0","event_id":"sha256:8350161710610d3545b13d558ba8ecd5319fcaaaad4e6c3b8f1935b10dad46ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/bundle.json","state_url":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/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-28T19:56:57Z","links":{"resolver":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4","bundle":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/bundle.json","state":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DS6CMHJ3T2QX3W7NLRUOTMHCF4","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":"9c7e7a3bbfcaeb594f0755031d6b5a0663840f43010e507eb24eb50f1050ff4a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-06T20:53:35Z","title_canon_sha256":"db63e360a1a91215e5b89495edf71e19bb843ca5efe5235859d667abd0d67b0f"},"schema_version":"1.0","source":{"id":"1302.1515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1515","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1515v2","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1515","created_at":"2026-05-18T03:18:51Z"},{"alias_kind":"pith_short_12","alias_value":"DS6CMHJ3T2QX","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DS6CMHJ3T2QX3W7N","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DS6CMHJ3","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:8350161710610d3545b13d558ba8ecd5319fcaaaad4e6c3b8f1935b10dad46ab","target":"graph","created_at":"2026-05-18T03:18:51Z","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":"We give a polynomial time algorithm for the lossy population recovery problem. In this problem, the goal is to approximately learn an unknown distribution on binary strings of length $n$ from lossy samples: for some parameter $\\mu$ each coordinate of the sample is preserved with probability $\\mu$ and otherwise is replaced by a `?'. The running time and number of samples needed for our algorithm is polynomial in $n$ and $1/\\varepsilon$ for each fixed $\\mu>0$. This improves on algorithm of Wigderson and Yehudayoff that runs in quasi-polynomial time for any $\\mu > 0$ and the polynomial time algor","authors_text":"Ankur Moitra, Michael Saks","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-06T20:53:35Z","title":"A Polynomial Time Algorithm for Lossy Population Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1515","kind":"arxiv","version":2},"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:0c6b01f0af5e54a01d030b91dfde446642e7ae2ed13a9c64cd0ae9826403d6c3","target":"record","created_at":"2026-05-18T03:18:51Z","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":"9c7e7a3bbfcaeb594f0755031d6b5a0663840f43010e507eb24eb50f1050ff4a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-06T20:53:35Z","title_canon_sha256":"db63e360a1a91215e5b89495edf71e19bb843ca5efe5235859d667abd0d67b0f"},"schema_version":"1.0","source":{"id":"1302.1515","kind":"arxiv","version":2}},"canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","first_computed_at":"2026-05-18T03:18:51.451975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:51.451975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OU567KNZ/7LooFRVX3VK2moLHP8IyYijZ+hMp09IU+YHBMF9r2YNgGarFYNUf19IAwiSWFkJYec38zQcGtGZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:51.452475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c6b01f0af5e54a01d030b91dfde446642e7ae2ed13a9c64cd0ae9826403d6c3","sha256:8350161710610d3545b13d558ba8ecd5319fcaaaad4e6c3b8f1935b10dad46ab"],"state_sha256":"b7bde127438c199b9c0833ea020668365335a552a351bc3196111ee386535b1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCfHOe68uwns5JFZKlCWVXEaPE8AZLRVz24N+kqS0tncKXBf4+AHQFl0iCqUNCk2awICFHVoAQNTjwgq7eVdDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:56:57.378909Z","bundle_sha256":"56059a9aa85f88f9a561a331bdbafe72469b0c5521f121fafd1154d7f98ccb7a"}}