{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4ZGA24VV5L2ZYI6CJV7AHZVHQL","short_pith_number":"pith:4ZGA24VV","canonical_record":{"source":{"id":"1906.09645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-23T20:27:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b0f55f66c4084443ee8882e48c0c86974138103348553a07e214c9be08b25444","abstract_canon_sha256":"2ad89ea3886bda7e743b405b7e6096143fcc5c1d2011314d62292e5ff8fe08d7"},"schema_version":"1.0"},"canonical_sha256":"e64c0d72b5eaf59c23c24d7e03e6a782e02d784874dc294928978194f9ff571f","source":{"kind":"arxiv","id":"1906.09645","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09645","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09645v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09645","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"4ZGA24VV5L2Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ZGA24VV5L2ZYI6C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ZGA24VV","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4ZGA24VV5L2ZYI6CJV7AHZVHQL","target":"record","payload":{"canonical_record":{"source":{"id":"1906.09645","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-23T20:27:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b0f55f66c4084443ee8882e48c0c86974138103348553a07e214c9be08b25444","abstract_canon_sha256":"2ad89ea3886bda7e743b405b7e6096143fcc5c1d2011314d62292e5ff8fe08d7"},"schema_version":"1.0"},"canonical_sha256":"e64c0d72b5eaf59c23c24d7e03e6a782e02d784874dc294928978194f9ff571f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:37.185382Z","signature_b64":"3dswE9RympwL2pHJUKqiUfWlmTyEI60OpBR0plErIvNjoeT05eO32Kp1eBm50DNhwpND6Iwq5982ihEyKHD7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e64c0d72b5eaf59c23c24d7e03e6a782e02d784874dc294928978194f9ff571f","last_reissued_at":"2026-05-17T23:42:37.184354Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:37.184354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.09645","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-17T23:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PgYGmE1EZMgN5GsJwnZiS7qGO/EmQ44eKl3EHHqhNWswt+cg3vAxzRKrSig3+QvUDV9QR1EaSuCd9H/ScVR+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:20:06.211001Z"},"content_sha256":"77d910babf78fd18fdf8a15cb9fb432d944b3946aef0ac8974d5f3b8951c874d","schema_version":"1.0","event_id":"sha256:77d910babf78fd18fdf8a15cb9fb432d944b3946aef0ac8974d5f3b8951c874d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4ZGA24VV5L2ZYI6CJV7AHZVHQL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On q-ary codes with two distances d and d+1","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"D. Zinoviev, K. Delchev, P. Boyvalenkov, V. Zinoviev","submitted_at":"2019-06-23T20:27:07Z","abstract_excerpt":"The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small $q$ and $n$ are presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09645","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-17T23:42:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHkvctjOE16htm5fFWU+bb6Z31f12y2/ufRNqaRpmXv3TlTWVjNTGtlwXHmL2XlGJFvii1iV3mgZzt7VmcOcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:20:06.211353Z"},"content_sha256":"0d5af981dbb03a7e135b5fb6c3a22ecc696085770c53571cb94e6f6628491ded","schema_version":"1.0","event_id":"sha256:0d5af981dbb03a7e135b5fb6c3a22ecc696085770c53571cb94e6f6628491ded"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/bundle.json","state_url":"https://pith.science/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/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-08T23:20:06Z","links":{"resolver":"https://pith.science/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL","bundle":"https://pith.science/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/bundle.json","state":"https://pith.science/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZGA24VV5L2ZYI6CJV7AHZVHQL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4ZGA24VV5L2ZYI6CJV7AHZVHQL","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":"2ad89ea3886bda7e743b405b7e6096143fcc5c1d2011314d62292e5ff8fe08d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-23T20:27:07Z","title_canon_sha256":"b0f55f66c4084443ee8882e48c0c86974138103348553a07e214c9be08b25444"},"schema_version":"1.0","source":{"id":"1906.09645","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.09645","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"arxiv_version","alias_value":"1906.09645v1","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09645","created_at":"2026-05-17T23:42:37Z"},{"alias_kind":"pith_short_12","alias_value":"4ZGA24VV5L2Z","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4ZGA24VV5L2ZYI6C","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4ZGA24VV","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:0d5af981dbb03a7e135b5fb6c3a22ecc696085770c53571cb94e6f6628491ded","target":"graph","created_at":"2026-05-17T23:42:37Z","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 $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for the maximum cardinality of such codes is derived. Tables of lower and upper bounds for small $q$ and $n$ are presented.","authors_text":"D. Zinoviev, K. Delchev, P. Boyvalenkov, V. Zinoviev","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-23T20:27:07Z","title":"On q-ary codes with two distances d and d+1"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09645","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:77d910babf78fd18fdf8a15cb9fb432d944b3946aef0ac8974d5f3b8951c874d","target":"record","created_at":"2026-05-17T23:42:37Z","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":"2ad89ea3886bda7e743b405b7e6096143fcc5c1d2011314d62292e5ff8fe08d7","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-06-23T20:27:07Z","title_canon_sha256":"b0f55f66c4084443ee8882e48c0c86974138103348553a07e214c9be08b25444"},"schema_version":"1.0","source":{"id":"1906.09645","kind":"arxiv","version":1}},"canonical_sha256":"e64c0d72b5eaf59c23c24d7e03e6a782e02d784874dc294928978194f9ff571f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e64c0d72b5eaf59c23c24d7e03e6a782e02d784874dc294928978194f9ff571f","first_computed_at":"2026-05-17T23:42:37.184354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:37.184354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3dswE9RympwL2pHJUKqiUfWlmTyEI60OpBR0plErIvNjoeT05eO32Kp1eBm50DNhwpND6Iwq5982ihEyKHD7BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:37.185382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.09645","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77d910babf78fd18fdf8a15cb9fb432d944b3946aef0ac8974d5f3b8951c874d","sha256:0d5af981dbb03a7e135b5fb6c3a22ecc696085770c53571cb94e6f6628491ded"],"state_sha256":"336a6bc68869de88ac700fbb2870f132ed33d8e8a22670728a98a8e19636ef61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9kTFJrOa5OnD9LRrZ87k0QGRdwNkNojEbOnlDI8ElTcsMCzACUXcGKGCrK1ykD4a1aUxtVmgJPQRq6ycgvr8DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:20:06.213660Z","bundle_sha256":"fd7478a67091bdd18fd5c6fc33b12c41ed5ae01603200d5d5ac4a94946650045"}}