{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MJSFEYFVRSCM4DVWGLYF6PEJ3R","short_pith_number":"pith:MJSFEYFV","canonical_record":{"source":{"id":"1811.04852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T16:57:33Z","cross_cats_sorted":["cs.IR","cs.LG","quant-ph"],"title_canon_sha256":"13494b989cf189b4047c13eb70c67ca3fd6de2df63184c1e5037e1fa70c322be","abstract_canon_sha256":"6fac3993cded40a5a83df88fb7631be5185ad698bb851c4e239c186298144ff7"},"schema_version":"1.0"},"canonical_sha256":"62645260b58c84ce0eb632f05f3c89dc6239b2219f4b1072b89c0e4a99a1cc8b","source":{"kind":"arxiv","id":"1811.04852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04852","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04852v1","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04852","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"MJSFEYFVRSCM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJSFEYFVRSCM4DVW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJSFEYFV","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MJSFEYFVRSCM4DVWGLYF6PEJ3R","target":"record","payload":{"canonical_record":{"source":{"id":"1811.04852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T16:57:33Z","cross_cats_sorted":["cs.IR","cs.LG","quant-ph"],"title_canon_sha256":"13494b989cf189b4047c13eb70c67ca3fd6de2df63184c1e5037e1fa70c322be","abstract_canon_sha256":"6fac3993cded40a5a83df88fb7631be5185ad698bb851c4e239c186298144ff7"},"schema_version":"1.0"},"canonical_sha256":"62645260b58c84ce0eb632f05f3c89dc6239b2219f4b1072b89c0e4a99a1cc8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:02.272742Z","signature_b64":"vFuEFkERUMZmBQ/zwnDIYpT80Ci0HnM8P2joT9Ia0k85fefN8NOnUFr7S4sUOMlxWVArvg38ql+9XXwZ041xAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62645260b58c84ce0eb632f05f3c89dc6239b2219f4b1072b89c0e4a99a1cc8b","last_reissued_at":"2026-05-18T00:01:02.272140Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:02.272140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.04852","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:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LSoSFs/YLjxIJ3Xju0XqNWJ6/ItB+4a9dgAUH0OhyBmzgKseRXm88UryY7ONljddV2FwBLbHnfoW1nBL7ETXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:42:42.187141Z"},"content_sha256":"fee97ce1f0ba8d19cfcf7e5165fe220561f3a356abb18d2543259f68adeb884e","schema_version":"1.0","event_id":"sha256:fee97ce1f0ba8d19cfcf7e5165fe220561f3a356abb18d2543259f68adeb884e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MJSFEYFVRSCM4DVWGLYF6PEJ3R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum-inspired sublinear classical algorithms for solving low-rank linear systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG","quant-ph"],"primary_cat":"cs.DS","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia","submitted_at":"2018-11-12T16:57:33Z","abstract_excerpt":"We present classical sublinear-time algorithms for solving low-rank linear systems of equations. Our algorithms are inspired by the HHL quantum algorithm for solving linear systems and the recent breakthrough by Tang of dequantizing the quantum algorithm for recommendation systems. Let $A \\in \\mathbb{C}^{m \\times n}$ be a rank-$k$ matrix, and $b \\in \\mathbb{C}^m$ be a vector. We present two algorithms: a \"sampling\" algorithm that provides a sample from $A^{-1}b$ and a \"query\" algorithm that outputs an estimate of an entry of $A^{-1}b$, where $A^{-1}$ denotes the Moore-Penrose pseudo-inverse. B"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04852","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:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4TmQTKykY1CyBbvs8bR5gVKAJYrV0vZfHb6KpliIjGFZh3MVV3BytjTHrXnSIcrgem5Dfx4ZUDxrcBan7ljxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:42:42.187858Z"},"content_sha256":"be2cac2b348173dc215185e84910b50c73f3e8ecdd8efee40bc35cc6f0c8d102","schema_version":"1.0","event_id":"sha256:be2cac2b348173dc215185e84910b50c73f3e8ecdd8efee40bc35cc6f0c8d102"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/bundle.json","state_url":"https://pith.science/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/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-31T14:42:42Z","links":{"resolver":"https://pith.science/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R","bundle":"https://pith.science/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/bundle.json","state":"https://pith.science/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJSFEYFVRSCM4DVWGLYF6PEJ3R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MJSFEYFVRSCM4DVWGLYF6PEJ3R","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":"6fac3993cded40a5a83df88fb7631be5185ad698bb851c4e239c186298144ff7","cross_cats_sorted":["cs.IR","cs.LG","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T16:57:33Z","title_canon_sha256":"13494b989cf189b4047c13eb70c67ca3fd6de2df63184c1e5037e1fa70c322be"},"schema_version":"1.0","source":{"id":"1811.04852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.04852","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.04852v1","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.04852","created_at":"2026-05-18T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"MJSFEYFVRSCM","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MJSFEYFVRSCM4DVW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MJSFEYFV","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:be2cac2b348173dc215185e84910b50c73f3e8ecdd8efee40bc35cc6f0c8d102","target":"graph","created_at":"2026-05-18T00:01:02Z","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 present classical sublinear-time algorithms for solving low-rank linear systems of equations. Our algorithms are inspired by the HHL quantum algorithm for solving linear systems and the recent breakthrough by Tang of dequantizing the quantum algorithm for recommendation systems. Let $A \\in \\mathbb{C}^{m \\times n}$ be a rank-$k$ matrix, and $b \\in \\mathbb{C}^m$ be a vector. We present two algorithms: a \"sampling\" algorithm that provides a sample from $A^{-1}b$ and a \"query\" algorithm that outputs an estimate of an entry of $A^{-1}b$, where $A^{-1}$ denotes the Moore-Penrose pseudo-inverse. B","authors_text":"Chunhao Wang, Han-Hsuan Lin, Nai-Hui Chia","cross_cats":["cs.IR","cs.LG","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T16:57:33Z","title":"Quantum-inspired sublinear classical algorithms for solving low-rank linear systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.04852","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:fee97ce1f0ba8d19cfcf7e5165fe220561f3a356abb18d2543259f68adeb884e","target":"record","created_at":"2026-05-18T00:01:02Z","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":"6fac3993cded40a5a83df88fb7631be5185ad698bb851c4e239c186298144ff7","cross_cats_sorted":["cs.IR","cs.LG","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T16:57:33Z","title_canon_sha256":"13494b989cf189b4047c13eb70c67ca3fd6de2df63184c1e5037e1fa70c322be"},"schema_version":"1.0","source":{"id":"1811.04852","kind":"arxiv","version":1}},"canonical_sha256":"62645260b58c84ce0eb632f05f3c89dc6239b2219f4b1072b89c0e4a99a1cc8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62645260b58c84ce0eb632f05f3c89dc6239b2219f4b1072b89c0e4a99a1cc8b","first_computed_at":"2026-05-18T00:01:02.272140Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:02.272140Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vFuEFkERUMZmBQ/zwnDIYpT80Ci0HnM8P2joT9Ia0k85fefN8NOnUFr7S4sUOMlxWVArvg38ql+9XXwZ041xAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:02.272742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.04852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fee97ce1f0ba8d19cfcf7e5165fe220561f3a356abb18d2543259f68adeb884e","sha256:be2cac2b348173dc215185e84910b50c73f3e8ecdd8efee40bc35cc6f0c8d102"],"state_sha256":"98a1dec1a91b4f161f75d7a212f146c6c17f3d119b29d3b5293c32806aa09957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eAYEhmCRAGTUscMPJ8O48JbVA6BBhArqSHxIV2hWlQlO/3Ou7fXo+3FSfO4rT1M+vOM3sKk3+u3cU20ODinPCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:42:42.191531Z","bundle_sha256":"c218e2a18b5b9a257e466073522e12f4e30cd6bd15cb8c4617e5dc7b168fab30"}}