{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FO54YHG2SXIZ7KYECGNISAHCX3","short_pith_number":"pith:FO54YHG2","canonical_record":{"source":{"id":"1009.5397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T20:57:00Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"143e2f67a152a55c84b1bd06d6342cba7ac87608a59d9f11ed701009b371ffd9","abstract_canon_sha256":"634cce162c208397df68f900daf30548a19263dd53a5793eea568825a7585148"},"schema_version":"1.0"},"canonical_sha256":"2bbbcc1cda95d19fab04119a8900e2beee5a6518a6ac8cf04d3aa570c6881a77","source":{"kind":"arxiv","id":"1009.5397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5397","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5397v2","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5397","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"FO54YHG2SXIZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FO54YHG2SXIZ7KYE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FO54YHG2","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FO54YHG2SXIZ7KYECGNISAHCX3","target":"record","payload":{"canonical_record":{"source":{"id":"1009.5397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T20:57:00Z","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"title_canon_sha256":"143e2f67a152a55c84b1bd06d6342cba7ac87608a59d9f11ed701009b371ffd9","abstract_canon_sha256":"634cce162c208397df68f900daf30548a19263dd53a5793eea568825a7585148"},"schema_version":"1.0"},"canonical_sha256":"2bbbcc1cda95d19fab04119a8900e2beee5a6518a6ac8cf04d3aa570c6881a77","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:37:09.977393Z","signature_b64":"dUS4eC938Id0mN/LbmtvseMrF4kqgpYJi//8cGNZhXW3zQK/heShhD8ZiAKBX/0bj5jk9sEgexILB/VrisGZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bbbcc1cda95d19fab04119a8900e2beee5a6518a6ac8cf04d3aa570c6881a77","last_reissued_at":"2026-05-18T04:37:09.976536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:37:09.976536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.5397","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-18T04:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fGivn6WvVtIOALfLzfTyd0+y+fdC3QY81C9ZhFlD6yWs3BR8LumHZfOcjtRq2IHvK50wudkFgbQ25l1NBuMNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:53:26.603788Z"},"content_sha256":"14cf8c7c9d7944f1dec428bf4522b3f67580fe77a47fa2b9cd24db32105db096","schema_version":"1.0","event_id":"sha256:14cf8c7c9d7944f1dec428bf4522b3f67580fe77a47fa2b9cd24db32105db096"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FO54YHG2SXIZ7KYECGNISAHCX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Closeness of Discrete Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Lance Fortnow, Patrick White, Ronitt Rubinfeld, Tugkan Batu, Warren D. Smith","submitted_at":"2010-09-27T20:57:00Z","abstract_excerpt":"Given samples from two distributions over an $n$-element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in $n$, specifically, $O(n^{2/3}\\epsilon^{-8/3}\\log n)$, independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small (less than $\\max\\{\\epsilon^{4/3}n^{-1/3}/32, \\epsilon n^{-1/2}/4\\}$) or large (more than $\\epsilon$) in $\\ell_1$ distance. This result can "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5397","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-18T04:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2WJUF3+QItodLvbPKeGTO4m5OTLc0zdl0/fs+t0AZx8zkAFcnpobqkGhNhUw2F/7S64G/tzeog85vxoSWkT5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:53:26.604369Z"},"content_sha256":"214a60d7c8a5ee598c19ac5d09474bd2c19b55a69ae263ae3bdf669cc1aae0ed","schema_version":"1.0","event_id":"sha256:214a60d7c8a5ee598c19ac5d09474bd2c19b55a69ae263ae3bdf669cc1aae0ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO54YHG2SXIZ7KYECGNISAHCX3/bundle.json","state_url":"https://pith.science/pith/FO54YHG2SXIZ7KYECGNISAHCX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO54YHG2SXIZ7KYECGNISAHCX3/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-27T05:53:26Z","links":{"resolver":"https://pith.science/pith/FO54YHG2SXIZ7KYECGNISAHCX3","bundle":"https://pith.science/pith/FO54YHG2SXIZ7KYECGNISAHCX3/bundle.json","state":"https://pith.science/pith/FO54YHG2SXIZ7KYECGNISAHCX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO54YHG2SXIZ7KYECGNISAHCX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FO54YHG2SXIZ7KYECGNISAHCX3","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":"634cce162c208397df68f900daf30548a19263dd53a5793eea568825a7585148","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T20:57:00Z","title_canon_sha256":"143e2f67a152a55c84b1bd06d6342cba7ac87608a59d9f11ed701009b371ffd9"},"schema_version":"1.0","source":{"id":"1009.5397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.5397","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"1009.5397v2","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5397","created_at":"2026-05-18T04:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"FO54YHG2SXIZ","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FO54YHG2SXIZ7KYE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FO54YHG2","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:214a60d7c8a5ee598c19ac5d09474bd2c19b55a69ae263ae3bdf669cc1aae0ed","target":"graph","created_at":"2026-05-18T04:37:09Z","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":"Given samples from two distributions over an $n$-element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in $n$, specifically, $O(n^{2/3}\\epsilon^{-8/3}\\log n)$, independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small (less than $\\max\\{\\epsilon^{4/3}n^{-1/3}/32, \\epsilon n^{-1/2}/4\\}$) or large (more than $\\epsilon$) in $\\ell_1$ distance. This result can ","authors_text":"Lance Fortnow, Patrick White, Ronitt Rubinfeld, Tugkan Batu, Warren D. Smith","cross_cats":["math.PR","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T20:57:00Z","title":"Testing Closeness of Discrete Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5397","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:14cf8c7c9d7944f1dec428bf4522b3f67580fe77a47fa2b9cd24db32105db096","target":"record","created_at":"2026-05-18T04:37:09Z","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":"634cce162c208397df68f900daf30548a19263dd53a5793eea568825a7585148","cross_cats_sorted":["math.PR","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T20:57:00Z","title_canon_sha256":"143e2f67a152a55c84b1bd06d6342cba7ac87608a59d9f11ed701009b371ffd9"},"schema_version":"1.0","source":{"id":"1009.5397","kind":"arxiv","version":2}},"canonical_sha256":"2bbbcc1cda95d19fab04119a8900e2beee5a6518a6ac8cf04d3aa570c6881a77","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bbbcc1cda95d19fab04119a8900e2beee5a6518a6ac8cf04d3aa570c6881a77","first_computed_at":"2026-05-18T04:37:09.976536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:37:09.976536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dUS4eC938Id0mN/LbmtvseMrF4kqgpYJi//8cGNZhXW3zQK/heShhD8ZiAKBX/0bj5jk9sEgexILB/VrisGZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:37:09.977393Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.5397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14cf8c7c9d7944f1dec428bf4522b3f67580fe77a47fa2b9cd24db32105db096","sha256:214a60d7c8a5ee598c19ac5d09474bd2c19b55a69ae263ae3bdf669cc1aae0ed"],"state_sha256":"42914a2765c353155b37d269a79d91763de07d16f6324a91919a6a346bfb80d8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Umzw6JrBJgXfYXvpqQY0S5OIwCfElR20f/cAed01tR0jd73zvO1Vv4B/AcyTuxaBk1lzMM+7vsLnk0AVtfVyBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:53:26.607501Z","bundle_sha256":"95740e2ccab648bf9522046bdbccdcd14cd417c7435a1ba25ed25d44f5d5843c"}}