{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5XS34FNQ77KYUEVKAVEKXM4HRG","short_pith_number":"pith:5XS34FNQ","schema_version":"1.0","canonical_sha256":"ede5be15b0ffd58a12aa0548abb38789b7d62e11c7108526a9b7d01e9da42d40","source":{"kind":"arxiv","id":"1706.01478","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.01478","created_at":"2026-05-18T00:41:17.573127+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.01478v2","created_at":"2026-05-18T00:41:17.573127+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01478","created_at":"2026-05-18T00:41:17.573127+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XS34FNQ77KY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XS34FNQ77KYUEVK","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XS34FNQ","created_at":"2026-05-18T12:31:03.183658+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/5XS34FNQ77KYUEVKAVEKXM4HRG","json":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG.json","graph_json":"https://pith.science/api/pith-number/5XS34FNQ77KYUEVKAVEKXM4HRG/graph.json","events_json":"https://pith.science/api/pith-number/5XS34FNQ77KYUEVKAVEKXM4HRG/events.json","paper":"https://pith.science/paper/5XS34FNQ"},"agent_actions":{"view_html":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG","download_json":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG.json","view_paper":"https://pith.science/paper/5XS34FNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.01478&json=true","fetch_graph":"https://pith.science/api/pith-number/5XS34FNQ77KYUEVKAVEKXM4HRG/graph.json","fetch_events":"https://pith.science/api/pith-number/5XS34FNQ77KYUEVKAVEKXM4HRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/action/storage_attestation","attest_author":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/action/author_attestation","sign_citation":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/action/citation_signature","submit_replication":"https://pith.science/pith/5XS34FNQ77KYUEVKAVEKXM4HRG/action/replication_record"}},"created_at":"2026-05-18T00:41:17.573127+00:00","updated_at":"2026-05-18T00:41:17.573127+00:00"}