{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:57LAVHVCF4TRF6SWUQDN2B7Y4D","short_pith_number":"pith:57LAVHVC","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"},"canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","source":{"kind":"arxiv","id":"1602.07616","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07616","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07616v1","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07616","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"57LAVHVCF4TR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"57LAVHVCF4TRF6SW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"57LAVHVC","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:57LAVHVCF4TRF6SWUQDN2B7Y4D","target":"record","payload":{"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"},"canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","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"},"source_kind":"arxiv","source_id":"1602.07616","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-18T01:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnS2xurCJ9FvytHNS1yZ3CjQAUPldkrQLNoZYnhf5ESpNj3tBiup1DNChP+I7r0uFyarP2BmWCljTIpMuP2qCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:13:59.819491Z"},"content_sha256":"0b7e7ef3e0589cd0fbff6fd73a12ed13f668e7293c2911bfa43e7186ac822c0e","schema_version":"1.0","event_id":"sha256:0b7e7ef3e0589cd0fbff6fd73a12ed13f668e7293c2911bfa43e7186ac822c0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:57LAVHVCF4TRF6SWUQDN2B7Y4D","target":"graph","payload":{"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"},"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-18T01:20:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RMNW28/N39FWiQ0YcE13SWJClikqGuAC6l37x4hXxiuvbIO0ED1exH5gDHay6wM/u6xvHPSeBhI78aanL0OwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:13:59.820136Z"},"content_sha256":"aae64eb23c3e49b803c454d72a7b27d03e5d150ef37b942cb0cf969de22db8f9","schema_version":"1.0","event_id":"sha256:aae64eb23c3e49b803c454d72a7b27d03e5d150ef37b942cb0cf969de22db8f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/bundle.json","state_url":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/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-27T12:13:59Z","links":{"resolver":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D","bundle":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/bundle.json","state":"https://pith.science/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57LAVHVCF4TRF6SWUQDN2B7Y4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:57LAVHVCF4TRF6SWUQDN2B7Y4D","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":"1bb16fd647a520d8b88dc2014c0cba0680dd8dcd9a1aed2a24e5566c68256659","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-24T17:46:30Z","title_canon_sha256":"c3d91c6456afcd718c8237db2a59c263e688e5f7940d04dce02a90a245d26e4c"},"schema_version":"1.0","source":{"id":"1602.07616","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07616","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07616v1","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07616","created_at":"2026-05-18T01:20:02Z"},{"alias_kind":"pith_short_12","alias_value":"57LAVHVCF4TR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"57LAVHVCF4TRF6SW","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"57LAVHVC","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:aae64eb23c3e49b803c454d72a7b27d03e5d150ef37b942cb0cf969de22db8f9","target":"graph","created_at":"2026-05-18T01:20:02Z","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":"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","authors_text":"Anindya De, Michael Saks, Sijian Tang","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-24T17:46:30Z","title":"Noisy population recovery in polynomial time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07616","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:0b7e7ef3e0589cd0fbff6fd73a12ed13f668e7293c2911bfa43e7186ac822c0e","target":"record","created_at":"2026-05-18T01:20:02Z","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":"1bb16fd647a520d8b88dc2014c0cba0680dd8dcd9a1aed2a24e5566c68256659","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-02-24T17:46:30Z","title_canon_sha256":"c3d91c6456afcd718c8237db2a59c263e688e5f7940d04dce02a90a245d26e4c"},"schema_version":"1.0","source":{"id":"1602.07616","kind":"arxiv","version":1}},"canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd60a9ea22f2712fa56a406dd07f8e0d15a1d2d159182f4f81bce7c4bac54cd","first_computed_at":"2026-05-18T01:20:02.487717Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:02.487717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Incmfqlv5uxSV1c8YOtJ5OAxVSv3YGGWP7SO98J3ogJKkGwUEStVHSBAicLGdrZPptN9AByaSsWDFjlVF9GJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:02.488443Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07616","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b7e7ef3e0589cd0fbff6fd73a12ed13f668e7293c2911bfa43e7186ac822c0e","sha256:aae64eb23c3e49b803c454d72a7b27d03e5d150ef37b942cb0cf969de22db8f9"],"state_sha256":"575d1df0e0f2dc8d5de46f3bc999bf9b2a2db2058591ce29a2051a1444e2f791"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y5Ny8jVbT7n6cHU/Hx08n5Zhyg35b3h0WpV7ChfGuM1cL9SRerNhz34gPo06CBDvo0yairn7395/2K1kGnL+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:13:59.823309Z","bundle_sha256":"1d02fc4be14191e93d83c8d8065717fadacbd9cab49f382169a5709cedcdb008"}}