{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:Q75VZ2CGP6FFLSIXXENUHDYB2P","short_pith_number":"pith:Q75VZ2CG","canonical_record":{"source":{"id":"1005.1318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"00140d7d0e7a02f1867afaa189bdfa8faddd59991d11d5036491e6757638b325","abstract_canon_sha256":"81fbb2b2259ad57a8cede27723f3a4c61c067cc23e540134c2ed94eebd2d51e4"},"schema_version":"1.0"},"canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","source":{"kind":"arxiv","id":"1005.1318","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1318","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1318v3","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1318","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q75VZ2CGP6FF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q75VZ2CGP6FFLSIX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q75VZ2CG","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:Q75VZ2CGP6FFLSIXXENUHDYB2P","target":"record","payload":{"canonical_record":{"source":{"id":"1005.1318","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"00140d7d0e7a02f1867afaa189bdfa8faddd59991d11d5036491e6757638b325","abstract_canon_sha256":"81fbb2b2259ad57a8cede27723f3a4c61c067cc23e540134c2ed94eebd2d51e4"},"schema_version":"1.0"},"canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:38.836213Z","signature_b64":"jA2wTPcxG/6er+JTBt7xnWGNwmLNkQRuOrOSJ47fSXcf8ZvZxY0sEBndyNQLgWZKfyBcLxuIIiFL/ElDAEaIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","last_reissued_at":"2026-05-18T04:39:38.835761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:38.835761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.1318","source_version":3,"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-05-18T04:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2T+Eh9dMhx5xZMUVap2cFPKo2q8mgGG4LXOKWxFO3c7RlKrd4QeJuksjkif6bggZQA1PYrap3JuPYs/8mFbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:40:23.962838Z"},"content_sha256":"cc6a98371e287e575f8a62838f78f3fc1cf8fd0db30def3cdaf88c5e65a88eb3","schema_version":"1.0","event_id":"sha256:cc6a98371e287e575f8a62838f78f3fc1cf8fd0db30def3cdaf88c5e65a88eb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:Q75VZ2CGP6FFLSIXXENUHDYB2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Efficiency of Quantum Algorithms for Hamiltonian Simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Anargyros Papageorgiou, Chi Zhang","submitted_at":"2010-05-08T02:08:01Z","abstract_excerpt":"We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1318","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T04:39:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GTg6e5wGt69RSOF98shr1HmmBbpqlQy/x0HwOwBMd3aB3FOl6sXRC2yROIAc6myRhCyLVlDNljdaYtew4xF9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:40:23.963420Z"},"content_sha256":"f0a17ff701bf45558bb1ccef7e984ad6c1080f4b0ac8ad007eaec68713e7d26d","schema_version":"1.0","event_id":"sha256:f0a17ff701bf45558bb1ccef7e984ad6c1080f4b0ac8ad007eaec68713e7d26d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/bundle.json","state_url":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/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-06-02T11:40:23Z","links":{"resolver":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P","bundle":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/bundle.json","state":"https://pith.science/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q75VZ2CGP6FFLSIXXENUHDYB2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:Q75VZ2CGP6FFLSIXXENUHDYB2P","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":"81fbb2b2259ad57a8cede27723f3a4c61c067cc23e540134c2ed94eebd2d51e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","title_canon_sha256":"00140d7d0e7a02f1867afaa189bdfa8faddd59991d11d5036491e6757638b325"},"schema_version":"1.0","source":{"id":"1005.1318","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.1318","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1005.1318v3","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1318","created_at":"2026-05-18T04:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"Q75VZ2CGP6FF","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"Q75VZ2CGP6FFLSIX","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"Q75VZ2CG","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:f0a17ff701bf45558bb1ccef7e984ad6c1080f4b0ac8ad007eaec68713e7d26d","target":"graph","created_at":"2026-05-18T04:39: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"},"paper":{"abstract_excerpt":"We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number of exponentials required to approximate $e^{-iHt}$ with error $\\e$. Moreover, we derive the order of the splitting method that optimizes the cost of the resulting algorithm. We show significant speedups relative to previously known results.","authors_text":"Anargyros Papageorgiou, Chi Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","title":"On the Efficiency of Quantum Algorithms for Hamiltonian Simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1318","kind":"arxiv","version":3},"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:cc6a98371e287e575f8a62838f78f3fc1cf8fd0db30def3cdaf88c5e65a88eb3","target":"record","created_at":"2026-05-18T04:39: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":"81fbb2b2259ad57a8cede27723f3a4c61c067cc23e540134c2ed94eebd2d51e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2010-05-08T02:08:01Z","title_canon_sha256":"00140d7d0e7a02f1867afaa189bdfa8faddd59991d11d5036491e6757638b325"},"schema_version":"1.0","source":{"id":"1005.1318","kind":"arxiv","version":3}},"canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87fb5ce8467f8a55c917b91b438f01d3f95acfc37d574b609197822944062466","first_computed_at":"2026-05-18T04:39:38.835761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:38.835761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jA2wTPcxG/6er+JTBt7xnWGNwmLNkQRuOrOSJ47fSXcf8ZvZxY0sEBndyNQLgWZKfyBcLxuIIiFL/ElDAEaIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:38.836213Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.1318","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc6a98371e287e575f8a62838f78f3fc1cf8fd0db30def3cdaf88c5e65a88eb3","sha256:f0a17ff701bf45558bb1ccef7e984ad6c1080f4b0ac8ad007eaec68713e7d26d"],"state_sha256":"c5a29b4df9b47bce43e1a7cae702c60d02388470c83697fd224f27ddf7ec0a0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JX9fkpmkvB51eHeOjT7ETvriT4J7VhbUTMkLeXvRFaZ31/uGi1ZiPzldafdDREMQQ4iRBFWCIwLAWBKSFAHBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:40:23.965930Z","bundle_sha256":"f8936803d2eac20b099773c54e12f727c9534770cd5d175fe0cd3dc32e3ea5ea"}}