{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5XS34FNQ77KYUEVKAVEKXM4HRG","short_pith_number":"pith:5XS34FNQ","canonical_record":{"source":{"id":"1706.01478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-06-05T18:09:36Z","cross_cats_sorted":[],"title_canon_sha256":"24288edbe04bd9c17e906b330d100c5963e56fc53893de12fbdc383e28833331","abstract_canon_sha256":"95f2b2f517990704d31dddc17804c1d7566f66a1b5dbef0eefcc16fe7a7af648"},"schema_version":"1.0"},"canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","source":{"kind":"arxiv","id":"1706.01478","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01478","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01478v2","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01478","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"5XS34FNQ77KY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XS34FNQ77KYUEVK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XS34FNQ","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5XS34FNQ77KYUEVKAVEKXM4HRG","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01478","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-06-05T18:09:36Z","cross_cats_sorted":[],"title_canon_sha256":"24288edbe04bd9c17e906b330d100c5963e56fc53893de12fbdc383e28833331","abstract_canon_sha256":"95f2b2f517990704d31dddc17804c1d7566f66a1b5dbef0eefcc16fe7a7af648"},"schema_version":"1.0"},"canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:17.573705Z","signature_b64":"hCTR09XfBoExU5dPS3vocmDXsJNKyumUgMFJt+Xaqz4uAKV8A8pfjUroo8eI8PDlgr9+NjnyiVzko65iwdQ7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","last_reissued_at":"2026-05-18T00:41:17.573029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:17.573029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01478","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-18T00:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzdREeEJgsb3LugI6H9uImhMznzOVeW9CnpKOyOVKgLl/MNsPB0ZbmviYLhSrcaWBb1yCmw7+VCmqE7sZfINDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:33.185422Z"},"content_sha256":"c9c9936f4548bb0490951c00b292de087417d7a8a50fce454e24c0a5005391bb","schema_version":"1.0","event_id":"sha256:c9c9936f4548bb0490951c00b292de087417d7a8a50fce454e24c0a5005391bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5XS34FNQ77KYUEVKAVEKXM4HRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An optimal $(\\epsilon,\\delta)$-approximation scheme for the mean of random variables with bounded relative variance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Mark Huber","submitted_at":"2017-06-05T18:09:36Z","abstract_excerpt":"Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\\{0,1\\}$-matrix, and many others) reduce to creating random variables $X_1,X_2,\\ldots$ with finite mean $\\mu$ and standard deviation$\\sigma$ such that $\\mu$ is the solution for the problem input, and the relative standard deviation $|\\sigma/\\mu| \\leq c$ for known $c$. Under these circumstances, it is known that the number of samples from the $\\{X_i\\}$ needed to form an $(\\epsilon,\\delta)$-approximation $\\hat \\mu$ that satisf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01478","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-18T00:41:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z64AraHAFF9uk5JAeYOSthQiB5xzvwRFanBOfaDEEFZeeXTPn/HvHDADimhcEK/msvWCLP2Z/2wGcPGkT6P+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:33.186063Z"},"content_sha256":"2dd6471dcc2192e14250a36f9e23b566818932c6a929a9a8a1aca37b0f7a0025","schema_version":"1.0","event_id":"sha256:2dd6471dcc2192e14250a36f9e23b566818932c6a929a9a8a1aca37b0f7a0025"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/bundle.json","state_url":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/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-06-09T06:13:33Z","links":{"resolver":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG","bundle":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/bundle.json","state":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5XS34FNQ77KYUEVKAVEKXM4HRG","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":"95f2b2f517990704d31dddc17804c1d7566f66a1b5dbef0eefcc16fe7a7af648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-06-05T18:09:36Z","title_canon_sha256":"24288edbe04bd9c17e906b330d100c5963e56fc53893de12fbdc383e28833331"},"schema_version":"1.0","source":{"id":"1706.01478","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01478","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01478v2","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01478","created_at":"2026-05-18T00:41:17Z"},{"alias_kind":"pith_short_12","alias_value":"5XS34FNQ77KY","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"5XS34FNQ77KYUEVK","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"5XS34FNQ","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:2dd6471dcc2192e14250a36f9e23b566818932c6a929a9a8a1aca37b0f7a0025","target":"graph","created_at":"2026-05-18T00:41:17Z","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":"Randomized approximation algorithms for many #P-complete problems (such as the partition function of a Gibbs distribution, the volume of a convex body, the permanent of a $\\{0,1\\}$-matrix, and many others) reduce to creating random variables $X_1,X_2,\\ldots$ with finite mean $\\mu$ and standard deviation$\\sigma$ such that $\\mu$ is the solution for the problem input, and the relative standard deviation $|\\sigma/\\mu| \\leq c$ for known $c$. Under these circumstances, it is known that the number of samples from the $\\{X_i\\}$ needed to form an $(\\epsilon,\\delta)$-approximation $\\hat \\mu$ that satisf","authors_text":"Mark Huber","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-06-05T18:09:36Z","title":"An optimal $(\\epsilon,\\delta)$-approximation scheme for the mean of random variables with bounded relative variance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01478","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:c9c9936f4548bb0490951c00b292de087417d7a8a50fce454e24c0a5005391bb","target":"record","created_at":"2026-05-18T00:41:17Z","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":"95f2b2f517990704d31dddc17804c1d7566f66a1b5dbef0eefcc16fe7a7af648","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-06-05T18:09:36Z","title_canon_sha256":"24288edbe04bd9c17e906b330d100c5963e56fc53893de12fbdc383e28833331"},"schema_version":"1.0","source":{"id":"1706.01478","kind":"arxiv","version":2}},"canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","first_computed_at":"2026-05-18T00:41:17.573029Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:17.573029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hCTR09XfBoExU5dPS3vocmDXsJNKyumUgMFJt+Xaqz4uAKV8A8pfjUroo8eI8PDlgr9+NjnyiVzko65iwdQ7CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:17.573705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01478","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9c9936f4548bb0490951c00b292de087417d7a8a50fce454e24c0a5005391bb","sha256:2dd6471dcc2192e14250a36f9e23b566818932c6a929a9a8a1aca37b0f7a0025"],"state_sha256":"a19b7afcd0ce3b18acb278a5d68dc47d972d7c08e0e0ef71d1aebde2cb5e3765"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3o3PbWtLbncafTG5kcjSmsmuMV7yeE4i74Fw5TsrCh3ZFswG8eJllCSRdvWxckaS7u7+F38/zwTzg20kYVF7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:13:33.189423Z","bundle_sha256":"d80a4009b4513ecb7f8db29b497f82eadef7ae588dd4270740db492f7c8223c1"}}