{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KUTDJB5ZDQ6FFJ4LQJUIASD6YN","short_pith_number":"pith:KUTDJB5Z","canonical_record":{"source":{"id":"1310.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"1785f09b46c65bcb36fe46118d4e34fe0f7d5b04dace3fa14f5ab91546a9db9f","abstract_canon_sha256":"e803818c2de36004d9166ab501cc5eb6b1d19f5323e2be9f4324ef5b66442ce7"},"schema_version":"1.0"},"canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","source":{"kind":"arxiv","id":"1310.4150","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4150","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4150v1","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4150","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"pith_short_12","alias_value":"KUTDJB5ZDQ6F","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KUTDJB5ZDQ6FFJ4L","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KUTDJB5Z","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KUTDJB5ZDQ6FFJ4LQJUIASD6YN","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4150","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"1785f09b46c65bcb36fe46118d4e34fe0f7d5b04dace3fa14f5ab91546a9db9f","abstract_canon_sha256":"e803818c2de36004d9166ab501cc5eb6b1d19f5323e2be9f4324ef5b66442ce7"},"schema_version":"1.0"},"canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:47:05.031022Z","signature_b64":"sRR+boBx7bsMtsHMDPPzm2DxZnzXclVHpvyoqKFNYPeIhKgIuNBpnqn1aRWLD+mtYaDL4rEGxekVjvWu/qWOBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","last_reissued_at":"2026-05-18T01:47:05.030543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:47:05.030543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4150","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-18T01:47:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2RXQabhk9kBNVP+Z9cPe29LHsaBhxYx6S1nVFzPUvytwNGjpZqi/u8GcgmvthntkJfCKvBS6qWiKXAI2hnUTAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:39:11.334678Z"},"content_sha256":"239fdbe0587344e8b7d4c4cf0aab4d5b692b48a85846a3f1c159c83936fb6cf3","schema_version":"1.0","event_id":"sha256:239fdbe0587344e8b7d4c4cf0aab4d5b692b48a85846a3f1c159c83936fb6cf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KUTDJB5ZDQ6FFJ4LQJUIASD6YN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Topological Quantum Compiling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Alex Bocharov, Krysta M. Svore, Vadym Kliuchnikov","submitted_at":"2013-10-15T19:15:32Z","abstract_excerpt":"In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the single-qubit unitaries that can be implemented exactly by a Fibonacci anyon braid pattern and present an efficient algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4150","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-18T01:47:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BXDkCvlJlEoigyZxWZEtjnONG2vwJEk6cysCyLg0ZLjg35sTsq31Kn7QLzV9l8WQ3xVrH7ZUSh642Sj5HCADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T13:39:11.335091Z"},"content_sha256":"a2f5f0c416690da4cf5b6b45f64b70ed90c693586f685231ceda108b308592b4","schema_version":"1.0","event_id":"sha256:a2f5f0c416690da4cf5b6b45f64b70ed90c693586f685231ceda108b308592b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/bundle.json","state_url":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/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-15T13:39:11Z","links":{"resolver":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN","bundle":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/bundle.json","state":"https://pith.science/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUTDJB5ZDQ6FFJ4LQJUIASD6YN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KUTDJB5ZDQ6FFJ4LQJUIASD6YN","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":"e803818c2de36004d9166ab501cc5eb6b1d19f5323e2be9f4324ef5b66442ce7","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","title_canon_sha256":"1785f09b46c65bcb36fe46118d4e34fe0f7d5b04dace3fa14f5ab91546a9db9f"},"schema_version":"1.0","source":{"id":"1310.4150","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4150","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4150v1","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4150","created_at":"2026-05-18T01:47:05Z"},{"alias_kind":"pith_short_12","alias_value":"KUTDJB5ZDQ6F","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KUTDJB5ZDQ6FFJ4L","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KUTDJB5Z","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:a2f5f0c416690da4cf5b6b45f64b70ed90c693586f685231ceda108b308592b4","target":"graph","created_at":"2026-05-18T01:47: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"},"paper":{"abstract_excerpt":"In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the single-qubit unitaries that can be implemented exactly by a Fibonacci anyon braid pattern and present an efficient algori","authors_text":"Alex Bocharov, Krysta M. Svore, Vadym Kliuchnikov","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","title":"Asymptotically Optimal Topological Quantum Compiling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4150","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:239fdbe0587344e8b7d4c4cf0aab4d5b692b48a85846a3f1c159c83936fb6cf3","target":"record","created_at":"2026-05-18T01:47: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":"e803818c2de36004d9166ab501cc5eb6b1d19f5323e2be9f4324ef5b66442ce7","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T19:15:32Z","title_canon_sha256":"1785f09b46c65bcb36fe46118d4e34fe0f7d5b04dace3fa14f5ab91546a9db9f"},"schema_version":"1.0","source":{"id":"1310.4150","kind":"arxiv","version":1}},"canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55263487b91c3c52a78b826880487ec354246788d4c8cb0791fcc7b78345dd33","first_computed_at":"2026-05-18T01:47:05.030543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:47:05.030543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sRR+boBx7bsMtsHMDPPzm2DxZnzXclVHpvyoqKFNYPeIhKgIuNBpnqn1aRWLD+mtYaDL4rEGxekVjvWu/qWOBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:47:05.031022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4150","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:239fdbe0587344e8b7d4c4cf0aab4d5b692b48a85846a3f1c159c83936fb6cf3","sha256:a2f5f0c416690da4cf5b6b45f64b70ed90c693586f685231ceda108b308592b4"],"state_sha256":"1c9e1f0b04bbc0b25830592e6f58c8650bc182d449f09455d9bc4659115d6a61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ogv/zaL0KhbxEPxM9/kYgmJmlJt9Lf9pe0/qbSxwNdvacikp3oLL1Cyq0asqb48CZ6DX8emB7CEYjoPoekf1Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T13:39:11.339722Z","bundle_sha256":"073685d32035ac6bf7e2ead3bbab16992f77c960be08172e8bfe6781368e578f"}}