{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7GDTUKAYGQ2BTPH4TBUIA3XS6J","short_pith_number":"pith:7GDTUKAY","schema_version":"1.0","canonical_sha256":"f9873a2818343419bcfc9868806ef2f26b8c29beaea45f76c69c0945dbe2b0de","source":{"kind":"arxiv","id":"1711.03310","version":1},"attestation_state":"computed","paper":{"title":"Weak Flip Codes and their Optimality on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hsuan-Yin Lin, Po-Ning Chen, Stefan M. Moser","submitted_at":"2017-11-09T10:13:57Z","abstract_excerpt":"This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Berlekamp, Gallager, and Shannon and which was shown to achieve the error exponent with a fixed number of codewords $M$, can be seen as a generalization of linear codes to an arbitrary number of codewords. Based on the column-wise approach, the $r$-wise Hamming distance is introduced as a "},"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":"1711.03310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-11-09T10:13:57Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"29aa13e8a62e6099c146867d27e7b3f542b85bc15ea897a6a3a07fb44eb9a31b","abstract_canon_sha256":"c9f4d6f34e4dcc454624274afc8f4c15710bc2333c8224d43e7c686f32444259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.613051Z","signature_b64":"b/HKYO+xYjc567nRknnIPBm1p0A7VNnYXWrhA9yGWhbw4/Omz6cHbS9WWhnhyaned9THfJKkRPWyqmxZgU8FBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9873a2818343419bcfc9868806ef2f26b8c29beaea45f76c69c0945dbe2b0de","last_reissued_at":"2026-05-18T00:30:56.612431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.612431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weak Flip Codes and their Optimality on the Binary Erasure Channel","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hsuan-Yin Lin, Po-Ning Chen, Stefan M. Moser","submitted_at":"2017-11-09T10:13:57Z","abstract_excerpt":"This paper investigates fundamental properties of nonlinear binary codes by looking at the codebook matrix not row-wise (codewords), but column-wise. The family of weak flip codes is presented and shown to contain many beautiful properties. In particular the subfamily fair weak flip codes, which goes back to Berlekamp, Gallager, and Shannon and which was shown to achieve the error exponent with a fixed number of codewords $M$, can be seen as a generalization of linear codes to an arbitrary number of codewords. Based on the column-wise approach, the $r$-wise Hamming distance is introduced as a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03310","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03310","created_at":"2026-05-18T00:30:56.612530+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03310v1","created_at":"2026-05-18T00:30:56.612530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03310","created_at":"2026-05-18T00:30:56.612530+00:00"},{"alias_kind":"pith_short_12","alias_value":"7GDTUKAYGQ2B","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7GDTUKAYGQ2BTPH4","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7GDTUKAY","created_at":"2026-05-18T12:31:05.417338+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/7GDTUKAYGQ2BTPH4TBUIA3XS6J","json":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J.json","graph_json":"https://pith.science/api/pith-number/7GDTUKAYGQ2BTPH4TBUIA3XS6J/graph.json","events_json":"https://pith.science/api/pith-number/7GDTUKAYGQ2BTPH4TBUIA3XS6J/events.json","paper":"https://pith.science/paper/7GDTUKAY"},"agent_actions":{"view_html":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J","download_json":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J.json","view_paper":"https://pith.science/paper/7GDTUKAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03310&json=true","fetch_graph":"https://pith.science/api/pith-number/7GDTUKAYGQ2BTPH4TBUIA3XS6J/graph.json","fetch_events":"https://pith.science/api/pith-number/7GDTUKAYGQ2BTPH4TBUIA3XS6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J/action/storage_attestation","attest_author":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J/action/author_attestation","sign_citation":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J/action/citation_signature","submit_replication":"https://pith.science/pith/7GDTUKAYGQ2BTPH4TBUIA3XS6J/action/replication_record"}},"created_at":"2026-05-18T00:30:56.612530+00:00","updated_at":"2026-05-18T00:30:56.612530+00:00"}