{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:B42VM6EWORGMETFBAPO5CA2DMU","short_pith_number":"pith:B42VM6EW","canonical_record":{"source":{"id":"1506.03227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T09:14:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1469884b8f0d49422ace7b12188a88e9c049863ab12b5bb6ba7406bb02c60290","abstract_canon_sha256":"906bf9d1d123657738d7d57542d2901195c5cc9bdf2feef93e3c172bb58eeda3"},"schema_version":"1.0"},"canonical_sha256":"0f35567896744cc24ca103ddd103436506c50fb71d96b814143f61a0e6d09f0d","source":{"kind":"arxiv","id":"1506.03227","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03227","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03227v3","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03227","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"B42VM6EWORGM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B42VM6EWORGMETFB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B42VM6EW","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:B42VM6EWORGMETFBAPO5CA2DMU","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03227","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T09:14:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1469884b8f0d49422ace7b12188a88e9c049863ab12b5bb6ba7406bb02c60290","abstract_canon_sha256":"906bf9d1d123657738d7d57542d2901195c5cc9bdf2feef93e3c172bb58eeda3"},"schema_version":"1.0"},"canonical_sha256":"0f35567896744cc24ca103ddd103436506c50fb71d96b814143f61a0e6d09f0d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:05.330390Z","signature_b64":"zV8OxNslyK5U8OHMkr7Yvaox8QgvpVq/RXowcayEHzjCF8eNQ6NdJG1RWBsqBQrmtRzjbnL5Q4NK5V5MmO3EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f35567896744cc24ca103ddd103436506c50fb71d96b814143f61a0e6d09f0d","last_reissued_at":"2026-05-18T01:17:05.329779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:05.329779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03227","source_version":3,"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-18T01:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+vS+HyWs8O4HFLKrfa5mpEKzIPcG9fQZZmnuifZTb/KjfCBC7ec5qIeOuJfZ7WQ1J/EzxNfZoYDVP2Qg6r/wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:31:09.336247Z"},"content_sha256":"f8b24c661654564f04837392408d3251b13e6ff0b96d536070c27f6013ff3e55","schema_version":"1.0","event_id":"sha256:f8b24c661654564f04837392408d3251b13e6ff0b96d536070c27f6013ff3e55"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:B42VM6EWORGMETFBAPO5CA2DMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On optimal nonlinear systematic codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alessio Meneghetti, Eleonora Guerrini, Massimiliano Sala","submitted_at":"2015-06-10T09:14:28Z","abstract_excerpt":"Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper we identify code parameters $(q,d,k)$, namely field size, minimum distance and dimension, for which the Griesmer bound holds also in the (systematic) nonlinear case. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by explicit construction of a family of optimal systematic binary codes. On the other hand, we are able to provide some versions of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03227","kind":"arxiv","version":3},"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-18T01:17:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v9HlAQE93T6hYDMQPbawYq57r0nWX0hUWsUHLIrbQ8woH7ThIn3o5XFGf2h6sxtEHBulCF2Cu5WWX15UznVKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:31:09.336727Z"},"content_sha256":"aaaf448391cd59c04a5e35ab663694862eec2d343f5f62e9b5f7f80410e78dda","schema_version":"1.0","event_id":"sha256:aaaf448391cd59c04a5e35ab663694862eec2d343f5f62e9b5f7f80410e78dda"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B42VM6EWORGMETFBAPO5CA2DMU/bundle.json","state_url":"https://pith.science/pith/B42VM6EWORGMETFBAPO5CA2DMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B42VM6EWORGMETFBAPO5CA2DMU/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-02T02:31:09Z","links":{"resolver":"https://pith.science/pith/B42VM6EWORGMETFBAPO5CA2DMU","bundle":"https://pith.science/pith/B42VM6EWORGMETFBAPO5CA2DMU/bundle.json","state":"https://pith.science/pith/B42VM6EWORGMETFBAPO5CA2DMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B42VM6EWORGMETFBAPO5CA2DMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:B42VM6EWORGMETFBAPO5CA2DMU","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":"906bf9d1d123657738d7d57542d2901195c5cc9bdf2feef93e3c172bb58eeda3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T09:14:28Z","title_canon_sha256":"1469884b8f0d49422ace7b12188a88e9c049863ab12b5bb6ba7406bb02c60290"},"schema_version":"1.0","source":{"id":"1506.03227","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03227","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03227v3","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03227","created_at":"2026-05-18T01:17:05Z"},{"alias_kind":"pith_short_12","alias_value":"B42VM6EWORGM","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"B42VM6EWORGMETFB","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"B42VM6EW","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:aaaf448391cd59c04a5e35ab663694862eec2d343f5f62e9b5f7f80410e78dda","target":"graph","created_at":"2026-05-18T01:17:05Z","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":"Most bounds on the size of codes hold for any code, whether linear or not. Notably, the Griesmer bound holds only in the linear case and so optimal linear codes are not necessarily optimal codes. In this paper we identify code parameters $(q,d,k)$, namely field size, minimum distance and dimension, for which the Griesmer bound holds also in the (systematic) nonlinear case. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by explicit construction of a family of optimal systematic binary codes. On the other hand, we are able to provide some versions of th","authors_text":"Alessio Meneghetti, Eleonora Guerrini, Massimiliano Sala","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T09:14:28Z","title":"On optimal nonlinear systematic codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03227","kind":"arxiv","version":3},"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:f8b24c661654564f04837392408d3251b13e6ff0b96d536070c27f6013ff3e55","target":"record","created_at":"2026-05-18T01:17:05Z","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":"906bf9d1d123657738d7d57542d2901195c5cc9bdf2feef93e3c172bb58eeda3","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-06-10T09:14:28Z","title_canon_sha256":"1469884b8f0d49422ace7b12188a88e9c049863ab12b5bb6ba7406bb02c60290"},"schema_version":"1.0","source":{"id":"1506.03227","kind":"arxiv","version":3}},"canonical_sha256":"0f35567896744cc24ca103ddd103436506c50fb71d96b814143f61a0e6d09f0d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f35567896744cc24ca103ddd103436506c50fb71d96b814143f61a0e6d09f0d","first_computed_at":"2026-05-18T01:17:05.329779Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:05.329779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zV8OxNslyK5U8OHMkr7Yvaox8QgvpVq/RXowcayEHzjCF8eNQ6NdJG1RWBsqBQrmtRzjbnL5Q4NK5V5MmO3EAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:05.330390Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03227","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f8b24c661654564f04837392408d3251b13e6ff0b96d536070c27f6013ff3e55","sha256:aaaf448391cd59c04a5e35ab663694862eec2d343f5f62e9b5f7f80410e78dda"],"state_sha256":"b2b04c768902417866ce1f260a68ccc24c99cef46c928c6b10cab77de0808394"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GZMxpk0bhGixs2aoIUGf1KJuSisT+w+yUAhPYtFMs6udfzJkwRozdAz3HWCSqT8lesdLpnY2Mq80mqJt9K34Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:31:09.338733Z","bundle_sha256":"754fe31e0703fef57cffa2e614e42604e496c560ac1bf5ec82262e8097df6155"}}