{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LTGPXKGNSMDLNSNOLWVPVYIGXQ","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":"b921a87e5e2640bdf2ef01cbc6d29a9e954904e3fe41aaf0deaa61bb4bff8847","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-08T07:27:29Z","title_canon_sha256":"a93552b56cf63e8eaca49b17af87f1449d8fbb2b43ecef32cbabd97e002cacf6"},"schema_version":"1.0","source":{"id":"2505.05009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.05009","created_at":"2026-07-05T11:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"2505.05009v1","created_at":"2026-07-05T11:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05009","created_at":"2026-07-05T11:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"LTGPXKGNSMDL","created_at":"2026-07-05T11:25:10Z"},{"alias_kind":"pith_short_16","alias_value":"LTGPXKGNSMDLNSNO","created_at":"2026-07-05T11:25:10Z"},{"alias_kind":"pith_short_8","alias_value":"LTGPXKGN","created_at":"2026-07-05T11:25:10Z"}],"graph_snapshots":[{"event_id":"sha256:e129e97d3d49fba4bd0aa1983d33f833313afdcd0255c22749c4ea2cb3c29c99","target":"graph","created_at":"2026-07-05T11:25:10Z","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/2505.05009/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the basic problem of learning an unknown partition of $n$ elements into at most $k$ sets using simple queries that reveal information about a small subset of elements. Our starting point is the well-studied pairwise same-set queries which ask if a pair of elements belong to the same class. It is known that non-adaptive algorithms require $\\Theta(n^2)$ queries, while adaptive algorithms require $\\Theta(nk)$ queries, and the best known algorithm uses $k-1$ rounds. This problem has been studied extensively over the last two decades in multiple communities due to its fundamental nature","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-08T07:27:29Z","title":"Learning Partitions with Optimal Query and Round Complexities"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05009","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:c593203116424da98f6ea129a6eba181e1c816b952b765ddb28db6539d81e86d","target":"record","created_at":"2026-07-05T11:25:10Z","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":"b921a87e5e2640bdf2ef01cbc6d29a9e954904e3fe41aaf0deaa61bb4bff8847","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-08T07:27:29Z","title_canon_sha256":"a93552b56cf63e8eaca49b17af87f1449d8fbb2b43ecef32cbabd97e002cacf6"},"schema_version":"1.0","source":{"id":"2505.05009","kind":"arxiv","version":1}},"canonical_sha256":"5cccfba8cd9306b6c9ae5daafae106bc310b37a813945d867b5248d6b94fc1fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cccfba8cd9306b6c9ae5daafae106bc310b37a813945d867b5248d6b94fc1fb","first_computed_at":"2026-07-05T11:25:10.263715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:25:10.263715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bICM2R3RahhFfGC0h/GQ4HrY5Vca/7s44+oZaBiS9CSOgHaxshMdUkVWZLOBlhKuxsuevLaBv1lxRWAoxJprCA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:25:10.264183Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.05009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c593203116424da98f6ea129a6eba181e1c816b952b765ddb28db6539d81e86d","sha256:e129e97d3d49fba4bd0aa1983d33f833313afdcd0255c22749c4ea2cb3c29c99"],"state_sha256":"b9efea819d01946101676cf901d009b3ed689868a2b0f648b204fe7a83677095"}