{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U2SZI67LQWTNJNFTPP4I3MNQ6E","short_pith_number":"pith:U2SZI67L","schema_version":"1.0","canonical_sha256":"a6a5947beb85a6d4b4b37bf88db1b0f1253fe0ba259e006a78430778213d9fbe","source":{"kind":"arxiv","id":"1111.3162","version":4},"attestation_state":"computed","paper":{"title":"Discretized normal approximation by Stein's method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Xiao Fang","submitted_at":"2011-11-14T10:05:04Z","abstract_excerpt":"We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of i.i.d. Bernoulli random variables, the number of vertices with a given degree in the Erd\\\"{o}s-R\\'{e}nyi random graph, and the uniform multinomial occupancy model."},"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":"1111.3162","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T10:05:04Z","cross_cats_sorted":[],"title_canon_sha256":"6c5e47a221805dcea6f4c2ef7bd3290953930a176d18b292300200e719601c4c","abstract_canon_sha256":"b50fd34db68e2f592673b7c8affb9c07aeba5bee8e331258f67404bb9759be32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:24.850728Z","signature_b64":"LTFznbVUYP+pVNGQEOISkhcJWLa4R2cF5uqh7sTpIndz7mllE5lAfUkt7qFaf3bcT2we5xuL4/Bixvl8iTpQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6a5947beb85a6d4b4b37bf88db1b0f1253fe0ba259e006a78430778213d9fbe","last_reissued_at":"2026-05-18T02:48:24.850076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:24.850076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discretized normal approximation by Stein's method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Xiao Fang","submitted_at":"2011-11-14T10:05:04Z","abstract_excerpt":"We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of i.i.d. Bernoulli random variables, the number of vertices with a given degree in the Erd\\\"{o}s-R\\'{e}nyi random graph, and the uniform multinomial occupancy model."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3162","kind":"arxiv","version":4},"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":"1111.3162","created_at":"2026-05-18T02:48:24.850176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3162v4","created_at":"2026-05-18T02:48:24.850176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3162","created_at":"2026-05-18T02:48:24.850176+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2SZI67LQWTN","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2SZI67LQWTNJNFT","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2SZI67L","created_at":"2026-05-18T12:26:42.757692+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/U2SZI67LQWTNJNFTPP4I3MNQ6E","json":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E.json","graph_json":"https://pith.science/api/pith-number/U2SZI67LQWTNJNFTPP4I3MNQ6E/graph.json","events_json":"https://pith.science/api/pith-number/U2SZI67LQWTNJNFTPP4I3MNQ6E/events.json","paper":"https://pith.science/paper/U2SZI67L"},"agent_actions":{"view_html":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E","download_json":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E.json","view_paper":"https://pith.science/paper/U2SZI67L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3162&json=true","fetch_graph":"https://pith.science/api/pith-number/U2SZI67LQWTNJNFTPP4I3MNQ6E/graph.json","fetch_events":"https://pith.science/api/pith-number/U2SZI67LQWTNJNFTPP4I3MNQ6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E/action/storage_attestation","attest_author":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E/action/author_attestation","sign_citation":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E/action/citation_signature","submit_replication":"https://pith.science/pith/U2SZI67LQWTNJNFTPP4I3MNQ6E/action/replication_record"}},"created_at":"2026-05-18T02:48:24.850176+00:00","updated_at":"2026-05-18T02:48:24.850176+00:00"}