{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GB22HRDRYMDARM6J24OOPXTJIY","short_pith_number":"pith:GB22HRDR","schema_version":"1.0","canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","source":{"kind":"arxiv","id":"1804.06454","version":1},"attestation_state":"computed","paper":{"title":"Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Mohammad H. Tadayon","submitted_at":"2018-04-17T19:47:42Z","abstract_excerpt":"We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths. Several numerical examples are given to show its effectiveness."},"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":"1804.06454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-17T19:47:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"e379261975d66300236258ed4d2acbfdf2ac1330ff652829696880f9e22effa2","abstract_canon_sha256":"0e9c1c8a28fc412311dfe567940d7714dfedd77e7a20d50a7be7d3e96f0ee6d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:06.623438Z","signature_b64":"1QqaypSexC+MS/KYrcQFQfrSFzdp6+nEU5t/aqT1hr1nk6KZ0vIUuTSr6EsyXER5e3sAvSfLHe2BYfTJc6QnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","last_reissued_at":"2026-05-18T00:18:06.621711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:06.621711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Mohammad H. Tadayon","submitted_at":"2018-04-17T19:47:42Z","abstract_excerpt":"We propose a low-complexity method to find quasi-cyclic low-density parity-check block codes with girth 10 or 12 and shorter length than those designed through classical approaches. The method is extended to time-invariant spatially coupled low-density parity-check convolutional codes, permitting to achieve small syndrome former constraint lengths. Several numerical examples are given to show its effectiveness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06454","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":"1804.06454","created_at":"2026-05-18T00:18:06.622823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06454v1","created_at":"2026-05-18T00:18:06.622823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06454","created_at":"2026-05-18T00:18:06.622823+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB22HRDRYMDA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB22HRDRYMDARM6J","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB22HRDR","created_at":"2026-05-18T12:32:25.280505+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/GB22HRDRYMDARM6J24OOPXTJIY","json":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY.json","graph_json":"https://pith.science/api/pith-number/GB22HRDRYMDARM6J24OOPXTJIY/graph.json","events_json":"https://pith.science/api/pith-number/GB22HRDRYMDARM6J24OOPXTJIY/events.json","paper":"https://pith.science/paper/GB22HRDR"},"agent_actions":{"view_html":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY","download_json":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY.json","view_paper":"https://pith.science/paper/GB22HRDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06454&json=true","fetch_graph":"https://pith.science/api/pith-number/GB22HRDRYMDARM6J24OOPXTJIY/graph.json","fetch_events":"https://pith.science/api/pith-number/GB22HRDRYMDARM6J24OOPXTJIY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/action/storage_attestation","attest_author":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/action/author_attestation","sign_citation":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/action/citation_signature","submit_replication":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/action/replication_record"}},"created_at":"2026-05-18T00:18:06.622823+00:00","updated_at":"2026-05-18T00:18:06.622823+00:00"}