{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:52EWSYZGU4TLFTQNKCJJ3MT3U3","short_pith_number":"pith:52EWSYZG","schema_version":"1.0","canonical_sha256":"ee89696326a726b2ce0d50929db27ba6ce2dcc471a488be5ddd2a59595b58158","source":{"kind":"arxiv","id":"1304.7487","version":2},"attestation_state":"computed","paper":{"title":"Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Bazarsky, Noam Presman, Simon Litsyn","submitted_at":"2013-04-28T17:00:56Z","abstract_excerpt":"An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods."},"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":"1304.7487","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-28T17:00:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"28e2f04fa9207e635e60990c17877363beb08c58d76202a966f92825a2cb8dc7","abstract_canon_sha256":"28aae010b745abca3f7655b1d8f757c6560e4980ad5726e0aed8b07491ff9274"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:17.301257Z","signature_b64":"J6Q45xfMPXET5N/x2WMlLn5V+PrnFy4UyFT3nhzEOtU8kfhV2FAKPG3C5k+zxAINt3HknABsGcbTb3NCtL7VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee89696326a726b2ce0d50929db27ba6ce2dcc471a488be5ddd2a59595b58158","last_reissued_at":"2026-05-18T00:58:17.300402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:17.300402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Bazarsky, Noam Presman, Simon Litsyn","submitted_at":"2013-04-28T17:00:56Z","abstract_excerpt":"An algorithm for constructing Tanner graphs of non-binary irregular quasi-cyclic LDPC codes is introduced. It employs a new method for selection of edge labels allowing control over the code's non-binary ACE spectrum and resulting in low error-floor. The efficiency of the algorithm is demonstrated by generating good codes of short to moderate length over small fields, outperforming codes generated by the known methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7487","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":"1304.7487","created_at":"2026-05-18T00:58:17.300544+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7487v2","created_at":"2026-05-18T00:58:17.300544+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7487","created_at":"2026-05-18T00:58:17.300544+00:00"},{"alias_kind":"pith_short_12","alias_value":"52EWSYZGU4TL","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"52EWSYZGU4TLFTQN","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"52EWSYZG","created_at":"2026-05-18T12:27:34.582898+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/52EWSYZGU4TLFTQNKCJJ3MT3U3","json":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3.json","graph_json":"https://pith.science/api/pith-number/52EWSYZGU4TLFTQNKCJJ3MT3U3/graph.json","events_json":"https://pith.science/api/pith-number/52EWSYZGU4TLFTQNKCJJ3MT3U3/events.json","paper":"https://pith.science/paper/52EWSYZG"},"agent_actions":{"view_html":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3","download_json":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3.json","view_paper":"https://pith.science/paper/52EWSYZG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7487&json=true","fetch_graph":"https://pith.science/api/pith-number/52EWSYZGU4TLFTQNKCJJ3MT3U3/graph.json","fetch_events":"https://pith.science/api/pith-number/52EWSYZGU4TLFTQNKCJJ3MT3U3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3/action/storage_attestation","attest_author":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3/action/author_attestation","sign_citation":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3/action/citation_signature","submit_replication":"https://pith.science/pith/52EWSYZGU4TLFTQNKCJJ3MT3U3/action/replication_record"}},"created_at":"2026-05-18T00:58:17.300544+00:00","updated_at":"2026-05-18T00:58:17.300544+00:00"}