{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DA4M7FQ6Y6HCYCN34GM6GZNDAD","short_pith_number":"pith:DA4M7FQ6","canonical_record":{"source":{"id":"1502.07379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-18T18:00:14Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"65712bb3f13e220f7385942dbb9c10cbb4b86873df858f89e2ac6fbaf1ad729c","abstract_canon_sha256":"37b072cacf0d2dd04fac1de9034b011ccc96d664031647387b178e1c4c674be7"},"schema_version":"1.0"},"canonical_sha256":"1838cf961ec78e2c09bbe199e365a300c70ab4560e06ebe87bc9ece5b1ad83e2","source":{"kind":"arxiv","id":"1502.07379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07379","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07379v1","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07379","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"DA4M7FQ6Y6HC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DA4M7FQ6Y6HCYCN3","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DA4M7FQ6","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DA4M7FQ6Y6HCYCN34GM6GZNDAD","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-18T18:00:14Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"65712bb3f13e220f7385942dbb9c10cbb4b86873df858f89e2ac6fbaf1ad729c","abstract_canon_sha256":"37b072cacf0d2dd04fac1de9034b011ccc96d664031647387b178e1c4c674be7"},"schema_version":"1.0"},"canonical_sha256":"1838cf961ec78e2c09bbe199e365a300c70ab4560e06ebe87bc9ece5b1ad83e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:09.942782Z","signature_b64":"Lo0WfDI5957OJUMv45ObUDFvRS26soXWkjpJ7QoQRPB/LUqimxYfqe721oG16OSIsgCn2udtbCbzfZG/Zd7zDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1838cf961ec78e2c09bbe199e365a300c70ab4560e06ebe87bc9ece5b1ad83e2","last_reissued_at":"2026-05-18T02:26:09.942146Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:09.942146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07379","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-18T02:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Bux6wxGuSH5IUrBe7pwcO0/1UgyPPPSXZQ+tjEK81AbO38PBNwZw+hI1JKB+9BOCKGQyy94VcT6syrGk8FlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:01:52.872738Z"},"content_sha256":"94403432cd44bac13d144d43a7b0782ccca5421eb3b7818298689adb21643dd5","schema_version":"1.0","event_id":"sha256:94403432cd44bac13d144d43a7b0782ccca5421eb3b7818298689adb21643dd5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DA4M7FQ6Y6HCYCN34GM6GZNDAD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Griesmer bound for nonlinear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Alessio Meneghetti, Eleonora Guerrini, Emanuele Bellini, Massimiliano Sala","submitted_at":"2015-01-18T18:00:14Z","abstract_excerpt":"Most bounds on the size of codes hold for any code, whether linear or nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family of systematic nonlinear codes for which the Griesmer bound holds. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by showing explicit counterexamples. On the other hand, we are also able to provide (weaker) versions of the Griesmer bound holding for all systematic codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07379","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-18T02:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zkSrzZ0HlC/o7Qbk3uzfbzii2iizezwMU0VC1QUtq0nMPv9y8aclU8f9E+HQn9/jaBhPf9ea1KZiNI04LkQaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:01:52.873449Z"},"content_sha256":"7fb46918208be74babd43f9db1f0ad9c64aba97b60a387d94736f9aa235750bb","schema_version":"1.0","event_id":"sha256:7fb46918208be74babd43f9db1f0ad9c64aba97b60a387d94736f9aa235750bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/bundle.json","state_url":"https://pith.science/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/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-06T06:01:52Z","links":{"resolver":"https://pith.science/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD","bundle":"https://pith.science/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/bundle.json","state":"https://pith.science/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DA4M7FQ6Y6HCYCN34GM6GZNDAD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DA4M7FQ6Y6HCYCN34GM6GZNDAD","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":"37b072cacf0d2dd04fac1de9034b011ccc96d664031647387b178e1c4c674be7","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-18T18:00:14Z","title_canon_sha256":"65712bb3f13e220f7385942dbb9c10cbb4b86873df858f89e2ac6fbaf1ad729c"},"schema_version":"1.0","source":{"id":"1502.07379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07379","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07379v1","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07379","created_at":"2026-05-18T02:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"DA4M7FQ6Y6HC","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DA4M7FQ6Y6HCYCN3","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DA4M7FQ6","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:7fb46918208be74babd43f9db1f0ad9c64aba97b60a387d94736f9aa235750bb","target":"graph","created_at":"2026-05-18T02:26:09Z","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 nonlinear. Notably, the Griesmer bound, holds only in the linear case. In this paper we characterize a family of systematic nonlinear codes for which the Griesmer bound holds. Moreover, we show that the Griesmer bound does not necessarily hold for a systematic code by showing explicit counterexamples. On the other hand, we are also able to provide (weaker) versions of the Griesmer bound holding for all systematic codes.","authors_text":"Alessio Meneghetti, Eleonora Guerrini, Emanuele Bellini, Massimiliano Sala","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-18T18:00:14Z","title":"On the Griesmer bound for nonlinear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07379","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:94403432cd44bac13d144d43a7b0782ccca5421eb3b7818298689adb21643dd5","target":"record","created_at":"2026-05-18T02:26:09Z","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":"37b072cacf0d2dd04fac1de9034b011ccc96d664031647387b178e1c4c674be7","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-18T18:00:14Z","title_canon_sha256":"65712bb3f13e220f7385942dbb9c10cbb4b86873df858f89e2ac6fbaf1ad729c"},"schema_version":"1.0","source":{"id":"1502.07379","kind":"arxiv","version":1}},"canonical_sha256":"1838cf961ec78e2c09bbe199e365a300c70ab4560e06ebe87bc9ece5b1ad83e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1838cf961ec78e2c09bbe199e365a300c70ab4560e06ebe87bc9ece5b1ad83e2","first_computed_at":"2026-05-18T02:26:09.942146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:09.942146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lo0WfDI5957OJUMv45ObUDFvRS26soXWkjpJ7QoQRPB/LUqimxYfqe721oG16OSIsgCn2udtbCbzfZG/Zd7zDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:09.942782Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94403432cd44bac13d144d43a7b0782ccca5421eb3b7818298689adb21643dd5","sha256:7fb46918208be74babd43f9db1f0ad9c64aba97b60a387d94736f9aa235750bb"],"state_sha256":"23b926e4f647759cb271aa795d58146c2005b87741f6e47038e7ba3808f1b361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6bLsqgbu3YAo82UNNmt0896sLpDETsh39vtUcJGKY2MqHDBkkglE+mVn8qUHTa+Ku3O1zueDgF/2L3dpH3VCDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:01:52.877501Z","bundle_sha256":"f3223bffc0ab1af357f6b088772d44f05e78c559bea11893f521cdb79fc18c5b"}}