{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LFPIR4EG7D4BF4MFAH7J72VTOX","short_pith_number":"pith:LFPIR4EG","canonical_record":{"source":{"id":"2507.15537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T12:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"d095fe43a83d6b258e26fc6682a70bae57b733ed8b753e8d7469f9a203d4e31f","abstract_canon_sha256":"f06a110da303d81999fd8c799868b4ea5e193c2b5c65ee8b3c1eda97be2dba13"},"schema_version":"1.0"},"canonical_sha256":"595e88f086f8f812f18501fe9feab375c6e2bdc027cdd694bd95c313648e1e9f","source":{"kind":"arxiv","id":"2507.15537","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15537","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15537v1","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15537","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"LFPIR4EG7D4B","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFPIR4EG7D4BF4MF","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFPIR4EG","created_at":"2026-07-05T11:40:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LFPIR4EG7D4BF4MFAH7J72VTOX","target":"record","payload":{"canonical_record":{"source":{"id":"2507.15537","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T12:04:56Z","cross_cats_sorted":[],"title_canon_sha256":"d095fe43a83d6b258e26fc6682a70bae57b733ed8b753e8d7469f9a203d4e31f","abstract_canon_sha256":"f06a110da303d81999fd8c799868b4ea5e193c2b5c65ee8b3c1eda97be2dba13"},"schema_version":"1.0"},"canonical_sha256":"595e88f086f8f812f18501fe9feab375c6e2bdc027cdd694bd95c313648e1e9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:38.851704Z","signature_b64":"rHCfBTzL/NafJg6awLBKA4H5EgwQQFJnhgz7uOjOuRQtWlJm/hrheOq3l0yBZddwmFtIGz1o5TwLYn3G3QRJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"595e88f086f8f812f18501fe9feab375c6e2bdc027cdd694bd95c313648e1e9f","last_reissued_at":"2026-07-05T11:40:38.851244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:38.851244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.15537","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-05T11:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"manNJgBcusjeiyb/shoPQ04MYyfVtB2Y4+r14dyffcc78Rns5hg3C6m8lWgGReyCsHtUolA4cyH3DC2Lt1IBDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:30.806469Z"},"content_sha256":"6cdb80cfa9938f4512537707875144f9c71dee0aa8e7498f8147189056a4b942","schema_version":"1.0","event_id":"sha256:6cdb80cfa9938f4512537707875144f9c71dee0aa8e7498f8147189056a4b942"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LFPIR4EG7D4BF4MFAH7J72VTOX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Matrix inversion polynomials for the quantum singular value transformation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adnaan Walayat, Andrew Patterson, Bjorn K. Berntson, Christoph S\\\"underhauf, Zal\\'an N\\'emeth","submitted_at":"2025-07-21T12:04:56Z","abstract_excerpt":"Quantum matrix inversion with the quantum singular value transformation (QSVT) requires a polynomial approximation to $1/x$. Several methods from the literature construct polynomials that achieve the known degree complexity $\\mathcal{O}(\\kappa\\log(\\kappa/\\varepsilon))$ with condition number $\\kappa$ and uniform error $\\varepsilon$. However, the \\emph{optimal} polynomial with lowest degree for fixed error $\\varepsilon$ can only be approximated numerically with the resource-intensive Remez method, leading to impractical preprocessing runtimes. Here, we derive an analytic shortcut to the optimal "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15537","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/2507.15537/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-05T11:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+SutWezPhb6Zbx8JfdIvJ3KiD39hbs/xpxJPLY3x7xAZxciPoyaWa8OJ0A1H8RxaaLEt7MH/B+HnRsk3cY1QDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:32:30.806969Z"},"content_sha256":"58fc6e2129703611e9af2cde7953cabe681c9df30b85b732ff95ad56173167a6","schema_version":"1.0","event_id":"sha256:58fc6e2129703611e9af2cde7953cabe681c9df30b85b732ff95ad56173167a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/bundle.json","state_url":"https://pith.science/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/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-07T10:32:30Z","links":{"resolver":"https://pith.science/pith/LFPIR4EG7D4BF4MFAH7J72VTOX","bundle":"https://pith.science/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/bundle.json","state":"https://pith.science/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LFPIR4EG7D4BF4MFAH7J72VTOX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LFPIR4EG7D4BF4MFAH7J72VTOX","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":"f06a110da303d81999fd8c799868b4ea5e193c2b5c65ee8b3c1eda97be2dba13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T12:04:56Z","title_canon_sha256":"d095fe43a83d6b258e26fc6682a70bae57b733ed8b753e8d7469f9a203d4e31f"},"schema_version":"1.0","source":{"id":"2507.15537","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.15537","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"2507.15537v1","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15537","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"LFPIR4EG7D4B","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_16","alias_value":"LFPIR4EG7D4BF4MF","created_at":"2026-07-05T11:40:38Z"},{"alias_kind":"pith_short_8","alias_value":"LFPIR4EG","created_at":"2026-07-05T11:40:38Z"}],"graph_snapshots":[{"event_id":"sha256:58fc6e2129703611e9af2cde7953cabe681c9df30b85b732ff95ad56173167a6","target":"graph","created_at":"2026-07-05T11:40:38Z","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/2507.15537/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum matrix inversion with the quantum singular value transformation (QSVT) requires a polynomial approximation to $1/x$. Several methods from the literature construct polynomials that achieve the known degree complexity $\\mathcal{O}(\\kappa\\log(\\kappa/\\varepsilon))$ with condition number $\\kappa$ and uniform error $\\varepsilon$. However, the \\emph{optimal} polynomial with lowest degree for fixed error $\\varepsilon$ can only be approximated numerically with the resource-intensive Remez method, leading to impractical preprocessing runtimes. Here, we derive an analytic shortcut to the optimal ","authors_text":"Adnaan Walayat, Andrew Patterson, Bjorn K. Berntson, Christoph S\\\"underhauf, Zal\\'an N\\'emeth","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T12:04:56Z","title":"Matrix inversion polynomials for the quantum singular value transformation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15537","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:6cdb80cfa9938f4512537707875144f9c71dee0aa8e7498f8147189056a4b942","target":"record","created_at":"2026-07-05T11:40:38Z","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":"f06a110da303d81999fd8c799868b4ea5e193c2b5c65ee8b3c1eda97be2dba13","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-21T12:04:56Z","title_canon_sha256":"d095fe43a83d6b258e26fc6682a70bae57b733ed8b753e8d7469f9a203d4e31f"},"schema_version":"1.0","source":{"id":"2507.15537","kind":"arxiv","version":1}},"canonical_sha256":"595e88f086f8f812f18501fe9feab375c6e2bdc027cdd694bd95c313648e1e9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"595e88f086f8f812f18501fe9feab375c6e2bdc027cdd694bd95c313648e1e9f","first_computed_at":"2026-07-05T11:40:38.851244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:40:38.851244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rHCfBTzL/NafJg6awLBKA4H5EgwQQFJnhgz7uOjOuRQtWlJm/hrheOq3l0yBZddwmFtIGz1o5TwLYn3G3QRJAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:40:38.851704Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.15537","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cdb80cfa9938f4512537707875144f9c71dee0aa8e7498f8147189056a4b942","sha256:58fc6e2129703611e9af2cde7953cabe681c9df30b85b732ff95ad56173167a6"],"state_sha256":"7b4d888db546f2aa63ce202a5382427169bce0e8c81aac7c3df048f489b8b69a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n5Wcy6blzJ8tFp+ZYilysqudoJMcs1lU7unM4S1Uf2YWgyPBCxIOuTW5RpATvI9hlCBkdOvi7CnYOukZlqzpBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:32:30.810894Z","bundle_sha256":"aae65a6fefa619e85646415006a45ee246ad76ad97d708ad5b10dc69a03d3c41"}}