{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TBNEVUANEIMZRG3VA5YNFAAYI2","short_pith_number":"pith:TBNEVUAN","canonical_record":{"source":{"id":"1903.12150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T17:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"d7aae11738173ec530ec4fffb1982d65feb7472b8765617ccc82644a0a294ee2","abstract_canon_sha256":"cbe3da8f55aff9ab3b4721653ff7fed5481f704f72db2f0743cfab934f6bc4b1"},"schema_version":"1.0"},"canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","source":{"kind":"arxiv","id":"1903.12150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12150","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12150v1","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12150","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"TBNEVUANEIMZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBNEVUANEIMZRG3V","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBNEVUAN","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TBNEVUANEIMZRG3VA5YNFAAYI2","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T17:38:45Z","cross_cats_sorted":[],"title_canon_sha256":"d7aae11738173ec530ec4fffb1982d65feb7472b8765617ccc82644a0a294ee2","abstract_canon_sha256":"cbe3da8f55aff9ab3b4721653ff7fed5481f704f72db2f0743cfab934f6bc4b1"},"schema_version":"1.0"},"canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:57.893837Z","signature_b64":"NUNFDoonme0tyCY7hz4Xi5tpZCdhZJGrKQwGpFMEu5YVCrvJSxwlHR7mcRLy7oJYxCfGOHLx0PcbSb/KP0PnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","last_reissued_at":"2026-05-17T23:49:57.893085Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:57.893085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12150","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-17T23:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8P7M6Ce042aBZ7XxwvkwSRnb27uQdRBjEmLlvUT0ebNASSZNWvuRu1T0sSDEoPaqw4BO0HsKyk228mHU8x/4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:34:18.994701Z"},"content_sha256":"120c45403af6323df2a0570e2cd27aa023eea3899c0071a76a0bd6df464023c1","schema_version":"1.0","event_id":"sha256:120c45403af6323df2a0570e2cd27aa023eea3899c0071a76a0bd6df464023c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TBNEVUANEIMZRG3VA5YNFAAYI2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Jakab Tardos, Michael Kapralov, Navid Nouri","submitted_at":"2019-03-28T17:38:45Z","abstract_excerpt":"In this paper we consider the problem of computing spectral approximations to graphs in the single pass dynamic streaming model. We provide a linear sketching based solution that given a stream of edge insertions and deletions to a $n$-node undirected graph, uses $\\tilde O(n)$ space, processes each update in $\\tilde O(1)$ time, and with high probability recovers a spectral sparsifier in $\\tilde O(n)$ time. Prior to our work, state of the art results either used near optimal $\\tilde O(n)$ space complexity, but brute-force $\\Omega(n^2)$ recovery time [Kapralov et al.'14], or with subquadratic ru"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12150","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-17T23:49:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TvTDh5gJgrItjd8VmC+rap07KUIr5XBe2d9iyMnh8PvgBuT1NXOHhi5OCRBbDG1VYRdOxUMzQBC4hie6EC4Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:34:18.995297Z"},"content_sha256":"5bf25a654861a3c4741975cfa506fe32185e72e80022d476276c5d291215c799","schema_version":"1.0","event_id":"sha256:5bf25a654861a3c4741975cfa506fe32185e72e80022d476276c5d291215c799"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/bundle.json","state_url":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/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-30T23:34:18Z","links":{"resolver":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2","bundle":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/bundle.json","state":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TBNEVUANEIMZRG3VA5YNFAAYI2","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":"cbe3da8f55aff9ab3b4721653ff7fed5481f704f72db2f0743cfab934f6bc4b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T17:38:45Z","title_canon_sha256":"d7aae11738173ec530ec4fffb1982d65feb7472b8765617ccc82644a0a294ee2"},"schema_version":"1.0","source":{"id":"1903.12150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12150","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12150v1","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12150","created_at":"2026-05-17T23:49:57Z"},{"alias_kind":"pith_short_12","alias_value":"TBNEVUANEIMZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TBNEVUANEIMZRG3V","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TBNEVUAN","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5bf25a654861a3c4741975cfa506fe32185e72e80022d476276c5d291215c799","target":"graph","created_at":"2026-05-17T23:49:57Z","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 consider the problem of computing spectral approximations to graphs in the single pass dynamic streaming model. We provide a linear sketching based solution that given a stream of edge insertions and deletions to a $n$-node undirected graph, uses $\\tilde O(n)$ space, processes each update in $\\tilde O(1)$ time, and with high probability recovers a spectral sparsifier in $\\tilde O(n)$ time. Prior to our work, state of the art results either used near optimal $\\tilde O(n)$ space complexity, but brute-force $\\Omega(n^2)$ recovery time [Kapralov et al.'14], or with subquadratic ru","authors_text":"Aaron Sidford, Jakab Tardos, Michael Kapralov, Navid Nouri","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T17:38:45Z","title":"Dynamic Streaming Spectral Sparsification in Nearly Linear Time and Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12150","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:120c45403af6323df2a0570e2cd27aa023eea3899c0071a76a0bd6df464023c1","target":"record","created_at":"2026-05-17T23:49:57Z","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":"cbe3da8f55aff9ab3b4721653ff7fed5481f704f72db2f0743cfab934f6bc4b1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T17:38:45Z","title_canon_sha256":"d7aae11738173ec530ec4fffb1982d65feb7472b8765617ccc82644a0a294ee2"},"schema_version":"1.0","source":{"id":"1903.12150","kind":"arxiv","version":1}},"canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","first_computed_at":"2026-05-17T23:49:57.893085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:57.893085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NUNFDoonme0tyCY7hz4Xi5tpZCdhZJGrKQwGpFMEu5YVCrvJSxwlHR7mcRLy7oJYxCfGOHLx0PcbSb/KP0PnDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:57.893837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:120c45403af6323df2a0570e2cd27aa023eea3899c0071a76a0bd6df464023c1","sha256:5bf25a654861a3c4741975cfa506fe32185e72e80022d476276c5d291215c799"],"state_sha256":"bdb69764892bb5d5d9288193b9cd1901410b0f92fadcfcd5e4a45f4091ff6412"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azcC9MUXrj1hpmzrCZOK1KAxDv6u2vSqBXhnYc2tIOPuqbe/YxFLUjQxJ1SOE0zpXskwSLl9GhfQjOSSYBbKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:34:18.998806Z","bundle_sha256":"46cadf516474d44008bd013292a909846fc9a5bc9943f5f1eaf3662faeed8ea7"}}