{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3NEEOE7MEK52DXVWGDK532AF6Y","short_pith_number":"pith:3NEEOE7M","canonical_record":{"source":{"id":"1407.1289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"f8984b1c273773caa48e5d92c2192a7e475b2bae216fac559c6b553bb2b5308c","abstract_canon_sha256":"205b76b7577198225df1d6008859eefd9f3717a31ce4a8e26286b006bec779f4"},"schema_version":"1.0"},"canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","source":{"kind":"arxiv","id":"1407.1289","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1289","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1289v3","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1289","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"3NEEOE7MEK52","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3NEEOE7MEK52DXVW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3NEEOE7M","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3NEEOE7MEK52DXVWGDK532AF6Y","target":"record","payload":{"canonical_record":{"source":{"id":"1407.1289","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","cross_cats_sorted":[],"title_canon_sha256":"f8984b1c273773caa48e5d92c2192a7e475b2bae216fac559c6b553bb2b5308c","abstract_canon_sha256":"205b76b7577198225df1d6008859eefd9f3717a31ce4a8e26286b006bec779f4"},"schema_version":"1.0"},"canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:40.913872Z","signature_b64":"90LY/1kh8TZ7I5zyQaK71JMGbD72/JxXpCcIa2ndonezU053diTjj8xpR+uIq2zSl7Em6Of6EskcaRbJVzWcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","last_reissued_at":"2026-05-18T02:18:40.913068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:40.913068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.1289","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-18T02:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afXzGLz6G+qILrRMo/ZJjiDgpIWgTRK2Jqs2SLFpbiwKs4Mc3efthDGmwXkaNhKdEAT8jXAd+F5s7bCB/Q/5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:02:09.813055Z"},"content_sha256":"9cb5942836eb8aab0da643ef4cd123bae8a4cc2f334b3c69499673361d6b1756","schema_version":"1.0","event_id":"sha256:9cb5942836eb8aab0da643ef4cd123bae8a4cc2f334b3c69499673361d6b1756"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3NEEOE7MEK52DXVWGDK532AF6Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single Pass Spectral Sparsification in Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael Kapralov, Yin Tat Lee","submitted_at":"2014-07-04T18:34:03Z","abstract_excerpt":"We present the first single pass algorithm for computing spectral sparsifiers of graphs in the dynamic semi-streaming model. Given a single pass over a stream containing insertions and deletions of edges to a graph G, our algorithm maintains a randomized linear sketch of the incidence matrix of G into dimension O((1/epsilon^2) n polylog(n)). Using this sketch, at any point, the algorithm can output a (1 +/- epsilon) spectral sparsifier for G with high probability.\n  While O((1/epsilon^2) n polylog(n)) space algorithms are known for computing \"cut sparsifiers\" in dynamic streams [AGM12b, GKP12]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1289","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-18T02:18:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"opQ4E3hHrWQSAa5Nt5AZ5axZlH+gDKwBX0nJRp+S6lz1N/V2BdsTI4YdQlYH+algnRhIghvonnEJFzp2MQajCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:02:09.813788Z"},"content_sha256":"4251aee0b52f82673834694c0db98f481944266f8d6c4551c1e29e0255e0b27a","schema_version":"1.0","event_id":"sha256:4251aee0b52f82673834694c0db98f481944266f8d6c4551c1e29e0255e0b27a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/bundle.json","state_url":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NEEOE7MEK52DXVWGDK532AF6Y/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-31T03:02:09Z","links":{"resolver":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y","bundle":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/bundle.json","state":"https://pith.science/pith/3NEEOE7MEK52DXVWGDK532AF6Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NEEOE7MEK52DXVWGDK532AF6Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3NEEOE7MEK52DXVWGDK532AF6Y","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":"205b76b7577198225df1d6008859eefd9f3717a31ce4a8e26286b006bec779f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","title_canon_sha256":"f8984b1c273773caa48e5d92c2192a7e475b2bae216fac559c6b553bb2b5308c"},"schema_version":"1.0","source":{"id":"1407.1289","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1289","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1289v3","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1289","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"3NEEOE7MEK52","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3NEEOE7MEK52DXVW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3NEEOE7M","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:4251aee0b52f82673834694c0db98f481944266f8d6c4551c1e29e0255e0b27a","target":"graph","created_at":"2026-05-18T02:18: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":"We present the first single pass algorithm for computing spectral sparsifiers of graphs in the dynamic semi-streaming model. Given a single pass over a stream containing insertions and deletions of edges to a graph G, our algorithm maintains a randomized linear sketch of the incidence matrix of G into dimension O((1/epsilon^2) n polylog(n)). Using this sketch, at any point, the algorithm can output a (1 +/- epsilon) spectral sparsifier for G with high probability.\n  While O((1/epsilon^2) n polylog(n)) space algorithms are known for computing \"cut sparsifiers\" in dynamic streams [AGM12b, GKP12]","authors_text":"Aaron Sidford, Cameron Musco, Christopher Musco, Michael Kapralov, Yin Tat Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","title":"Single Pass Spectral Sparsification in Dynamic Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1289","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:9cb5942836eb8aab0da643ef4cd123bae8a4cc2f334b3c69499673361d6b1756","target":"record","created_at":"2026-05-18T02:18: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":"205b76b7577198225df1d6008859eefd9f3717a31ce4a8e26286b006bec779f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-04T18:34:03Z","title_canon_sha256":"f8984b1c273773caa48e5d92c2192a7e475b2bae216fac559c6b553bb2b5308c"},"schema_version":"1.0","source":{"id":"1407.1289","kind":"arxiv","version":3}},"canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db484713ec22bba1deb630d5dde805f60d6c9a6d29ab870d0f99b7d1b4bbc0a8","first_computed_at":"2026-05-18T02:18:40.913068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:40.913068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"90LY/1kh8TZ7I5zyQaK71JMGbD72/JxXpCcIa2ndonezU053diTjj8xpR+uIq2zSl7Em6Of6EskcaRbJVzWcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:40.913872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1289","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9cb5942836eb8aab0da643ef4cd123bae8a4cc2f334b3c69499673361d6b1756","sha256:4251aee0b52f82673834694c0db98f481944266f8d6c4551c1e29e0255e0b27a"],"state_sha256":"74de35ebae76da1639b556650cea9367e5fd3790ffdf89826ec4981dee40dfb2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Dy4hAV5a4d5fNawLItrTAUYFl6c/F8HeuTId3nAv7kMsNuUHC2BFldfvVpG0tQoD+p/Ab/T2fxLmW5FvNjeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:02:09.816916Z","bundle_sha256":"a688008e7c87db2ac7d6375bfe917e23cff4f7d7707a1ef35cde607e80115678"}}