{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YWPAA5J73GA2RL7ETWDGEHQHZR","short_pith_number":"pith:YWPAA5J7","canonical_record":{"source":{"id":"1703.01913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-06T15:03:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"dd44cee9d414ca7d85d7f5f7121bd36c73be73e54fb5ec482bb31e51e080736f","abstract_canon_sha256":"0d364ecb03c6a364063ad9e7d55c59fb597635b517ff06bd1318478041a1ad51"},"schema_version":"1.0"},"canonical_sha256":"c59e00753fd981a8afe49d86621e07cc4b98987497328c1ade5d8908be95307c","source":{"kind":"arxiv","id":"1703.01913","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01913","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01913v1","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01913","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"YWPAA5J73GA2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YWPAA5J73GA2RL7E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YWPAA5J7","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YWPAA5J73GA2RL7ETWDGEHQHZR","target":"record","payload":{"canonical_record":{"source":{"id":"1703.01913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-06T15:03:55Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"title_canon_sha256":"dd44cee9d414ca7d85d7f5f7121bd36c73be73e54fb5ec482bb31e51e080736f","abstract_canon_sha256":"0d364ecb03c6a364063ad9e7d55c59fb597635b517ff06bd1318478041a1ad51"},"schema_version":"1.0"},"canonical_sha256":"c59e00753fd981a8afe49d86621e07cc4b98987497328c1ade5d8908be95307c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:29.298143Z","signature_b64":"NXrYX4K5FK8xqpr+1zE44fb4TSXYDwUdFSI93rIWAjzOfqcxulyTJnddy4pgxwmbaGWtwnglonFrmNPZi7UsAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c59e00753fd981a8afe49d86621e07cc4b98987497328c1ade5d8908be95307c","last_reissued_at":"2026-05-18T00:49:29.297400Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:29.297400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.01913","source_version":1,"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-18T00:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zwkBUovFi8H+bcgEF7OUb+FYSlmDFOaJ6L1V/48wnQEix99Z+0ZKn+7YcvfqE4u0pMeOM4c9bfOu6DVg3eVcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:44:24.118646Z"},"content_sha256":"c62a9286dd806b7ab02f232dd1a2967ce6d547c70c448d5710070b4fb9b7380d","schema_version":"1.0","event_id":"sha256:c62a9286dd806b7ab02f232dd1a2967ce6d547c70c448d5710070b4fb9b7380d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YWPAA5J73GA2RL7ETWDGEHQHZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Closeness Testing of Discrete Histogram Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Vladimir Nikishkin","submitted_at":"2017-03-06T15:03:55Z","abstract_excerpt":"We investigate the problem of testing the equivalence between two discrete histograms. A {\\em $k$-histogram} over $[n]$ is a probability distribution that is piecewise constant over some set of $k$ intervals over $[n]$. Histograms have been extensively studied in computer science and statistics. Given a set of samples from two $k$-histogram distributions $p, q$ over $[n]$, we want to distinguish (with high probability) between the cases that $p = q$ and $\\|p-q\\|_1 \\geq \\epsilon$. The main contribution of this paper is a new algorithm for this testing problem and a nearly matching information-t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01913","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":""},"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-18T00:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FjyZ1vBpdotbSOiKdMTRFZMw9jtIR1viPRD2GzTmasYC7Z3qTJXKGlyf/5kjnadHQoO/Pz0z2ULZM05W/hLvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:44:24.119006Z"},"content_sha256":"95ccb8a634e6d011c1d4c7530a3981530ebb956a051552908bd841080a0a4a82","schema_version":"1.0","event_id":"sha256:95ccb8a634e6d011c1d4c7530a3981530ebb956a051552908bd841080a0a4a82"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/bundle.json","state_url":"https://pith.science/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/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-06-05T13:44:24Z","links":{"resolver":"https://pith.science/pith/YWPAA5J73GA2RL7ETWDGEHQHZR","bundle":"https://pith.science/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/bundle.json","state":"https://pith.science/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWPAA5J73GA2RL7ETWDGEHQHZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YWPAA5J73GA2RL7ETWDGEHQHZR","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":"0d364ecb03c6a364063ad9e7d55c59fb597635b517ff06bd1318478041a1ad51","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-06T15:03:55Z","title_canon_sha256":"dd44cee9d414ca7d85d7f5f7121bd36c73be73e54fb5ec482bb31e51e080736f"},"schema_version":"1.0","source":{"id":"1703.01913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01913","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01913v1","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01913","created_at":"2026-05-18T00:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"YWPAA5J73GA2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YWPAA5J73GA2RL7E","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YWPAA5J7","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:95ccb8a634e6d011c1d4c7530a3981530ebb956a051552908bd841080a0a4a82","target":"graph","created_at":"2026-05-18T00:49:29Z","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":"We investigate the problem of testing the equivalence between two discrete histograms. A {\\em $k$-histogram} over $[n]$ is a probability distribution that is piecewise constant over some set of $k$ intervals over $[n]$. Histograms have been extensively studied in computer science and statistics. Given a set of samples from two $k$-histogram distributions $p, q$ over $[n]$, we want to distinguish (with high probability) between the cases that $p = q$ and $\\|p-q\\|_1 \\geq \\epsilon$. The main contribution of this paper is a new algorithm for this testing problem and a nearly matching information-t","authors_text":"Daniel M. Kane, Ilias Diakonikolas, Vladimir Nikishkin","cross_cats":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-06T15:03:55Z","title":"Near-Optimal Closeness Testing of Discrete Histogram Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01913","kind":"arxiv","version":1},"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:c62a9286dd806b7ab02f232dd1a2967ce6d547c70c448d5710070b4fb9b7380d","target":"record","created_at":"2026-05-18T00:49:29Z","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":"0d364ecb03c6a364063ad9e7d55c59fb597635b517ff06bd1318478041a1ad51","cross_cats_sorted":["cs.IT","cs.LG","math.IT","math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-06T15:03:55Z","title_canon_sha256":"dd44cee9d414ca7d85d7f5f7121bd36c73be73e54fb5ec482bb31e51e080736f"},"schema_version":"1.0","source":{"id":"1703.01913","kind":"arxiv","version":1}},"canonical_sha256":"c59e00753fd981a8afe49d86621e07cc4b98987497328c1ade5d8908be95307c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c59e00753fd981a8afe49d86621e07cc4b98987497328c1ade5d8908be95307c","first_computed_at":"2026-05-18T00:49:29.297400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:29.297400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXrYX4K5FK8xqpr+1zE44fb4TSXYDwUdFSI93rIWAjzOfqcxulyTJnddy4pgxwmbaGWtwnglonFrmNPZi7UsAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:29.298143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62a9286dd806b7ab02f232dd1a2967ce6d547c70c448d5710070b4fb9b7380d","sha256:95ccb8a634e6d011c1d4c7530a3981530ebb956a051552908bd841080a0a4a82"],"state_sha256":"12185dcca9f59a7874fe0cae39648091bbb49b62ba776b7be20c5c932676e99c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nrxgL8wFSrT9pVPDM0+00IIRufkAC7nUTrAfHqcjWEDNSjD4xb9IiYzX9ddU5b4F94lfS0Y7+sl+7ht2R8VOCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:44:24.120974Z","bundle_sha256":"7adcbc678ff8c36078d90a13603712aef632eb12ed4db86d2c31d1dbcb22e3b1"}}