{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U7CTIBKNE7Z2T3QMWOYEWK73RI","short_pith_number":"pith:U7CTIBKN","canonical_record":{"source":{"id":"1607.05404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-19T05:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"969cbcfc878a399dbefe292dd00d229c969b2086ec69b405541547312f2dc362","abstract_canon_sha256":"5cdd20e497b567e78bd0c482933ee56c4cbb83a3f83b2102e54831da1ca7f54a"},"schema_version":"1.0"},"canonical_sha256":"a7c534054d27f3a9ee0cb3b04b2bfb8a3b49d750ec9b3995df591aff17b63a57","source":{"kind":"arxiv","id":"1607.05404","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05404","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05404v1","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05404","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"U7CTIBKNE7Z2","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7CTIBKNE7Z2T3QM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7CTIBKN","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U7CTIBKNE7Z2T3QMWOYEWK73RI","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05404","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-19T05:19:59Z","cross_cats_sorted":[],"title_canon_sha256":"969cbcfc878a399dbefe292dd00d229c969b2086ec69b405541547312f2dc362","abstract_canon_sha256":"5cdd20e497b567e78bd0c482933ee56c4cbb83a3f83b2102e54831da1ca7f54a"},"schema_version":"1.0"},"canonical_sha256":"a7c534054d27f3a9ee0cb3b04b2bfb8a3b49d750ec9b3995df591aff17b63a57","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:53.274821Z","signature_b64":"VymJEhhPaB5C0GsQRV0aEPdNPnbKBJJtA9PXpRgLeqJ2crohfHyiuh/cc45jHRCt7UbZWNmgtqwg2heVwEzSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7c534054d27f3a9ee0cb3b04b2bfb8a3b49d750ec9b3995df591aff17b63a57","last_reissued_at":"2026-05-18T00:24:53.274144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:53.274144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05404","source_version":1,"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:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dXSOaocaIl74BRZaOA60xplu8h0jF0c4bUqtywtUMptzjuScgTQqrwOjS6Krs0QVqY7JH9rl0jRuGGDBMaeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:47:43.488023Z"},"content_sha256":"813590d63aeea6195e2b35b6f09f41bb2a2bf823d3c601ad8163364ac38e50a0","schema_version":"1.0","event_id":"sha256:813590d63aeea6195e2b35b6f09f41bb2a2bf823d3c601ad8163364ac38e50a0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U7CTIBKNE7Z2T3QMWOYEWK73RI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum singular value decomposition of non-sparse low-rank matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adrian Steffens, Patrick Rebentrost, Seth Lloyd","submitted_at":"2016-07-19T05:19:59Z","abstract_excerpt":"In this work, we present a method to exponentiate non-sparse indefinite low-rank matrices on a quantum computer. Given an operation for accessing the elements of the matrix, our method allows singular values and associated singular vectors to be found quantum mechanically in a time exponentially faster in the dimension of the matrix than known classical algorithms. The method extends to non-Hermitian and non-square matrices via embedding matrices. In the context of the generic singular value decomposition of a matrix, we discuss the Procrustes problem of finding a closest isometry to a given m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05404","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":""},"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:24:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HqTbW/eOUZmXgQ+7pTk1WjOqSlPleOjKnMmT0p8qsr+RlEiGCh7gLs4pJ73CTca87V18DmSQkQxIn9cpLyV5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:47:43.488382Z"},"content_sha256":"21d0a11d3ec412e7e5cc6ae97eef090a1808c0bc52ea8823a4d06ebc83e522ab","schema_version":"1.0","event_id":"sha256:21d0a11d3ec412e7e5cc6ae97eef090a1808c0bc52ea8823a4d06ebc83e522ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/bundle.json","state_url":"https://pith.science/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/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-02T17:47:43Z","links":{"resolver":"https://pith.science/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI","bundle":"https://pith.science/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/bundle.json","state":"https://pith.science/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7CTIBKNE7Z2T3QMWOYEWK73RI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U7CTIBKNE7Z2T3QMWOYEWK73RI","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":"5cdd20e497b567e78bd0c482933ee56c4cbb83a3f83b2102e54831da1ca7f54a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-19T05:19:59Z","title_canon_sha256":"969cbcfc878a399dbefe292dd00d229c969b2086ec69b405541547312f2dc362"},"schema_version":"1.0","source":{"id":"1607.05404","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05404","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05404v1","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05404","created_at":"2026-05-18T00:24:53Z"},{"alias_kind":"pith_short_12","alias_value":"U7CTIBKNE7Z2","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7CTIBKNE7Z2T3QM","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7CTIBKN","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:21d0a11d3ec412e7e5cc6ae97eef090a1808c0bc52ea8823a4d06ebc83e522ab","target":"graph","created_at":"2026-05-18T00:24:53Z","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":"In this work, we present a method to exponentiate non-sparse indefinite low-rank matrices on a quantum computer. Given an operation for accessing the elements of the matrix, our method allows singular values and associated singular vectors to be found quantum mechanically in a time exponentially faster in the dimension of the matrix than known classical algorithms. The method extends to non-Hermitian and non-square matrices via embedding matrices. In the context of the generic singular value decomposition of a matrix, we discuss the Procrustes problem of finding a closest isometry to a given m","authors_text":"Adrian Steffens, Patrick Rebentrost, Seth Lloyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-19T05:19:59Z","title":"Quantum singular value decomposition of non-sparse low-rank matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05404","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:813590d63aeea6195e2b35b6f09f41bb2a2bf823d3c601ad8163364ac38e50a0","target":"record","created_at":"2026-05-18T00:24:53Z","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":"5cdd20e497b567e78bd0c482933ee56c4cbb83a3f83b2102e54831da1ca7f54a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-19T05:19:59Z","title_canon_sha256":"969cbcfc878a399dbefe292dd00d229c969b2086ec69b405541547312f2dc362"},"schema_version":"1.0","source":{"id":"1607.05404","kind":"arxiv","version":1}},"canonical_sha256":"a7c534054d27f3a9ee0cb3b04b2bfb8a3b49d750ec9b3995df591aff17b63a57","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7c534054d27f3a9ee0cb3b04b2bfb8a3b49d750ec9b3995df591aff17b63a57","first_computed_at":"2026-05-18T00:24:53.274144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:53.274144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VymJEhhPaB5C0GsQRV0aEPdNPnbKBJJtA9PXpRgLeqJ2crohfHyiuh/cc45jHRCt7UbZWNmgtqwg2heVwEzSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:53.274821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05404","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:813590d63aeea6195e2b35b6f09f41bb2a2bf823d3c601ad8163364ac38e50a0","sha256:21d0a11d3ec412e7e5cc6ae97eef090a1808c0bc52ea8823a4d06ebc83e522ab"],"state_sha256":"10d57c5fed6f648fc13f061f51f9c2e1ff64d54f18d81fe120917dc3aaeff765"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q+CPBEG4y783r31GmKDKNmbP0a58BISW3kPAd6pur5KY5tIsDCz3OL77zd8YtPjaLYR8nME5TCYJMKef6nYHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:47:43.490360Z","bundle_sha256":"674c37d9a9c231bfabc870ad84fbb7ce1e3dfa9eae8cfb6ba2fb71999d45a5b0"}}