{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:LZV6LXMRGOJM2JJO25XBTPJQRP","short_pith_number":"pith:LZV6LXMR","canonical_record":{"source":{"id":"2401.16378","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-29T18:18:11Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"4137434fa1c9fbd0ed636c9344e64635b38d2b5084a75bc9d18c3b5303dc81b0","abstract_canon_sha256":"4dcd3b6f4e04259e031dd3bc6a12a718378efc0acbb92113ba45ad72a32042fd"},"schema_version":"1.0"},"canonical_sha256":"5e6be5dd913392cd252ed76e19bd308bd378098af8e7fbba2ecb6b70c9414e71","source":{"kind":"arxiv","id":"2401.16378","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.16378","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.16378v2","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16378","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"LZV6LXMRGOJM","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"LZV6LXMRGOJM2JJO","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"LZV6LXMR","created_at":"2026-07-05T07:39:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:LZV6LXMRGOJM2JJO25XBTPJQRP","target":"record","payload":{"canonical_record":{"source":{"id":"2401.16378","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-29T18:18:11Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"4137434fa1c9fbd0ed636c9344e64635b38d2b5084a75bc9d18c3b5303dc81b0","abstract_canon_sha256":"4dcd3b6f4e04259e031dd3bc6a12a718378efc0acbb92113ba45ad72a32042fd"},"schema_version":"1.0"},"canonical_sha256":"5e6be5dd913392cd252ed76e19bd308bd378098af8e7fbba2ecb6b70c9414e71","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:15.392634Z","signature_b64":"p38K43E77Nvv1Z6DiYyHGKy/Q5p7sMvsXOoZMacxB0Kry2xq5kDbOQ++3a29OhBu1PJWwvLSdGgvG86JfSFMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e6be5dd913392cd252ed76e19bd308bd378098af8e7fbba2ecb6b70c9414e71","last_reissued_at":"2026-07-05T07:39:15.392250Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:15.392250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.16378","source_version":2,"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-05T07:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pNVuy9H+VgGCBQzMRYYZPTfSiVUvaAosQ8PfrODYVEG1/a3y+jzM6QDX7XhtCLS+QcM7/VTomtfg7joqrFH4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:47:22.999426Z"},"content_sha256":"423a4fc9cb231020c3012293047b07550c587e008465e94f1110799f72d6fdb3","schema_version":"1.0","event_id":"sha256:423a4fc9cb231020c3012293047b07550c587e008465e94f1110799f72d6fdb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:LZV6LXMRGOJM2JJO25XBTPJQRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposing dense matrices into dense Pauli tensors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"quant-ph","authors_text":"Tyson Jones","submitted_at":"2024-01-29T18:18:11Z","abstract_excerpt":"Decomposing a matrix into a weighted sum of Pauli strings is a common chore of the quantum computer scientist, whom is not easily discouraged by exponential scaling. But beware, a naive decomposition can be cubically more expensive than necessary! In this manuscript, we derive a fixed-memory, branchless algorithm to compute the inner product between a 2^N-by-2^N complex matrix and an N-term Pauli tensor in O(2^N) time, by leveraging the Gray code. Our scheme permits the embarrassingly parallel decomposition of a matrix into a weighted sum of Pauli strings in O(8^N) time. We implement our algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16378","kind":"arxiv","version":2},"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/2401.16378/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-05T07:39:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLiBlTKrN3TGJS42cU7ObHcwgeCIF0qa+3wPD6qolTL0NZQyxtg5RDHZpqGIPLaYEvmo65SFsJpSsAgolO4NBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:47:22.999922Z"},"content_sha256":"0b114ec21ab2608cd5c563e1e2851e64eb5e26010ebd479d2e5e92f6c38c6c4d","schema_version":"1.0","event_id":"sha256:0b114ec21ab2608cd5c563e1e2851e64eb5e26010ebd479d2e5e92f6c38c6c4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/bundle.json","state_url":"https://pith.science/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/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-09T23:47:23Z","links":{"resolver":"https://pith.science/pith/LZV6LXMRGOJM2JJO25XBTPJQRP","bundle":"https://pith.science/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/bundle.json","state":"https://pith.science/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LZV6LXMRGOJM2JJO25XBTPJQRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:LZV6LXMRGOJM2JJO25XBTPJQRP","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":"4dcd3b6f4e04259e031dd3bc6a12a718378efc0acbb92113ba45ad72a32042fd","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-29T18:18:11Z","title_canon_sha256":"4137434fa1c9fbd0ed636c9344e64635b38d2b5084a75bc9d18c3b5303dc81b0"},"schema_version":"1.0","source":{"id":"2401.16378","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.16378","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"arxiv_version","alias_value":"2401.16378v2","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.16378","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_12","alias_value":"LZV6LXMRGOJM","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_16","alias_value":"LZV6LXMRGOJM2JJO","created_at":"2026-07-05T07:39:15Z"},{"alias_kind":"pith_short_8","alias_value":"LZV6LXMR","created_at":"2026-07-05T07:39:15Z"}],"graph_snapshots":[{"event_id":"sha256:0b114ec21ab2608cd5c563e1e2851e64eb5e26010ebd479d2e5e92f6c38c6c4d","target":"graph","created_at":"2026-07-05T07:39:15Z","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/2401.16378/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decomposing a matrix into a weighted sum of Pauli strings is a common chore of the quantum computer scientist, whom is not easily discouraged by exponential scaling. But beware, a naive decomposition can be cubically more expensive than necessary! In this manuscript, we derive a fixed-memory, branchless algorithm to compute the inner product between a 2^N-by-2^N complex matrix and an N-term Pauli tensor in O(2^N) time, by leveraging the Gray code. Our scheme permits the embarrassingly parallel decomposition of a matrix into a weighted sum of Pauli strings in O(8^N) time. We implement our algor","authors_text":"Tyson Jones","cross_cats":["math-ph","math.MP"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-29T18:18:11Z","title":"Decomposing dense matrices into dense Pauli tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.16378","kind":"arxiv","version":2},"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:423a4fc9cb231020c3012293047b07550c587e008465e94f1110799f72d6fdb3","target":"record","created_at":"2026-07-05T07:39:15Z","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":"4dcd3b6f4e04259e031dd3bc6a12a718378efc0acbb92113ba45ad72a32042fd","cross_cats_sorted":["math-ph","math.MP"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-01-29T18:18:11Z","title_canon_sha256":"4137434fa1c9fbd0ed636c9344e64635b38d2b5084a75bc9d18c3b5303dc81b0"},"schema_version":"1.0","source":{"id":"2401.16378","kind":"arxiv","version":2}},"canonical_sha256":"5e6be5dd913392cd252ed76e19bd308bd378098af8e7fbba2ecb6b70c9414e71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5e6be5dd913392cd252ed76e19bd308bd378098af8e7fbba2ecb6b70c9414e71","first_computed_at":"2026-07-05T07:39:15.392250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:39:15.392250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p38K43E77Nvv1Z6DiYyHGKy/Q5p7sMvsXOoZMacxB0Kry2xq5kDbOQ++3a29OhBu1PJWwvLSdGgvG86JfSFMBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:39:15.392634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.16378","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:423a4fc9cb231020c3012293047b07550c587e008465e94f1110799f72d6fdb3","sha256:0b114ec21ab2608cd5c563e1e2851e64eb5e26010ebd479d2e5e92f6c38c6c4d"],"state_sha256":"004a6e0d084751eba5d248cbd7f30b4998853953f30d6ac5b6ef063526f66702"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HCHm5CYbrVgQyBucNIty22WjdXzQU0VzgSSGa/+ExVJfp7HO610Aqq9/jcUn1MUZEvye4EmHj5pxLRUnETwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:47:23.005117Z","bundle_sha256":"6bb6fe73ed2a9b11afa558d146b9c5abffec400c3e0fd9b29e234a42ab27f32d"}}