{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NCWPUNVKMMRNSJCNIOPAKOHD24","short_pith_number":"pith:NCWPUNVK","schema_version":"1.0","canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","source":{"kind":"arxiv","id":"1608.03118","version":2},"attestation_state":"computed","paper":{"title":"The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan","submitted_at":"2016-08-10T10:40:22Z","abstract_excerpt":"Estimating the size of the maximum matching is a canonical problem in graph algorithms, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs.\n  * Insert-Only Streams: We present a one-pass algorithm that takes O(c log^2 n) space and approximates the size of the maximum matching in graphs with arboricity c within a factor of O(c). This improves significantly on the state-of-the-art O~(cn^{2/3})-space streaming algorithms.\n  * Dynam"},"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":"1608.03118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T10:40:22Z","cross_cats_sorted":[],"title_canon_sha256":"54b1823a77228daa11a14fb102745ba73188f2c668aa2009a569a03f3970fa6f","abstract_canon_sha256":"9f9c07ad029353f545677fad37fc5dfecbb21c700e796e9a83adeba7bf326d5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:19.850276Z","signature_b64":"R/LALMnUrGBfSimtATg9WGYTtPO6i9xi36dxb+1W4t/RZ9PutTNdv2ttREzHGP4tSjrlAHgP9Di/HrLgV1tfBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","last_reissued_at":"2026-05-18T00:59:19.849560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:19.849560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan","submitted_at":"2016-08-10T10:40:22Z","abstract_excerpt":"Estimating the size of the maximum matching is a canonical problem in graph algorithms, and one that has attracted extensive study over a range of different computational models. We present improved streaming algorithms for approximating the size of maximum matching with sparse (bounded arboricity) graphs.\n  * Insert-Only Streams: We present a one-pass algorithm that takes O(c log^2 n) space and approximates the size of the maximum matching in graphs with arboricity c within a factor of O(c). This improves significantly on the state-of-the-art O~(cn^{2/3})-space streaming algorithms.\n  * Dynam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03118","kind":"arxiv","version":2},"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":"1608.03118","created_at":"2026-05-18T00:59:19.849682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.03118v2","created_at":"2026-05-18T00:59:19.849682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03118","created_at":"2026-05-18T00:59:19.849682+00:00"},{"alias_kind":"pith_short_12","alias_value":"NCWPUNVKMMRN","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NCWPUNVKMMRNSJCN","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NCWPUNVK","created_at":"2026-05-18T12:30:32.724797+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/NCWPUNVKMMRNSJCNIOPAKOHD24","json":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24.json","graph_json":"https://pith.science/api/pith-number/NCWPUNVKMMRNSJCNIOPAKOHD24/graph.json","events_json":"https://pith.science/api/pith-number/NCWPUNVKMMRNSJCNIOPAKOHD24/events.json","paper":"https://pith.science/paper/NCWPUNVK"},"agent_actions":{"view_html":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24","download_json":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24.json","view_paper":"https://pith.science/paper/NCWPUNVK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.03118&json=true","fetch_graph":"https://pith.science/api/pith-number/NCWPUNVKMMRNSJCNIOPAKOHD24/graph.json","fetch_events":"https://pith.science/api/pith-number/NCWPUNVKMMRNSJCNIOPAKOHD24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/action/storage_attestation","attest_author":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/action/author_attestation","sign_citation":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/action/citation_signature","submit_replication":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/action/replication_record"}},"created_at":"2026-05-18T00:59:19.849682+00:00","updated_at":"2026-05-18T00:59:19.849682+00:00"}