{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:RXRCVGO3CUEJAUHOMRTHEDOPM7","short_pith_number":"pith:RXRCVGO3","canonical_record":{"source":{"id":"1612.02531","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T05:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"85123e95ae2cf7553ad36c023ee5e869ee58960ca5003aae9f4e528ad21db70a","abstract_canon_sha256":"605d30c2d44e2f20b4d8e4287071710c4dbd37ef92952fa4720577845275f6de"},"schema_version":"1.0"},"canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","source":{"kind":"arxiv","id":"1612.02531","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02531","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02531v3","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02531","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"RXRCVGO3CUEJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXRCVGO3CUEJAUHO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXRCVGO3","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:RXRCVGO3CUEJAUHOMRTHEDOPM7","target":"record","payload":{"canonical_record":{"source":{"id":"1612.02531","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T05:15:07Z","cross_cats_sorted":[],"title_canon_sha256":"85123e95ae2cf7553ad36c023ee5e869ee58960ca5003aae9f4e528ad21db70a","abstract_canon_sha256":"605d30c2d44e2f20b4d8e4287071710c4dbd37ef92952fa4720577845275f6de"},"schema_version":"1.0"},"canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:09.109693Z","signature_b64":"GQaSFBy+9MsQuu3x28b7bCYifpj1D1JvfgHjlIMdKYnDDaW3PGWzv03JleyOFxqJlQLD3Lwq9BYBVN7yJ97gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","last_reissued_at":"2026-05-18T00:38:09.109017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:09.109017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.02531","source_version":3,"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:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H0shMRpr9kjPbIsz6Co04+wXE4wrB18WgEnSHriYYg6xW4AsvDUHH50wvmxHiLtCfuZSQGzm7W6E+HZxJxAzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:45:23.802366Z"},"content_sha256":"e5dfd7e9b3dfed835fc07fcdef513760d9effd805ba97900a9d202fb61be511f","schema_version":"1.0","event_id":"sha256:e5dfd7e9b3dfed835fc07fcdef513760d9effd805ba97900a9d202fb61be511f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:RXRCVGO3CUEJAUHOMRTHEDOPM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, Sofya Vorotnikova","submitted_at":"2016-12-08T05:15:07Z","abstract_excerpt":"We present a data stream algorithm for estimating the size of the maximum matching of a low arboricity graph. Recall that a graph has arboricity $\\alpha$ if its edges can be partitioned into at most $\\alpha$ forests and that a planar graph has arboricity $\\alpha=3$. Estimating the size of the maximum matching in such graphs has been a focus of recent data stream research.\n  A surprising result on this problem was recently proved by Cormode et al. They designed an ingenious algorithm that returned a $(22.5\\alpha+6)(1+\\epsilon)$ approximation using a single pass over the edges of the graph (orde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02531","kind":"arxiv","version":3},"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:38:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mv+qKWebuEpLoUFKERZJteRfvWmsLjg2qigQbjSza2N7vWAMM18Vpvrff7gLM0UZGA6F23kyQAzDsFXNErgQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:45:23.803078Z"},"content_sha256":"fedbd158765ff4caa2a69f6e527440a2f0ea6e1a8c82914c914e51766da9901c","schema_version":"1.0","event_id":"sha256:fedbd158765ff4caa2a69f6e527440a2f0ea6e1a8c82914c914e51766da9901c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/bundle.json","state_url":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/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-06-11T01:45:23Z","links":{"resolver":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7","bundle":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/bundle.json","state":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RXRCVGO3CUEJAUHOMRTHEDOPM7","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":"605d30c2d44e2f20b4d8e4287071710c4dbd37ef92952fa4720577845275f6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T05:15:07Z","title_canon_sha256":"85123e95ae2cf7553ad36c023ee5e869ee58960ca5003aae9f4e528ad21db70a"},"schema_version":"1.0","source":{"id":"1612.02531","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.02531","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"arxiv_version","alias_value":"1612.02531v3","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02531","created_at":"2026-05-18T00:38:09Z"},{"alias_kind":"pith_short_12","alias_value":"RXRCVGO3CUEJ","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RXRCVGO3CUEJAUHO","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RXRCVGO3","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:fedbd158765ff4caa2a69f6e527440a2f0ea6e1a8c82914c914e51766da9901c","target":"graph","created_at":"2026-05-18T00:38:09Z","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":"We present a data stream algorithm for estimating the size of the maximum matching of a low arboricity graph. Recall that a graph has arboricity $\\alpha$ if its edges can be partitioned into at most $\\alpha$ forests and that a planar graph has arboricity $\\alpha=3$. Estimating the size of the maximum matching in such graphs has been a focus of recent data stream research.\n  A surprising result on this problem was recently proved by Cormode et al. They designed an ingenious algorithm that returned a $(22.5\\alpha+6)(1+\\epsilon)$ approximation using a single pass over the edges of the graph (orde","authors_text":"Andrew McGregor, Sofya Vorotnikova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T05:15:07Z","title":"A Note on Logarithmic Space Stream Algorithms for Matchings in Low Arboricity Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02531","kind":"arxiv","version":3},"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:e5dfd7e9b3dfed835fc07fcdef513760d9effd805ba97900a9d202fb61be511f","target":"record","created_at":"2026-05-18T00:38:09Z","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":"605d30c2d44e2f20b4d8e4287071710c4dbd37ef92952fa4720577845275f6de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-08T05:15:07Z","title_canon_sha256":"85123e95ae2cf7553ad36c023ee5e869ee58960ca5003aae9f4e528ad21db70a"},"schema_version":"1.0","source":{"id":"1612.02531","kind":"arxiv","version":3}},"canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","first_computed_at":"2026-05-18T00:38:09.109017Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:09.109017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQaSFBy+9MsQuu3x28b7bCYifpj1D1JvfgHjlIMdKYnDDaW3PGWzv03JleyOFxqJlQLD3Lwq9BYBVN7yJ97gDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:09.109693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.02531","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5dfd7e9b3dfed835fc07fcdef513760d9effd805ba97900a9d202fb61be511f","sha256:fedbd158765ff4caa2a69f6e527440a2f0ea6e1a8c82914c914e51766da9901c"],"state_sha256":"1a4d1ba4d7fc83c9aeb8ebdd7592498ea2e6c8c7311b383c98d51763d6793fda"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T9qLT0tkmoL0mDD9VYyr/q5eECq9dB6/6Cj/6/lsqW+FgMJ+9TX1TKTz7QXW5Gh6Ld8vRf4ZCJv9w5QxO4/gDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:45:23.807340Z","bundle_sha256":"16477e59d9075ce51fb38028712e5f2ef994db28c9e0282730ebb07be692746f"}}