{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:V3SRPUXGHMTX2XROZM6ERJAVBN","short_pith_number":"pith:V3SRPUXG","schema_version":"1.0","canonical_sha256":"aee517d2e63b277d5e2ecb3c48a4150b5151f1bb08de036897971f931a93b48d","source":{"kind":"arxiv","id":"math/0605719","version":1},"attestation_state":"computed","paper":{"title":"Digital search trees and chaos game representation","license":"","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.PR","authors_text":"Brigitte Chauvin (LM-Versailles), Nicolas Pouyanne (LM-Versailles), Peggy C\\'enac (INRIA Rocquencourt), St\\'ephane Ginouillac (LM-Versailles)","submitted_at":"2006-05-29T09:34:38Z","abstract_excerpt":"In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which on can visualize repetitions of subwords. The CGR-tree turns a sequence of letters into a digital search tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height and the insertion depth for DST built from i.i.d. successive sequences. Here, the successive inserted wors are strongly dependent. We give the asymptotic behaviour of the insertion depth and of the length of branches for the CGR-tree obtained from the suffixes of reversed i.i.d. "},"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":"math/0605719","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.PR","submitted_at":"2006-05-29T09:34:38Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"37c89ce871303badcbc6669ff8e03ddadce7391f09ed7c3994f4e3aa2df3d666","abstract_canon_sha256":"d5ef9619eecc894b995b3149cc238cae08c292f44dbcbe79b2c938a9bc575233"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:50.230790Z","signature_b64":"iHkfD0IBoxUHqzN1SlxuUb19kGfmG7nztjIdTVMkPmXyQF9y+n0iWEmmwMOW70uTYpDqa5DW3GA0K1SvhDhkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aee517d2e63b277d5e2ecb3c48a4150b5151f1bb08de036897971f931a93b48d","last_reissued_at":"2026-05-18T01:08:50.230150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:50.230150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Digital search trees and chaos game representation","license":"","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"math.PR","authors_text":"Brigitte Chauvin (LM-Versailles), Nicolas Pouyanne (LM-Versailles), Peggy C\\'enac (INRIA Rocquencourt), St\\'ephane Ginouillac (LM-Versailles)","submitted_at":"2006-05-29T09:34:38Z","abstract_excerpt":"In this paper, we consider a possible representation of a DNA sequence in a quaternary tree, in which on can visualize repetitions of subwords. The CGR-tree turns a sequence of letters into a digital search tree (DST), obtained from the suffixes of the reversed sequence. Several results are known concerning the height and the insertion depth for DST built from i.i.d. successive sequences. Here, the successive inserted wors are strongly dependent. We give the asymptotic behaviour of the insertion depth and of the length of branches for the CGR-tree obtained from the suffixes of reversed i.i.d. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0605719","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":"math/0605719","created_at":"2026-05-18T01:08:50.230255+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0605719v1","created_at":"2026-05-18T01:08:50.230255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0605719","created_at":"2026-05-18T01:08:50.230255+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3SRPUXGHMTX","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3SRPUXGHMTX2XRO","created_at":"2026-05-18T12:25:54.717736+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3SRPUXG","created_at":"2026-05-18T12:25:54.717736+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/V3SRPUXGHMTX2XROZM6ERJAVBN","json":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN.json","graph_json":"https://pith.science/api/pith-number/V3SRPUXGHMTX2XROZM6ERJAVBN/graph.json","events_json":"https://pith.science/api/pith-number/V3SRPUXGHMTX2XROZM6ERJAVBN/events.json","paper":"https://pith.science/paper/V3SRPUXG"},"agent_actions":{"view_html":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN","download_json":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN.json","view_paper":"https://pith.science/paper/V3SRPUXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0605719&json=true","fetch_graph":"https://pith.science/api/pith-number/V3SRPUXGHMTX2XROZM6ERJAVBN/graph.json","fetch_events":"https://pith.science/api/pith-number/V3SRPUXGHMTX2XROZM6ERJAVBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN/action/storage_attestation","attest_author":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN/action/author_attestation","sign_citation":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN/action/citation_signature","submit_replication":"https://pith.science/pith/V3SRPUXGHMTX2XROZM6ERJAVBN/action/replication_record"}},"created_at":"2026-05-18T01:08:50.230255+00:00","updated_at":"2026-05-18T01:08:50.230255+00:00"}