{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:57LAVHVCF4TRF6SWUQDN2B7Y4D","short_pith_number":"pith:57LAVHVC","schema_version":"1.0","canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","source":{"kind":"arxiv","id":"1602.07616","version":1},"attestation_state":"computed","paper":{"title":"Noisy population recovery in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anindya De, Michael Saks, Sijian Tang","submitted_at":"2016-02-24T17:46:30Z","abstract_excerpt":"In the noisy population recovery problem of Dvir et al., the goal is to learn an unknown distribution $f$ on binary strings of length $n$ from noisy samples. For some parameter $\\mu \\in [0,1]$, a noisy sample is generated by flipping each coordinate of a sample from $f$ independently with probability $(1-\\mu)/2$. We assume an upper bound $k$ on the size of the support of the distribution, and the goal is to estimate the probability of any string to within some given error $\\varepsilon$. It is known that the algorithmic complexity and sample complexity of this problem are polynomially related t"},"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":"1602.07616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-24T17:46:30Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"c3d91c6456afcd718c8237db2a59c263e688e5f7940d04dce02a90a245d26e4c","abstract_canon_sha256":"1bb16fd647a520d8b88dc2014c0cba0680dd8dcd9a1aed2a24e5566c68256659"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:02.488443Z","signature_b64":"Incmfqlv5uxSV1c8YOtJ5OAxVSv3YGGWP7SO98J3ogJKkGwUEStVHSBAicLGdrZPptN9AByaSsWDFjlVF9GJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","last_reissued_at":"2026-05-18T01:20:02.487717Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:02.487717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Noisy population recovery in polynomial time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anindya De, Michael Saks, Sijian Tang","submitted_at":"2016-02-24T17:46:30Z","abstract_excerpt":"In the noisy population recovery problem of Dvir et al., the goal is to learn an unknown distribution $f$ on binary strings of length $n$ from noisy samples. For some parameter $\\mu \\in [0,1]$, a noisy sample is generated by flipping each coordinate of a sample from $f$ independently with probability $(1-\\mu)/2$. We assume an upper bound $k$ on the size of the support of the distribution, and the goal is to estimate the probability of any string to within some given error $\\varepsilon$. It is known that the algorithmic complexity and sample complexity of this problem are polynomially related t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07616","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.07616","created_at":"2026-05-18T01:20:02.487837+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.07616v1","created_at":"2026-05-18T01:20:02.487837+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07616","created_at":"2026-05-18T01:20:02.487837+00:00"},{"alias_kind":"pith_short_12","alias_value":"57LAVHVCF4TR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"57LAVHVCF4TRF6SW","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"57LAVHVC","created_at":"2026-05-18T12:29:58.707656+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/57LAVHVCF4TRF6SWUQDN2B7Y4D","json":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D.json","graph_json":"https://pith.science/api/pith-number/57LAVHVCF4TRF6SWUQDN2B7Y4D/graph.json","events_json":"https://pith.science/api/pith-number/57LAVHVCF4TRF6SWUQDN2B7Y4D/events.json","paper":"https://pith.science/paper/57LAVHVC"},"agent_actions":{"view_html":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D","download_json":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D.json","view_paper":"https://pith.science/paper/57LAVHVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.07616&json=true","fetch_graph":"https://pith.science/api/pith-number/57LAVHVCF4TRF6SWUQDN2B7Y4D/graph.json","fetch_events":"https://pith.science/api/pith-number/57LAVHVCF4TRF6SWUQDN2B7Y4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/action/storage_attestation","attest_author":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/action/author_attestation","sign_citation":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/action/citation_signature","submit_replication":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/action/replication_record"}},"created_at":"2026-05-18T01:20:02.487837+00:00","updated_at":"2026-05-18T01:20:02.487837+00:00"}