{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QECKB3LXWQBJTSCMPBRIY6BEQP","short_pith_number":"pith:QECKB3LX","schema_version":"1.0","canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","source":{"kind":"arxiv","id":"2506.01669","version":1},"attestation_state":"computed","paper":{"title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Tarnawski, Mohammad Roghani, Sepideh Mahabadi","submitted_at":"2025-06-02T13:38:55Z","abstract_excerpt":"We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it. Our result is a $0.5109$-approximation algorithm with a running time of $\\tilde{O}(n\\sqrt{n})$.\n  All previous algorithms either provide only a marginal improvement (e.g., $2^{-280}$) over the $0.5$-approximation that arises from estimating a \\emph{maximal} matching, or have a running time that is nearly $n^2$. Our approach is also arguably much simpler than other algorithms beating $0.5$-approx"},"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":"2506.01669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T13:38:55Z","cross_cats_sorted":[],"title_canon_sha256":"3b439e98b3a4365ed9fc5695085f98c8c4ef94452bcced670780f61bb0cc4a04","abstract_canon_sha256":"71fe30974f4447d5decb3ebcfc465f51e9b01b74aad6638aa7e58b1088b28124"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:17.520923Z","signature_b64":"Uhks0WM096u63RVras1rQrqoDssNRLytF8+JeiGTYDkpXj8lWHM7vtOcklzDQzVGdFh8lrdjYlNgr1la2Tk+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8104a0ed77b40299c84c78628c782483eb60efec5a1b8fd175e1ad6df7bd6316","last_reissued_at":"2026-07-05T11:14:17.520472Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:17.520472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A 0.51-Approximation of Maximum Matching in Sublinear $n^{1.5}$ Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jakub Tarnawski, Mohammad Roghani, Sepideh Mahabadi","submitted_at":"2025-06-02T13:38:55Z","abstract_excerpt":"We study the problem of estimating the size of a maximum matching in sublinear time. The problem has been studied extensively in the literature and various algorithms and lower bounds are known for it. Our result is a $0.5109$-approximation algorithm with a running time of $\\tilde{O}(n\\sqrt{n})$.\n  All previous algorithms either provide only a marginal improvement (e.g., $2^{-280}$) over the $0.5$-approximation that arises from estimating a \\emph{maximal} matching, or have a running time that is nearly $n^2$. Our approach is also arguably much simpler than other algorithms beating $0.5$-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01669","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/2506.01669/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":"2506.01669","created_at":"2026-07-05T11:14:17.520539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01669v1","created_at":"2026-07-05T11:14:17.520539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01669","created_at":"2026-07-05T11:14:17.520539+00:00"},{"alias_kind":"pith_short_12","alias_value":"QECKB3LXWQBJ","created_at":"2026-07-05T11:14:17.520539+00:00"},{"alias_kind":"pith_short_16","alias_value":"QECKB3LXWQBJTSCM","created_at":"2026-07-05T11:14:17.520539+00:00"},{"alias_kind":"pith_short_8","alias_value":"QECKB3LX","created_at":"2026-07-05T11:14:17.520539+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/QECKB3LXWQBJTSCMPBRIY6BEQP","json":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP.json","graph_json":"https://pith.science/api/pith-number/QECKB3LXWQBJTSCMPBRIY6BEQP/graph.json","events_json":"https://pith.science/api/pith-number/QECKB3LXWQBJTSCMPBRIY6BEQP/events.json","paper":"https://pith.science/paper/QECKB3LX"},"agent_actions":{"view_html":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP","download_json":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP.json","view_paper":"https://pith.science/paper/QECKB3LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01669&json=true","fetch_graph":"https://pith.science/api/pith-number/QECKB3LXWQBJTSCMPBRIY6BEQP/graph.json","fetch_events":"https://pith.science/api/pith-number/QECKB3LXWQBJTSCMPBRIY6BEQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/action/storage_attestation","attest_author":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/action/author_attestation","sign_citation":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/action/citation_signature","submit_replication":"https://pith.science/pith/QECKB3LXWQBJTSCMPBRIY6BEQP/action/replication_record"}},"created_at":"2026-07-05T11:14:17.520539+00:00","updated_at":"2026-07-05T11:14:17.520539+00:00"}