{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NCWPUNVKMMRNSJCNIOPAKOHD24","short_pith_number":"pith:NCWPUNVK","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"},"canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","source":{"kind":"arxiv","id":"1608.03118","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03118","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03118v2","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03118","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"NCWPUNVKMMRN","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCWPUNVKMMRNSJCN","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCWPUNVK","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NCWPUNVKMMRNSJCNIOPAKOHD24","target":"record","payload":{"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"},"canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","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"},"source_kind":"arxiv","source_id":"1608.03118","source_version":2,"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-18T00:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7nazDrfn5xhd5o8zBLtfWhKIKNU8TCAMnvFZVM1NhiMMQFvl044mmc4C0J3HTjVjCMIpazZLtyQ3I95GIJMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:40:56.737083Z"},"content_sha256":"7a8ef0019b9fb9c57f3bcf9c7f21388cf1b559ea5f146f46b6511258fff9744f","schema_version":"1.0","event_id":"sha256:7a8ef0019b9fb9c57f3bcf9c7f21388cf1b559ea5f146f46b6511258fff9744f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NCWPUNVKMMRNSJCNIOPAKOHD24","target":"graph","payload":{"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"},"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-18T00:59:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gc6gKZJKyrkxEIWT6TL7R2vzxwmXswyMvkJ0Wb4TdneOdWFYeCtFpb/9RObIObfdO6vmYS6Q8qH0/ylgt7wpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:40:56.737473Z"},"content_sha256":"0898c15f01c2c1a66cf1cbf2d63ef0bc68a3b6960c9aee80061bdb712929241a","schema_version":"1.0","event_id":"sha256:0898c15f01c2c1a66cf1cbf2d63ef0bc68a3b6960c9aee80061bdb712929241a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/bundle.json","state_url":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/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-27T10:40:56Z","links":{"resolver":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24","bundle":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/bundle.json","state":"https://pith.science/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NCWPUNVKMMRNSJCNIOPAKOHD24/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NCWPUNVKMMRNSJCNIOPAKOHD24","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":"9f9c07ad029353f545677fad37fc5dfecbb21c700e796e9a83adeba7bf326d5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T10:40:22Z","title_canon_sha256":"54b1823a77228daa11a14fb102745ba73188f2c668aa2009a569a03f3970fa6f"},"schema_version":"1.0","source":{"id":"1608.03118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.03118","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"arxiv_version","alias_value":"1608.03118v2","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.03118","created_at":"2026-05-18T00:59:19Z"},{"alias_kind":"pith_short_12","alias_value":"NCWPUNVKMMRN","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NCWPUNVKMMRNSJCN","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NCWPUNVK","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:0898c15f01c2c1a66cf1cbf2d63ef0bc68a3b6960c9aee80061bdb712929241a","target":"graph","created_at":"2026-05-18T00:59:19Z","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":"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","authors_text":"Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, S. Muthukrishnan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T10:40:22Z","title":"The Sparse Awakens: Streaming Algorithms for Matching Size Estimation in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.03118","kind":"arxiv","version":2},"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:7a8ef0019b9fb9c57f3bcf9c7f21388cf1b559ea5f146f46b6511258fff9744f","target":"record","created_at":"2026-05-18T00:59:19Z","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":"9f9c07ad029353f545677fad37fc5dfecbb21c700e796e9a83adeba7bf326d5e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-10T10:40:22Z","title_canon_sha256":"54b1823a77228daa11a14fb102745ba73188f2c668aa2009a569a03f3970fa6f"},"schema_version":"1.0","source":{"id":"1608.03118","kind":"arxiv","version":2}},"canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68acfa36aa6322d9244d439e0538e3d737bc798724d07b3d0b1ca9caad376349","first_computed_at":"2026-05-18T00:59:19.849560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:19.849560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R/LALMnUrGBfSimtATg9WGYTtPO6i9xi36dxb+1W4t/RZ9PutTNdv2ttREzHGP4tSjrlAHgP9Di/HrLgV1tfBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:19.850276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.03118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a8ef0019b9fb9c57f3bcf9c7f21388cf1b559ea5f146f46b6511258fff9744f","sha256:0898c15f01c2c1a66cf1cbf2d63ef0bc68a3b6960c9aee80061bdb712929241a"],"state_sha256":"cc3a9b669af3ff8dd80926b8946f3bc56886e11a8833525b36b1d97f61dd2f44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3de8oN3gYC0kXGDAzyt6MIFbHgUVWMWUupKw81aLVhF+ZQwoR4FE87fp/DD6ZKJRcnRvLnsSNysJLzwVcV0kDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:40:56.740079Z","bundle_sha256":"7585d6240ee847a27e9ac92696c96825899d108efe79e5740aa62734e2fd6d62"}}