{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:HEJ3ZBA2ZF6SBGVWEG32BY3JTU","short_pith_number":"pith:HEJ3ZBA2","canonical_record":{"source":{"id":"1101.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-30T05:06:11Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"bb010c955166c2fd049bd92190e1838e5104a2be7f157963bf21710fbda901cf","abstract_canon_sha256":"38e82e5e2109ba31da6ceb533ecf15fead79ae0086bb6c65fcc9401b9dbc9f83"},"schema_version":"1.0"},"canonical_sha256":"3913bc841ac97d209ab621b7a0e3699d3189b16b0aaa69b6748f7cc7e6d0ec41","source":{"kind":"arxiv","id":"1101.0036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0036","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0036v1","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0036","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"HEJ3ZBA2ZF6S","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HEJ3ZBA2ZF6SBGVW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HEJ3ZBA2","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:HEJ3ZBA2ZF6SBGVWEG32BY3JTU","target":"record","payload":{"canonical_record":{"source":{"id":"1101.0036","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-30T05:06:11Z","cross_cats_sorted":["cs.DM","math.NT"],"title_canon_sha256":"bb010c955166c2fd049bd92190e1838e5104a2be7f157963bf21710fbda901cf","abstract_canon_sha256":"38e82e5e2109ba31da6ceb533ecf15fead79ae0086bb6c65fcc9401b9dbc9f83"},"schema_version":"1.0"},"canonical_sha256":"3913bc841ac97d209ab621b7a0e3699d3189b16b0aaa69b6748f7cc7e6d0ec41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.178348Z","signature_b64":"KWfNxADglg2qGCeHu4GVwk2DzXkOp4DvGM3QGtihwBv0tajF1IYk//5W7F2U150W8QGFHd5pnYCSjjFEjtGtBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3913bc841ac97d209ab621b7a0e3699d3189b16b0aaa69b6748f7cc7e6d0ec41","last_reissued_at":"2026-05-18T04:32:11.177844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.177844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.0036","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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vju2kKfdt7dr18BYlJXsOlD/MiNDD5c97VfoQ+rZdwzBb/O+jX/203/IBn/MeFJx8onRkiaKy6KqI5biIN+dBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:24:57.411279Z"},"content_sha256":"c87581c2aa098c891360565e7d1b4c8da5640fe6d97940aaa9182c56bda76630","schema_version":"1.0","event_id":"sha256:c87581c2aa098c891360565e7d1b4c8da5640fe6d97940aaa9182c56bda76630"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:HEJ3ZBA2ZF6SBGVWEG32BY3JTU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The growth function of S-recognizable sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.NT"],"primary_cat":"cs.FL","authors_text":"Emilie Charlier, Narad Rampersad","submitted_at":"2010-12-30T05:06:11Z","abstract_excerpt":"A set $X\\subseteq\\mathbb N$ is S-recognizable for an abstract numeration system S if the set $\\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either $\\Theta((\\log(n))^{c-df}n^f)$ where $c,d\\in\\mathbb N$ and $f\\ge 1$, or $\\Theta(n^r \\theta^{\\Theta(n^q)})$, where $r,q\\in\\mathbb Q$ with $q\\le 1$. If the number of words of length n in the numeration language is bounded by a polynomial, then the growth function of an S-recognizable set is $\\Theta(n^r)$, where $r\\in \\mathbb Q$ with $r\\ge 1$. Furthermore, for eve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0036","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-18T04:32:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkLjhOlXklhiZqXFFH+eESx4gI9d5fCHsG5nnpeCrxjPWpYEesCVz07P7jT5ROk1axPd9XNzi1vH+7JEuoq2BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:24:57.411653Z"},"content_sha256":"aff36cf6a719b10513f597da5b4e5f76dfd4323bbd338c3bfd0855709b03c5ff","schema_version":"1.0","event_id":"sha256:aff36cf6a719b10513f597da5b4e5f76dfd4323bbd338c3bfd0855709b03c5ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/bundle.json","state_url":"https://pith.science/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/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-24T01:24:57Z","links":{"resolver":"https://pith.science/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU","bundle":"https://pith.science/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/bundle.json","state":"https://pith.science/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEJ3ZBA2ZF6SBGVWEG32BY3JTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:HEJ3ZBA2ZF6SBGVWEG32BY3JTU","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":"38e82e5e2109ba31da6ceb533ecf15fead79ae0086bb6c65fcc9401b9dbc9f83","cross_cats_sorted":["cs.DM","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-30T05:06:11Z","title_canon_sha256":"bb010c955166c2fd049bd92190e1838e5104a2be7f157963bf21710fbda901cf"},"schema_version":"1.0","source":{"id":"1101.0036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.0036","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"arxiv_version","alias_value":"1101.0036v1","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0036","created_at":"2026-05-18T04:32:11Z"},{"alias_kind":"pith_short_12","alias_value":"HEJ3ZBA2ZF6S","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"HEJ3ZBA2ZF6SBGVW","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"HEJ3ZBA2","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:aff36cf6a719b10513f597da5b4e5f76dfd4323bbd338c3bfd0855709b03c5ff","target":"graph","created_at":"2026-05-18T04:32:11Z","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":"A set $X\\subseteq\\mathbb N$ is S-recognizable for an abstract numeration system S if the set $\\rep_S(X)$ of its representations is accepted by a finite automaton. We show that the growth function of an S-recognizable set is always either $\\Theta((\\log(n))^{c-df}n^f)$ where $c,d\\in\\mathbb N$ and $f\\ge 1$, or $\\Theta(n^r \\theta^{\\Theta(n^q)})$, where $r,q\\in\\mathbb Q$ with $q\\le 1$. If the number of words of length n in the numeration language is bounded by a polynomial, then the growth function of an S-recognizable set is $\\Theta(n^r)$, where $r\\in \\mathbb Q$ with $r\\ge 1$. Furthermore, for eve","authors_text":"Emilie Charlier, Narad Rampersad","cross_cats":["cs.DM","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-30T05:06:11Z","title":"The growth function of S-recognizable sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.0036","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:c87581c2aa098c891360565e7d1b4c8da5640fe6d97940aaa9182c56bda76630","target":"record","created_at":"2026-05-18T04:32:11Z","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":"38e82e5e2109ba31da6ceb533ecf15fead79ae0086bb6c65fcc9401b9dbc9f83","cross_cats_sorted":["cs.DM","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2010-12-30T05:06:11Z","title_canon_sha256":"bb010c955166c2fd049bd92190e1838e5104a2be7f157963bf21710fbda901cf"},"schema_version":"1.0","source":{"id":"1101.0036","kind":"arxiv","version":1}},"canonical_sha256":"3913bc841ac97d209ab621b7a0e3699d3189b16b0aaa69b6748f7cc7e6d0ec41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3913bc841ac97d209ab621b7a0e3699d3189b16b0aaa69b6748f7cc7e6d0ec41","first_computed_at":"2026-05-18T04:32:11.177844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:11.177844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KWfNxADglg2qGCeHu4GVwk2DzXkOp4DvGM3QGtihwBv0tajF1IYk//5W7F2U150W8QGFHd5pnYCSjjFEjtGtBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:11.178348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.0036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87581c2aa098c891360565e7d1b4c8da5640fe6d97940aaa9182c56bda76630","sha256:aff36cf6a719b10513f597da5b4e5f76dfd4323bbd338c3bfd0855709b03c5ff"],"state_sha256":"04b3ba204c9c8db066fae763d0ea06356b61ce07552e8c024a665e937bd13e7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+GpNqOPimmkhPJCAjpNM7wOJbC8cmb4ccUDUlxF2CpDR55ZH2JHRBRASMGkADCL3NNg/gTO3fRgX0ZMweZ4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:24:57.413556Z","bundle_sha256":"377857f265db45b73b05b6570148733c7270fcf4dc92aa5ecf5ee3179ac9b91f"}}