{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EEZSMMCJA7TSQXKHYM7NE3AY3G","short_pith_number":"pith:EEZSMMCJ","canonical_record":{"source":{"id":"1703.00332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T15:06:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d22703958027a5c420397b24b71c5c7120ae3f3d09e1c3389308dce6b866531","abstract_canon_sha256":"a89a1c064c868b2a07c877adaa1c2fed5d1170c85e2658897d0892b8598104a3"},"schema_version":"1.0"},"canonical_sha256":"213326304907e7285d47c33ed26c18d9b222f07be9c920f965fefd16fbd7ea3d","source":{"kind":"arxiv","id":"1703.00332","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00332","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00332v2","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00332","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"EEZSMMCJA7TS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEZSMMCJA7TSQXKH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEZSMMCJ","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EEZSMMCJA7TSQXKHYM7NE3AY3G","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00332","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T15:06:38Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8d22703958027a5c420397b24b71c5c7120ae3f3d09e1c3389308dce6b866531","abstract_canon_sha256":"a89a1c064c868b2a07c877adaa1c2fed5d1170c85e2658897d0892b8598104a3"},"schema_version":"1.0"},"canonical_sha256":"213326304907e7285d47c33ed26c18d9b222f07be9c920f965fefd16fbd7ea3d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:18.851069Z","signature_b64":"5UCDvzU9/Bjrano2xvh+nvzH7E1zTfEFb5jDhpVj+zXUaykd4pQw1aoi3PTmA2F14+PJb3y66RwizAJSOYKICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"213326304907e7285d47c33ed26c18d9b222f07be9c920f965fefd16fbd7ea3d","last_reissued_at":"2026-05-18T00:29:18.850483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:18.850483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00332","source_version":2,"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:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bbN4xDsJvb83YWwdcykn6grDxgQqtTrFSU8qhGHcL2HNSLYaymrIRqY94asxqEM3yN9oaSknmP1ENoUJQHIWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:34:48.385790Z"},"content_sha256":"694c43c9df6bb7481032e54541e4cac3613d337fd831ca9f62a17c9554adf4ba","schema_version":"1.0","event_id":"sha256:694c43c9df6bb7481032e54541e4cac3613d337fd831ca9f62a17c9554adf4ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EEZSMMCJA7TSQXKHYM7NE3AY3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi, Massimo Battaglioni","submitted_at":"2017-03-01T15:06:38Z","abstract_excerpt":"In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable unwrapping procedures to obtain SC-LDPC-CCs. We show that the direct design of the SC-LDPC-CCs syndrome former matrix or, equivalently, the symbolic parity-check matrix, leads to codes with smaller syndrome former constraint lengths with respect to the best solutions available in the literature. We provide theoretical lower bounds on the syndrome form"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00332","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"},"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:29:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0DX/kpu2LJEh2K5m1vs3pdEssFkMXKcUJSHGpx2+E/5Ra8+hpaF+g9dXfZgwAJ0USpp1m/dsRtPwNbVihswBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:34:48.386141Z"},"content_sha256":"24e6021f1d908dda52f717d7139379eacbdf17e8ec4ed7b54a0304eb9f56ab1e","schema_version":"1.0","event_id":"sha256:24e6021f1d908dda52f717d7139379eacbdf17e8ec4ed7b54a0304eb9f56ab1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/bundle.json","state_url":"https://pith.science/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/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-01T20:34:48Z","links":{"resolver":"https://pith.science/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G","bundle":"https://pith.science/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/bundle.json","state":"https://pith.science/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EEZSMMCJA7TSQXKHYM7NE3AY3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EEZSMMCJA7TSQXKHYM7NE3AY3G","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":"a89a1c064c868b2a07c877adaa1c2fed5d1170c85e2658897d0892b8598104a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T15:06:38Z","title_canon_sha256":"8d22703958027a5c420397b24b71c5c7120ae3f3d09e1c3389308dce6b866531"},"schema_version":"1.0","source":{"id":"1703.00332","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00332","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00332v2","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00332","created_at":"2026-05-18T00:29:18Z"},{"alias_kind":"pith_short_12","alias_value":"EEZSMMCJA7TS","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEZSMMCJA7TSQXKH","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEZSMMCJ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:24e6021f1d908dda52f717d7139379eacbdf17e8ec4ed7b54a0304eb9f56ab1e","target":"graph","created_at":"2026-05-18T00:29:18Z","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":"In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit suitable unwrapping procedures to obtain SC-LDPC-CCs. We show that the direct design of the SC-LDPC-CCs syndrome former matrix or, equivalently, the symbolic parity-check matrix, leads to codes with smaller syndrome former constraint lengths with respect to the best solutions available in the literature. We provide theoretical lower bounds on the syndrome form","authors_text":"Alireza Tasdighi, Franco Chiaraluce, Giovanni Cancellieri, Marco Baldi, Massimo Battaglioni","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T15:06:38Z","title":"Design and Analysis of Time-Invariant SC-LDPC Convolutional Codes With Small Constraint Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00332","kind":"arxiv","version":2},"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:694c43c9df6bb7481032e54541e4cac3613d337fd831ca9f62a17c9554adf4ba","target":"record","created_at":"2026-05-18T00:29:18Z","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":"a89a1c064c868b2a07c877adaa1c2fed5d1170c85e2658897d0892b8598104a3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-03-01T15:06:38Z","title_canon_sha256":"8d22703958027a5c420397b24b71c5c7120ae3f3d09e1c3389308dce6b866531"},"schema_version":"1.0","source":{"id":"1703.00332","kind":"arxiv","version":2}},"canonical_sha256":"213326304907e7285d47c33ed26c18d9b222f07be9c920f965fefd16fbd7ea3d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"213326304907e7285d47c33ed26c18d9b222f07be9c920f965fefd16fbd7ea3d","first_computed_at":"2026-05-18T00:29:18.850483Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:18.850483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5UCDvzU9/Bjrano2xvh+nvzH7E1zTfEFb5jDhpVj+zXUaykd4pQw1aoi3PTmA2F14+PJb3y66RwizAJSOYKICA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:18.851069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00332","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:694c43c9df6bb7481032e54541e4cac3613d337fd831ca9f62a17c9554adf4ba","sha256:24e6021f1d908dda52f717d7139379eacbdf17e8ec4ed7b54a0304eb9f56ab1e"],"state_sha256":"24dc56f7742a43ae8f1b3dcd568f17536b0c4a548d30b06ab947257951461eed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hvuzs6xk92d0UZ8qtqYJbYTLdq4ZBAPwM9JUWb64Mm2qf3FnHma/QlGUfQP9/qmIl30TddxRENdBgsLYLb8RAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:34:48.388004Z","bundle_sha256":"b8f94ccc725cf0e541f385aa410a98a0544fba59bd87d1017a31769dfdcec068"}}