{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OO7HZCKBAZZXYMDISHRH3SHBPL","short_pith_number":"pith:OO7HZCKB","schema_version":"1.0","canonical_sha256":"73be7c894106737c306891e27dc8e17afbe7a35da3d3bff70f08e4199d80df74","source":{"kind":"arxiv","id":"1908.05386","version":1},"attestation_state":"computed","paper":{"title":"Robust estimation of the mean with bounded relative standard deviation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Mark Huber","submitted_at":"2019-08-15T01:13:18Z","abstract_excerpt":"Many randomized approximation algorithms operate by giving a procedure for simulating a random variable $X$ which has mean $\\mu$ equal to the target answer, and a relative standard deviation bounded above by a known constant $c$. Examples of this type of algorithm includes methods for approximating the number of satisfying assignments to 2-SAT or DNF, the volume of a convex body, and the partition function of a Gibbs distribution. Because the answer is usually exponentially large in the problem input size, it is typical to require an estimate $\\hat \\mu$ satisfy $\\mathbb{P}(|\\hat \\mu/\\mu - 1| >"},"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":"1908.05386","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2019-08-15T01:13:18Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6d70ab846bfef73bdb50835d99ff51134dcdc8478f730dbb3f8d7ed079ee3e66","abstract_canon_sha256":"88591f191187b49a4047275affa8604944c02ea0e7ab46f7915bf13dc58c9bb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:50.993401Z","signature_b64":"nip/3L8+lAUhz1YyROoBOphkrM/yUyeITRi9V5lWVhIFq2a34eL9UYIiE1twMGomfvRzI5AOZ0FuPQbQukTEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73be7c894106737c306891e27dc8e17afbe7a35da3d3bff70f08e4199d80df74","last_reissued_at":"2026-07-04T23:56:50.992980Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:50.992980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust estimation of the mean with bounded relative standard deviation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"stat.CO","authors_text":"Mark Huber","submitted_at":"2019-08-15T01:13:18Z","abstract_excerpt":"Many randomized approximation algorithms operate by giving a procedure for simulating a random variable $X$ which has mean $\\mu$ equal to the target answer, and a relative standard deviation bounded above by a known constant $c$. Examples of this type of algorithm includes methods for approximating the number of satisfying assignments to 2-SAT or DNF, the volume of a convex body, and the partition function of a Gibbs distribution. Because the answer is usually exponentially large in the problem input size, it is typical to require an estimate $\\hat \\mu$ satisfy $\\mathbb{P}(|\\hat \\mu/\\mu - 1| >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05386","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.05386/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.05386","created_at":"2026-07-04T23:56:50.993034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05386v1","created_at":"2026-07-04T23:56:50.993034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05386","created_at":"2026-07-04T23:56:50.993034+00:00"},{"alias_kind":"pith_short_12","alias_value":"OO7HZCKBAZZX","created_at":"2026-07-04T23:56:50.993034+00:00"},{"alias_kind":"pith_short_16","alias_value":"OO7HZCKBAZZXYMDI","created_at":"2026-07-04T23:56:50.993034+00:00"},{"alias_kind":"pith_short_8","alias_value":"OO7HZCKB","created_at":"2026-07-04T23:56:50.993034+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/OO7HZCKBAZZXYMDISHRH3SHBPL","json":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL.json","graph_json":"https://pith.science/api/pith-number/OO7HZCKBAZZXYMDISHRH3SHBPL/graph.json","events_json":"https://pith.science/api/pith-number/OO7HZCKBAZZXYMDISHRH3SHBPL/events.json","paper":"https://pith.science/paper/OO7HZCKB"},"agent_actions":{"view_html":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL","download_json":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL.json","view_paper":"https://pith.science/paper/OO7HZCKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05386&json=true","fetch_graph":"https://pith.science/api/pith-number/OO7HZCKBAZZXYMDISHRH3SHBPL/graph.json","fetch_events":"https://pith.science/api/pith-number/OO7HZCKBAZZXYMDISHRH3SHBPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL/action/storage_attestation","attest_author":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL/action/author_attestation","sign_citation":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL/action/citation_signature","submit_replication":"https://pith.science/pith/OO7HZCKBAZZXYMDISHRH3SHBPL/action/replication_record"}},"created_at":"2026-07-04T23:56:50.993034+00:00","updated_at":"2026-07-04T23:56:50.993034+00:00"}