{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NKHT4SWYUCM5JAQ2P3TOKOHQD3","short_pith_number":"pith:NKHT4SWY","canonical_record":{"source":{"id":"1111.3159","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T09:55:29Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"d919f8c837b97474daa37c44957655853edb7035dd3086005caf40e12afbf3a1","abstract_canon_sha256":"64702b491b5877fc58afa5db99d8deb305d5ff4fcea1776fa8043ee34ba1de89"},"schema_version":"1.0"},"canonical_sha256":"6a8f3e4ad8a099d4821a7ee6e538f01ed3f3fb4697f9e58f722070254a829e22","source":{"kind":"arxiv","id":"1111.3159","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3159","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3159v5","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3159","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"NKHT4SWYUCM5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NKHT4SWYUCM5JAQ2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NKHT4SWY","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NKHT4SWYUCM5JAQ2P3TOKOHQD3","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3159","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T09:55:29Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"d919f8c837b97474daa37c44957655853edb7035dd3086005caf40e12afbf3a1","abstract_canon_sha256":"64702b491b5877fc58afa5db99d8deb305d5ff4fcea1776fa8043ee34ba1de89"},"schema_version":"1.0"},"canonical_sha256":"6a8f3e4ad8a099d4821a7ee6e538f01ed3f3fb4697f9e58f722070254a829e22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.556359Z","signature_b64":"n+O/lf4ok3uWaem0pcxAstwKl+4hG/T+nGyR8RU1X6RJS01XWuqFj3WrxUDyrNCF0Ax5lNoIfOdMcUFMG1uyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a8f3e4ad8a099d4821a7ee6e538f01ed3f3fb4697f9e58f722070254a829e22","last_reissued_at":"2026-05-18T02:19:06.555805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.555805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3159","source_version":5,"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-18T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELDd2eSbUUpQMhUE1B114Ka/NvOv0zjak8NT60/2FqYWKRYK9LevqkK/v0eFWl5OYICvbRlwuxic4GPdf0cADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:39:59.709862Z"},"content_sha256":"948ea78e097e02b836c18e2a4c983b5eb9f27694b6227c067d3cea18fdfc2ef9","schema_version":"1.0","event_id":"sha256:948ea78e097e02b836c18e2a4c983b5eb9f27694b6227c067d3cea18fdfc2ef9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NKHT4SWYUCM5JAQ2P3TOKOHQD3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the error bound in a combinatorial central limit theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.PR","authors_text":"Louis H.Y. Chen, Xiao Fang","submitted_at":"2011-11-14T09:55:29Z","abstract_excerpt":"Let $\\mathbb{X}=\\{X_{ij}: 1\\le i,j\\le n\\}$ be an $n\\times n$ array of independent random variables where $n\\ge2$. Let $\\pi$ be a uniform random permutation of $\\{1,2,\\dots,n\\}$, independent of $\\mathbb{X}$, and let $W=\\sum_{i=1}^nX_{i\\pi(i)}$. Suppose $\\mathbb{X}$ is standardized so that ${\\mathbb{E}}W=0,\\operatorname {Var}(W)=1$. We prove that the Kolmogorov distance between the distribution of $W$ and the standard normal distribution is bounded by $451\\sum_{i,j=1}^n{\\mathbb{E}}|X_{ij}|^3/n$. Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3159","kind":"arxiv","version":5},"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-18T02:19:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blZVc8tW96tknTwqXTBQ7w1kyJp1YEAWMbNMusX+3UDAlmWNCSBR96/vrhXGKyspNa6VkNzVscBnHh7GAHFbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:39:59.710212Z"},"content_sha256":"f76c93fcd67ab1a667d98d6e1192313227d9ccf05d6d7cbae6e96d5695f1466f","schema_version":"1.0","event_id":"sha256:f76c93fcd67ab1a667d98d6e1192313227d9ccf05d6d7cbae6e96d5695f1466f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/bundle.json","state_url":"https://pith.science/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/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-30T08:39:59Z","links":{"resolver":"https://pith.science/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3","bundle":"https://pith.science/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/bundle.json","state":"https://pith.science/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NKHT4SWYUCM5JAQ2P3TOKOHQD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NKHT4SWYUCM5JAQ2P3TOKOHQD3","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":"64702b491b5877fc58afa5db99d8deb305d5ff4fcea1776fa8043ee34ba1de89","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T09:55:29Z","title_canon_sha256":"d919f8c837b97474daa37c44957655853edb7035dd3086005caf40e12afbf3a1"},"schema_version":"1.0","source":{"id":"1111.3159","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3159","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3159v5","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3159","created_at":"2026-05-18T02:19:06Z"},{"alias_kind":"pith_short_12","alias_value":"NKHT4SWYUCM5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NKHT4SWYUCM5JAQ2","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NKHT4SWY","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:f76c93fcd67ab1a667d98d6e1192313227d9ccf05d6d7cbae6e96d5695f1466f","target":"graph","created_at":"2026-05-18T02:19:06Z","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":"Let $\\mathbb{X}=\\{X_{ij}: 1\\le i,j\\le n\\}$ be an $n\\times n$ array of independent random variables where $n\\ge2$. Let $\\pi$ be a uniform random permutation of $\\{1,2,\\dots,n\\}$, independent of $\\mathbb{X}$, and let $W=\\sum_{i=1}^nX_{i\\pi(i)}$. Suppose $\\mathbb{X}$ is standardized so that ${\\mathbb{E}}W=0,\\operatorname {Var}(W)=1$. We prove that the Kolmogorov distance between the distribution of $W$ and the standard normal distribution is bounded by $451\\sum_{i,j=1}^n{\\mathbb{E}}|X_{ij}|^3/n$. Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality.","authors_text":"Louis H.Y. Chen, Xiao Fang","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T09:55:29Z","title":"On the error bound in a combinatorial central limit theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3159","kind":"arxiv","version":5},"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:948ea78e097e02b836c18e2a4c983b5eb9f27694b6227c067d3cea18fdfc2ef9","target":"record","created_at":"2026-05-18T02:19:06Z","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":"64702b491b5877fc58afa5db99d8deb305d5ff4fcea1776fa8043ee34ba1de89","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-11-14T09:55:29Z","title_canon_sha256":"d919f8c837b97474daa37c44957655853edb7035dd3086005caf40e12afbf3a1"},"schema_version":"1.0","source":{"id":"1111.3159","kind":"arxiv","version":5}},"canonical_sha256":"6a8f3e4ad8a099d4821a7ee6e538f01ed3f3fb4697f9e58f722070254a829e22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a8f3e4ad8a099d4821a7ee6e538f01ed3f3fb4697f9e58f722070254a829e22","first_computed_at":"2026-05-18T02:19:06.555805Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:19:06.555805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n+O/lf4ok3uWaem0pcxAstwKl+4hG/T+nGyR8RU1X6RJS01XWuqFj3WrxUDyrNCF0Ax5lNoIfOdMcUFMG1uyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:19:06.556359Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3159","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:948ea78e097e02b836c18e2a4c983b5eb9f27694b6227c067d3cea18fdfc2ef9","sha256:f76c93fcd67ab1a667d98d6e1192313227d9ccf05d6d7cbae6e96d5695f1466f"],"state_sha256":"80ab1ffffc016975423ddbf7ddb008e06ba0c208c81abbcd5d87f3190cd8abd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNuaTZ8Nc8kPue+IvDxnGgFsm9MQpCbBZ0Q/6T/vvf7ke4h3q6zV1wZaKEB6Jomga23FG1poCdgMqQmzHsSWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:39:59.712154Z","bundle_sha256":"a6e1b77bd8bf61d368fad2cf9557dc687a56cdac6dab5f829b1afbf3761ada28"}}