{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TBNEVUANEIMZRG3VA5YNFAAYI2","short_pith_number":"pith:TBNEVUAN","schema_version":"1.0","canonical_sha256":"985a4ad00d2219989b750770d28018469269f96c92cee3b9186e5b6c515ecf78","source":{"kind":"arxiv","id":"1903.12150","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.12150","created_at":"2026-05-17T23:49:57.893177+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12150v1","created_at":"2026-05-17T23:49:57.893177+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12150","created_at":"2026-05-17T23:49:57.893177+00:00"},{"alias_kind":"pith_short_12","alias_value":"TBNEVUANEIMZ","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"TBNEVUANEIMZRG3V","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"TBNEVUAN","created_at":"2026-05-18T12:33:27.125529+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/TBNEVUANEIMZRG3VA5YNFAAYI2","json":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2.json","graph_json":"https://pith.science/api/pith-number/TBNEVUANEIMZRG3VA5YNFAAYI2/graph.json","events_json":"https://pith.science/api/pith-number/TBNEVUANEIMZRG3VA5YNFAAYI2/events.json","paper":"https://pith.science/paper/TBNEVUAN"},"agent_actions":{"view_html":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2","download_json":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2.json","view_paper":"https://pith.science/paper/TBNEVUAN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12150&json=true","fetch_graph":"https://pith.science/api/pith-number/TBNEVUANEIMZRG3VA5YNFAAYI2/graph.json","fetch_events":"https://pith.science/api/pith-number/TBNEVUANEIMZRG3VA5YNFAAYI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/action/storage_attestation","attest_author":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/action/author_attestation","sign_citation":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/action/citation_signature","submit_replication":"https://pith.science/pith/TBNEVUANEIMZRG3VA5YNFAAYI2/action/replication_record"}},"created_at":"2026-05-17T23:49:57.893177+00:00","updated_at":"2026-05-17T23:49:57.893177+00:00"}