{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U2ZYEBASE7G7TE5KGSCZLPOJKQ","short_pith_number":"pith:U2ZYEBAS","canonical_record":{"source":{"id":"1811.08017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"28132b91cbaf5f33898b128dd38fde12de98afef37bb057de070bcb0fa104e1d","abstract_canon_sha256":"fa6a59ec8e312bf01355a955e5a71f7fc243651fe0976e74b740e74e612c2286"},"schema_version":"1.0"},"canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","source":{"kind":"arxiv","id":"1811.08017","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08017","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08017v2","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08017","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"U2ZYEBASE7G7","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_16","alias_value":"U2ZYEBASE7G7TE5K","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_8","alias_value":"U2ZYEBAS","created_at":"2026-07-04T23:58:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U2ZYEBASE7G7TE5KGSCZLPOJKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08017","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","cross_cats_sorted":[],"title_canon_sha256":"28132b91cbaf5f33898b128dd38fde12de98afef37bb057de070bcb0fa104e1d","abstract_canon_sha256":"fa6a59ec8e312bf01355a955e5a71f7fc243651fe0976e74b740e74e612c2286"},"schema_version":"1.0"},"canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:58:05.150910Z","signature_b64":"KFu5PxiBDPc2FEUP/HXTOSWP9HoRzBz4wgm1QW4avEVwZPdapAk06wTRiI6qj/mPNdnEXjgq7D/rc1aL+Af7CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","last_reissued_at":"2026-07-04T23:58:05.150393Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:58:05.150393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08017","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-04T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cytAw75530W+VaZLmnllgkdRo3WeRIGE3P6Jp2lDt08WjPiySmP5oli1SWQ8CGDVkfvHM7ePkTgYWi9SdnvaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:00:11.373136Z"},"content_sha256":"304795185f15d5cb41631f3dd9eb99519f605378bc01fc0de1c388f8d38e8813","schema_version":"1.0","event_id":"sha256:304795185f15d5cb41631f3dd9eb99519f605378bc01fc0de1c388f8d38e8813"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U2ZYEBASE7G7TE5KGSCZLPOJKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A random compiler for fast Hamiltonian simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Earl Campbell","submitted_at":"2018-11-19T23:10:55Z","abstract_excerpt":"The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $\\Lambda$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08017","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/1811.08017/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-04T23:58:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E+RHwYSERfKhFOpFD1jBi1boTw/BfyeysJSiVwvPqwcIHeO0+BxRqJ3bhKSflEfO7F9eDUCr6dmJE4FyI8ujDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:00:11.373655Z"},"content_sha256":"4d8af96f20f894102b188dba4a28d9a35966d3c8ad3b429c6149d4388dbe8537","schema_version":"1.0","event_id":"sha256:4d8af96f20f894102b188dba4a28d9a35966d3c8ad3b429c6149d4388dbe8537"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/bundle.json","state_url":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/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-06T16:00:11Z","links":{"resolver":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ","bundle":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/bundle.json","state":"https://pith.science/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2ZYEBASE7G7TE5KGSCZLPOJKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U2ZYEBASE7G7TE5KGSCZLPOJKQ","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":"fa6a59ec8e312bf01355a955e5a71f7fc243651fe0976e74b740e74e612c2286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","title_canon_sha256":"28132b91cbaf5f33898b128dd38fde12de98afef37bb057de070bcb0fa104e1d"},"schema_version":"1.0","source":{"id":"1811.08017","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08017","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08017v2","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08017","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_12","alias_value":"U2ZYEBASE7G7","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_16","alias_value":"U2ZYEBASE7G7TE5K","created_at":"2026-07-04T23:58:05Z"},{"alias_kind":"pith_short_8","alias_value":"U2ZYEBAS","created_at":"2026-07-04T23:58:05Z"}],"graph_snapshots":[{"event_id":"sha256:4d8af96f20f894102b188dba4a28d9a35966d3c8ad3b429c6149d4388dbe8537","target":"graph","created_at":"2026-07-04T23:58:05Z","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/1811.08017/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The dynamics of a quantum system can be simulated using a quantum computer by breaking down the unitary into a quantum circuit of one and two qubit gates. The most established methods are the Trotter-Suzuki decompositions, for which rigorous bounds on the circuit size depend on the number of terms $L$ in the system Hamiltonian and the size of the largest term in the Hamiltonian $\\Lambda$. Consequently, Trotter-Suzuki is only practical for sparse Hamiltonians. Trotter-Suzuki is a deterministic compiler but it was recently shown that randomised compiling offers lower overheads. Here we present a","authors_text":"Earl Campbell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","title":"A random compiler for fast Hamiltonian simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08017","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:304795185f15d5cb41631f3dd9eb99519f605378bc01fc0de1c388f8d38e8813","target":"record","created_at":"2026-07-04T23:58:05Z","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":"fa6a59ec8e312bf01355a955e5a71f7fc243651fe0976e74b740e74e612c2286","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-11-19T23:10:55Z","title_canon_sha256":"28132b91cbaf5f33898b128dd38fde12de98afef37bb057de070bcb0fa104e1d"},"schema_version":"1.0","source":{"id":"1811.08017","kind":"arxiv","version":2}},"canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6b382041227cdf993aa348595bdc9543daeeaa4eddeef8a850bf3b9eb48e3ce","first_computed_at":"2026-07-04T23:58:05.150393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:58:05.150393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KFu5PxiBDPc2FEUP/HXTOSWP9HoRzBz4wgm1QW4avEVwZPdapAk06wTRiI6qj/mPNdnEXjgq7D/rc1aL+Af7CQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:58:05.150910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08017","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:304795185f15d5cb41631f3dd9eb99519f605378bc01fc0de1c388f8d38e8813","sha256:4d8af96f20f894102b188dba4a28d9a35966d3c8ad3b429c6149d4388dbe8537"],"state_sha256":"543bf3aa8269b6fa1e657a08cf6fb9baa1da0a4d2cec7f30a065df6bcf87177a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fPj3WgZsT4a3PpmOrlghy6XgR9VK5vrThwgpVRdRKiyjv9/P2QuFKG+b3eOkkSXJn65V0uJ82yoAeN4p/oXeAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:00:11.380501Z","bundle_sha256":"5d56777eb51e4021dcbc3a85f113895cf7fa435e6ed078ad4d3e30f5eaead37c"}}