{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SNLFR7VBQMN3RCZTSFOCATUCPK","short_pith_number":"pith:SNLFR7VB","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"},"canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","source":{"kind":"arxiv","id":"1505.01731","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01731","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01731v1","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01731","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"SNLFR7VBQMN3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNLFR7VBQMN3RCZT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNLFR7VB","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SNLFR7VBQMN3RCZTSFOCATUCPK","target":"record","payload":{"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"},"canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","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"},"source_kind":"arxiv","source_id":"1505.01731","source_version":1,"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-18T02:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ke8fTdJCQ74WiHjoNZ/1wDh36ywnAdGbr5s+tCE+Hz3tsmV5Dcje+MzoqY2S2OwtMm/k67q4LYtLyKJoZb/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:27:12.225420Z"},"content_sha256":"94f0d07e67c63b85ae891522af96751a8b390a18b5043f851fa4282a9b1b8643","schema_version":"1.0","event_id":"sha256:94f0d07e67c63b85ae891522af96751a8b390a18b5043f851fa4282a9b1b8643"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SNLFR7VBQMN3RCZTSFOCATUCPK","target":"graph","payload":{"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"},"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-18T02:16:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xNb1ESp6Ldp7FgzJZ6OjRO9/AT7z2z2NXbfzVzpANrO/vYh6MzNMaaMIRQJpRJYputqA8Q5MSkaawEhDTysDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:27:12.226010Z"},"content_sha256":"8a4c04ac759f891f6bd993558584658a2c3ab59fc176cc0b2f439decde77064b","schema_version":"1.0","event_id":"sha256:8a4c04ac759f891f6bd993558584658a2c3ab59fc176cc0b2f439decde77064b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/bundle.json","state_url":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/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-27T08:27:12Z","links":{"resolver":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK","bundle":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/bundle.json","state":"https://pith.science/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNLFR7VBQMN3RCZTSFOCATUCPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SNLFR7VBQMN3RCZTSFOCATUCPK","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":"b020291dd9b13db60bc6f740aa57447b54c675a8ab854795adcf87293afafaef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-07T14:59:05Z","title_canon_sha256":"d80c39c9fd3c5ca1dcc16a1e689a534829939099d6bb0cfc7ce9459e4dcd1ff9"},"schema_version":"1.0","source":{"id":"1505.01731","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01731","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01731v1","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01731","created_at":"2026-05-18T02:16:40Z"},{"alias_kind":"pith_short_12","alias_value":"SNLFR7VBQMN3","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNLFR7VBQMN3RCZT","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNLFR7VB","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:8a4c04ac759f891f6bd993558584658a2c3ab59fc176cc0b2f439decde77064b","target":"graph","created_at":"2026-05-18T02:16:40Z","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":"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","authors_text":"Andrew McGregor, Graham Cormode, Hossein Esfandiari, MohammadTaghi Hajiaghayi, Morteza Monemizadeh, Rajesh Chitnis, Sofya Vorotnikova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-07T14:59:05Z","title":"Kernelization via Sampling with Applications to Dynamic Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01731","kind":"arxiv","version":1},"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:94f0d07e67c63b85ae891522af96751a8b390a18b5043f851fa4282a9b1b8643","target":"record","created_at":"2026-05-18T02:16:40Z","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":"b020291dd9b13db60bc6f740aa57447b54c675a8ab854795adcf87293afafaef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-07T14:59:05Z","title_canon_sha256":"d80c39c9fd3c5ca1dcc16a1e689a534829939099d6bb0cfc7ce9459e4dcd1ff9"},"schema_version":"1.0","source":{"id":"1505.01731","kind":"arxiv","version":1}},"canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"935658fea1831bb88b33915c204e827a80b68599fef90ef52539a77905bd00ca","first_computed_at":"2026-05-18T02:16:40.206908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:40.206908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X6Q2JjFCMmlzRGlNhXO3etCUJ3rA13t77hHD3vakk2VV1gJximJ6FbI4Sh5xt/O4ycKyHuQiILw1nLbrocOJBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:40.207375Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01731","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94f0d07e67c63b85ae891522af96751a8b390a18b5043f851fa4282a9b1b8643","sha256:8a4c04ac759f891f6bd993558584658a2c3ab59fc176cc0b2f439decde77064b"],"state_sha256":"c1421db78f303826ee2acec552bc2245cb2bfb277ffb998a871e176868de5b59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Su8uMgEEhdSlCz+V0i/5YqlDEzvErOvXX/UxxyNr1Rcb+VtpkYgq25Z8RNQ4oH93q8m9pgZ/PzSqtVcSrTsiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:27:12.229235Z","bundle_sha256":"99ff547f8ad867eb2385d9faa16236d9334bd5199b6ae743023cf37795760f1f"}}