{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RXRCVGO3CUEJAUHOMRTHEDOPM7","short_pith_number":"pith:RXRCVGO3","schema_version":"1.0","canonical_sha256":"8de22a99db15089050ee6466720dcf67ffe985fc417f1b4a4fe1e2060c5561b3","source":{"kind":"arxiv","id":"1612.02531","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1612.02531","created_at":"2026-05-18T00:38:09.109119+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02531v3","created_at":"2026-05-18T00:38:09.109119+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02531","created_at":"2026-05-18T00:38:09.109119+00:00"},{"alias_kind":"pith_short_12","alias_value":"RXRCVGO3CUEJ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RXRCVGO3CUEJAUHO","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RXRCVGO3","created_at":"2026-05-18T12:30:41.710351+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/RXRCVGO3CUEJAUHOMRTHEDOPM7","json":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7.json","graph_json":"https://pith.science/api/pith-number/RXRCVGO3CUEJAUHOMRTHEDOPM7/graph.json","events_json":"https://pith.science/api/pith-number/RXRCVGO3CUEJAUHOMRTHEDOPM7/events.json","paper":"https://pith.science/paper/RXRCVGO3"},"agent_actions":{"view_html":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7","download_json":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7.json","view_paper":"https://pith.science/paper/RXRCVGO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02531&json=true","fetch_graph":"https://pith.science/api/pith-number/RXRCVGO3CUEJAUHOMRTHEDOPM7/graph.json","fetch_events":"https://pith.science/api/pith-number/RXRCVGO3CUEJAUHOMRTHEDOPM7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/action/storage_attestation","attest_author":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/action/author_attestation","sign_citation":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/action/citation_signature","submit_replication":"https://pith.science/pith/RXRCVGO3CUEJAUHOMRTHEDOPM7/action/replication_record"}},"created_at":"2026-05-18T00:38:09.109119+00:00","updated_at":"2026-05-18T00:38:09.109119+00:00"}