{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MRN2GRMCCHTZECB7FDJ5EHHPWM","short_pith_number":"pith:MRN2GRMC","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"},"canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","source":{"kind":"arxiv","id":"1311.1851","version":10},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1851","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1851v10","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1851","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"MRN2GRMCCHTZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRN2GRMCCHTZECB7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRN2GRMC","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MRN2GRMCCHTZECB7FDJ5EHHPWM","target":"record","payload":{"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"},"canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","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"},"source_kind":"arxiv","source_id":"1311.1851","source_version":10,"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LPPlfAUAgb0HrIrH4LG/YRa2N0ms4HrDI6FnH7LHf2KqBtXdnVlhR9ka9DUDbNkg0le0+DYOlbQezWqq3uG2Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:15:57.092591Z"},"content_sha256":"67975420d4c9612f29afaa7edd8df48b62716723df0016d643d6a27220fe91b5","schema_version":"1.0","event_id":"sha256:67975420d4c9612f29afaa7edd8df48b62716723df0016d643d6a27220fe91b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MRN2GRMCCHTZECB7FDJ5EHHPWM","target":"graph","payload":{"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"},"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:39:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JrWXxfdd0FDZJf7w/Bz1MISMXwewPqNPWyUeFLg70mdAmHf8XAB7tORWcqblyELDki6KebUk3jO90Y0oVq4RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T02:15:57.093292Z"},"content_sha256":"14d766c3d67074abb525a9283877b6657e6c2be2f0375d6c593af730ad6adb3b","schema_version":"1.0","event_id":"sha256:14d766c3d67074abb525a9283877b6657e6c2be2f0375d6c593af730ad6adb3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/bundle.json","state_url":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/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-01T02:15:57Z","links":{"resolver":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM","bundle":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/bundle.json","state":"https://pith.science/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MRN2GRMCCHTZECB7FDJ5EHHPWM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MRN2GRMCCHTZECB7FDJ5EHHPWM","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":"06ec5d46b32616890b8e04574875550540a45205307cf6c5e826f3a7a36bab9f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-08T00:11:28Z","title_canon_sha256":"8ba8f5978ad3777aea1e56a68aac2c68f0daddc05856bcd26178bf09e807e73c"},"schema_version":"1.0","source":{"id":"1311.1851","kind":"arxiv","version":10}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1851","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1851v10","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1851","created_at":"2026-05-18T00:39:41Z"},{"alias_kind":"pith_short_12","alias_value":"MRN2GRMCCHTZ","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MRN2GRMCCHTZECB7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MRN2GRMC","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:14d766c3d67074abb525a9283877b6657e6c2be2f0375d6c593af730ad6adb3b","target":"graph","created_at":"2026-05-18T00:39:41Z","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":"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","authors_text":"Guoming Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-08T00:11:28Z","title":"Efficient Quantum Algorithms for Analyzing Large Sparse Electrical Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1851","kind":"arxiv","version":10},"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:67975420d4c9612f29afaa7edd8df48b62716723df0016d643d6a27220fe91b5","target":"record","created_at":"2026-05-18T00:39:41Z","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":"06ec5d46b32616890b8e04574875550540a45205307cf6c5e826f3a7a36bab9f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-11-08T00:11:28Z","title_canon_sha256":"8ba8f5978ad3777aea1e56a68aac2c68f0daddc05856bcd26178bf09e807e73c"},"schema_version":"1.0","source":{"id":"1311.1851","kind":"arxiv","version":10}},"canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"645ba3458211e792083f28d3d21cefb3231ed449f1622e4addd42c745e116fcf","first_computed_at":"2026-05-18T00:39:41.052907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:41.052907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mtqCIvuDpBFgBDjlu1I8HST/7kT2MZ5VfcDDvAf/MwxDrgfEFt0mRoc0X1+Sp28caa3iy7l2ESGd51hW9ZD2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:41.053500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1851","source_kind":"arxiv","source_version":10}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67975420d4c9612f29afaa7edd8df48b62716723df0016d643d6a27220fe91b5","sha256:14d766c3d67074abb525a9283877b6657e6c2be2f0375d6c593af730ad6adb3b"],"state_sha256":"5a3d2669f910012ba8356978a6042f6c8cac5ad328695db5bd846c3f0c68d238"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tH8HPvcxTvDL7E9Z2luCn3gEeTttlLftsLSDQhb+YA7BwLP4CyElELL/bnuWFGSzmcFT6DIim+Ek6TSz0NuuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T02:15:57.097479Z","bundle_sha256":"fbbb36c79a9240d2b7b57ef2c89f9099b361ee68b219a690c2a58f5213c72bd9"}}