{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SNLFR7VBQMN3RCZTSFOCATUCPK","short_pith_number":"pith:SNLFR7VB","schema_version":"1.0","canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","source":{"kind":"arxiv","id":"1505.01731","version":1},"attestation_state":"computed","paper":{"title":"Kernelization via Sampling with Applications to Dynamic Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Rajesh Chitnis, Sofya Vorotnikova","submitted_at":"2015-05-07T14:59:05Z","abstract_excerpt":"In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions and deletions) and distributed systems such as MapReduce. In the case of dynamic graph streams, we use this primitive to prove the following results:\n  -- Matching: First, there exists an $\\tilde{O}(k^2)$ space algorithm that returns an exact maximum matching on the assumption the cardinality is at most $k$. The best previous algorithm used $\\tilde{O}(kn)$ s"},"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":"1505.01731","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-07T14:59:05Z","cross_cats_sorted":[],"title_canon_sha256":"d80c39c9fd3c5ca1dcc16a1e689a534829939099d6bb0cfc7ce9459e4dcd1ff9","abstract_canon_sha256":"b020291dd9b13db60bc6f740aa57447b54c675a8ab854795adcf87293afafaef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:40.207375Z","signature_b64":"X6Q2JjFCMmlzRGlNhXO3etCUJ3rA13t77hHD3vakk2VV1gJximJ6FbI4Sh5xt/O4ycKyHuQiILw1nLbrocOJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","last_reissued_at":"2026-05-18T02:16:40.206908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:40.206908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization via Sampling with Applications to Dynamic Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Rajesh Chitnis, Sofya Vorotnikova","submitted_at":"2015-05-07T14:59:05Z","abstract_excerpt":"In this paper we present a simple but powerful subgraph sampling primitive that is applicable in a variety of computational models including dynamic graph streams (where the input graph is defined by a sequence of edge/hyperedge insertions and deletions) and distributed systems such as MapReduce. In the case of dynamic graph streams, we use this primitive to prove the following results:\n  -- Matching: First, there exists an $\\tilde{O}(k^2)$ space algorithm that returns an exact maximum matching on the assumption the cardinality is at most $k$. The best previous algorithm used $\\tilde{O}(kn)$ s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01731","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.01731","created_at":"2026-05-18T02:16:40.206971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.01731v1","created_at":"2026-05-18T02:16:40.206971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01731","created_at":"2026-05-18T02:16:40.206971+00:00"},{"alias_kind":"pith_short_12","alias_value":"SNLFR7VBQMN3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SNLFR7VBQMN3RCZT","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SNLFR7VB","created_at":"2026-05-18T12:29:42.218222+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/SNLFR7VBQMN3RCZTSFOCATUCPK","json":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK.json","graph_json":"https://pith.science/api/pith-number/SNLFR7VBQMN3RCZTSFOCATUCPK/graph.json","events_json":"https://pith.science/api/pith-number/SNLFR7VBQMN3RCZTSFOCATUCPK/events.json","paper":"https://pith.science/paper/SNLFR7VB"},"agent_actions":{"view_html":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK","download_json":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK.json","view_paper":"https://pith.science/paper/SNLFR7VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.01731&json=true","fetch_graph":"https://pith.science/api/pith-number/SNLFR7VBQMN3RCZTSFOCATUCPK/graph.json","fetch_events":"https://pith.science/api/pith-number/SNLFR7VBQMN3RCZTSFOCATUCPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/action/storage_attestation","attest_author":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/action/author_attestation","sign_citation":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/action/citation_signature","submit_replication":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/action/replication_record"}},"created_at":"2026-05-18T02:16:40.206971+00:00","updated_at":"2026-05-18T02:16:40.206971+00:00"}