{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PXHYSZVDTZOBUUQW3RDIVOGNFT","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":"3674455fb84b8354cdb2585fea73514bceaa749515cc85c300a35262d54ac9f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T07:31:52Z","title_canon_sha256":"d4cf1da459e1d72417a585cd72922df3eeb02fb72c8e2fd986ddcd1c761df814"},"schema_version":"1.0","source":{"id":"1604.00761","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.00761","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"arxiv_version","alias_value":"1604.00761v1","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00761","created_at":"2026-05-18T00:58:57Z"},{"alias_kind":"pith_short_12","alias_value":"PXHYSZVDTZOB","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PXHYSZVDTZOBUUQW","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PXHYSZVD","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:9937a02b546f134f96896910f5d0b9ec9237fd0d39305b40b116859156ef10ba","target":"graph","created_at":"2026-05-18T00:58:57Z","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 trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes in an attempt to estimate the number of redundant rows in a parity-check matrix suitable for iterative decoding. Essentially the same concepts appear in other contexts as well such as robust syndrome extraction for quantum error correction. Among the known upper bounds on the trapping redundancy, the strongest one was proposed by employing a powerful tool i","authors_text":"Yuichiro Fujiwara, Yu Tsunoda","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T07:31:52Z","title":"Probabilistic bounds on the trapping redundancy of linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00761","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:e8cc214ea6122bff27e53303c65d295ec9b00ed085b657ecf606d057afbdf3a2","target":"record","created_at":"2026-05-18T00:58:57Z","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":"3674455fb84b8354cdb2585fea73514bceaa749515cc85c300a35262d54ac9f2","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-04-04T07:31:52Z","title_canon_sha256":"d4cf1da459e1d72417a585cd72922df3eeb02fb72c8e2fd986ddcd1c761df814"},"schema_version":"1.0","source":{"id":"1604.00761","kind":"arxiv","version":1}},"canonical_sha256":"7dcf8966a39e5c1a5216dc468ab8cd2cc22e21ba541bf4fd3eb5497416da56b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dcf8966a39e5c1a5216dc468ab8cd2cc22e21ba541bf4fd3eb5497416da56b7","first_computed_at":"2026-05-18T00:58:57.064700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:57.064700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHhY1jEA+AExGqcHGOx3xuBuA9vq9mUJOfxPVPPBuBtipvPpNkwIT7HQcooovj1u8qQ/uOewifbI/XKZKhmKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:57.065510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.00761","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8cc214ea6122bff27e53303c65d295ec9b00ed085b657ecf606d057afbdf3a2","sha256:9937a02b546f134f96896910f5d0b9ec9237fd0d39305b40b116859156ef10ba"],"state_sha256":"465a4ef933f198751fc56ebd8e2a40b5093c713819251fb5ae2ff06be761f3d3"}