{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WWFESP7B4QZ6TH4ZIWBMVVEAGU","short_pith_number":"pith:WWFESP7B","canonical_record":{"source":{"id":"1305.0526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-02T18:06:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"12c52d9576aff6443627967198aca9ab9b91336a729c680fb37050902eaf1f43","abstract_canon_sha256":"72a6afcf5007d9dfc7e95318ea8e189f3edd8e5e9a10ba51b8b25fbfda6bb9e8"},"schema_version":"1.0"},"canonical_sha256":"b58a493fe1e433e99f994582cad480351b30c10a14dd1e5decd32a2645fc6759","source":{"kind":"arxiv","id":"1305.0526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0526","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0526v2","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0526","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"WWFESP7B4QZ6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WWFESP7B4QZ6TH4Z","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WWFESP7B","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WWFESP7B4QZ6TH4ZIWBMVVEAGU","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-02T18:06:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"12c52d9576aff6443627967198aca9ab9b91336a729c680fb37050902eaf1f43","abstract_canon_sha256":"72a6afcf5007d9dfc7e95318ea8e189f3edd8e5e9a10ba51b8b25fbfda6bb9e8"},"schema_version":"1.0"},"canonical_sha256":"b58a493fe1e433e99f994582cad480351b30c10a14dd1e5decd32a2645fc6759","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:27.644260Z","signature_b64":"4ipFfwIOGvad8v6dkscYBoDFkj2XE8+yKc17nBbvGFHm7jv/bUbsIqQ6bZy2AMlo5cekqLocxL6Q05v4/RE2Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b58a493fe1e433e99f994582cad480351b30c10a14dd1e5decd32a2645fc6759","last_reissued_at":"2026-05-18T01:08:27.643665Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:27.643665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0526","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-18T01:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V85ct8OtVdtzl5gl3/ElEVQfQ7AU4vkXEqYEr2IWMluCX0HoG6tV1SIEhywdLykvkFlcIRiEQzjRQZE4jEsIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:55.774107Z"},"content_sha256":"ef2318e1b293c94809dd86832e480600685b2611aa08b8be9648dcf87f90fde5","schema_version":"1.0","event_id":"sha256:ef2318e1b293c94809dd86832e480600685b2611aa08b8be9648dcf87f90fde5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WWFESP7B4QZ6TH4ZIWBMVVEAGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix Inversion Is As Easy As Exponentiation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Nisheeth K. Vishnoi, Sushant Sachdeva","submitted_at":"2013-05-02T18:06:54Z","abstract_excerpt":"We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and exponentiation up to polylogarithmic factors. In particular, this connection justifies the use of Laplacian solvers for designing fast semi-definite programming based algorithms for certain graph problems. The proof relies on the Euler-Maclaurin formula and certain bounds derived from the Riemann zeta function."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0526","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-18T01:08:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IKNSNRlo4B7bFT3W8CY6MYp34SQlDHp+BZ8sSqSBqdGW5KwDLAKJwGNcxfwPH0bDGB9fIa+y+JvaRvxSRz42Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:35:55.774803Z"},"content_sha256":"ec82c3f40e4144709d716ff4b2f14890617921b0c7a9ed57c67e5e5d6a27c57a","schema_version":"1.0","event_id":"sha256:ec82c3f40e4144709d716ff4b2f14890617921b0c7a9ed57c67e5e5d6a27c57a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/bundle.json","state_url":"https://pith.science/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/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-05-26T11:35:55Z","links":{"resolver":"https://pith.science/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU","bundle":"https://pith.science/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/bundle.json","state":"https://pith.science/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWFESP7B4QZ6TH4ZIWBMVVEAGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WWFESP7B4QZ6TH4ZIWBMVVEAGU","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":"72a6afcf5007d9dfc7e95318ea8e189f3edd8e5e9a10ba51b8b25fbfda6bb9e8","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-02T18:06:54Z","title_canon_sha256":"12c52d9576aff6443627967198aca9ab9b91336a729c680fb37050902eaf1f43"},"schema_version":"1.0","source":{"id":"1305.0526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0526","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0526v2","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0526","created_at":"2026-05-18T01:08:27Z"},{"alias_kind":"pith_short_12","alias_value":"WWFESP7B4QZ6","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"WWFESP7B4QZ6TH4Z","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"WWFESP7B","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:ec82c3f40e4144709d716ff4b2f14890617921b0c7a9ed57c67e5e5d6a27c57a","target":"graph","created_at":"2026-05-18T01:08:27Z","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":"We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and exponentiation up to polylogarithmic factors. In particular, this connection justifies the use of Laplacian solvers for designing fast semi-definite programming based algorithms for certain graph problems. The proof relies on the Euler-Maclaurin formula and certain bounds derived from the Riemann zeta function.","authors_text":"Nisheeth K. Vishnoi, Sushant Sachdeva","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-02T18:06:54Z","title":"Matrix Inversion Is As Easy As Exponentiation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0526","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:ef2318e1b293c94809dd86832e480600685b2611aa08b8be9648dcf87f90fde5","target":"record","created_at":"2026-05-18T01:08:27Z","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":"72a6afcf5007d9dfc7e95318ea8e189f3edd8e5e9a10ba51b8b25fbfda6bb9e8","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-02T18:06:54Z","title_canon_sha256":"12c52d9576aff6443627967198aca9ab9b91336a729c680fb37050902eaf1f43"},"schema_version":"1.0","source":{"id":"1305.0526","kind":"arxiv","version":2}},"canonical_sha256":"b58a493fe1e433e99f994582cad480351b30c10a14dd1e5decd32a2645fc6759","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b58a493fe1e433e99f994582cad480351b30c10a14dd1e5decd32a2645fc6759","first_computed_at":"2026-05-18T01:08:27.643665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:27.643665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ipFfwIOGvad8v6dkscYBoDFkj2XE8+yKc17nBbvGFHm7jv/bUbsIqQ6bZy2AMlo5cekqLocxL6Q05v4/RE2Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:27.644260Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef2318e1b293c94809dd86832e480600685b2611aa08b8be9648dcf87f90fde5","sha256:ec82c3f40e4144709d716ff4b2f14890617921b0c7a9ed57c67e5e5d6a27c57a"],"state_sha256":"71b7401f309afda75287ea58051cc5a273329b207883d866c82a828d419818cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YTqxCWF+wMppaZFAnfjG/2BaAUDM/XhbgOjc0CSDNFdEOGwXQ35PLt3HAX4xyLhu4NjWwiBiCCs7xtUKbL79Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:35:55.778502Z","bundle_sha256":"9f014ebb54a93c3a40e6d4a7fa3fb0dafd1095cf11be2193a03e823a51d15670"}}