{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HUKLMTLQ4QCUZRZETXCL2CSNRU","short_pith_number":"pith:HUKLMTLQ","canonical_record":{"source":{"id":"1603.09304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-30T18:37:17Z","cross_cats_sorted":["math.MG","math.NT"],"title_canon_sha256":"4319b4a1f46e1391ed0709c78f6becb6798749b177feb0fa50aa07814a5f5e36","abstract_canon_sha256":"3e6c1a9c9a2d1bec28621010260ea5a2473884874eed4307569dd9200ba41f8f"},"schema_version":"1.0"},"canonical_sha256":"3d14b64d70e4054cc7249dc4bd0a4d8d3185a98b989f06c14a28bfde14499f10","source":{"kind":"arxiv","id":"1603.09304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09304","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09304v2","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09304","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"HUKLMTLQ4QCU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUKLMTLQ4QCUZRZE","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUKLMTLQ","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HUKLMTLQ4QCUZRZETXCL2CSNRU","target":"record","payload":{"canonical_record":{"source":{"id":"1603.09304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-30T18:37:17Z","cross_cats_sorted":["math.MG","math.NT"],"title_canon_sha256":"4319b4a1f46e1391ed0709c78f6becb6798749b177feb0fa50aa07814a5f5e36","abstract_canon_sha256":"3e6c1a9c9a2d1bec28621010260ea5a2473884874eed4307569dd9200ba41f8f"},"schema_version":"1.0"},"canonical_sha256":"3d14b64d70e4054cc7249dc4bd0a4d8d3185a98b989f06c14a28bfde14499f10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:18.836374Z","signature_b64":"HcKdPZL0rmXpOZ3NO1b1Vq3ErW9xYV+uteepHeJNejb/f94nhfwT0rKXLtOnEx+Fb5i2oS57W2aqMpItBMPICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d14b64d70e4054cc7249dc4bd0a4d8d3185a98b989f06c14a28bfde14499f10","last_reissued_at":"2026-05-17T23:43:18.835826Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:18.835826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.09304","source_version":2,"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-17T23:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4Ak5AUoZ+bTTPXT4ZH33b62QSYXSXtrMeM7FBfq0r/xdLJ4LOYv1dlYu+tNc5jgdFS4cwGEorGgyO42YsNwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:16:37.964813Z"},"content_sha256":"f1f83a0c7d773aacf30b616d572310c5abfd430b5073780d8a834ea72199d172","schema_version":"1.0","event_id":"sha256:f1f83a0c7d773aacf30b616d572310c5abfd430b5073780d8a834ea72199d172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HUKLMTLQ4QCUZRZETXCL2CSNRU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple codings for self-similar sets with overlaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG","math.NT"],"primary_cat":"math.DS","authors_text":"Derong Kong, Kan Jiang, Karma Dajani, Lifeng Xi, Wenxia Li","submitted_at":"2016-03-30T18:37:17Z","abstract_excerpt":"In this paper we consider a general class $\\mathcal E$ of self-similar sets with complete overlaps. Given a self-similar iterated function system $\\Phi=(E, \\{f_i\\}_{i=1}^m)\\in\\mathcal E$ on the real line, for each point $x\\in E$ we can find a sequence $(i_k)=i_1i_2\\ldots\\in\\{1,\\ldots,m\\}^\\mathbb N$, called a coding of $x$, such that $$ x=\\lim_{n\\to\\infty}f_{i_1}\\circ f_{i_{2}}\\circ\\cdots\\circ f_{i_n}(0). $$ For $k=1,2,\\ldots, \\aleph_0$ or $2^{\\aleph_0}$ we investigate the subset $\\mathcal U_k(\\Phi)$ which consists of all $x\\in E$ having precisely $k$ different codings. Among several equivalent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09304","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"},"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-17T23:43:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drrD3QTmhunuFjQ7emKjwopK+TOSwLXiXu+uUf7wEDa85r6y5wmcPxzkRo6xVOXVm+c0e+/7Y4aeDHL2C8vfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:16:37.965177Z"},"content_sha256":"7a8e4b0caba5c1ca159f47738d5a04f7fe875bac3ef4273f9328c2de527de5df","schema_version":"1.0","event_id":"sha256:7a8e4b0caba5c1ca159f47738d5a04f7fe875bac3ef4273f9328c2de527de5df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/bundle.json","state_url":"https://pith.science/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/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-05-28T13:16:37Z","links":{"resolver":"https://pith.science/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU","bundle":"https://pith.science/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/bundle.json","state":"https://pith.science/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUKLMTLQ4QCUZRZETXCL2CSNRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HUKLMTLQ4QCUZRZETXCL2CSNRU","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":"3e6c1a9c9a2d1bec28621010260ea5a2473884874eed4307569dd9200ba41f8f","cross_cats_sorted":["math.MG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-30T18:37:17Z","title_canon_sha256":"4319b4a1f46e1391ed0709c78f6becb6798749b177feb0fa50aa07814a5f5e36"},"schema_version":"1.0","source":{"id":"1603.09304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.09304","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"arxiv_version","alias_value":"1603.09304v2","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09304","created_at":"2026-05-17T23:43:18Z"},{"alias_kind":"pith_short_12","alias_value":"HUKLMTLQ4QCU","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HUKLMTLQ4QCUZRZE","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HUKLMTLQ","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:7a8e4b0caba5c1ca159f47738d5a04f7fe875bac3ef4273f9328c2de527de5df","target":"graph","created_at":"2026-05-17T23:43:18Z","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":"In this paper we consider a general class $\\mathcal E$ of self-similar sets with complete overlaps. Given a self-similar iterated function system $\\Phi=(E, \\{f_i\\}_{i=1}^m)\\in\\mathcal E$ on the real line, for each point $x\\in E$ we can find a sequence $(i_k)=i_1i_2\\ldots\\in\\{1,\\ldots,m\\}^\\mathbb N$, called a coding of $x$, such that $$ x=\\lim_{n\\to\\infty}f_{i_1}\\circ f_{i_{2}}\\circ\\cdots\\circ f_{i_n}(0). $$ For $k=1,2,\\ldots, \\aleph_0$ or $2^{\\aleph_0}$ we investigate the subset $\\mathcal U_k(\\Phi)$ which consists of all $x\\in E$ having precisely $k$ different codings. Among several equivalent","authors_text":"Derong Kong, Kan Jiang, Karma Dajani, Lifeng Xi, Wenxia Li","cross_cats":["math.MG","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-30T18:37:17Z","title":"Multiple codings for self-similar sets with overlaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09304","kind":"arxiv","version":2},"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:f1f83a0c7d773aacf30b616d572310c5abfd430b5073780d8a834ea72199d172","target":"record","created_at":"2026-05-17T23:43:18Z","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":"3e6c1a9c9a2d1bec28621010260ea5a2473884874eed4307569dd9200ba41f8f","cross_cats_sorted":["math.MG","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2016-03-30T18:37:17Z","title_canon_sha256":"4319b4a1f46e1391ed0709c78f6becb6798749b177feb0fa50aa07814a5f5e36"},"schema_version":"1.0","source":{"id":"1603.09304","kind":"arxiv","version":2}},"canonical_sha256":"3d14b64d70e4054cc7249dc4bd0a4d8d3185a98b989f06c14a28bfde14499f10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d14b64d70e4054cc7249dc4bd0a4d8d3185a98b989f06c14a28bfde14499f10","first_computed_at":"2026-05-17T23:43:18.835826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:18.835826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HcKdPZL0rmXpOZ3NO1b1Vq3ErW9xYV+uteepHeJNejb/f94nhfwT0rKXLtOnEx+Fb5i2oS57W2aqMpItBMPICw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:18.836374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.09304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1f83a0c7d773aacf30b616d572310c5abfd430b5073780d8a834ea72199d172","sha256:7a8e4b0caba5c1ca159f47738d5a04f7fe875bac3ef4273f9328c2de527de5df"],"state_sha256":"39b9eae064836acd3fcc14d894d40ccb0b4e79459cd999f3c8b614e1c75bf491"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xBDy/gSOaIAUoogbAyEfdnzHknjJ79aLqVuooxpx8u+yWrZ0882vXB8b6nJ4rs+KQFKsRsPsMI59e4T3/0waDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:16:37.967298Z","bundle_sha256":"e6ff7368e0f55b5d846039d47a0868d9c21e506647c7d6bea59ba96d5cf8b4ef"}}