{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:CTF4JAEJKMCCJLNA72YGANCZIC","short_pith_number":"pith:CTF4JAEJ","canonical_record":{"source":{"id":"cs/0508019","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-02T16:34:05Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"1fdc0b6c12e230518dac420cd13475b41f9ea12ad8c79571175e8c780637c962","abstract_canon_sha256":"53111bd63ce5467b5a1b481a1106c6652019a952abf96f329fe18aa8a30ef8c5"},"schema_version":"1.0"},"canonical_sha256":"14cbc48089530424ada0feb060345940a8dcb8f0de35d311a28fa542c26c43c6","source":{"kind":"arxiv","id":"cs/0508019","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508019","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508019v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508019","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"CTF4JAEJKMCC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"CTF4JAEJKMCCJLNA","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"CTF4JAEJ","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:CTF4JAEJKMCCJLNA72YGANCZIC","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0508019","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-02T16:34:05Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"1fdc0b6c12e230518dac420cd13475b41f9ea12ad8c79571175e8c780637c962","abstract_canon_sha256":"53111bd63ce5467b5a1b481a1106c6652019a952abf96f329fe18aa8a30ef8c5"},"schema_version":"1.0"},"canonical_sha256":"14cbc48089530424ada0feb060345940a8dcb8f0de35d311a28fa542c26c43c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.791255Z","signature_b64":"hwNALmMEhipFaHgTku+0mA9s46Fzo3EyrlCwtvxfsrDLgZfTm12frr0XBUVK1c9leA0uhN7UIVwSCspo6qTAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14cbc48089530424ada0feb060345940a8dcb8f0de35d311a28fa542c26c43c6","last_reissued_at":"2026-05-18T00:58:26.790643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.790643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0508019","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IRuBMKvn6Mx0CrW2jzZV3MIDZ9uFFTPTSwEaGBhwi7nX41P6w1PLFjri6Kt9vXR1PxAdj9sWBmyKFrstKmbtCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:57:48.970975Z"},"content_sha256":"5d10631d94d86ea6d0f982b3960616afcf880b99bef481bbf338c02378fd1c7b","schema_version":"1.0","event_id":"sha256:5d10631d94d86ea6d0f982b3960616afcf880b99bef481bbf338c02378fd1c7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:CTF4JAEJKMCCJLNA72YGANCZIC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Minimal Pseudo-Codewords of Codes from Finite Geometries","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"Dejan Vukobratovic, Jason Teutsch, Negar Kiyavash, Pascal O. Vontobel, Roxana Smarandache","submitted_at":"2005-08-02T16:34:05Z","abstract_excerpt":"In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal pseudo-codewords. This paper studies the minimal codewords and minimal pseudo-codewords of some families of codes derived from projective and Euclidean planes. Although our numerical results are only for codes of very modest length, they suggest that these code families exhibit an interesting property. Namely, all minimal pseudo-codewords that are not multiples o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508019","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-18T00:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Le67t3M3A1ksdqphNIrwW1jZ5aEX/80DjXSIW2u7XwWRUau1v47i6pcPyA/ARyD5e8qZHRAfHWBguda1Gb7JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:57:48.971388Z"},"content_sha256":"49e92b351b77551fe92bd6e33f64355bca0f364303f614def8eba692651c2f34","schema_version":"1.0","event_id":"sha256:49e92b351b77551fe92bd6e33f64355bca0f364303f614def8eba692651c2f34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CTF4JAEJKMCCJLNA72YGANCZIC/bundle.json","state_url":"https://pith.science/pith/CTF4JAEJKMCCJLNA72YGANCZIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CTF4JAEJKMCCJLNA72YGANCZIC/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-26T18:57:48Z","links":{"resolver":"https://pith.science/pith/CTF4JAEJKMCCJLNA72YGANCZIC","bundle":"https://pith.science/pith/CTF4JAEJKMCCJLNA72YGANCZIC/bundle.json","state":"https://pith.science/pith/CTF4JAEJKMCCJLNA72YGANCZIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CTF4JAEJKMCCJLNA72YGANCZIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:CTF4JAEJKMCCJLNA72YGANCZIC","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":"53111bd63ce5467b5a1b481a1106c6652019a952abf96f329fe18aa8a30ef8c5","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-02T16:34:05Z","title_canon_sha256":"1fdc0b6c12e230518dac420cd13475b41f9ea12ad8c79571175e8c780637c962"},"schema_version":"1.0","source":{"id":"cs/0508019","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508019","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0508019v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508019","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"CTF4JAEJKMCC","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"CTF4JAEJKMCCJLNA","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"CTF4JAEJ","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:49e92b351b77551fe92bd6e33f64355bca0f364303f614def8eba692651c2f34","target":"graph","created_at":"2026-05-18T00:58:26Z","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 order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) decoding, it turns out to be necessary to know the minimal pseudo-codewords. This paper studies the minimal codewords and minimal pseudo-codewords of some families of codes derived from projective and Euclidean planes. Although our numerical results are only for codes of very modest length, they suggest that these code families exhibit an interesting property. Namely, all minimal pseudo-codewords that are not multiples o","authors_text":"Dejan Vukobratovic, Jason Teutsch, Negar Kiyavash, Pascal O. Vontobel, Roxana Smarandache","cross_cats":["cs.DM","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2005-08-02T16:34:05Z","title":"On the Minimal Pseudo-Codewords of Codes from Finite Geometries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508019","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:5d10631d94d86ea6d0f982b3960616afcf880b99bef481bbf338c02378fd1c7b","target":"record","created_at":"2026-05-18T00:58:26Z","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":"53111bd63ce5467b5a1b481a1106c6652019a952abf96f329fe18aa8a30ef8c5","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2005-08-02T16:34:05Z","title_canon_sha256":"1fdc0b6c12e230518dac420cd13475b41f9ea12ad8c79571175e8c780637c962"},"schema_version":"1.0","source":{"id":"cs/0508019","kind":"arxiv","version":1}},"canonical_sha256":"14cbc48089530424ada0feb060345940a8dcb8f0de35d311a28fa542c26c43c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14cbc48089530424ada0feb060345940a8dcb8f0de35d311a28fa542c26c43c6","first_computed_at":"2026-05-18T00:58:26.790643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.790643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hwNALmMEhipFaHgTku+0mA9s46Fzo3EyrlCwtvxfsrDLgZfTm12frr0XBUVK1c9leA0uhN7UIVwSCspo6qTAAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.791255Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0508019","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d10631d94d86ea6d0f982b3960616afcf880b99bef481bbf338c02378fd1c7b","sha256:49e92b351b77551fe92bd6e33f64355bca0f364303f614def8eba692651c2f34"],"state_sha256":"130c55d3f482b3ad4f3fcafd401ab8ea4b608b6412684fa13079143e5c5ad3a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q8MtwdXFX0RGg/QdMc4tmKi55t9fbZI0nyz4Vr8cnJoNMxq9SzRLy571QXQOUpGmxsbaxGaaIb/V+C/TrBR6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:57:48.974897Z","bundle_sha256":"f154d07beb8bf61bdacd3a50727825526bcff50f95144398ee1a8d7c14d72f40"}}