{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:INOFUY3UQYDVTPOANXAXP3A6XO","short_pith_number":"pith:INOFUY3U","canonical_record":{"source":{"id":"2606.31952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"7a3b8323338434a2f6666e95792be6d8d44a19ffb66004510575eb8f6e140814","abstract_canon_sha256":"7b8a607d60e2f23459ce5fe1781ab88ba24d4f25016f7fd2fefdcf24eecd7523"},"schema_version":"1.0"},"canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","source":{"kind":"arxiv","id":"2606.31952","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31952","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31952v1","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31952","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_12","alias_value":"INOFUY3UQYDV","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_16","alias_value":"INOFUY3UQYDVTPOA","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_8","alias_value":"INOFUY3U","created_at":"2026-07-01T01:18:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:INOFUY3UQYDVTPOANXAXP3A6XO","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31952","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","cross_cats_sorted":[],"title_canon_sha256":"7a3b8323338434a2f6666e95792be6d8d44a19ffb66004510575eb8f6e140814","abstract_canon_sha256":"7b8a607d60e2f23459ce5fe1781ab88ba24d4f25016f7fd2fefdcf24eecd7523"},"schema_version":"1.0"},"canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:26.846089Z","signature_b64":"n9OnWcX/BKe1WDgnbZ17h/oeBZ9gc/LoRVjSRPeS3kix5GmsUtqMXRsStJqZMDAkWgxofmObp4LKhlgX/BbvCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","last_reissued_at":"2026-07-01T01:18:26.845616Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:26.845616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31952","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-01T01:18:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rT6cSq6otZBkH5KrvihCuUXBZBF55/lS807+TNxu56n4EDEBoNLBkjFIfjHw50+klsHoXGgQEi8UWJNb2hOrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:05:24.639253Z"},"content_sha256":"53309ff55ca5ea8092574bccea68f3f5d983dfd8f012879a3205bcc7fd1d9728","schema_version":"1.0","event_id":"sha256:53309ff55ca5ea8092574bccea68f3f5d983dfd8f012879a3205bcc7fd1d9728"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:INOFUY3UQYDVTPOANXAXP3A6XO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient Pauli decomposition algorithm for structured matrices","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexey V. Gorshkov, Daniel J. Spencer, Kishor Bharti","submitted_at":"2026-06-30T16:57:07Z","abstract_excerpt":"Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \\mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We prese"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31952","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/2606.31952/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-01T01:18:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PZo42qAzPMY3CCO9qyctSkBZG21x9ORpZDGbRcY8Z3Q04A0EoTsZFdfwfzvvtzBMUYhHo9LJ2yf0rySY0V4DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T18:05:24.639631Z"},"content_sha256":"dcb440f2b71eb93abda24b94ec14294b9fb957017744dbd8a74eb8a1d2973a98","schema_version":"1.0","event_id":"sha256:dcb440f2b71eb93abda24b94ec14294b9fb957017744dbd8a74eb8a1d2973a98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/bundle.json","state_url":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/INOFUY3UQYDVTPOANXAXP3A6XO/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-07-01T18:05:24Z","links":{"resolver":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO","bundle":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/bundle.json","state":"https://pith.science/pith/INOFUY3UQYDVTPOANXAXP3A6XO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/INOFUY3UQYDVTPOANXAXP3A6XO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:INOFUY3UQYDVTPOANXAXP3A6XO","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":"7b8a607d60e2f23459ce5fe1781ab88ba24d4f25016f7fd2fefdcf24eecd7523","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","title_canon_sha256":"7a3b8323338434a2f6666e95792be6d8d44a19ffb66004510575eb8f6e140814"},"schema_version":"1.0","source":{"id":"2606.31952","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31952","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31952v1","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31952","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_12","alias_value":"INOFUY3UQYDV","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_16","alias_value":"INOFUY3UQYDVTPOA","created_at":"2026-07-01T01:18:26Z"},{"alias_kind":"pith_short_8","alias_value":"INOFUY3U","created_at":"2026-07-01T01:18:26Z"}],"graph_snapshots":[{"event_id":"sha256:dcb440f2b71eb93abda24b94ec14294b9fb957017744dbd8a74eb8a1d2973a98","target":"graph","created_at":"2026-07-01T01:18:26Z","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/2606.31952/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \\mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We prese","authors_text":"Alexey V. Gorshkov, Daniel J. Spencer, Kishor Bharti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","title":"An efficient Pauli decomposition algorithm for structured matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31952","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:53309ff55ca5ea8092574bccea68f3f5d983dfd8f012879a3205bcc7fd1d9728","target":"record","created_at":"2026-07-01T01:18:26Z","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":"7b8a607d60e2f23459ce5fe1781ab88ba24d4f25016f7fd2fefdcf24eecd7523","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-30T16:57:07Z","title_canon_sha256":"7a3b8323338434a2f6666e95792be6d8d44a19ffb66004510575eb8f6e140814"},"schema_version":"1.0","source":{"id":"2606.31952","kind":"arxiv","version":1}},"canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"435c5a6374860759bdc06dc177ec1ebbacd77cc27ac74ba2f634628d084216b5","first_computed_at":"2026-07-01T01:18:26.845616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:26.845616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9OnWcX/BKe1WDgnbZ17h/oeBZ9gc/LoRVjSRPeS3kix5GmsUtqMXRsStJqZMDAkWgxofmObp4LKhlgX/BbvCA==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:26.846089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31952","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53309ff55ca5ea8092574bccea68f3f5d983dfd8f012879a3205bcc7fd1d9728","sha256:dcb440f2b71eb93abda24b94ec14294b9fb957017744dbd8a74eb8a1d2973a98"],"state_sha256":"41d8a977f603bad498749612283f9402f5d97ec9f9562c143467b3f5ce5cbeb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6cmq1sQnWsggFi1taBiTMKjvUlIVrm23xilkh1zDjLIhBB3oNtnkMBzYaGn0mjcMkKyrDNdQvg5Trn8sVaSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T18:05:24.641602Z","bundle_sha256":"ef19606176dfe6e2f4dbf089def919d78833a6f9fb7340211923c0188b9212c2"}}