{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VSCGPQY5DK46GSGODENZCMW56L","short_pith_number":"pith:VSCGPQY5","canonical_record":{"source":{"id":"1705.07785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54f5e0bfb395456313ad54ac6371d68dc841c3bbd2b888556c19809d9a18b051","abstract_canon_sha256":"cfbc05df362f2381157e94a6230427e083578f1d24bcaaab8c4a99b1346f1d65"},"schema_version":"1.0"},"canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","source":{"kind":"arxiv","id":"1705.07785","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07785","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07785v3","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07785","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"VSCGPQY5DK46","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VSCGPQY5DK46GSGO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VSCGPQY5","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VSCGPQY5DK46GSGODENZCMW56L","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07785","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"54f5e0bfb395456313ad54ac6371d68dc841c3bbd2b888556c19809d9a18b051","abstract_canon_sha256":"cfbc05df362f2381157e94a6230427e083578f1d24bcaaab8c4a99b1346f1d65"},"schema_version":"1.0"},"canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:29.237918Z","signature_b64":"dVoBsiX1Dc+QgRQxfss+KlQM2io/Plk6FvGk+dwM91zA0+BoG5k3qvMvfMQYlEepi7IoUDewLrpVpjo+E0GXDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","last_reissued_at":"2026-05-18T00:22:29.237334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:29.237334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07785","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-18T00:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/EzEltbzyMjWtqLVKcrSthA9a2L1IKX6hbOznMIv40QOIIseH1FE0oY/T0zuIo1OO79hi9j4BRWlSdQgEFoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:11.668984Z"},"content_sha256":"f02fa9be06e54c6b9f196f6de497314fffcba39e7cab256f90efeab92832349f","schema_version":"1.0","event_id":"sha256:f02fa9be06e54c6b9f196f6de497314fffcba39e7cab256f90efeab92832349f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VSCGPQY5DK46GSGODENZCMW56L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improvement of the asymptotic Elias bound for non-binary codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Krishna Kaipa","submitted_at":"2017-05-22T14:55:07Z","abstract_excerpt":"For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds.\n  The question of convexity of the asymptotic rate function is an important open question. We conjecture a much weaker form of the convexity, and we show that our bounds follow immediately if we assume the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07785","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-18T00:22:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghSBJuTjYBrgdGGnc8/Z9uJNY7+7hRJ58E07zBlN0lvDS+0b5WHnyE++a3ynvat7Zfmbf7W7BLUjW1jn0a0GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T08:12:11.669344Z"},"content_sha256":"b3b7c924ab3eb68ecf7681094a820e285b1d7cf2105eb03c580dc2af05819581","schema_version":"1.0","event_id":"sha256:b3b7c924ab3eb68ecf7681094a820e285b1d7cf2105eb03c580dc2af05819581"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/bundle.json","state_url":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSCGPQY5DK46GSGODENZCMW56L/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-30T08:12:11Z","links":{"resolver":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L","bundle":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/bundle.json","state":"https://pith.science/pith/VSCGPQY5DK46GSGODENZCMW56L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSCGPQY5DK46GSGODENZCMW56L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VSCGPQY5DK46GSGODENZCMW56L","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":"cfbc05df362f2381157e94a6230427e083578f1d24bcaaab8c4a99b1346f1d65","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","title_canon_sha256":"54f5e0bfb395456313ad54ac6371d68dc841c3bbd2b888556c19809d9a18b051"},"schema_version":"1.0","source":{"id":"1705.07785","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07785","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07785v3","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07785","created_at":"2026-05-18T00:22:29Z"},{"alias_kind":"pith_short_12","alias_value":"VSCGPQY5DK46","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VSCGPQY5DK46GSGO","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VSCGPQY5","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:b3b7c924ab3eb68ecf7681094a820e285b1d7cf2105eb03c580dc2af05819581","target":"graph","created_at":"2026-05-18T00:22:29Z","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":"For non-binary codes the Elias bound is a good upper bound for the asymptotic information rate at low relative minimum distance, where as the Plotkin bound is better at high relative minimum distance. In this work, we obtain a hybrid of these bounds which improves both. This in turn is based on the anticode bound which is a hybrid of the Hamming and Singleton bounds and improves both bounds.\n  The question of convexity of the asymptotic rate function is an important open question. We conjecture a much weaker form of the convexity, and we show that our bounds follow immediately if we assume the","authors_text":"Krishna Kaipa","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","title":"An improvement of the asymptotic Elias bound for non-binary codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07785","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:f02fa9be06e54c6b9f196f6de497314fffcba39e7cab256f90efeab92832349f","target":"record","created_at":"2026-05-18T00:22:29Z","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":"cfbc05df362f2381157e94a6230427e083578f1d24bcaaab8c4a99b1346f1d65","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2017-05-22T14:55:07Z","title_canon_sha256":"54f5e0bfb395456313ad54ac6371d68dc841c3bbd2b888556c19809d9a18b051"},"schema_version":"1.0","source":{"id":"1705.07785","kind":"arxiv","version":3}},"canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac8467c31d1ab9e348ce191b9132ddf2c41c0e08771893fe3b2b65132d7f2f85","first_computed_at":"2026-05-18T00:22:29.237334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:29.237334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dVoBsiX1Dc+QgRQxfss+KlQM2io/Plk6FvGk+dwM91zA0+BoG5k3qvMvfMQYlEepi7IoUDewLrpVpjo+E0GXDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:29.237918Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07785","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f02fa9be06e54c6b9f196f6de497314fffcba39e7cab256f90efeab92832349f","sha256:b3b7c924ab3eb68ecf7681094a820e285b1d7cf2105eb03c580dc2af05819581"],"state_sha256":"f76858f154382f08fa6ed62724d8af73875843a2430f50b71f4d17008772e1c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qg0viRkppdHg/HAqRcPn+HGaPgrio1STcTa0eoBLulHkdLyg9TEBDSCN41vRIFOuWZbNnU4PEPNVYb2sjYW3BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T08:12:11.671213Z","bundle_sha256":"7f7f6123eb06f7bc04c9951db2a4bbb8b5f1dc8254c13057401c822e3640e0d5"}}