{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NLSIVWOUL7QAI73CSK2YHJ6MTH","short_pith_number":"pith:NLSIVWOU","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"},"canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","source":{"kind":"arxiv","id":"1711.00571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00571","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00571v2","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00571","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"NLSIVWOUL7QA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLSIVWOUL7QAI73C","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLSIVWOU","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NLSIVWOUL7QAI73CSK2YHJ6MTH","target":"record","payload":{"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"},"canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","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"},"source_kind":"arxiv","source_id":"1711.00571","source_version":2,"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-18T00:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcqhJPSeCgcfH97EUxu8A6L9W0ei5VYCtUlkGHDHENgq/zvXK0AdvFLXjBMC1q7VYfo/9rJJzcAbXJzV3kelBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:17:23.741729Z"},"content_sha256":"24f14d68f2adedf6aa2fe4d892fe29e0f723bdba6fd56fe0bae1d94d65578b24","schema_version":"1.0","event_id":"sha256:24f14d68f2adedf6aa2fe4d892fe29e0f723bdba6fd56fe0bae1d94d65578b24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NLSIVWOUL7QAI73CSK2YHJ6MTH","target":"graph","payload":{"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"},"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-18T00:26:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D+qIAe41Nc/5mJOS7rdPWPDL31RIjkXNaSMzaXofHThohBnobSWINnaGj4vA/DmYrkh+736BaKsb4nhCEswwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:17:23.742083Z"},"content_sha256":"a973a8b4c54facbc797d3878f36879c0a108fa2add75c81b4e5d78de5828fee2","schema_version":"1.0","event_id":"sha256:a973a8b4c54facbc797d3878f36879c0a108fa2add75c81b4e5d78de5828fee2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/bundle.json","state_url":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/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-06-21T23:17:23Z","links":{"resolver":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH","bundle":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/bundle.json","state":"https://pith.science/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLSIVWOUL7QAI73CSK2YHJ6MTH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NLSIVWOUL7QAI73CSK2YHJ6MTH","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":"5e63f55a8347722e15b38c230381217ced0c7d7d56baf8e7fe8351989603f4c5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T00:06:55Z","title_canon_sha256":"5176712ff93e98317f040ca993e7a9f5fcd9800aa7c586abecbf4043c50db10b"},"schema_version":"1.0","source":{"id":"1711.00571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.00571","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.00571v2","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00571","created_at":"2026-05-18T00:26:36Z"},{"alias_kind":"pith_short_12","alias_value":"NLSIVWOUL7QA","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NLSIVWOUL7QAI73C","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NLSIVWOU","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a973a8b4c54facbc797d3878f36879c0a108fa2add75c81b4e5d78de5828fee2","target":"graph","created_at":"2026-05-18T00:26:36Z","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 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","authors_text":"Aaron Sidford, Arun Jambulapati","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T00:06:55Z","title":"Efficient $\\widetilde{O}(n/\\epsilon)$ Spectral Sketches for the Laplacian and its Pseudoinverse"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00571","kind":"arxiv","version":2},"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:24f14d68f2adedf6aa2fe4d892fe29e0f723bdba6fd56fe0bae1d94d65578b24","target":"record","created_at":"2026-05-18T00:26:36Z","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":"5e63f55a8347722e15b38c230381217ced0c7d7d56baf8e7fe8351989603f4c5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T00:06:55Z","title_canon_sha256":"5176712ff93e98317f040ca993e7a9f5fcd9800aa7c586abecbf4043c50db10b"},"schema_version":"1.0","source":{"id":"1711.00571","kind":"arxiv","version":2}},"canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ae48ad9d45fe0047f6292b583a7cc99cd74db017d4a5440f2d79015fdfc906c","first_computed_at":"2026-05-18T00:26:36.087279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:36.087279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4osipK5AMFWbgVZL3x9Iyd7oDdc1XIi3o0pD/F6RrTcVWEJQ4DRAi3QnR2UupLO3KhUhtB4xl0u4Lmt5bFVBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:36.087781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.00571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24f14d68f2adedf6aa2fe4d892fe29e0f723bdba6fd56fe0bae1d94d65578b24","sha256:a973a8b4c54facbc797d3878f36879c0a108fa2add75c81b4e5d78de5828fee2"],"state_sha256":"966fc0ab8626e83e0dd97294b5fc503e081b2fbb9c3318991c233874d7f9cab0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0yGyvF5mNqR64RKy/tIzvzQimaapGTisY4uU+Wszn08LYhNLjSTSDV16Q5tS8cBkczFz9stvEhxnAHMI0CF6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:17:23.744112Z","bundle_sha256":"784e17be51a6bc751b6706a153fa5f0ff1ca9736b2f3bcac29e1f9799f0fe43d"}}