{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:36KVBMYKZUHMD46GTD3VZWZSGI","short_pith_number":"pith:36KVBMYK","schema_version":"1.0","canonical_sha256":"df9550b30acd0ec1f3c698f75cdb32323a7b4e1c8b679f075c1d21c0d7eaa661","source":{"kind":"arxiv","id":"1607.02279","version":1},"attestation_state":"computed","paper":{"title":"Rates of DNA Sequence Profiles for Practical Values of Read Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Johan Chrisnata, Martianus Frederic Ezerman, Zuling Chang","submitted_at":"2016-07-08T09:09:08Z","abstract_excerpt":"A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on the number of profile vectors for finite values of alphabet size $q$, read length $\\ell$, and word length $n$.Consequently, we demonstrate that for $q\\ge 2$ and $n\\le q^{\\ell/2-1}$, the number of profile vectors is at least $q^{\\kappa n}$ with $\\kappa$ very close to one.In addition to enumeration results, we provide a set of efficient encoding and decoding algorithms for each of two particular families of profile vectors."},"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":"1607.02279","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-07-08T09:09:08Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"72d0c0c4b418277024897f42aa1a095d3d8b75022f3a10d2ff994cf1b3b47305","abstract_canon_sha256":"da4f008cc835f36d5f68474bceb2c4799606c5e60e4026ef285d48eca7dbb267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.770006Z","signature_b64":"URRfJ4OYPiBm6hOw3oFbBaOnZbcMhEIPxwRvN5oLyAwZBfRkbiVfk/UJvH7xlag+/RO77yxYrnFhsPLsE4j4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df9550b30acd0ec1f3c698f75cdb32323a7b4e1c8b679f075c1d21c0d7eaa661","last_reissued_at":"2026-05-18T01:11:20.769307Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.769307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rates of DNA Sequence Profiles for Practical Values of Read Lengths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Han Mao Kiah, Johan Chrisnata, Martianus Frederic Ezerman, Zuling Chang","submitted_at":"2016-07-08T09:09:08Z","abstract_excerpt":"A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on the number of profile vectors for finite values of alphabet size $q$, read length $\\ell$, and word length $n$.Consequently, we demonstrate that for $q\\ge 2$ and $n\\le q^{\\ell/2-1}$, the number of profile vectors is at least $q^{\\kappa n}$ with $\\kappa$ very close to one.In addition to enumeration results, we provide a set of efficient encoding and decoding algorithms for each of two particular families of profile vectors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02279","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.02279","created_at":"2026-05-18T01:11:20.769434+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02279v1","created_at":"2026-05-18T01:11:20.769434+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02279","created_at":"2026-05-18T01:11:20.769434+00:00"},{"alias_kind":"pith_short_12","alias_value":"36KVBMYKZUHM","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"36KVBMYKZUHMD46G","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"36KVBMYK","created_at":"2026-05-18T12:29:55.572404+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/36KVBMYKZUHMD46GTD3VZWZSGI","json":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI.json","graph_json":"https://pith.science/api/pith-number/36KVBMYKZUHMD46GTD3VZWZSGI/graph.json","events_json":"https://pith.science/api/pith-number/36KVBMYKZUHMD46GTD3VZWZSGI/events.json","paper":"https://pith.science/paper/36KVBMYK"},"agent_actions":{"view_html":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI","download_json":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI.json","view_paper":"https://pith.science/paper/36KVBMYK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02279&json=true","fetch_graph":"https://pith.science/api/pith-number/36KVBMYKZUHMD46GTD3VZWZSGI/graph.json","fetch_events":"https://pith.science/api/pith-number/36KVBMYKZUHMD46GTD3VZWZSGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI/action/storage_attestation","attest_author":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI/action/author_attestation","sign_citation":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI/action/citation_signature","submit_replication":"https://pith.science/pith/36KVBMYKZUHMD46GTD3VZWZSGI/action/replication_record"}},"created_at":"2026-05-18T01:11:20.769434+00:00","updated_at":"2026-05-18T01:11:20.769434+00:00"}