{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:XDVTVRHCIS6YXNVOZ5T7HLFY3C","short_pith_number":"pith:XDVTVRHC","canonical_record":{"source":{"id":"1610.07107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-23T00:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"77d4abea60271dff2aa4e31fa57fccd707cfb0a26034721081eea4dd41a13f3b","abstract_canon_sha256":"0e4b8106f968913705f05ad6d4ad768eea880ad2093cd2287f3c5be2ea278ac9"},"schema_version":"1.0"},"canonical_sha256":"b8eb3ac4e244bd8bb6aecf67f3acb8d8b77e25834bb1a084ae6ca83117102b78","source":{"kind":"arxiv","id":"1610.07107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07107","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07107v1","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07107","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"XDVTVRHCIS6Y","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XDVTVRHCIS6YXNVO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XDVTVRHC","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:XDVTVRHCIS6YXNVOZ5T7HLFY3C","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-23T00:35:58Z","cross_cats_sorted":[],"title_canon_sha256":"77d4abea60271dff2aa4e31fa57fccd707cfb0a26034721081eea4dd41a13f3b","abstract_canon_sha256":"0e4b8106f968913705f05ad6d4ad768eea880ad2093cd2287f3c5be2ea278ac9"},"schema_version":"1.0"},"canonical_sha256":"b8eb3ac4e244bd8bb6aecf67f3acb8d8b77e25834bb1a084ae6ca83117102b78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:43.073055Z","signature_b64":"dUNEeoID1tufHgqlp5ioln1TdqNTkj7KINS/K/evWjLDYDNJ5Dwz+9kq9d+qbYYRpAQp7zi+sfeI8i147VGMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8eb3ac4e244bd8bb6aecf67f3acb8d8b77e25834bb1a084ae6ca83117102b78","last_reissued_at":"2026-05-18T00:51:43.072311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:43.072311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07107","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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ympfUg6gaEMCpXUmrG6Gtw8HI9Z39pjgXFIspaCbK167VsITynDDvoJSRozkZ/am3hW+QsG5ZKpULQMiK5/XDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:50:43.136422Z"},"content_sha256":"042335ab57dae6be5d9dc2d1586de95cd2c4939013565af91c6f9940fa7d2cf1","schema_version":"1.0","event_id":"sha256:042335ab57dae6be5d9dc2d1586de95cd2c4939013565af91c6f9940fa7d2cf1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:XDVTVRHCIS6YXNVOZ5T7HLFY3C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient quantum circuits for continuous-time quantum walks on composite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"J. B. Wang, T. Loke","submitted_at":"2016-10-23T00:35:58Z","abstract_excerpt":"In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform the simulation exactly, while maintaining $\\mbox{poly}(\\mbox{log}(n))$ efficiency. In particular, we discuss two classes of composite graphs, commuting graphs and Cartesian product of graphs, that contain classes of graphs which can be simulated in this fashion. This allows us to identify new families of graphs that we can efficiently simulate in a quantum c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07107","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:51:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j744vtFQPQcrCRta2W754N8DhjdAeQcZMSzpbxkM/eJR9/6emJZolc967xFq69wKXxa1SBhhcH24R0KOyGKMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:50:43.136984Z"},"content_sha256":"3fa18e17f1ee55514ae679fd97168d2a4d9706e91390309c135a91aadcf3b5b3","schema_version":"1.0","event_id":"sha256:3fa18e17f1ee55514ae679fd97168d2a4d9706e91390309c135a91aadcf3b5b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/bundle.json","state_url":"https://pith.science/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/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-07T13:50:43Z","links":{"resolver":"https://pith.science/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C","bundle":"https://pith.science/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/bundle.json","state":"https://pith.science/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDVTVRHCIS6YXNVOZ5T7HLFY3C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:XDVTVRHCIS6YXNVOZ5T7HLFY3C","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":"0e4b8106f968913705f05ad6d4ad768eea880ad2093cd2287f3c5be2ea278ac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-23T00:35:58Z","title_canon_sha256":"77d4abea60271dff2aa4e31fa57fccd707cfb0a26034721081eea4dd41a13f3b"},"schema_version":"1.0","source":{"id":"1610.07107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07107","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07107v1","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07107","created_at":"2026-05-18T00:51:43Z"},{"alias_kind":"pith_short_12","alias_value":"XDVTVRHCIS6Y","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"XDVTVRHCIS6YXNVO","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"XDVTVRHC","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:3fa18e17f1ee55514ae679fd97168d2a4d9706e91390309c135a91aadcf3b5b3","target":"graph","created_at":"2026-05-18T00:51:43Z","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":"In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform the simulation exactly, while maintaining $\\mbox{poly}(\\mbox{log}(n))$ efficiency. In particular, we discuss two classes of composite graphs, commuting graphs and Cartesian product of graphs, that contain classes of graphs which can be simulated in this fashion. This allows us to identify new families of graphs that we can efficiently simulate in a quantum c","authors_text":"J. B. Wang, T. Loke","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-23T00:35:58Z","title":"Efficient quantum circuits for continuous-time quantum walks on composite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07107","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:042335ab57dae6be5d9dc2d1586de95cd2c4939013565af91c6f9940fa7d2cf1","target":"record","created_at":"2026-05-18T00:51:43Z","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":"0e4b8106f968913705f05ad6d4ad768eea880ad2093cd2287f3c5be2ea278ac9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-10-23T00:35:58Z","title_canon_sha256":"77d4abea60271dff2aa4e31fa57fccd707cfb0a26034721081eea4dd41a13f3b"},"schema_version":"1.0","source":{"id":"1610.07107","kind":"arxiv","version":1}},"canonical_sha256":"b8eb3ac4e244bd8bb6aecf67f3acb8d8b77e25834bb1a084ae6ca83117102b78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8eb3ac4e244bd8bb6aecf67f3acb8d8b77e25834bb1a084ae6ca83117102b78","first_computed_at":"2026-05-18T00:51:43.072311Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:43.072311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dUNEeoID1tufHgqlp5ioln1TdqNTkj7KINS/K/evWjLDYDNJ5Dwz+9kq9d+qbYYRpAQp7zi+sfeI8i147VGMBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:43.073055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:042335ab57dae6be5d9dc2d1586de95cd2c4939013565af91c6f9940fa7d2cf1","sha256:3fa18e17f1ee55514ae679fd97168d2a4d9706e91390309c135a91aadcf3b5b3"],"state_sha256":"0f9abd7c4ba3facce16467949998d5b10ded0a09623034fab795b8eae16e197c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vN2jongI60y/cdXQx37gUceSiDxZJQ9zxLwaUfI0dsARMWAdFalnjTZTA1AMeh8UsBhS/MURAMwMRMqzafwPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:50:43.141217Z","bundle_sha256":"8bf279c53ebf7849ebab03689915b7976c39e03078ed50cfe4844b9206f7dda0"}}