{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:QJEYRFOIFDFQQ54H3Z34BH2PQC","short_pith_number":"pith:QJEYRFOI","canonical_record":{"source":{"id":"2607.13191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T18:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"42e8e7738322cfa7ace8aaf90439631ed6d7d78f7bedecfab23d199b5c085d6b","abstract_canon_sha256":"4155a07f599bd2daeede0a68879cfc62d27a8fc60f1ec635a0e6c6963d2ee190"},"schema_version":"1.0"},"canonical_sha256":"82498895c828cb087787de77c09f4f809becd728f2de5ddcb186519d50bf4974","source":{"kind":"arxiv","id":"2607.13191","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13191","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13191v1","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13191","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"QJEYRFOIFDFQ","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"QJEYRFOIFDFQQ54H","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"QJEYRFOI","created_at":"2026-07-16T00:22:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:QJEYRFOIFDFQQ54H3Z34BH2PQC","target":"record","payload":{"canonical_record":{"source":{"id":"2607.13191","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T18:42:40Z","cross_cats_sorted":[],"title_canon_sha256":"42e8e7738322cfa7ace8aaf90439631ed6d7d78f7bedecfab23d199b5c085d6b","abstract_canon_sha256":"4155a07f599bd2daeede0a68879cfc62d27a8fc60f1ec635a0e6c6963d2ee190"},"schema_version":"1.0"},"canonical_sha256":"82498895c828cb087787de77c09f4f809becd728f2de5ddcb186519d50bf4974","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:02.126400Z","signature_b64":"1s1ahHZh88f+AtFWEeMNcMH7sCU1ejKuGyljpY0wLOuST89FRAqU/qSR31dj8E+nymDiXidqN92JGwDKoFLrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82498895c828cb087787de77c09f4f809becd728f2de5ddcb186519d50bf4974","last_reissued_at":"2026-07-16T00:22:02.125544Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:02.125544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.13191","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-07-16T00:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIpGaXTYu3RwWNCyrb9aJTGEPsU1btHb2AGp8OzeGkPjITZYt0SLBl25IB4Yf460SpNRDRtJjj5z6dZ7mwFHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:58:21.705578Z"},"content_sha256":"b7bceedcd774d46b13b0206e6d034a5cd5bda3da7a1fb949745920ff9ca4ea74","schema_version":"1.0","event_id":"sha256:b7bceedcd774d46b13b0206e6d034a5cd5bda3da7a1fb949745920ff9ca4ea74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:QJEYRFOIFDFQQ54H3Z34BH2PQC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alessandro Berti, Alessandro Poggiali, Anna Bernasconi, Giacomo Antonioli, Gianna M. Del Corso","submitted_at":"2026-07-14T18:42:40Z","abstract_excerpt":"Matrix chain multiplication -- computing $\\mathcal{W} = M^{(0)}\\cdots M^{(K-1)}$ where $M^{(k)} \\in \\mathbb{R}^{P_k \\times P_{k+1}}$ -- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \\emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\\mathcal{O}(\\max_{k} \\mathrm{pol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13191","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.13191/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"},"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-07-16T00:22:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9H2oEbN5qp4envyVcbtNzj1XKdyt2iCZXxaFgZXm8qik8aYRnNZOtpnRWFx/bIxAhiEbakm3q6NyKw2Oyec2CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:58:21.706198Z"},"content_sha256":"6731653634a01accec4b49f03417127a1bb2ae69f7895ae0bff38f6adc347f92","schema_version":"1.0","event_id":"sha256:6731653634a01accec4b49f03417127a1bb2ae69f7895ae0bff38f6adc347f92"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:QJEYRFOIFDFQQ54H3Z34BH2PQC","target":"integrity","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1103/PhysRevLett.120.050502 resolves to 'Quantum Linear System Algorithm for Dense Matrices'. A reader following the printed text alone cannot reach it.","snippet":"L. Wossnig, Z. Zhao, A. Prakash, Quantum linear sys- tem algorithm for dense matrices, Physical Review Letters 120 (5) (2018) 050502. doi:10.1103/PhysRevLett. 120.050502","arxiv_id":"2607.13191","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":"Quantum Linear System Algorithm for Dense Matrices","printed_excerpt":"10.1103/physrevlett","reconstructed_doi":"10.1103/PhysRevLett.120.050502"},"severity":"advisory","ref_index":9,"audited_at":"2026-08-02T06:10:58.225018Z","event_type":"pith.integrity.v1","detected_doi":"10.1103/PhysRevLett.120.050502","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"93bce839a4bce033fadf71f4b203b512d429b59ae6bf27a75a518db5cad22f49","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Quantum Linear System Algorithm for Dense Matrices","detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":17331,"payload_sha256":"1d1119995135390eea53d3a112db9f0700d3910ab6874f37d6c211b35ac29284","signature_b64":"8NzNd0KEY7Qj23CUyYh9HALeNpQ7Ihgnl+iFEmB/HiLLXWOWxKnRa7qK5rn8SLivsR3O3U9mkYRMSDnmKS/EBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-02T06:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NeraBdYXwXCm4gn6YNhozg53pbRcz510y/ZEK8f0tW+YEBkmFgWjCZ7/WT/HP2Laq7dnNK+MZnJowRqT1T3dCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:58:21.709955Z"},"content_sha256":"950a57bf0090b015dba59d0dc88973d9ebf70397a4e80a773ee538e26be470ab","schema_version":"1.0","event_id":"sha256:950a57bf0090b015dba59d0dc88973d9ebf70397a4e80a773ee538e26be470ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/bundle.json","state_url":"https://pith.science/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/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-08-04T00:58:21Z","links":{"resolver":"https://pith.science/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC","bundle":"https://pith.science/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/bundle.json","state":"https://pith.science/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QJEYRFOIFDFQQ54H3Z34BH2PQC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:QJEYRFOIFDFQQ54H3Z34BH2PQC","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4155a07f599bd2daeede0a68879cfc62d27a8fc60f1ec635a0e6c6963d2ee190","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T18:42:40Z","title_canon_sha256":"42e8e7738322cfa7ace8aaf90439631ed6d7d78f7bedecfab23d199b5c085d6b"},"schema_version":"1.0","source":{"id":"2607.13191","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.13191","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.13191v1","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13191","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_12","alias_value":"QJEYRFOIFDFQ","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_16","alias_value":"QJEYRFOIFDFQQ54H","created_at":"2026-07-16T00:22:02Z"},{"alias_kind":"pith_short_8","alias_value":"QJEYRFOI","created_at":"2026-07-16T00:22:02Z"}],"graph_snapshots":[{"event_id":"sha256:6731653634a01accec4b49f03417127a1bb2ae69f7895ae0bff38f6adc347f92","target":"graph","created_at":"2026-07-16T00:22: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.13191/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Matrix chain multiplication -- computing $\\mathcal{W} = M^{(0)}\\cdots M^{(K-1)}$ where $M^{(k)} \\in \\mathbb{R}^{P_k \\times P_{k+1}}$ -- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \\emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\\mathcal{O}(\\max_{k} \\mathrm{pol","authors_text":"Alessandro Berti, Alessandro Poggiali, Anna Bernasconi, Giacomo Antonioli, Gianna M. Del Corso","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T18:42:40Z","title":"Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13191","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:b7bceedcd774d46b13b0206e6d034a5cd5bda3da7a1fb949745920ff9ca4ea74","target":"record","created_at":"2026-07-16T00:22: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":"4155a07f599bd2daeede0a68879cfc62d27a8fc60f1ec635a0e6c6963d2ee190","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-14T18:42:40Z","title_canon_sha256":"42e8e7738322cfa7ace8aaf90439631ed6d7d78f7bedecfab23d199b5c085d6b"},"schema_version":"1.0","source":{"id":"2607.13191","kind":"arxiv","version":1}},"canonical_sha256":"82498895c828cb087787de77c09f4f809becd728f2de5ddcb186519d50bf4974","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82498895c828cb087787de77c09f4f809becd728f2de5ddcb186519d50bf4974","first_computed_at":"2026-07-16T00:22:02.125544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-16T00:22:02.125544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1s1ahHZh88f+AtFWEeMNcMH7sCU1ejKuGyljpY0wLOuST89FRAqU/qSR31dj8E+nymDiXidqN92JGwDKoFLrAw==","signature_status":"signed_v1","signed_at":"2026-07-16T00:22:02.126400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.13191","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7bceedcd774d46b13b0206e6d034a5cd5bda3da7a1fb949745920ff9ca4ea74","sha256:6731653634a01accec4b49f03417127a1bb2ae69f7895ae0bff38f6adc347f92","sha256:950a57bf0090b015dba59d0dc88973d9ebf70397a4e80a773ee538e26be470ab"],"state_sha256":"20ae66f6604442fe24df33f9a8bdb3e5f381765e3ce2e04bf13e39b82106c460"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edo6M1un9USvqebdI/V4Shnjwhc8+DnU4ttyPd9VeZ4iR6zffXFJTriA5DfxVWEJ5ebYyhQX1r1gvUUPhbTqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T00:58:21.712049Z","bundle_sha256":"7094ca378337535d1d6edd5d397ac4d1274aade1fa47cfb9dfc7913517159a27"}}