{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LPZM5MMK5DXVQRRLCWUHAOYAPK","short_pith_number":"pith:LPZM5MMK","schema_version":"1.0","canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","source":{"kind":"arxiv","id":"1907.05725","version":1},"attestation_state":"computed","paper":{"title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Jakab Tardos, Michael Kapralov, Slobodan Mitrovi\\'c","submitted_at":"2019-07-12T13:12:45Z","abstract_excerpt":"Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain such an estimate in a small amount of space? We show that, on the one hand, this problem cannot be solved using a nontrivially sublinear (in $m$) number of samples: $m^{1-o(1)}$ samples are needed. On the other hand, a surprisingly space efficient algorithm for processing the samples exists: $O(\\log^2 n)$ bits of space suffice to compute an estimate.\n  Our m"},"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":"1907.05725","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T13:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"781190c9591a5371e6b706ca2adff119b75b8fbfd548166f4b7b1275b496c939","abstract_canon_sha256":"ad8874762b66bb53a536caaae87c58610af7511876413cddaf27e28fd6cc0abe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:44.640730Z","signature_b64":"izOhjbB8YjX0uzb1Heoy11bTAWJ9wQ0c/oQuI0hHZEEPHMuBWz6BbmU74/Kk20aCHigoqaDu3U6DQ5Db3PYwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","last_reissued_at":"2026-05-17T23:40:44.640016Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:44.640016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Jakab Tardos, Michael Kapralov, Slobodan Mitrovi\\'c","submitted_at":"2019-07-12T13:12:45Z","abstract_excerpt":"Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain such an estimate in a small amount of space? We show that, on the one hand, this problem cannot be solved using a nontrivially sublinear (in $m$) number of samples: $m^{1-o(1)}$ samples are needed. On the other hand, a surprisingly space efficient algorithm for processing the samples exists: $O(\\log^2 n)$ bits of space suffice to compute an estimate.\n  Our m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05725","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":""},"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":"1907.05725","created_at":"2026-05-17T23:40:44.640141+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05725v1","created_at":"2026-05-17T23:40:44.640141+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05725","created_at":"2026-05-17T23:40:44.640141+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPZM5MMK5DXV","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPZM5MMK5DXVQRRL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPZM5MMK","created_at":"2026-05-18T12:33:21.387695+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/LPZM5MMK5DXVQRRLCWUHAOYAPK","json":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK.json","graph_json":"https://pith.science/api/pith-number/LPZM5MMK5DXVQRRLCWUHAOYAPK/graph.json","events_json":"https://pith.science/api/pith-number/LPZM5MMK5DXVQRRLCWUHAOYAPK/events.json","paper":"https://pith.science/paper/LPZM5MMK"},"agent_actions":{"view_html":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK","download_json":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK.json","view_paper":"https://pith.science/paper/LPZM5MMK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05725&json=true","fetch_graph":"https://pith.science/api/pith-number/LPZM5MMK5DXVQRRLCWUHAOYAPK/graph.json","fetch_events":"https://pith.science/api/pith-number/LPZM5MMK5DXVQRRLCWUHAOYAPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/action/storage_attestation","attest_author":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/action/author_attestation","sign_citation":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/action/citation_signature","submit_replication":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/action/replication_record"}},"created_at":"2026-05-17T23:40:44.640141+00:00","updated_at":"2026-05-17T23:40:44.640141+00:00"}