{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FQCM5OXPMGO4QE7CH7LVZCSJ6T","short_pith_number":"pith:FQCM5OXP","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"},"canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","source":{"kind":"arxiv","id":"1103.3641","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3641","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3641v2","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3641","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"FQCM5OXPMGO4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQCM5OXPMGO4QE7C","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQCM5OXP","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FQCM5OXPMGO4QE7CH7LVZCSJ6T","target":"record","payload":{"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"},"canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","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"},"source_kind":"arxiv","source_id":"1103.3641","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-18T04:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtB8Cy0AbsG428zv74t+UbnZoKALZoawGYDNl4V1X8c05vY24WVAwen6shi2o4/5xMl3QEKdVKFy1Fedn8NxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:30:21.361781Z"},"content_sha256":"26f45245b1c9e7d1a5ded907877a7c0611964b6fd930e336915b2f0a9b009e5a","schema_version":"1.0","event_id":"sha256:26f45245b1c9e7d1a5ded907877a7c0611964b6fd930e336915b2f0a9b009e5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FQCM5OXPMGO4QE7CH7LVZCSJ6T","target":"graph","payload":{"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"},"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-18T04:00:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7fq7BHuvADWsLsil2J/fmuDK1HEaXg2ZQSLhH7SGVhslB9SrFVGR3Pup36N/PolZJFEnD/ae7ghpB+RroMbuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:30:21.362123Z"},"content_sha256":"b5b3756a2f6ff41319682de14ba3a2f4c1dbfa65153a9630380e7c7ddc968271","schema_version":"1.0","event_id":"sha256:b5b3756a2f6ff41319682de14ba3a2f4c1dbfa65153a9630380e7c7ddc968271"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/bundle.json","state_url":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/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-23T18:30:21Z","links":{"resolver":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T","bundle":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/bundle.json","state":"https://pith.science/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FQCM5OXPMGO4QE7CH7LVZCSJ6T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FQCM5OXPMGO4QE7CH7LVZCSJ6T","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":"57145f585bb8253a3dd70bab7229a61b47ce364bb8e3482e41f9bd6f062651ef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-18T14:57:28Z","title_canon_sha256":"8425f5e57393cabb526e7b7b8b24b591274142b76e61e9f9111211c50a762381"},"schema_version":"1.0","source":{"id":"1103.3641","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3641","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3641v2","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3641","created_at":"2026-05-18T04:00:49Z"},{"alias_kind":"pith_short_12","alias_value":"FQCM5OXPMGO4","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FQCM5OXPMGO4QE7C","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FQCM5OXP","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:b5b3756a2f6ff41319682de14ba3a2f4c1dbfa65153a9630380e7c7ddc968271","target":"graph","created_at":"2026-05-18T04:00:49Z","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 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","authors_text":"Jens Zumbr\\\"agel, Mark F. Flanagan, Vitaly Skachek","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-18T14:57:28Z","title":"On the Pseudocodeword Redundancy of Binary Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3641","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:26f45245b1c9e7d1a5ded907877a7c0611964b6fd930e336915b2f0a9b009e5a","target":"record","created_at":"2026-05-18T04:00:49Z","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":"57145f585bb8253a3dd70bab7229a61b47ce364bb8e3482e41f9bd6f062651ef","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-03-18T14:57:28Z","title_canon_sha256":"8425f5e57393cabb526e7b7b8b24b591274142b76e61e9f9111211c50a762381"},"schema_version":"1.0","source":{"id":"1103.3641","kind":"arxiv","version":2}},"canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c04cebaef619dc813e23fd75c8a49f4db6a18da8da803533dc1940dab108236","first_computed_at":"2026-05-18T04:00:49.520185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:49.520185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GfgQflgcMwTWlVSrkMna3m6oujRpk39uOjRFoAOZvQv3/23WI5PE4QatVkARQlFfTlaNtoe51O1BBmqH8r8vDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:49.520691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3641","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26f45245b1c9e7d1a5ded907877a7c0611964b6fd930e336915b2f0a9b009e5a","sha256:b5b3756a2f6ff41319682de14ba3a2f4c1dbfa65153a9630380e7c7ddc968271"],"state_sha256":"2486e7fd6573575f6b3ee55f8120ac43710c0a9c77845e6de37845ef59214990"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AwNb1yUbi8/lep/kjH++5zGaNJUAD0ZFUm5hHrRoxm6AXuHLCjrMTRmwDigRsTCEgsp1g1x0tUdb8aPuhWOsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:30:21.364049Z","bundle_sha256":"445a8b43087ee30bfd919b81e2ab2643af2484c3aa7369db6ec0bc8dc9d57ec3"}}