{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6HZE7F54Z6VDYDDEPOP6SESZB2","short_pith_number":"pith:6HZE7F54","canonical_record":{"source":{"id":"2607.19852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"7de7cfdedfe39de045bd2e6aa46f06b02875b859c7fbe2076d46257f55af5acd","abstract_canon_sha256":"a97e20aab017ecf3ba17e113e3fe1927573d7f70f0ae3e7b2ec6f8893213e0e0"},"schema_version":"1.0"},"canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","source":{"kind":"arxiv","id":"2607.19852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19852","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19852v1","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19852","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"6HZE7F54Z6VD","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HZE7F54Z6VDYDDE","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HZE7F54","created_at":"2026-07-23T01:24:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6HZE7F54Z6VDYDDEPOP6SESZB2","target":"record","payload":{"canonical_record":{"source":{"id":"2607.19852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","cross_cats_sorted":[],"title_canon_sha256":"7de7cfdedfe39de045bd2e6aa46f06b02875b859c7fbe2076d46257f55af5acd","abstract_canon_sha256":"a97e20aab017ecf3ba17e113e3fe1927573d7f70f0ae3e7b2ec6f8893213e0e0"},"schema_version":"1.0"},"canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:03.676836Z","signature_b64":"iFnMfNvHykC9Ui8ZIdTHVk1gKEAd/gM16i3RDLCAPFt4Yu5rqFY8auxZzaKWcG8AaEqidrTlb8f43d1tY71sAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","last_reissued_at":"2026-07-23T01:24:03.676014Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:03.676014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.19852","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-23T01:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4zxtjeo70LEY4sT0llRoCJMoAOR8X3vOCpJObiQwaKNxDz8W0IWb7Nd/SGlw37PCBMignIzcdaLzUqPLiiFdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:16:38.357310Z"},"content_sha256":"8811e2749fa47ea1128da08192c879442479c31f7108edc959770833882bcb7b","schema_version":"1.0","event_id":"sha256:8811e2749fa47ea1128da08192c879442479c31f7108edc959770833882bcb7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6HZE7F54Z6VDYDDEPOP6SESZB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Lower Bounds for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Zlokapa, Aram W. Harrow, Richard R. Allen","submitted_at":"2026-07-22T07:41:32Z","abstract_excerpt":"For Hamiltonian $H = \\sum_j h_j$, we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold for arbitrary term norms $\\|h_j\\|$, time $t$, and trace-distance error $\\epsilon$. The matching upper bound (known as composite qDRIFT) consists of high-order Trotterization of the large terms and a randomized first-order Trotterization of the small terms. Unlike prior work that chooses worst-case $\\|h_j\\|$ to encode the computation of parity or other Boolean functions in time evolution, our proof is elementary and b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19852","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.19852/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-23T01:24:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8Tcvf4X2ID4WdrWXE46Md11J3fx+GzgCH7ab8kpbmi3I+vSuKnFqtj4BOFy28upPqdEQF79EHr5dT3EWFPTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T20:16:38.357835Z"},"content_sha256":"9498d8f3f4bf17a7f7c718c1f1d83ce22cd4c4e617a0bd5e30440796bc3a7a87","schema_version":"1.0","event_id":"sha256:9498d8f3f4bf17a7f7c718c1f1d83ce22cd4c4e617a0bd5e30440796bc3a7a87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/bundle.json","state_url":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/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-02T20:16:38Z","links":{"resolver":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2","bundle":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/bundle.json","state":"https://pith.science/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6HZE7F54Z6VDYDDEPOP6SESZB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6HZE7F54Z6VDYDDEPOP6SESZB2","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":"a97e20aab017ecf3ba17e113e3fe1927573d7f70f0ae3e7b2ec6f8893213e0e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","title_canon_sha256":"7de7cfdedfe39de045bd2e6aa46f06b02875b859c7fbe2076d46257f55af5acd"},"schema_version":"1.0","source":{"id":"2607.19852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.19852","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"arxiv_version","alias_value":"2607.19852v1","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19852","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_12","alias_value":"6HZE7F54Z6VD","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_16","alias_value":"6HZE7F54Z6VDYDDE","created_at":"2026-07-23T01:24:03Z"},{"alias_kind":"pith_short_8","alias_value":"6HZE7F54","created_at":"2026-07-23T01:24:03Z"}],"graph_snapshots":[{"event_id":"sha256:9498d8f3f4bf17a7f7c718c1f1d83ce22cd4c4e617a0bd5e30440796bc3a7a87","target":"graph","created_at":"2026-07-23T01:24:03Z","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.19852/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For Hamiltonian $H = \\sum_j h_j$, we prove asymptotically tight lower bounds on the gate and query complexities of simulating time evolution on a quantum computer. Our bounds hold for arbitrary term norms $\\|h_j\\|$, time $t$, and trace-distance error $\\epsilon$. The matching upper bound (known as composite qDRIFT) consists of high-order Trotterization of the large terms and a randomized first-order Trotterization of the small terms. Unlike prior work that chooses worst-case $\\|h_j\\|$ to encode the computation of parity or other Boolean functions in time evolution, our proof is elementary and b","authors_text":"Alexander Zlokapa, Aram W. Harrow, Richard R. Allen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","title":"Optimal Lower Bounds for Hamiltonian Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19852","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:8811e2749fa47ea1128da08192c879442479c31f7108edc959770833882bcb7b","target":"record","created_at":"2026-07-23T01:24:03Z","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":"a97e20aab017ecf3ba17e113e3fe1927573d7f70f0ae3e7b2ec6f8893213e0e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-22T07:41:32Z","title_canon_sha256":"7de7cfdedfe39de045bd2e6aa46f06b02875b859c7fbe2076d46257f55af5acd"},"schema_version":"1.0","source":{"id":"2607.19852","kind":"arxiv","version":1}},"canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1f24f97bccfaa3c0c647b9fe912590e82edf952dff9c665ef4f37cd153a8ab8","first_computed_at":"2026-07-23T01:24:03.676014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-23T01:24:03.676014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iFnMfNvHykC9Ui8ZIdTHVk1gKEAd/gM16i3RDLCAPFt4Yu5rqFY8auxZzaKWcG8AaEqidrTlb8f43d1tY71sAg==","signature_status":"signed_v1","signed_at":"2026-07-23T01:24:03.676836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.19852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8811e2749fa47ea1128da08192c879442479c31f7108edc959770833882bcb7b","sha256:9498d8f3f4bf17a7f7c718c1f1d83ce22cd4c4e617a0bd5e30440796bc3a7a87"],"state_sha256":"679a37072fbde4effbcaf3b0d73daf5d29e20bbcc24a55e1d3bfe8f8283aac64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0goMcAuQYEofmUwlyFxCNJb6cRZ+XyLCP6bMz8YpgHOwlTkIqFIi4C3o/zsiInGG8/JAx+818O0XgLuI91K6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T20:16:38.361387Z","bundle_sha256":"7b64a8cd128012e3e9fb1c1930151121f667402ba208cf4872ba097e4ec61924"}}