{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WGD32UYK7VMK7HGLVNUDBWGSVT","short_pith_number":"pith:WGD32UYK","schema_version":"1.0","canonical_sha256":"b187bd530afd58af9ccbab6830d8d2acff01af0be74316ffd2a8bbe5d06511b4","source":{"kind":"arxiv","id":"1211.7359","version":2},"attestation_state":"computed","paper":{"title":"Genetic braid optimization: A heuristic approach to compute quasiparticle braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.NE"],"primary_cat":"quant-ph","authors_text":"Helmut G. Katzgraber, Ross B. McDonald","submitted_at":"2012-11-30T19:56:15Z","abstract_excerpt":"In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well as Leijnse and Flensberg [Phys. Rev. B 86, 104511 (2012)] recently provided schemes for computing quantum gates from quasiparticle braids. Mathematically, the problem of executing a gate becomes that of finding a product of the generators (matrices) in that set that approximates the gate best, up to an error. To date, efficient methods to compute these gates"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1211.7359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-11-30T19:56:15Z","cross_cats_sorted":["cond-mat.mes-hall","cs.NE"],"title_canon_sha256":"b9695802c28e5d6e05bad98553ea0d6ccb39d705086c541abeba29356f9a9f0c","abstract_canon_sha256":"28f29498217ff4bfe9f33efca0ade3deec3326fef7ec5ee9a593bfa424a006a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:49.645946Z","signature_b64":"l9wOyLXoXdod2tWNxoWNt7Gmx9l5XdHRF63z1ca+1ay6dX9+k9v6r3uU/hMl7JAOCGPQl6tw4unGhnv3aCQgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b187bd530afd58af9ccbab6830d8d2acff01af0be74316ffd2a8bbe5d06511b4","last_reissued_at":"2026-05-18T03:33:49.645404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:49.645404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Genetic braid optimization: A heuristic approach to compute quasiparticle braids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall","cs.NE"],"primary_cat":"quant-ph","authors_text":"Helmut G. Katzgraber, Ross B. McDonald","submitted_at":"2012-11-30T19:56:15Z","abstract_excerpt":"In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well as Leijnse and Flensberg [Phys. Rev. B 86, 104511 (2012)] recently provided schemes for computing quantum gates from quasiparticle braids. Mathematically, the problem of executing a gate becomes that of finding a product of the generators (matrices) in that set that approximates the gate best, up to an error. To date, efficient methods to compute these gates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7359","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1211.7359","created_at":"2026-05-18T03:33:49.645487+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.7359v2","created_at":"2026-05-18T03:33:49.645487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7359","created_at":"2026-05-18T03:33:49.645487+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGD32UYK7VMK","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGD32UYK7VMK7HGL","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGD32UYK","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT","json":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT.json","graph_json":"https://pith.science/api/pith-number/WGD32UYK7VMK7HGLVNUDBWGSVT/graph.json","events_json":"https://pith.science/api/pith-number/WGD32UYK7VMK7HGLVNUDBWGSVT/events.json","paper":"https://pith.science/paper/WGD32UYK"},"agent_actions":{"view_html":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT","download_json":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT.json","view_paper":"https://pith.science/paper/WGD32UYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.7359&json=true","fetch_graph":"https://pith.science/api/pith-number/WGD32UYK7VMK7HGLVNUDBWGSVT/graph.json","fetch_events":"https://pith.science/api/pith-number/WGD32UYK7VMK7HGLVNUDBWGSVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT/action/storage_attestation","attest_author":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT/action/author_attestation","sign_citation":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT/action/citation_signature","submit_replication":"https://pith.science/pith/WGD32UYK7VMK7HGLVNUDBWGSVT/action/replication_record"}},"created_at":"2026-05-18T03:33:49.645487+00:00","updated_at":"2026-05-18T03:33:49.645487+00:00"}