{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NLSIVWOUL7QAI73CSK2YHJ6MTH","short_pith_number":"pith:NLSIVWOU","schema_version":"1.0","canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","source":{"kind":"arxiv","id":"1711.00571","version":2},"attestation_state":"computed","paper":{"title":"Efficient $\\widetilde{O}(n/\\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati","submitted_at":"2017-11-02T00:06:55Z","abstract_excerpt":"In this paper we consider the problem of efficiently computing $\\epsilon$-sketches for the Laplacian and its pseudoinverse. Given a Laplacian and an error tolerance $\\epsilon$, we seek to construct a function $f$ such that for any vector $x$ (chosen obliviously from $f$), with high probability $(1-\\epsilon) x^\\top A x \\leq f(x) \\leq (1 + \\epsilon) x^\\top A x$ where $A$ is either the Laplacian or its pseudoinverse. Our goal is to construct such a sketch $f$ efficiently and to store it in the least space possible.\n  We provide nearly-linear time algorithms that, when given a Laplacian matrix $\\m"},"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":"1711.00571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T00:06:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"5176712ff93e98317f040ca993e7a9f5fcd9800aa7c586abecbf4043c50db10b","abstract_canon_sha256":"5e63f55a8347722e15b38c230381217ced0c7d7d56baf8e7fe8351989603f4c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:36.087781Z","signature_b64":"n4osipK5AMFWbgVZL3x9Iyd7oDdc1XIi3o0pD/F6RrTcVWEJQ4DRAi3QnR2UupLO3KhUhtB4xl0u4Lmt5bFVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","last_reissued_at":"2026-05-18T00:26:36.087279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:36.087279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient $\\widetilde{O}(n/\\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Aaron Sidford, Arun Jambulapati","submitted_at":"2017-11-02T00:06:55Z","abstract_excerpt":"In this paper we consider the problem of efficiently computing $\\epsilon$-sketches for the Laplacian and its pseudoinverse. Given a Laplacian and an error tolerance $\\epsilon$, we seek to construct a function $f$ such that for any vector $x$ (chosen obliviously from $f$), with high probability $(1-\\epsilon) x^\\top A x \\leq f(x) \\leq (1 + \\epsilon) x^\\top A x$ where $A$ is either the Laplacian or its pseudoinverse. Our goal is to construct such a sketch $f$ efficiently and to store it in the least space possible.\n  We provide nearly-linear time algorithms that, when given a Laplacian matrix $\\m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00571","kind":"arxiv","version":2},"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":"1711.00571","created_at":"2026-05-18T00:26:36.087370+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00571v2","created_at":"2026-05-18T00:26:36.087370+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00571","created_at":"2026-05-18T00:26:36.087370+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLSIVWOUL7QA","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLSIVWOUL7QAI73C","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLSIVWOU","created_at":"2026-05-18T12:31:31.346846+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/NLSIVWOUL7QAI73CSK2YHJ6MTH","json":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH.json","graph_json":"https://pith.science/api/pith-number/NLSIVWOUL7QAI73CSK2YHJ6MTH/graph.json","events_json":"https://pith.science/api/pith-number/NLSIVWOUL7QAI73CSK2YHJ6MTH/events.json","paper":"https://pith.science/paper/NLSIVWOU"},"agent_actions":{"view_html":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH","download_json":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH.json","view_paper":"https://pith.science/paper/NLSIVWOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00571&json=true","fetch_graph":"https://pith.science/api/pith-number/NLSIVWOUL7QAI73CSK2YHJ6MTH/graph.json","fetch_events":"https://pith.science/api/pith-number/NLSIVWOUL7QAI73CSK2YHJ6MTH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/action/storage_attestation","attest_author":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/action/author_attestation","sign_citation":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/action/citation_signature","submit_replication":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/action/replication_record"}},"created_at":"2026-05-18T00:26:36.087370+00:00","updated_at":"2026-05-18T00:26:36.087370+00:00"}