{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FQCM5OXPMGO4QE7CH7LVZCSJ6T","short_pith_number":"pith:FQCM5OXP","schema_version":"1.0","canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","source":{"kind":"arxiv","id":"1103.3641","version":2},"attestation_state":"computed","paper":{"title":"On the Pseudocodeword Redundancy of Binary Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jens Zumbr\\\"agel, Mark F. Flanagan, Vitaly Skachek","submitted_at":"2011-03-18T14:57:28Z","abstract_excerpt":"The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1103.3641","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-18T14:57:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"8425f5e57393cabb526e7b7b8b24b591274142b76e61e9f9111211c50a762381","abstract_canon_sha256":"57145f585bb8253a3dd70bab7229a61b47ce364bb8e3482e41f9bd6f062651ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:49.520691Z","signature_b64":"GfgQflgcMwTWlVSrkMna3m6oujRpk39uOjRFoAOZvQv3/23WI5PE4QatVkARQlFfTlaNtoe51O1BBmqH8r8vDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","last_reissued_at":"2026-05-18T04:00:49.520185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:49.520185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Pseudocodeword Redundancy of Binary Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jens Zumbr\\\"agel, Mark F. Flanagan, Vitaly Skachek","submitted_at":"2011-03-18T14:57:28Z","abstract_excerpt":"The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3641","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.3641","created_at":"2026-05-18T04:00:49.520254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3641v2","created_at":"2026-05-18T04:00:49.520254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3641","created_at":"2026-05-18T04:00:49.520254+00:00"},{"alias_kind":"pith_short_12","alias_value":"FQCM5OXPMGO4","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FQCM5OXPMGO4QE7C","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FQCM5OXP","created_at":"2026-05-18T12:26:28.662955+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T","json":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T.json","graph_json":"https://pith.science/api/pith-number/FQCM5OXPMGO4QE7CH7LVZCSJ6T/graph.json","events_json":"https://pith.science/api/pith-number/FQCM5OXPMGO4QE7CH7LVZCSJ6T/events.json","paper":"https://pith.science/paper/FQCM5OXP"},"agent_actions":{"view_html":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T","download_json":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T.json","view_paper":"https://pith.science/paper/FQCM5OXP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3641&json=true","fetch_graph":"https://pith.science/api/pith-number/FQCM5OXPMGO4QE7CH7LVZCSJ6T/graph.json","fetch_events":"https://pith.science/api/pith-number/FQCM5OXPMGO4QE7CH7LVZCSJ6T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/action/storage_attestation","attest_author":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/action/author_attestation","sign_citation":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/action/citation_signature","submit_replication":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/action/replication_record"}},"created_at":"2026-05-18T04:00:49.520254+00:00","updated_at":"2026-05-18T04:00:49.520254+00:00"}