{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QAHRKTBHXDSQAJ64RBCGNDD6EL","short_pith_number":"pith:QAHRKTBH","canonical_record":{"source":{"id":"1503.05270","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"b8377de2b42a3a5b882ce2a72d644b9000a0a530cba209c089801b4cef8f69c7","abstract_canon_sha256":"ed2e09e1fee5d34bb7e5b87047984c7ec664a4bd79f0c15f8068bd71fea6bb51"},"schema_version":"1.0"},"canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","source":{"kind":"arxiv","id":"1503.05270","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05270","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05270v4","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05270","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"QAHRKTBHXDSQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAHRKTBHXDSQAJ64","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAHRKTBH","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QAHRKTBHXDSQAJ64RBCGNDD6EL","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05270","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"b8377de2b42a3a5b882ce2a72d644b9000a0a530cba209c089801b4cef8f69c7","abstract_canon_sha256":"ed2e09e1fee5d34bb7e5b87047984c7ec664a4bd79f0c15f8068bd71fea6bb51"},"schema_version":"1.0"},"canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:02.443231Z","signature_b64":"V8ArgME7QU40gcKvyv3I2pfBoXei5WBiHSIKa7uVCQk95zLw/Se6eT0QnPPdmgQc+nhc4b9HGdYik99Ta8tBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","last_reissued_at":"2026-05-18T00:41:02.442667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:02.442667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05270","source_version":4,"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U0ELyzaXckHlRrmWZlzg3B9Yd4GdG4cY6EwPPm8M1HMwapFWYd49ons+govKG3HcLgBpmMudp7DzB1FijgPrDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:51:47.869289Z"},"content_sha256":"69642df4502a602ac0e31105521e80fe2bbfc53d473c500172c253d2b9802f18","schema_version":"1.0","event_id":"sha256:69642df4502a602ac0e31105521e80fe2bbfc53d473c500172c253d2b9802f18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QAHRKTBHXDSQAJ64RBCGNDD6EL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently Controllable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Can Gokler, Kevin Thompson, Peter Shor, Seth Lloyd","submitted_at":"2015-03-18T02:39:46Z","abstract_excerpt":"We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficently controllable, and explore generalizations to percolation clusters and random graphs. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05270","kind":"arxiv","version":4},"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:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DofhhKJjrZ/NE6DYJJsIdecF1kU3Euk12Jzu+CdAvvK1b0gWMOmWy4T9RkztjZZZmxCB6zHgSW8cqhG/bYoJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T13:51:47.869943Z"},"content_sha256":"fa4a4bbc506cd25dcb043315ac8269bb24d9926391c860ed8e68fab393c26bba","schema_version":"1.0","event_id":"sha256:fa4a4bbc506cd25dcb043315ac8269bb24d9926391c860ed8e68fab393c26bba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/bundle.json","state_url":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/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:51:47Z","links":{"resolver":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL","bundle":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/bundle.json","state":"https://pith.science/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAHRKTBHXDSQAJ64RBCGNDD6EL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QAHRKTBHXDSQAJ64RBCGNDD6EL","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":"ed2e09e1fee5d34bb7e5b87047984c7ec664a4bd79f0c15f8068bd71fea6bb51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","title_canon_sha256":"b8377de2b42a3a5b882ce2a72d644b9000a0a530cba209c089801b4cef8f69c7"},"schema_version":"1.0","source":{"id":"1503.05270","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05270","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05270v4","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05270","created_at":"2026-05-18T00:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"QAHRKTBHXDSQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QAHRKTBHXDSQAJ64","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QAHRKTBH","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:fa4a4bbc506cd25dcb043315ac8269bb24d9926391c860ed8e68fab393c26bba","target":"graph","created_at":"2026-05-18T00:41:02Z","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 graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in the sense that universal quantum computation can be performed using a control sequence polynomial in the size of the network while controlling a vanishingly small fraction of subsystems. We show that networks corresponding to finite-dimensional lattices are efficently controllable, and explore generalizations to percolation clusters and random graphs. We show","authors_text":"Can Gokler, Kevin Thompson, Peter Shor, Seth Lloyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","title":"Efficiently Controllable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05270","kind":"arxiv","version":4},"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:69642df4502a602ac0e31105521e80fe2bbfc53d473c500172c253d2b9802f18","target":"record","created_at":"2026-05-18T00:41:02Z","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":"ed2e09e1fee5d34bb7e5b87047984c7ec664a4bd79f0c15f8068bd71fea6bb51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-03-18T02:39:46Z","title_canon_sha256":"b8377de2b42a3a5b882ce2a72d644b9000a0a530cba209c089801b4cef8f69c7"},"schema_version":"1.0","source":{"id":"1503.05270","kind":"arxiv","version":4}},"canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"800f154c27b8e50027dc8844668c7e22de4424729cb38f27d49c9b97d8c10aa1","first_computed_at":"2026-05-18T00:41:02.442667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:02.442667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V8ArgME7QU40gcKvyv3I2pfBoXei5WBiHSIKa7uVCQk95zLw/Se6eT0QnPPdmgQc+nhc4b9HGdYik99Ta8tBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:02.443231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05270","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69642df4502a602ac0e31105521e80fe2bbfc53d473c500172c253d2b9802f18","sha256:fa4a4bbc506cd25dcb043315ac8269bb24d9926391c860ed8e68fab393c26bba"],"state_sha256":"8e22aa2dc7e21f18f91bd7dde5ec87b9341f899039fc49cfdb2006daec2eed7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J0Rb0rPxNakMnTfF4iNSUmEXv3VicfWeEv0aH0g4P3yoo18rrJqbIKGfPg7RH9WKRQ4kZQuKW29ztnQxRJTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T13:51:47.873327Z","bundle_sha256":"cb25f91c1d8592dc72bb603d158042be0a8127275373ab3e95e008917f850c93"}}