{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7KVVID73KVME2JV62NUJM6YNO5","short_pith_number":"pith:7KVVID73","canonical_record":{"source":{"id":"2512.08376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-12-09T09:01:41Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"478b794c6724b9dcbcd61afe48c8058793cb35fd0f1ded6089ce901bac59ba89","abstract_canon_sha256":"fda92aa8ae49543e05b010a53b25084944804218af1c1968bb107a4a06928df4"},"schema_version":"1.0"},"canonical_sha256":"faab540ffb55584d26bed368967b0d774b04638f151f6e652166bfdf0fc8e0a7","source":{"kind":"arxiv","id":"2512.08376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08376","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08376v2","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08376","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"7KVVID73KVME","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"7KVVID73KVME2JV6","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"7KVVID73","created_at":"2026-06-01T01:03:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7KVVID73KVME2JV62NUJM6YNO5","target":"record","payload":{"canonical_record":{"source":{"id":"2512.08376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-12-09T09:01:41Z","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"478b794c6724b9dcbcd61afe48c8058793cb35fd0f1ded6089ce901bac59ba89","abstract_canon_sha256":"fda92aa8ae49543e05b010a53b25084944804218af1c1968bb107a4a06928df4"},"schema_version":"1.0"},"canonical_sha256":"faab540ffb55584d26bed368967b0d774b04638f151f6e652166bfdf0fc8e0a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:03:47.480236Z","signature_b64":"RYN/E1B0SWD/U7PgMlGyyQHpufkciTreJBmv9CzqGJy6pK8p+AjnM8bV7OWcK5MijFTpj1GTBw9lNonBcjMBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faab540ffb55584d26bed368967b0d774b04638f151f6e652166bfdf0fc8e0a7","last_reissued_at":"2026-06-01T01:03:47.479169Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:03:47.479169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2512.08376","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-06-01T01:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jIcCLdeY7A+txNUy6p9oPiU8sumk2bKAxc/TRyEWsl7O8K8T7l66DArBWrHwaVQBvs5XOo6ABII93SxteXqXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:04.182448Z"},"content_sha256":"7763cf8ec03d85d9c54fe79cecdc7d23ba70bbe4b05c515297d6f24578117d2e","schema_version":"1.0","event_id":"sha256:7763cf8ec03d85d9c54fe79cecdc7d23ba70bbe4b05c515297d6f24578117d2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7KVVID73KVME2JV62NUJM6YNO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distribution Testing Approach to Clustering Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.DS","authors_text":"Gunjan Kumar, Jonathan Scarlett, Yash Pote","submitted_at":"2025-12-09T09:01:41Z","abstract_excerpt":"We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters are $\\varepsilon$-far in total variation, the goal is to recover the partition. We establish upper and lower bounds on the sample complexity for two fundamental cases: (1) when one of the cluster's distributions is known, and (2) when both are unknown. Our upper and lower bounds characterize the sample complexity's dependence on the domain size $n$, number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08376","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.08376/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"},"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-06-01T01:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VC4DMgQvIkotD1dI4cKjpSsmLgA4qC7ZtJ0gsNbUDRcfyw6i8frul9bXAX1MaDBUdyP/RHOokuJe5scG45/MCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:50:04.183152Z"},"content_sha256":"df2b539bbeba57cccf0fcb8823ee94b796c2cc0c162d2df3f8c516097428cebe","schema_version":"1.0","event_id":"sha256:df2b539bbeba57cccf0fcb8823ee94b796c2cc0c162d2df3f8c516097428cebe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KVVID73KVME2JV62NUJM6YNO5/bundle.json","state_url":"https://pith.science/pith/7KVVID73KVME2JV62NUJM6YNO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KVVID73KVME2JV62NUJM6YNO5/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-09T07:50:04Z","links":{"resolver":"https://pith.science/pith/7KVVID73KVME2JV62NUJM6YNO5","bundle":"https://pith.science/pith/7KVVID73KVME2JV62NUJM6YNO5/bundle.json","state":"https://pith.science/pith/7KVVID73KVME2JV62NUJM6YNO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KVVID73KVME2JV62NUJM6YNO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7KVVID73KVME2JV62NUJM6YNO5","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":"fda92aa8ae49543e05b010a53b25084944804218af1c1968bb107a4a06928df4","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-12-09T09:01:41Z","title_canon_sha256":"478b794c6724b9dcbcd61afe48c8058793cb35fd0f1ded6089ce901bac59ba89"},"schema_version":"1.0","source":{"id":"2512.08376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.08376","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2512.08376v2","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.08376","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"7KVVID73KVME","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"7KVVID73KVME2JV6","created_at":"2026-06-01T01:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"7KVVID73","created_at":"2026-06-01T01:03:47Z"}],"graph_snapshots":[{"event_id":"sha256:df2b539bbeba57cccf0fcb8823ee94b796c2cc0c162d2df3f8c516097428cebe","target":"graph","created_at":"2026-06-01T01:03:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2512.08376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters are $\\varepsilon$-far in total variation, the goal is to recover the partition. We establish upper and lower bounds on the sample complexity for two fundamental cases: (1) when one of the cluster's distributions is known, and (2) when both are unknown. Our upper and lower bounds characterize the sample complexity's dependence on the domain size $n$, number of ","authors_text":"Gunjan Kumar, Jonathan Scarlett, Yash Pote","cross_cats":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-12-09T09:01:41Z","title":"A Distribution Testing Approach to Clustering Distributions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.08376","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:7763cf8ec03d85d9c54fe79cecdc7d23ba70bbe4b05c515297d6f24578117d2e","target":"record","created_at":"2026-06-01T01:03:47Z","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":"fda92aa8ae49543e05b010a53b25084944804218af1c1968bb107a4a06928df4","cross_cats_sorted":["cs.IT","math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-12-09T09:01:41Z","title_canon_sha256":"478b794c6724b9dcbcd61afe48c8058793cb35fd0f1ded6089ce901bac59ba89"},"schema_version":"1.0","source":{"id":"2512.08376","kind":"arxiv","version":2}},"canonical_sha256":"faab540ffb55584d26bed368967b0d774b04638f151f6e652166bfdf0fc8e0a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faab540ffb55584d26bed368967b0d774b04638f151f6e652166bfdf0fc8e0a7","first_computed_at":"2026-06-01T01:03:47.479169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:47.479169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RYN/E1B0SWD/U7PgMlGyyQHpufkciTreJBmv9CzqGJy6pK8p+AjnM8bV7OWcK5MijFTpj1GTBw9lNonBcjMBDw==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:47.480236Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.08376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7763cf8ec03d85d9c54fe79cecdc7d23ba70bbe4b05c515297d6f24578117d2e","sha256:df2b539bbeba57cccf0fcb8823ee94b796c2cc0c162d2df3f8c516097428cebe"],"state_sha256":"455ff5d5b5697c86b5f702869ff7decb4b65ac60de678439abc7714e30717cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Edg02rkIdYPllawx69qb/sSEbOhanc5wOOU1/YrE3xXLbG/sg/SOoD+/9cH3z7z7d+84ehc99es0Lb0IaCcPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:50:04.187151Z","bundle_sha256":"f639d098f5fc00dd825f4dcc0b40dcd7027c0ea69218ee2cc86f9e5a0483bdce"}}