{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LPZM5MMK5DXVQRRLCWUHAOYAPK","short_pith_number":"pith:LPZM5MMK","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"},"canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","source":{"kind":"arxiv","id":"1907.05725","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05725","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05725v1","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05725","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"LPZM5MMK5DXV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LPZM5MMK5DXVQRRL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LPZM5MMK","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LPZM5MMK5DXVQRRLCWUHAOYAPK","target":"record","payload":{"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"},"canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","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"},"source_kind":"arxiv","source_id":"1907.05725","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sv43p3ZgAGu74O3WyceSm9L/slGeaaz4/dQmgzMDlE+OyqczDPFtMAmJff001IhHkJQO3UECa43DylWyfKgIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:30:17.617106Z"},"content_sha256":"4c364af6b707f79a771c6461acae596ab38df56768c0d464ad6d8b03394e1d4f","schema_version":"1.0","event_id":"sha256:4c364af6b707f79a771c6461acae596ab38df56768c0d464ad6d8b03394e1d4f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LPZM5MMK5DXVQRRLCWUHAOYAPK","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:40:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"62HLVF88Wb4sZtTSOhQZf1oV9jf6ifpCqzOUKfvVPX34qNmembXynII6FHqq/e4JGJTHRdg53TyeTrqaScYcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:30:17.617829Z"},"content_sha256":"39d09daf3c5e86f21c37912d81662b2f6e29b2ee8cc521670b43152cb257b2de","schema_version":"1.0","event_id":"sha256:39d09daf3c5e86f21c37912d81662b2f6e29b2ee8cc521670b43152cb257b2de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/bundle.json","state_url":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T03:30:17Z","links":{"resolver":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK","bundle":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/bundle.json","state":"https://pith.science/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPZM5MMK5DXVQRRLCWUHAOYAPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LPZM5MMK5DXVQRRLCWUHAOYAPK","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":"ad8874762b66bb53a536caaae87c58610af7511876413cddaf27e28fd6cc0abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T13:12:45Z","title_canon_sha256":"781190c9591a5371e6b706ca2adff119b75b8fbfd548166f4b7b1275b496c939"},"schema_version":"1.0","source":{"id":"1907.05725","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05725","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05725v1","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05725","created_at":"2026-05-17T23:40:44Z"},{"alias_kind":"pith_short_12","alias_value":"LPZM5MMK5DXV","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LPZM5MMK5DXVQRRL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LPZM5MMK","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:39d09daf3c5e86f21c37912d81662b2f6e29b2ee8cc521670b43152cb257b2de","target":"graph","created_at":"2026-05-17T23:40:44Z","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"},"paper":{"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","authors_text":"Ashkan Norouzi-Fard, Jakab Tardos, Michael Kapralov, Slobodan Mitrovi\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T13:12:45Z","title":"Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05725","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:4c364af6b707f79a771c6461acae596ab38df56768c0d464ad6d8b03394e1d4f","target":"record","created_at":"2026-05-17T23:40:44Z","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":"ad8874762b66bb53a536caaae87c58610af7511876413cddaf27e28fd6cc0abe","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-12T13:12:45Z","title_canon_sha256":"781190c9591a5371e6b706ca2adff119b75b8fbfd548166f4b7b1275b496c939"},"schema_version":"1.0","source":{"id":"1907.05725","kind":"arxiv","version":1}},"canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bf2ceb18ae8ef58462b15a8703b007a95f5026a04228a49389bea29d29be8db","first_computed_at":"2026-05-17T23:40:44.640016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:44.640016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izOhjbB8YjX0uzb1Heoy11bTAWJ9wQ0c/oQuI0hHZEEPHMuBWz6BbmU74/Kk20aCHigoqaDu3U6DQ5Db3PYwAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:44.640730Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05725","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c364af6b707f79a771c6461acae596ab38df56768c0d464ad6d8b03394e1d4f","sha256:39d09daf3c5e86f21c37912d81662b2f6e29b2ee8cc521670b43152cb257b2de"],"state_sha256":"fd7c336628bc4dbb846be230593e9df6833b682b16dbb4fb24f7224c7bfe5d8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6GCNhHo58RAKjU/6SCP5U8rqNal3NdiLcw5k8mwMq0hYfW6flvFmE2LmO5g/fFKFMT6V06aFyko5A+Kn/kGiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:30:17.621462Z","bundle_sha256":"d21b0c05a8f20a6ce219dffa39e22a1f893f84c955cb12a251910bd0b55f51da"}}