{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:HQS65LNLE64XOUGBWRKA36YFEO","short_pith_number":"pith:HQS65LNL","canonical_record":{"source":{"id":"1101.5858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T07:08:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9b512d5a5629ed1a448e8a031d8554da05c6305f3fb44faf209fa4f5d6447aef","abstract_canon_sha256":"83db59dcb491c8472577d321cde447b461b8559bc9dd1ef002ba1a373534f88d"},"schema_version":"1.0"},"canonical_sha256":"3c25eeadab27b97750c1b4540dfb052389f2f67696ac551646d4472637d37df8","source":{"kind":"arxiv","id":"1101.5858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5858","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5858v1","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5858","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"HQS65LNLE64X","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HQS65LNLE64XOUGB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HQS65LNL","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:HQS65LNLE64XOUGBWRKA36YFEO","target":"record","payload":{"canonical_record":{"source":{"id":"1101.5858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T07:08:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9b512d5a5629ed1a448e8a031d8554da05c6305f3fb44faf209fa4f5d6447aef","abstract_canon_sha256":"83db59dcb491c8472577d321cde447b461b8559bc9dd1ef002ba1a373534f88d"},"schema_version":"1.0"},"canonical_sha256":"3c25eeadab27b97750c1b4540dfb052389f2f67696ac551646d4472637d37df8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:20.248589Z","signature_b64":"wzysv1V3dG7AgR5joT5ETcvQaFDce4KVUX+5e1Kmu30QNZbSaaVpi6OaAHqOYP8SoNocO6+6Jd2ofqqKUTy4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c25eeadab27b97750c1b4540dfb052389f2f67696ac551646d4472637d37df8","last_reissued_at":"2026-05-18T02:03:20.248107Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:20.248107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.5858","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-18T02:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mtXoSKh5MdVJhvEgzEc3YB1G29ErINf7y9aBM0LF7a3GmXuc1rrZoglPmV9smynKy2Ai4D/PgHZRd8r64QCjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:24:32.220714Z"},"content_sha256":"e70b26fe1b0a2d003c2357984ee9c7ab6fb579376860b67c6e2bbb95b9b112ee","schema_version":"1.0","event_id":"sha256:e70b26fe1b0a2d003c2357984ee9c7ab6fb579376860b67c6e2bbb95b9b112ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:HQS65LNLE64XOUGBWRKA36YFEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Koji Okino, Masato Tajima, Takashi Miyagoshi","submitted_at":"2011-01-31T07:08:56Z","abstract_excerpt":"In this paper, we show that the code-trellis and the error-trellis for a convolutional code can be reduced simultaneously, if reduction is possible. Assume that the error-trellis can be reduced using shifted error-subsequences. In this case, if the identical shifts occur in the subsequences of each code path, then the code-trellis can also be reduced. First, we obtain pairs of transformations which generate the identical shifts both in the subsequences of the code-path and in those of the error-path. Next, by applying these transformations to the generator matrix and the parity-check matrix, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5858","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-18T02:03:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PA0b9eKq6dSzIjyJNhjmB6MXVWYF6kf3afvroeiOKrBcS++ilPn6TIbNxjlF8WCF1P/HAXMZP7Ed4H6wcB+uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T13:24:32.221045Z"},"content_sha256":"4ea31d231e6929db863b64880cf1257b8efd83da228eee90acbb78466ce16eae","schema_version":"1.0","event_id":"sha256:4ea31d231e6929db863b64880cf1257b8efd83da228eee90acbb78466ce16eae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQS65LNLE64XOUGBWRKA36YFEO/bundle.json","state_url":"https://pith.science/pith/HQS65LNLE64XOUGBWRKA36YFEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQS65LNLE64XOUGBWRKA36YFEO/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-07-02T13:24:32Z","links":{"resolver":"https://pith.science/pith/HQS65LNLE64XOUGBWRKA36YFEO","bundle":"https://pith.science/pith/HQS65LNLE64XOUGBWRKA36YFEO/bundle.json","state":"https://pith.science/pith/HQS65LNLE64XOUGBWRKA36YFEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQS65LNLE64XOUGBWRKA36YFEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:HQS65LNLE64XOUGBWRKA36YFEO","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":"83db59dcb491c8472577d321cde447b461b8559bc9dd1ef002ba1a373534f88d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T07:08:56Z","title_canon_sha256":"9b512d5a5629ed1a448e8a031d8554da05c6305f3fb44faf209fa4f5d6447aef"},"schema_version":"1.0","source":{"id":"1101.5858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.5858","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"arxiv_version","alias_value":"1101.5858v1","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.5858","created_at":"2026-05-18T02:03:20Z"},{"alias_kind":"pith_short_12","alias_value":"HQS65LNLE64X","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"HQS65LNLE64XOUGB","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"HQS65LNL","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:4ea31d231e6929db863b64880cf1257b8efd83da228eee90acbb78466ce16eae","target":"graph","created_at":"2026-05-18T02:03:20Z","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 show that the code-trellis and the error-trellis for a convolutional code can be reduced simultaneously, if reduction is possible. Assume that the error-trellis can be reduced using shifted error-subsequences. In this case, if the identical shifts occur in the subsequences of each code path, then the code-trellis can also be reduced. First, we obtain pairs of transformations which generate the identical shifts both in the subsequences of the code-path and in those of the error-path. Next, by applying these transformations to the generator matrix and the parity-check matrix, w","authors_text":"Koji Okino, Masato Tajima, Takashi Miyagoshi","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T07:08:56Z","title":"Simultaneous Code/Error-Trellis Reduction for Convolutional Codes Using Shifted Code/Error-Subsequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.5858","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:e70b26fe1b0a2d003c2357984ee9c7ab6fb579376860b67c6e2bbb95b9b112ee","target":"record","created_at":"2026-05-18T02:03:20Z","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":"83db59dcb491c8472577d321cde447b461b8559bc9dd1ef002ba1a373534f88d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-01-31T07:08:56Z","title_canon_sha256":"9b512d5a5629ed1a448e8a031d8554da05c6305f3fb44faf209fa4f5d6447aef"},"schema_version":"1.0","source":{"id":"1101.5858","kind":"arxiv","version":1}},"canonical_sha256":"3c25eeadab27b97750c1b4540dfb052389f2f67696ac551646d4472637d37df8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c25eeadab27b97750c1b4540dfb052389f2f67696ac551646d4472637d37df8","first_computed_at":"2026-05-18T02:03:20.248107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:20.248107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wzysv1V3dG7AgR5joT5ETcvQaFDce4KVUX+5e1Kmu30QNZbSaaVpi6OaAHqOYP8SoNocO6+6Jd2ofqqKUTy4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:20.248589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.5858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e70b26fe1b0a2d003c2357984ee9c7ab6fb579376860b67c6e2bbb95b9b112ee","sha256:4ea31d231e6929db863b64880cf1257b8efd83da228eee90acbb78466ce16eae"],"state_sha256":"c7f61e8822809166a2584539580fb4eb508566a146ba3b11809ab05b33e12f23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njglD27MIZgO4Bv0kBsuLHKYTYIoDq1Q5wh0b/TayeoHZzTbxHFga+TTnRU4JobFSS/vBr3w6VpRGIURozCHAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T13:24:32.222841Z","bundle_sha256":"761269076569445cb220ecc5c3614285d05da76ab486bb4d26e9b0252ae0bf65"}}