{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DS6CMHJ3T2QX3W7NLRUOTMHCF4","short_pith_number":"pith:DS6CMHJ3","schema_version":"1.0","canonical_sha256":"1cbc261d3b9ea17ddbed5c68e9b0e22f158e96635c5bf235277533e566b6c18f","source":{"kind":"arxiv","id":"1302.1515","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1302.1515","created_at":"2026-05-18T03:18:51.452050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.1515v2","created_at":"2026-05-18T03:18:51.452050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1515","created_at":"2026-05-18T03:18:51.452050+00:00"},{"alias_kind":"pith_short_12","alias_value":"DS6CMHJ3T2QX","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DS6CMHJ3T2QX3W7N","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DS6CMHJ3","created_at":"2026-05-18T12:27:43.054852+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/DS6CMHJ3T2QX3W7NLRUOTMHCF4","json":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4.json","graph_json":"https://pith.science/api/pith-number/DS6CMHJ3T2QX3W7NLRUOTMHCF4/graph.json","events_json":"https://pith.science/api/pith-number/DS6CMHJ3T2QX3W7NLRUOTMHCF4/events.json","paper":"https://pith.science/paper/DS6CMHJ3"},"agent_actions":{"view_html":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4","download_json":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4.json","view_paper":"https://pith.science/paper/DS6CMHJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.1515&json=true","fetch_graph":"https://pith.science/api/pith-number/DS6CMHJ3T2QX3W7NLRUOTMHCF4/graph.json","fetch_events":"https://pith.science/api/pith-number/DS6CMHJ3T2QX3W7NLRUOTMHCF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/action/storage_attestation","attest_author":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/action/author_attestation","sign_citation":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/action/citation_signature","submit_replication":"https://pith.science/pith/DS6CMHJ3T2QX3W7NLRUOTMHCF4/action/replication_record"}},"created_at":"2026-05-18T03:18:51.452050+00:00","updated_at":"2026-05-18T03:18:51.452050+00:00"}