{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GB22HRDRYMDARM6J24OOPXTJIY","short_pith_number":"pith:GB22HRDR","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"},"canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","source":{"kind":"arxiv","id":"1804.06454","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06454","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06454v1","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06454","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"GB22HRDRYMDA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GB22HRDRYMDARM6J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GB22HRDR","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GB22HRDRYMDARM6J24OOPXTJIY","target":"record","payload":{"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"},"canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","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"},"source_kind":"arxiv","source_id":"1804.06454","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sRBrLwkPLOWDhWWXgv2lVkDvY8BcOwaf1eeQe5oo3a5MIuVjdQqCO5CDONrqiJE7t4lGi1Gwia6kbEQ+hCrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:35.446097Z"},"content_sha256":"ef037e2f6342d0a24616f036b2c2fae02e9cc6fea44603440fed95a70e8cf3a5","schema_version":"1.0","event_id":"sha256:ef037e2f6342d0a24616f036b2c2fae02e9cc6fea44603440fed95a70e8cf3a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GB22HRDRYMDARM6J24OOPXTJIY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLacmJqcWx3B9J2kZLmrlM5hCUINUXEJfaEI1Br9iGDO5MLpDNfyo7ttQnMk0f06+opcROCRcW0H0fJO7hZTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:21:35.446463Z"},"content_sha256":"131c2d836d2d70ff68bb5e7fd7310040a387619c8a7a664132a6833e8e718346","schema_version":"1.0","event_id":"sha256:131c2d836d2d70ff68bb5e7fd7310040a387619c8a7a664132a6833e8e718346"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/bundle.json","state_url":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GB22HRDRYMDARM6J24OOPXTJIY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T04:21:35Z","links":{"resolver":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY","bundle":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/bundle.json","state":"https://pith.science/pith/GB22HRDRYMDARM6J24OOPXTJIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GB22HRDRYMDARM6J24OOPXTJIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GB22HRDRYMDARM6J24OOPXTJIY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"0e9c1c8a28fc412311dfe567940d7714dfedd77e7a20d50a7be7d3e96f0ee6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-17T19:47:42Z","title_canon_sha256":"e379261975d66300236258ed4d2acbfdf2ac1330ff652829696880f9e22effa2"},"schema_version":"1.0","source":{"id":"1804.06454","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.06454","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"arxiv_version","alias_value":"1804.06454v1","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06454","created_at":"2026-05-18T00:18:06Z"},{"alias_kind":"pith_short_12","alias_value":"GB22HRDRYMDA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GB22HRDRYMDARM6J","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GB22HRDR","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:131c2d836d2d70ff68bb5e7fd7310040a387619c8a7a664132a6833e8e718346","target":"graph","created_at":"2026-05-18T00:18:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Marco Baldi, Massimo Battaglioni, Mohammad H. Tadayon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-17T19:47:42Z","title":"Efficient Search of Compact QC-LDPC and SC-LDPC Convolutional Codes with Large Girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06454","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ef037e2f6342d0a24616f036b2c2fae02e9cc6fea44603440fed95a70e8cf3a5","target":"record","created_at":"2026-05-18T00:18:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"0e9c1c8a28fc412311dfe567940d7714dfedd77e7a20d50a7be7d3e96f0ee6d4","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-17T19:47:42Z","title_canon_sha256":"e379261975d66300236258ed4d2acbfdf2ac1330ff652829696880f9e22effa2"},"schema_version":"1.0","source":{"id":"1804.06454","kind":"arxiv","version":1}},"canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3075a3c471c30608b3c9d71ce7de6946329d74d9cb0a3f689d9d9291738f55e8","first_computed_at":"2026-05-18T00:18:06.621711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:06.621711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1QqaypSexC+MS/KYrcQFQfrSFzdp6+nEU5t/aqT1hr1nk6KZ0vIUuTSr6EsyXER5e3sAvSfLHe2BYfTJc6QnDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:06.623438Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.06454","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef037e2f6342d0a24616f036b2c2fae02e9cc6fea44603440fed95a70e8cf3a5","sha256:131c2d836d2d70ff68bb5e7fd7310040a387619c8a7a664132a6833e8e718346"],"state_sha256":"76f14bf2aedeb3d63700088b6ff0c424cd3bbf8a64282b670bea777b038014e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"De8vPFMm3odPF75CXW4v7AKajEytXQB+w1/3YaM9wPZGXHk617dWINTDkZ1IToNR+cmuzxx2HxtCKt6vigFRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:21:35.448393Z","bundle_sha256":"f5063f45dd2a37c2c0c83c6572baddd224fdbc7442f9d546afe5dddc7d95345d"}}