{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QGQ64UU6ALNUWS7U43OLSBOFN5","short_pith_number":"pith:QGQ64UU6","schema_version":"1.0","canonical_sha256":"81a1ee529e02db4b4bf4e6dcb905c56f60e6accfcb77c7163d3e6269be6d7145","source":{"kind":"arxiv","id":"1307.4677","version":1},"attestation_state":"computed","paper":{"title":"An application of Khovanov homology to quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Benjamin Audoux","submitted_at":"2013-07-17T15:46:39Z","abstract_excerpt":"We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[3^(2l+1)/sqrt(8{\\pi}l);1;2^l]]; unlink codes with asymptotical parameters [[sqrt(2/2{\\pi}l)6^l;2^l;2^l]] and (2,l)-torus link codes with asymptotical parameters [[n;1;d_n]] where d_n>\\sqrt(n)/1.62."},"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":"1307.4677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-17T15:46:39Z","cross_cats_sorted":["math.GT","math.IT","quant-ph"],"title_canon_sha256":"b9397a588f2bcf9efe5e81ef03d8b58cb288339807a8ac75d7ce8d54126f5477","abstract_canon_sha256":"d20e3982e337fc438e08db09ea3b66585cde85b56926b054f054b6b9fd914770"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:52.589445Z","signature_b64":"PoIcsSGkt7DWjrYb9wQen3mp+AAxz/diXwBdVIYHoQauEXW+hVMvWtfkradsMD2iFmjavap+cUoS9p86Gkk8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81a1ee529e02db4b4bf4e6dcb905c56f60e6accfcb77c7163d3e6269be6d7145","last_reissued_at":"2026-05-18T00:31:52.588810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:52.588810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An application of Khovanov homology to quantum codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GT","math.IT","quant-ph"],"primary_cat":"cs.IT","authors_text":"Benjamin Audoux","submitted_at":"2013-07-17T15:46:39Z","abstract_excerpt":"We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[3^(2l+1)/sqrt(8{\\pi}l);1;2^l]]; unlink codes with asymptotical parameters [[sqrt(2/2{\\pi}l)6^l;2^l;2^l]] and (2,l)-torus link codes with asymptotical parameters [[n;1;d_n]] where d_n>\\sqrt(n)/1.62."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4677","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1307.4677","created_at":"2026-05-18T00:31:52.588896+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4677v1","created_at":"2026-05-18T00:31:52.588896+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4677","created_at":"2026-05-18T00:31:52.588896+00:00"},{"alias_kind":"pith_short_12","alias_value":"QGQ64UU6ALNU","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QGQ64UU6ALNUWS7U","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QGQ64UU6","created_at":"2026-05-18T12:27:57.521954+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/QGQ64UU6ALNUWS7U43OLSBOFN5","json":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5.json","graph_json":"https://pith.science/api/pith-number/QGQ64UU6ALNUWS7U43OLSBOFN5/graph.json","events_json":"https://pith.science/api/pith-number/QGQ64UU6ALNUWS7U43OLSBOFN5/events.json","paper":"https://pith.science/paper/QGQ64UU6"},"agent_actions":{"view_html":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5","download_json":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5.json","view_paper":"https://pith.science/paper/QGQ64UU6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4677&json=true","fetch_graph":"https://pith.science/api/pith-number/QGQ64UU6ALNUWS7U43OLSBOFN5/graph.json","fetch_events":"https://pith.science/api/pith-number/QGQ64UU6ALNUWS7U43OLSBOFN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5/action/storage_attestation","attest_author":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5/action/author_attestation","sign_citation":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5/action/citation_signature","submit_replication":"https://pith.science/pith/QGQ64UU6ALNUWS7U43OLSBOFN5/action/replication_record"}},"created_at":"2026-05-18T00:31:52.588896+00:00","updated_at":"2026-05-18T00:31:52.588896+00:00"}