{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LBBPWZI4HXFOWD5QVROTVUG2BS","short_pith_number":"pith:LBBPWZI4","schema_version":"1.0","canonical_sha256":"5842fb651c3dcaeb0fb0ac5d3ad0da0cb7573e75cc2409678919fb06037f68b4","source":{"kind":"arxiv","id":"2506.03397","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning Enhanced Greedy Decoding for Quantum Stabilizer Codes over $\\mathbb{F}_q$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"quant-ph","authors_text":"Vahid Nourozi","submitted_at":"2025-06-03T21:08:36Z","abstract_excerpt":"We construct new classical Goppa codes and corresponding quantum stabilizer codes from plane curves defined by separated polynomials. In particular, over $\\mathbb{F}_3$ with the Hermitian curve $y^3 + y = x^4$, we obtain a ternary code of length 27, dimension 13, distance 4, which yields a [[27, 13, 4]]$_3$ quantum code. To decode, we introduce an RL-on-Greedy algorithm: first apply a standard greedy syndrome decoder, then use a trained Deep Q-Network to correct any residual syndrome. Simulation under a depolarizing noise model shows that RL-on-Greedy dramatically reduces logical failure compa"},"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":"2506.03397","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-06-03T21:08:36Z","cross_cats_sorted":["math.QA"],"title_canon_sha256":"04c2e6efdeb3122cd8d0fc9ae21913510e9329ce10883c91c3224ea6d203141f","abstract_canon_sha256":"5b1c2088ac66e1dcb466a263b79b4bc4e19c312792da2e057995fa95b7a4ff9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:26.868180Z","signature_b64":"HD25zb1aRn3MI5NturVmAakAh5/1t2B+8BP34iUA+Aq9mdKVzBl/lbnQfTllbxIvy7AxhwNKBtfFOpJve1bNBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5842fb651c3dcaeb0fb0ac5d3ad0da0cb7573e75cc2409678919fb06037f68b4","last_reissued_at":"2026-07-05T11:15:26.867756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:26.867756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning Enhanced Greedy Decoding for Quantum Stabilizer Codes over $\\mathbb{F}_q$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.QA"],"primary_cat":"quant-ph","authors_text":"Vahid Nourozi","submitted_at":"2025-06-03T21:08:36Z","abstract_excerpt":"We construct new classical Goppa codes and corresponding quantum stabilizer codes from plane curves defined by separated polynomials. In particular, over $\\mathbb{F}_3$ with the Hermitian curve $y^3 + y = x^4$, we obtain a ternary code of length 27, dimension 13, distance 4, which yields a [[27, 13, 4]]$_3$ quantum code. To decode, we introduce an RL-on-Greedy algorithm: first apply a standard greedy syndrome decoder, then use a trained Deep Q-Network to correct any residual syndrome. Simulation under a depolarizing noise model shows that RL-on-Greedy dramatically reduces logical failure compa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03397","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.03397/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.03397","created_at":"2026-07-05T11:15:26.867815+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03397v1","created_at":"2026-07-05T11:15:26.867815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03397","created_at":"2026-07-05T11:15:26.867815+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBBPWZI4HXFO","created_at":"2026-07-05T11:15:26.867815+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBBPWZI4HXFOWD5Q","created_at":"2026-07-05T11:15:26.867815+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBBPWZI4","created_at":"2026-07-05T11:15:26.867815+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/LBBPWZI4HXFOWD5QVROTVUG2BS","json":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS.json","graph_json":"https://pith.science/api/pith-number/LBBPWZI4HXFOWD5QVROTVUG2BS/graph.json","events_json":"https://pith.science/api/pith-number/LBBPWZI4HXFOWD5QVROTVUG2BS/events.json","paper":"https://pith.science/paper/LBBPWZI4"},"agent_actions":{"view_html":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS","download_json":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS.json","view_paper":"https://pith.science/paper/LBBPWZI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03397&json=true","fetch_graph":"https://pith.science/api/pith-number/LBBPWZI4HXFOWD5QVROTVUG2BS/graph.json","fetch_events":"https://pith.science/api/pith-number/LBBPWZI4HXFOWD5QVROTVUG2BS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS/action/storage_attestation","attest_author":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS/action/author_attestation","sign_citation":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS/action/citation_signature","submit_replication":"https://pith.science/pith/LBBPWZI4HXFOWD5QVROTVUG2BS/action/replication_record"}},"created_at":"2026-07-05T11:15:26.867815+00:00","updated_at":"2026-07-05T11:15:26.867815+00:00"}