{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PSISWG65PYUXHPUWSLMDW2NCGL","short_pith_number":"pith:PSISWG65","schema_version":"1.0","canonical_sha256":"7c912b1bdd7e2973be9692d83b69a232d4da1e0d5baea44a55556e4f94b6a569","source":{"kind":"arxiv","id":"1004.4488","version":3},"attestation_state":"computed","paper":{"title":"Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes$\\,$\"","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dazu Huang, Xin Li, Ying Guo, Zhigang Chen","submitted_at":"2010-04-26T11:31:56Z","abstract_excerpt":"In our recent paper entitled \"Quantum Quasi-Cyclic Low-Density Parity-Check codes\" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled \"Quantum Quasi-Cyclic LDPC codes\" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the di"},"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":"1004.4488","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2010-04-26T11:31:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fcfb9cf5e9cb92d944241420050d744c4a22dd0353d192404c947415744ac5e7","abstract_canon_sha256":"afff84712822fba11cad5d3a7f8d33f0e937c57b48c9d30eefc2290c97302bbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:16.183778Z","signature_b64":"wx2sGQnmuTl3zS4C2id+7sz2EiLOjfbhwkKgMko5zAVidOHQBelk7RJGi1Yii0NJVtOp6lyxdjfuUMw1hFPRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c912b1bdd7e2973be9692d83b69a232d4da1e0d5baea44a55556e4f94b6a569","last_reissued_at":"2026-05-18T02:24:16.183161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:16.183161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Apologizing Comment on `Quantum Quasi-Cyclic Low-Density Parity-Check codes$\\,$\"","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dazu Huang, Xin Li, Ying Guo, Zhigang Chen","submitted_at":"2010-04-26T11:31:56Z","abstract_excerpt":"In our recent paper entitled \"Quantum Quasi-Cyclic Low-Density Parity-Check codes\" [ICIC 2009. LNCS 5754], it was claimed that some new quantum codes can be constructed via the CSS encoding/decoding approach with various lengths and rates. However, the further investigation shows that the proposed construction may steal some ideas from the paper entitled \"Quantum Quasi-Cyclic LDPC codes\" [quant-ph/0701020v2]. We feel that the apologizing point of the original protocol is that some results are almost similar to that of construction methods with algebraic combinatorics although we suggest the di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4488","kind":"arxiv","version":3},"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":"1004.4488","created_at":"2026-05-18T02:24:16.183260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.4488v3","created_at":"2026-05-18T02:24:16.183260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4488","created_at":"2026-05-18T02:24:16.183260+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSISWG65PYUX","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSISWG65PYUXHPUW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSISWG65","created_at":"2026-05-18T12:26:12.377268+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/PSISWG65PYUXHPUWSLMDW2NCGL","json":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL.json","graph_json":"https://pith.science/api/pith-number/PSISWG65PYUXHPUWSLMDW2NCGL/graph.json","events_json":"https://pith.science/api/pith-number/PSISWG65PYUXHPUWSLMDW2NCGL/events.json","paper":"https://pith.science/paper/PSISWG65"},"agent_actions":{"view_html":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL","download_json":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL.json","view_paper":"https://pith.science/paper/PSISWG65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.4488&json=true","fetch_graph":"https://pith.science/api/pith-number/PSISWG65PYUXHPUWSLMDW2NCGL/graph.json","fetch_events":"https://pith.science/api/pith-number/PSISWG65PYUXHPUWSLMDW2NCGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL/action/storage_attestation","attest_author":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL/action/author_attestation","sign_citation":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL/action/citation_signature","submit_replication":"https://pith.science/pith/PSISWG65PYUXHPUWSLMDW2NCGL/action/replication_record"}},"created_at":"2026-05-18T02:24:16.183260+00:00","updated_at":"2026-05-18T02:24:16.183260+00:00"}