{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MRN2GRMCCHTZECB7FDJ5EHHPWM","short_pith_number":"pith:MRN2GRMC","schema_version":"1.0","canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","source":{"kind":"arxiv","id":"1311.1851","version":10},"attestation_state":"computed","paper":{"title":"Efficient Quantum Algorithms for Analyzing Large Sparse Electrical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Guoming Wang","submitted_at":"2013-11-08T00:11:28Z","abstract_excerpt":"Analyzing large sparse electrical networks is a fundamental task in physics, electrical engineering and computer science. We propose two classes of quantum algorithms for this task. The first class is based on solving linear systems, and the second class is based on using quantum walks. These algorithms compute various electrical quantities, including voltages, currents, dissipated powers and effective resistances, in time $\\operatorname{poly}(d, c, \\operatorname{log}(N), 1/\\lambda, 1/\\epsilon)$, where $N$ is the number of vertices in the network, $d$ is the maximum unweighted degree of the ve"},"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":"1311.1851","kind":"arxiv","version":10},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-08T00:11:28Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8ba8f5978ad3777aea1e56a68aac2c68f0daddc05856bcd26178bf09e807e73c","abstract_canon_sha256":"06ec5d46b32616890b8e04574875550540a45205307cf6c5e826f3a7a36bab9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:41.053500Z","signature_b64":"mtqCIvuDpBFgBDjlu1I8HST/7kT2MZ5VfcDDvAf/MwxDrgfEFt0mRoc0X1+Sp28caa3iy7l2ESGd51hW9ZD2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","last_reissued_at":"2026-05-18T00:39:41.052907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:41.052907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Quantum Algorithms for Analyzing Large Sparse Electrical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Guoming Wang","submitted_at":"2013-11-08T00:11:28Z","abstract_excerpt":"Analyzing large sparse electrical networks is a fundamental task in physics, electrical engineering and computer science. We propose two classes of quantum algorithms for this task. The first class is based on solving linear systems, and the second class is based on using quantum walks. These algorithms compute various electrical quantities, including voltages, currents, dissipated powers and effective resistances, in time $\\operatorname{poly}(d, c, \\operatorname{log}(N), 1/\\lambda, 1/\\epsilon)$, where $N$ is the number of vertices in the network, $d$ is the maximum unweighted degree of the ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1851","kind":"arxiv","version":10},"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":"1311.1851","created_at":"2026-05-18T00:39:41.052992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1851v10","created_at":"2026-05-18T00:39:41.052992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1851","created_at":"2026-05-18T00:39:41.052992+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRN2GRMCCHTZ","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRN2GRMCCHTZECB7","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRN2GRMC","created_at":"2026-05-18T12:27:52.871228+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/MRN2GRMCCHTZECB7FDJ5EHHPWM","json":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM.json","graph_json":"https://pith.science/api/pith-number/MRN2GRMCCHTZECB7FDJ5EHHPWM/graph.json","events_json":"https://pith.science/api/pith-number/MRN2GRMCCHTZECB7FDJ5EHHPWM/events.json","paper":"https://pith.science/paper/MRN2GRMC"},"agent_actions":{"view_html":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM","download_json":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM.json","view_paper":"https://pith.science/paper/MRN2GRMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1851&json=true","fetch_graph":"https://pith.science/api/pith-number/MRN2GRMCCHTZECB7FDJ5EHHPWM/graph.json","fetch_events":"https://pith.science/api/pith-number/MRN2GRMCCHTZECB7FDJ5EHHPWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/action/storage_attestation","attest_author":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/action/author_attestation","sign_citation":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/action/citation_signature","submit_replication":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/action/replication_record"}},"created_at":"2026-05-18T00:39:41.052992+00:00","updated_at":"2026-05-18T00:39:41.052992+00:00"}