{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4SXDRS3XO6ESIA3OLO4SGOTF5M","short_pith_number":"pith:4SXDRS3X","canonical_record":{"source":{"id":"1608.00281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"87fc6d636abece712cae851c3e117bb206a9e4ef2b652199bd058b4d25c9276b","abstract_canon_sha256":"80811d5be4b98a600c8b34b070873012b182eb82ab8f5b03db5d8f178a10effc"},"schema_version":"1.0"},"canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","source":{"kind":"arxiv","id":"1608.00281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00281","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00281v1","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00281","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"4SXDRS3XO6ES","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SXDRS3XO6ESIA3O","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SXDRS3X","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4SXDRS3XO6ESIA3OLO4SGOTF5M","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00281","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"87fc6d636abece712cae851c3e117bb206a9e4ef2b652199bd058b4d25c9276b","abstract_canon_sha256":"80811d5be4b98a600c8b34b070873012b182eb82ab8f5b03db5d8f178a10effc"},"schema_version":"1.0"},"canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:12.899294Z","signature_b64":"lrSrw4hBkP/n79kd44FCPCZZtEaazF3Nbn9WK6O3gXyBWCHMYkibL/S/RS7UtoWbeSr5Vr8ujc6z7BP8T3c+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","last_reissued_at":"2026-05-18T00:42:12.898797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:12.898797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00281","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-05-18T00:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hLs75SoYc0nAMhpb2J4xjbFOnCwbZRGUBHBhKfC5fUNlzxc39DLWQNil6akcIp0uNiEbt3qHCbHdN0cOmLQVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:45:22.321072Z"},"content_sha256":"d5c9a0a83755a2932acd48df5e15bcc8b4e702492bf9772816b782ec6eacd6d6","schema_version":"1.0","event_id":"sha256:d5c9a0a83755a2932acd48df5e15bcc8b4e702492bf9772816b782ec6eacd6d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4SXDRS3XO6ESIA3OLO4SGOTF5M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonian Simulation with Optimal Sample Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Shelby Kimmel, Theodore J. Yoder","submitted_at":"2016-07-31T23:39:55Z","abstract_excerpt":"We investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00281","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":""},"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-18T00:42:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DlgWubw1iaMgsVensiSnZBYyx+UU61qc+uaAU2wU2UnlkItsDIPZhZFTwa3TwSUBweUaLJCo1zI9INlUr53OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:45:22.321780Z"},"content_sha256":"416e3110487e0593882b1b26716af8223fdb155509cef589c5658e7d93ab59e7","schema_version":"1.0","event_id":"sha256:416e3110487e0593882b1b26716af8223fdb155509cef589c5658e7d93ab59e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/bundle.json","state_url":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/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-05-25T20:45:22Z","links":{"resolver":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M","bundle":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/bundle.json","state":"https://pith.science/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4SXDRS3XO6ESIA3OLO4SGOTF5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4SXDRS3XO6ESIA3OLO4SGOTF5M","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":"80811d5be4b98a600c8b34b070873012b182eb82ab8f5b03db5d8f178a10effc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","title_canon_sha256":"87fc6d636abece712cae851c3e117bb206a9e4ef2b652199bd058b4d25c9276b"},"schema_version":"1.0","source":{"id":"1608.00281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00281","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00281v1","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00281","created_at":"2026-05-18T00:42:12Z"},{"alias_kind":"pith_short_12","alias_value":"4SXDRS3XO6ES","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4SXDRS3XO6ESIA3O","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4SXDRS3X","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:416e3110487e0593882b1b26716af8223fdb155509cef589c5658e7d93ab59e7","target":"graph","created_at":"2026-05-18T00:42:12Z","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 investigate the sample complexity of Hamiltonian simulation: how many copies of an unknown quantum state are required to simulate a Hamiltonian encoded by the density matrix of that state? We show that the procedure proposed by Lloyd, Mohseni, and Rebentrost [Nat. Phys., 10(9):631--633, 2014] is optimal for this task. We further extend their method to the case of multiple input states, showing how to simulate any Hermitian polynomial of the states provided. As applications, we derive optimal algorithms for commutator simulation and orthogonality testing, and we give a protocol for creating ","authors_text":"Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Shelby Kimmel, Theodore J. Yoder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","title":"Hamiltonian Simulation with Optimal Sample Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00281","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:d5c9a0a83755a2932acd48df5e15bcc8b4e702492bf9772816b782ec6eacd6d6","target":"record","created_at":"2026-05-18T00:42:12Z","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":"80811d5be4b98a600c8b34b070873012b182eb82ab8f5b03db5d8f178a10effc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-07-31T23:39:55Z","title_canon_sha256":"87fc6d636abece712cae851c3e117bb206a9e4ef2b652199bd058b4d25c9276b"},"schema_version":"1.0","source":{"id":"1608.00281","kind":"arxiv","version":1}},"canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4ae38cb77778924036e5bb9233a65eb2d5ae61147794e9cce54dd3cedfd59c1","first_computed_at":"2026-05-18T00:42:12.898797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:12.898797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lrSrw4hBkP/n79kd44FCPCZZtEaazF3Nbn9WK6O3gXyBWCHMYkibL/S/RS7UtoWbeSr5Vr8ujc6z7BP8T3c+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:12.899294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5c9a0a83755a2932acd48df5e15bcc8b4e702492bf9772816b782ec6eacd6d6","sha256:416e3110487e0593882b1b26716af8223fdb155509cef589c5658e7d93ab59e7"],"state_sha256":"73f268d961a5d32afcd89136486c74d9dca54c1b08a3c4d8bdf5b2757f2b7b47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GoSH/Qc3jHkbwL0nU+svQQoP3ZBVD4RiG0qlE+/tYVIVyANQ1sMoHPOYbP9vNPDDme4V4mWtuVq8mmG5T4lBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:45:22.325673Z","bundle_sha256":"5977b1854eb7ffa2b2de009ed8500b3f5574167b992c51967da417af5ccb7ffe"}}