{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:N5SF54MRJCXPYSGHXKX5UJ7GJQ","short_pith_number":"pith:N5SF54MR","schema_version":"1.0","canonical_sha256":"6f645ef19148aefc48c7baafda27e64c1952ae5d4e1e8349bbcbb46b60d07363","source":{"kind":"arxiv","id":"1910.02861","version":1},"attestation_state":"computed","paper":{"title":"Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Sathyawageeswar Subramanian, Steven Herbert","submitted_at":"2019-10-07T15:40:36Z","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"},"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":"1910.02861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-10-07T15:40:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"346204c74dd43881d02a6514350e8bd25188398ace1b5b669d1a0ceb7ebf8885","abstract_canon_sha256":"2be0393166d64a5d4b130bd90ca8d0b1ff3c4ca163dfe0740fb0c33bbc1c4d98"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:10:12.155705Z","signature_b64":"Qn1j+k3uD8xfWlXvA11GEtx0W8KkdzQ1Vp7Yf6Mz17fE+13PJXvyWL1h1zQZCScK2g2DQ/yAzhfut1RaDONxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f645ef19148aefc48c7baafda27e64c1952ae5d4e1e8349bbcbb46b60d07363","last_reissued_at":"2026-07-05T00:10:12.155366Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:10:12.155366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral sparsification of matrix inputs as a preprocessing step for quantum algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Sathyawageeswar Subramanian, Steven Herbert","submitted_at":"2019-10-07T15:40:36Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02861","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1910.02861/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1910.02861","created_at":"2026-07-05T00:10:12.155422+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.02861v1","created_at":"2026-07-05T00:10:12.155422+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02861","created_at":"2026-07-05T00:10:12.155422+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5SF54MRJCXP","created_at":"2026-07-05T00:10:12.155422+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5SF54MRJCXPYSGH","created_at":"2026-07-05T00:10:12.155422+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5SF54MR","created_at":"2026-07-05T00:10:12.155422+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.14932","citing_title":"Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ","json":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ.json","graph_json":"https://pith.science/api/pith-number/N5SF54MRJCXPYSGHXKX5UJ7GJQ/graph.json","events_json":"https://pith.science/api/pith-number/N5SF54MRJCXPYSGHXKX5UJ7GJQ/events.json","paper":"https://pith.science/paper/N5SF54MR"},"agent_actions":{"view_html":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ","download_json":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ.json","view_paper":"https://pith.science/paper/N5SF54MR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.02861&json=true","fetch_graph":"https://pith.science/api/pith-number/N5SF54MRJCXPYSGHXKX5UJ7GJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/N5SF54MRJCXPYSGHXKX5UJ7GJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ/action/storage_attestation","attest_author":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ/action/author_attestation","sign_citation":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ/action/citation_signature","submit_replication":"https://pith.science/pith/N5SF54MRJCXPYSGHXKX5UJ7GJQ/action/replication_record"}},"created_at":"2026-07-05T00:10:12.155422+00:00","updated_at":"2026-07-05T00:10:12.155422+00:00"}