{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VFO5DUMIOBSGW55J573TRHB3EH","short_pith_number":"pith:VFO5DUMI","canonical_record":{"source":{"id":"1010.0060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6775b5bc73778ff416c7561ea9867981e6b34296993351ae9d03cb6588cbd1d8","abstract_canon_sha256":"efec7b703bfce891dd938b67418ff341b445f7e7ddb63728d34b70d371b46bfb"},"schema_version":"1.0"},"canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","source":{"kind":"arxiv","id":"1010.0060","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0060","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0060v2","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0060","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"VFO5DUMIOBSG","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VFO5DUMIOBSGW55J","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VFO5DUMI","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VFO5DUMIOBSGW55J573TRHB3EH","target":"record","payload":{"canonical_record":{"source":{"id":"1010.0060","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6775b5bc73778ff416c7561ea9867981e6b34296993351ae9d03cb6588cbd1d8","abstract_canon_sha256":"efec7b703bfce891dd938b67418ff341b445f7e7ddb63728d34b70d371b46bfb"},"schema_version":"1.0"},"canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:05:12.825390Z","signature_b64":"KIptm+yE1kkXO1hdotIIVvSXLX9mAHpU3I++vZKZjd4yFA6g5wo4Uy1ZR3AipmMEGGdHorvOQM3pMlwn3G3GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","last_reissued_at":"2026-05-18T02:05:12.824663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:05:12.824663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.0060","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-18T02:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MzoVlr2dTa5JObwYpTJymuat+TTiHUYSppykw/pdzZ8YpbWPRXAKtawhDhpGJXXGhz1lJn2C57sWoWS1e3vBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:35:26.271032Z"},"content_sha256":"b6dabf54d40c7830727cc80d34466e0d59b6784ef8dd11e17c3c1042d73ef6ad","schema_version":"1.0","event_id":"sha256:b6dabf54d40c7830727cc80d34466e0d59b6784ef8dd11e17c3c1042d73ef6ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VFO5DUMIOBSGW55J573TRHB3EH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa","submitted_at":"2010-10-01T04:27:29Z","abstract_excerpt":"In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0060","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-18T02:05:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ysqdV8m123gJeftCTpJkY0XWy3+A06NGo7pS2JeCduM7dl9PobE+oYcoPIW09LneYmgPpdi7iwTMZ12s2TRCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:35:26.271387Z"},"content_sha256":"fb0a92dd7f7b86c71bb61e347cd90c145b29a9c4c60acb4243398a5ccf40357b","schema_version":"1.0","event_id":"sha256:fb0a92dd7f7b86c71bb61e347cd90c145b29a9c4c60acb4243398a5ccf40357b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/bundle.json","state_url":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFO5DUMIOBSGW55J573TRHB3EH/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-01T17:35:26Z","links":{"resolver":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH","bundle":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/bundle.json","state":"https://pith.science/pith/VFO5DUMIOBSGW55J573TRHB3EH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFO5DUMIOBSGW55J573TRHB3EH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VFO5DUMIOBSGW55J573TRHB3EH","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":"efec7b703bfce891dd938b67418ff341b445f7e7ddb63728d34b70d371b46bfb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","title_canon_sha256":"6775b5bc73778ff416c7561ea9867981e6b34296993351ae9d03cb6588cbd1d8"},"schema_version":"1.0","source":{"id":"1010.0060","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.0060","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"arxiv_version","alias_value":"1010.0060v2","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0060","created_at":"2026-05-18T02:05:12Z"},{"alias_kind":"pith_short_12","alias_value":"VFO5DUMIOBSG","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VFO5DUMIOBSGW55J","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VFO5DUMI","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:fb0a92dd7f7b86c71bb61e347cd90c145b29a9c4c60acb4243398a5ccf40357b","target":"graph","created_at":"2026-05-18T02:05:12Z","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 present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felstroem and Zigangirov construction for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular non-binary LDPC convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation ","authors_text":"Hironori Uchikawa, Kenta Kasai, Kohichi Sakaniwa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","title":"Design and Performance of Rate-compatible Non-Binary LDPC Convolutional Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0060","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:b6dabf54d40c7830727cc80d34466e0d59b6784ef8dd11e17c3c1042d73ef6ad","target":"record","created_at":"2026-05-18T02:05:12Z","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":"efec7b703bfce891dd938b67418ff341b445f7e7ddb63728d34b70d371b46bfb","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-10-01T04:27:29Z","title_canon_sha256":"6775b5bc73778ff416c7561ea9867981e6b34296993351ae9d03cb6588cbd1d8"},"schema_version":"1.0","source":{"id":"1010.0060","kind":"arxiv","version":2}},"canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a95dd1d18870646b77a9eff7389c3b21f507832010960c75263fabfb62724049","first_computed_at":"2026-05-18T02:05:12.824663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:05:12.824663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KIptm+yE1kkXO1hdotIIVvSXLX9mAHpU3I++vZKZjd4yFA6g5wo4Uy1ZR3AipmMEGGdHorvOQM3pMlwn3G3GDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:05:12.825390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.0060","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6dabf54d40c7830727cc80d34466e0d59b6784ef8dd11e17c3c1042d73ef6ad","sha256:fb0a92dd7f7b86c71bb61e347cd90c145b29a9c4c60acb4243398a5ccf40357b"],"state_sha256":"5e8331b0e9281d38831771c3d9e5d258db3db8279ba6ab4bb2c0d3be77f3fefa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aud3l89PZsoS3C96NbYbgP5uKvLV+bTxCzRKH4BOQBpecQJw6UgtTVPnHqLh7h2F3Am+6mGNGnRyqQlBtXiRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:35:26.273611Z","bundle_sha256":"5f6e823b9c90defa8bcbff482aa8e17dac7d46d3a76c0a063dc255cbad59a186"}}