{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZEVYBYXMYHYL6PXK2PAFVZAUI3","short_pith_number":"pith:ZEVYBYXM","schema_version":"1.0","canonical_sha256":"c92b80e2ecc1f0bf3eead3c05ae41446cd59ca469936385232488289108dca89","source":{"kind":"arxiv","id":"2606.24845","version":1},"attestation_state":"computed","paper":{"title":"A Near-Optimal Parallel Algorithm for Finding Matroid Bases","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aaron Putterman, Junkai Song, Sanjeev Khanna","submitted_at":"2026-06-23T17:24:37Z","abstract_excerpt":"We settle the classic question of the parallel complexity of computing a matroid basis, as first posed in the seminal work of Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988). Our algorithm runs in $O(n^{1/3}\\log^{1/3}n)$ rounds, matching the lower bound of KUW up to a $\\log^{2/3}(n)$ factor."},"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":"2606.24845","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-23T17:24:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"914cd935abb951ef00b98462686ee5610592530d5d4a3e3de63a7352b9e29624","abstract_canon_sha256":"b7a8049d2b195acc8b8f7d6fc3d56297d19789e662b52af8a6c980e03727ce1d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:43.738336Z","signature_b64":"Pwu42bVYm9dGE8DYdVeQjJHHxgNw9pU3y4u8TVMHqmFt7OzVh2Sp2fMqcu3LNSmfgdyQ25R7H41iKmAWHWk0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c92b80e2ecc1f0bf3eead3c05ae41446cd59ca469936385232488289108dca89","last_reissued_at":"2026-06-24T01:15:43.737918Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:43.737918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Near-Optimal Parallel Algorithm for Finding Matroid Bases","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Aaron Putterman, Junkai Song, Sanjeev Khanna","submitted_at":"2026-06-23T17:24:37Z","abstract_excerpt":"We settle the classic question of the parallel complexity of computing a matroid basis, as first posed in the seminal work of Karp, Upfal, and Wigderson (FOCS 1985, JCSS 1988). Our algorithm runs in $O(n^{1/3}\\log^{1/3}n)$ rounds, matching the lower bound of KUW up to a $\\log^{2/3}(n)$ factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.24845","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/2606.24845/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":"2606.24845","created_at":"2026-06-24T01:15:43.737981+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.24845v1","created_at":"2026-06-24T01:15:43.737981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.24845","created_at":"2026-06-24T01:15:43.737981+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZEVYBYXMYHYL","created_at":"2026-06-24T01:15:43.737981+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZEVYBYXMYHYL6PXK","created_at":"2026-06-24T01:15:43.737981+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZEVYBYXM","created_at":"2026-06-24T01:15:43.737981+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/ZEVYBYXMYHYL6PXK2PAFVZAUI3","json":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3.json","graph_json":"https://pith.science/api/pith-number/ZEVYBYXMYHYL6PXK2PAFVZAUI3/graph.json","events_json":"https://pith.science/api/pith-number/ZEVYBYXMYHYL6PXK2PAFVZAUI3/events.json","paper":"https://pith.science/paper/ZEVYBYXM"},"agent_actions":{"view_html":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3","download_json":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3.json","view_paper":"https://pith.science/paper/ZEVYBYXM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.24845&json=true","fetch_graph":"https://pith.science/api/pith-number/ZEVYBYXMYHYL6PXK2PAFVZAUI3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZEVYBYXMYHYL6PXK2PAFVZAUI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3/action/storage_attestation","attest_author":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3/action/author_attestation","sign_citation":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3/action/citation_signature","submit_replication":"https://pith.science/pith/ZEVYBYXMYHYL6PXK2PAFVZAUI3/action/replication_record"}},"created_at":"2026-06-24T01:15:43.737981+00:00","updated_at":"2026-06-24T01:15:43.737981+00:00"}