{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TLOMD6JUV5PXZUYCQUCWMF7ESL","short_pith_number":"pith:TLOMD6JU","canonical_record":{"source":{"id":"1410.1627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-07T07:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9050851d95fa00d3c7618df0a1d88fa9bed55d6691e25b8bab792941927d18ca","abstract_canon_sha256":"76550326996e4e00f0658ec1a25bb8d738bd880f0c37cb70842be4d6d717c8bc"},"schema_version":"1.0"},"canonical_sha256":"9adcc1f934af5f7cd30285056617e492d2db67b809910df9d46fdf6f5034ac98","source":{"kind":"arxiv","id":"1410.1627","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1627","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1627v1","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1627","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"TLOMD6JUV5PX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLOMD6JUV5PXZUYC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLOMD6JU","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TLOMD6JUV5PXZUYCQUCWMF7ESL","target":"record","payload":{"canonical_record":{"source":{"id":"1410.1627","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-07T07:10:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"9050851d95fa00d3c7618df0a1d88fa9bed55d6691e25b8bab792941927d18ca","abstract_canon_sha256":"76550326996e4e00f0658ec1a25bb8d738bd880f0c37cb70842be4d6d717c8bc"},"schema_version":"1.0"},"canonical_sha256":"9adcc1f934af5f7cd30285056617e492d2db67b809910df9d46fdf6f5034ac98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:55.243427Z","signature_b64":"t16a/c1FVyYk3hE5/p83VCGD+lqrU2ZZBbDyTvqYjWewHGj/WXVd8PxPYczkGQOAzgxmKyKDtOAPwurccyXeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9adcc1f934af5f7cd30285056617e492d2db67b809910df9d46fdf6f5034ac98","last_reissued_at":"2026-05-18T02:40:55.242751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:55.242751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.1627","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:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A3fhaCbYhcEbPW0wZPz7mldlOGB4MLeq4bWhCURt6GHWPyxiWnV3JUmc2KRHX7YuGWolci5ThaQQUeVUsthjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:50.326741Z"},"content_sha256":"9242ab8b5eea7da89ab36344ecdccdf4a70998a0adf75c00d06d76c3a4a9b17b","schema_version":"1.0","event_id":"sha256:9242ab8b5eea7da89ab36344ecdccdf4a70998a0adf75c00d06d76c3a4a9b17b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TLOMD6JUV5PXZUYCQUCWMF7ESL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Results on the Pseudoredundancy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jens Zumbr\\\"agel, Marcus Greferath, Xin-Wen Wu, Zihui Liu","submitted_at":"2014-10-07T07:10:27Z","abstract_excerpt":"The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kl{\\o}ve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1627","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:40:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z2MOlNe7NlsABLOmcs1jWg1u2g8sX/iXHv0pT6J+kitTurKYSCAaM6DYn6ZWGKGh9CeIqHhRex9AjFEl7YrjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:43:50.327527Z"},"content_sha256":"850e6acde691b4c8a5332b0893846faf8a91db1083724a24723c2837275db6e0","schema_version":"1.0","event_id":"sha256:850e6acde691b4c8a5332b0893846faf8a91db1083724a24723c2837275db6e0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/bundle.json","state_url":"https://pith.science/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/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-05-30T07:43:50Z","links":{"resolver":"https://pith.science/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL","bundle":"https://pith.science/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/bundle.json","state":"https://pith.science/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TLOMD6JUV5PXZUYCQUCWMF7ESL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TLOMD6JUV5PXZUYCQUCWMF7ESL","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":"76550326996e4e00f0658ec1a25bb8d738bd880f0c37cb70842be4d6d717c8bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-07T07:10:27Z","title_canon_sha256":"9050851d95fa00d3c7618df0a1d88fa9bed55d6691e25b8bab792941927d18ca"},"schema_version":"1.0","source":{"id":"1410.1627","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.1627","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1410.1627v1","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1627","created_at":"2026-05-18T02:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"TLOMD6JUV5PX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"TLOMD6JUV5PXZUYC","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"TLOMD6JU","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:850e6acde691b4c8a5332b0893846faf8a91db1083724a24723c2837275db6e0","target":"graph","created_at":"2026-05-18T02:40:55Z","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":"The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kl{\\o}ve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcode","authors_text":"Jens Zumbr\\\"agel, Marcus Greferath, Xin-Wen Wu, Zihui Liu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-07T07:10:27Z","title":"New Results on the Pseudoredundancy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1627","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:9242ab8b5eea7da89ab36344ecdccdf4a70998a0adf75c00d06d76c3a4a9b17b","target":"record","created_at":"2026-05-18T02:40:55Z","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":"76550326996e4e00f0658ec1a25bb8d738bd880f0c37cb70842be4d6d717c8bc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-10-07T07:10:27Z","title_canon_sha256":"9050851d95fa00d3c7618df0a1d88fa9bed55d6691e25b8bab792941927d18ca"},"schema_version":"1.0","source":{"id":"1410.1627","kind":"arxiv","version":1}},"canonical_sha256":"9adcc1f934af5f7cd30285056617e492d2db67b809910df9d46fdf6f5034ac98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9adcc1f934af5f7cd30285056617e492d2db67b809910df9d46fdf6f5034ac98","first_computed_at":"2026-05-18T02:40:55.242751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:55.242751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t16a/c1FVyYk3hE5/p83VCGD+lqrU2ZZBbDyTvqYjWewHGj/WXVd8PxPYczkGQOAzgxmKyKDtOAPwurccyXeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:55.243427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.1627","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9242ab8b5eea7da89ab36344ecdccdf4a70998a0adf75c00d06d76c3a4a9b17b","sha256:850e6acde691b4c8a5332b0893846faf8a91db1083724a24723c2837275db6e0"],"state_sha256":"43d7db73105389087cf1155a12f3f9752c5132b85ba6cf9711919ae4f0bb75e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXlICDh8t+2sy8mTgpW2Z8nxvFh761A6nDWOw+FUAn7krYMXmLcNEjNo00fAJx/rwfbxKwBYt4PRtDu917SPBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:43:50.331350Z","bundle_sha256":"7030f57582169c977e6ca692c7e3180b25517228fabca6104e73e0b657b63415"}}