{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AXXLU7AYGPFWLNFCLXJCZIOS44","short_pith_number":"pith:AXXLU7AY","schema_version":"1.0","canonical_sha256":"05eeba7c1833cb65b4a25dd22ca1d2e71c5171f5f8637b18fe6aed307e61564d","source":{"kind":"arxiv","id":"1908.06229","version":8},"attestation_state":"computed","paper":{"title":"Quantum solvability of noisy linear problems by divide-and-conquer strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jaewan Kim, Jeongho Bang, Jinhyoung Lee, Kabgyun Jeong, M. S. Kim, Wooyeong Song, Youngrong Lim, Yun-Seong Ji","submitted_at":"2019-08-17T03:07:21Z","abstract_excerpt":"Noisy linear problems have been studied in various science and engineering disciplines. A class of \"hard\" noisy linear problems can be formulated as follows: Given a matrix $\\hat{A}$ and a vector $\\mathbf{b}$ constructed using a finite set of samples, a hidden vector or structure involved in $\\mathbf{b}$ is obtained by solving a noise-corrupted linear equation $\\hat{A}\\mathbf{x} \\approx \\mathbf{b} + \\boldsymbol\\eta$, where $\\boldsymbol\\eta$ is a noise vector that cannot be identified. For solving such a noisy linear problem, we consider a quantum algorithm based on a divide-and-conquer strateg"},"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":"1908.06229","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-17T03:07:21Z","cross_cats_sorted":[],"title_canon_sha256":"c08b625bc591636ffee86d05ae3e1b3a108e74e0b84bfad59c827fb4498a2766","abstract_canon_sha256":"e8882811f59250118c7707846b7cf0735e0b53045395a8c8ec5872ceafbb13e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:42.857813Z","signature_b64":"eh+77hH6G4jbd5JDCnG2becf0dRi699m2eel4lkZGZEruY87Mwfds1KxYS414FClFqYNfg99NjJgOfIl3nMRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05eeba7c1833cb65b4a25dd22ca1d2e71c5171f5f8637b18fe6aed307e61564d","last_reissued_at":"2026-07-05T04:03:42.857413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:42.857413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum solvability of noisy linear problems by divide-and-conquer strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jaewan Kim, Jeongho Bang, Jinhyoung Lee, Kabgyun Jeong, M. S. Kim, Wooyeong Song, Youngrong Lim, Yun-Seong Ji","submitted_at":"2019-08-17T03:07:21Z","abstract_excerpt":"Noisy linear problems have been studied in various science and engineering disciplines. A class of \"hard\" noisy linear problems can be formulated as follows: Given a matrix $\\hat{A}$ and a vector $\\mathbf{b}$ constructed using a finite set of samples, a hidden vector or structure involved in $\\mathbf{b}$ is obtained by solving a noise-corrupted linear equation $\\hat{A}\\mathbf{x} \\approx \\mathbf{b} + \\boldsymbol\\eta$, where $\\boldsymbol\\eta$ is a noise vector that cannot be identified. For solving such a noisy linear problem, we consider a quantum algorithm based on a divide-and-conquer strateg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06229","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.06229/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.06229","created_at":"2026-07-05T04:03:42.857470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.06229v8","created_at":"2026-07-05T04:03:42.857470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06229","created_at":"2026-07-05T04:03:42.857470+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXXLU7AYGPFW","created_at":"2026-07-05T04:03:42.857470+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXXLU7AYGPFWLNFC","created_at":"2026-07-05T04:03:42.857470+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXXLU7AY","created_at":"2026-07-05T04:03:42.857470+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/AXXLU7AYGPFWLNFCLXJCZIOS44","json":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44.json","graph_json":"https://pith.science/api/pith-number/AXXLU7AYGPFWLNFCLXJCZIOS44/graph.json","events_json":"https://pith.science/api/pith-number/AXXLU7AYGPFWLNFCLXJCZIOS44/events.json","paper":"https://pith.science/paper/AXXLU7AY"},"agent_actions":{"view_html":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44","download_json":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44.json","view_paper":"https://pith.science/paper/AXXLU7AY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.06229&json=true","fetch_graph":"https://pith.science/api/pith-number/AXXLU7AYGPFWLNFCLXJCZIOS44/graph.json","fetch_events":"https://pith.science/api/pith-number/AXXLU7AYGPFWLNFCLXJCZIOS44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44/action/storage_attestation","attest_author":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44/action/author_attestation","sign_citation":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44/action/citation_signature","submit_replication":"https://pith.science/pith/AXXLU7AYGPFWLNFCLXJCZIOS44/action/replication_record"}},"created_at":"2026-07-05T04:03:42.857470+00:00","updated_at":"2026-07-05T04:03:42.857470+00:00"}