{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:N5SF54MRJCXPYSGHXKX5UJ7GJQ","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":"2be0393166d64a5d4b130bd90ca8d0b1ff3c4ca163dfe0740fb0c33bbc1c4d98","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-07T15:40:36Z","title_canon_sha256":"346204c74dd43881d02a6514350e8bd25188398ace1b5b669d1a0ceb7ebf8885"},"schema_version":"1.0","source":{"id":"1910.02861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.02861","created_at":"2026-07-05T00:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1910.02861v1","created_at":"2026-07-05T00:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02861","created_at":"2026-07-05T00:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"N5SF54MRJCXP","created_at":"2026-07-05T00:10:12Z"},{"alias_kind":"pith_short_16","alias_value":"N5SF54MRJCXPYSGH","created_at":"2026-07-05T00:10:12Z"},{"alias_kind":"pith_short_8","alias_value":"N5SF54MR","created_at":"2026-07-05T00:10:12Z"}],"graph_snapshots":[{"event_id":"sha256:8695fc2382efa0cce01f0bc05cf80ab15cb597cfa5c31d9348fa0b25c65af856","target":"graph","created_at":"2026-07-05T00:10:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1910.02861/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the potential utility of classical techniques of spectral sparsification of graphs as a preprocessing step for digital quantum algorithms, in particular, for Hamiltonian simulation. Our results indicate that spectral sparsification of a graph with $n$ nodes through a sampling method, e.g.\\ as in \\cite{Spielman2011resistances} using effective resistances, gives, with high probability, a locally computable matrix $\\tilde H$ with row sparsity at most $\\mathcal{O}(\\text{poly}\\log n)$. For a symmetric matrix $H$ of size $n$ with $m$ non-zero entries, a one-time classical runtime overhead o","authors_text":"Sathyawageeswar Subramanian, Steven Herbert","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-07T15:40:36Z","title":"Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02861","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:9742697afb069c93bbd03075973fd167ea6ee3a342e33f10c910aa13f6f1a7d6","target":"record","created_at":"2026-07-05T00:10:12Z","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":"2be0393166d64a5d4b130bd90ca8d0b1ff3c4ca163dfe0740fb0c33bbc1c4d98","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-07T15:40:36Z","title_canon_sha256":"346204c74dd43881d02a6514350e8bd25188398ace1b5b669d1a0ceb7ebf8885"},"schema_version":"1.0","source":{"id":"1910.02861","kind":"arxiv","version":1}},"canonical_sha256":"6f645ef19148aefc48c7baafda27e64c1952ae5d4e1e8349bbcbb46b60d07363","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f645ef19148aefc48c7baafda27e64c1952ae5d4e1e8349bbcbb46b60d07363","first_computed_at":"2026-07-05T00:10:12.155366Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:10:12.155366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qn1j+k3uD8xfWlXvA11GEtx0W8KkdzQ1Vp7Yf6Mz17fE+13PJXvyWL1h1zQZCScK2g2DQ/yAzhfut1RaDONxBw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:10:12.155705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.02861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9742697afb069c93bbd03075973fd167ea6ee3a342e33f10c910aa13f6f1a7d6","sha256:8695fc2382efa0cce01f0bc05cf80ab15cb597cfa5c31d9348fa0b25c65af856"],"state_sha256":"ec1b36f2f87ae6564e59f9f77a70272f452cda3aada18bc618b5ed24a4671789"}