{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XF27OAAYRVEP34VK5AVSNPKOXV","short_pith_number":"pith:XF27OAAY","schema_version":"1.0","canonical_sha256":"b975f700188d48fdf2aae82b26bd4ebd74747cb788c7b6cbbfb581c71a0c39b9","source":{"kind":"arxiv","id":"1804.04824","version":2},"attestation_state":"computed","paper":{"title":"An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Takayuki Nozaki, Toyohiko Saeki","submitted_at":"2018-04-13T08:07:14Z","abstract_excerpt":"This paper constructs a non-binary code correcting a single $b$-burst of insertions or deletions with a large cardinality. This paper also proposes a decoding algorithm of this code and evaluates a lower bound of the cardinality of this code. Moreover, we evaluate an asymptotic upper bound on the cardinality of codes which correct a single burst of insertions or deletions."},"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":"1804.04824","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-13T08:07:14Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"2c0eb0d7b45399406d255ab1fb60c84cff1e3bf31d6531451232c8413088f40d","abstract_canon_sha256":"6c07290802ae1426e48c12dfd4f1b822a6f9a2992eda15584a2352999d6f6010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:31.042395Z","signature_b64":"dQ38TmcxCV2CA+fnv7SzUHofPmu//GH+Oa1IuzPsrdwXrNM8MmJYXZt/BA/mY8I/7GPR+2t3fQgGUx5FZaI8Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b975f700188d48fdf2aae82b26bd4ebd74747cb788c7b6cbbfb581c71a0c39b9","last_reissued_at":"2026-05-18T00:08:31.041981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:31.041981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improvement of Non-binary Code Correcting Single b-Burst of Insertions or Deletions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Takayuki Nozaki, Toyohiko Saeki","submitted_at":"2018-04-13T08:07:14Z","abstract_excerpt":"This paper constructs a non-binary code correcting a single $b$-burst of insertions or deletions with a large cardinality. This paper also proposes a decoding algorithm of this code and evaluates a lower bound of the cardinality of this code. Moreover, we evaluate an asymptotic upper bound on the cardinality of codes which correct a single burst of insertions or deletions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04824","kind":"arxiv","version":2},"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":"1804.04824","created_at":"2026-05-18T00:08:31.042049+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.04824v2","created_at":"2026-05-18T00:08:31.042049+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04824","created_at":"2026-05-18T00:08:31.042049+00:00"},{"alias_kind":"pith_short_12","alias_value":"XF27OAAYRVEP","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XF27OAAYRVEP34VK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XF27OAAY","created_at":"2026-05-18T12:33:01.666342+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/XF27OAAYRVEP34VK5AVSNPKOXV","json":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV.json","graph_json":"https://pith.science/api/pith-number/XF27OAAYRVEP34VK5AVSNPKOXV/graph.json","events_json":"https://pith.science/api/pith-number/XF27OAAYRVEP34VK5AVSNPKOXV/events.json","paper":"https://pith.science/paper/XF27OAAY"},"agent_actions":{"view_html":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV","download_json":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV.json","view_paper":"https://pith.science/paper/XF27OAAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.04824&json=true","fetch_graph":"https://pith.science/api/pith-number/XF27OAAYRVEP34VK5AVSNPKOXV/graph.json","fetch_events":"https://pith.science/api/pith-number/XF27OAAYRVEP34VK5AVSNPKOXV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV/action/storage_attestation","attest_author":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV/action/author_attestation","sign_citation":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV/action/citation_signature","submit_replication":"https://pith.science/pith/XF27OAAYRVEP34VK5AVSNPKOXV/action/replication_record"}},"created_at":"2026-05-18T00:08:31.042049+00:00","updated_at":"2026-05-18T00:08:31.042049+00:00"}