{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LTGPXKGNSMDLNSNOLWVPVYIGXQ","short_pith_number":"pith:LTGPXKGN","schema_version":"1.0","canonical_sha256":"5cccfba8cd9306b6c9ae5daafae106bc310b37a813945d867b5248d6b94fc1fb","source":{"kind":"arxiv","id":"2505.05009","version":1},"attestation_state":"computed","paper":{"title":"Learning Partitions with Optimal Query and Round Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black","submitted_at":"2025-05-08T07:27:29Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.05009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-05-08T07:27:29Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"a93552b56cf63e8eaca49b17af87f1449d8fbb2b43ecef32cbabd97e002cacf6","abstract_canon_sha256":"b921a87e5e2640bdf2ef01cbc6d29a9e954904e3fe41aaf0deaa61bb4bff8847"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:10.264183Z","signature_b64":"bICM2R3RahhFfGC0h/GQ4HrY5Vca/7s44+oZaBiS9CSOgHaxshMdUkVWZLOBlhKuxsuevLaBv1lxRWAoxJprCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cccfba8cd9306b6c9ae5daafae106bc310b37a813945d867b5248d6b94fc1fb","last_reissued_at":"2026-07-05T11:25:10.263715Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:10.263715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Partitions with Optimal Query and Round Complexities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.DS","authors_text":"Arya Mazumdar, Barna Saha, Hadley Black","submitted_at":"2025-05-08T07:27:29Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.05009","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.05009/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.05009","created_at":"2026-07-05T11:25:10.263773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.05009v1","created_at":"2026-07-05T11:25:10.263773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.05009","created_at":"2026-07-05T11:25:10.263773+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTGPXKGNSMDL","created_at":"2026-07-05T11:25:10.263773+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTGPXKGNSMDLNSNO","created_at":"2026-07-05T11:25:10.263773+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTGPXKGN","created_at":"2026-07-05T11:25:10.263773+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ","json":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ.json","graph_json":"https://pith.science/api/pith-number/LTGPXKGNSMDLNSNOLWVPVYIGXQ/graph.json","events_json":"https://pith.science/api/pith-number/LTGPXKGNSMDLNSNOLWVPVYIGXQ/events.json","paper":"https://pith.science/paper/LTGPXKGN"},"agent_actions":{"view_html":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ","download_json":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ.json","view_paper":"https://pith.science/paper/LTGPXKGN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.05009&json=true","fetch_graph":"https://pith.science/api/pith-number/LTGPXKGNSMDLNSNOLWVPVYIGXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/LTGPXKGNSMDLNSNOLWVPVYIGXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ/action/storage_attestation","attest_author":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ/action/author_attestation","sign_citation":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ/action/citation_signature","submit_replication":"https://pith.science/pith/LTGPXKGNSMDLNSNOLWVPVYIGXQ/action/replication_record"}},"created_at":"2026-07-05T11:25:10.263773+00:00","updated_at":"2026-07-05T11:25:10.263773+00:00"}