{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DCBXBHVMFKFHQZKZI5JVRA6N5F","short_pith_number":"pith:DCBXBHVM","canonical_record":{"source":{"id":"1810.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-10-16T15:36:25Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"a48b6e19601e6f62508b73d64eca763b94270fc1dd9def7fd9b9356efb38db77","abstract_canon_sha256":"96da060869e6f743babe4afa400328997212a8191e51f5afe855b48d8cc06bfb"},"schema_version":"1.0"},"canonical_sha256":"1883709eac2a8a78655947535883cde96b4a5a0d1ed239ade659c7fbaecdf3df","source":{"kind":"arxiv","id":"1810.07083","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07083","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07083v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07083","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"DCBXBHVMFKFH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCBXBHVMFKFHQZKZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCBXBHVM","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DCBXBHVMFKFHQZKZI5JVRA6N5F","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-10-16T15:36:25Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"a48b6e19601e6f62508b73d64eca763b94270fc1dd9def7fd9b9356efb38db77","abstract_canon_sha256":"96da060869e6f743babe4afa400328997212a8191e51f5afe855b48d8cc06bfb"},"schema_version":"1.0"},"canonical_sha256":"1883709eac2a8a78655947535883cde96b4a5a0d1ed239ade659c7fbaecdf3df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:10.507155Z","signature_b64":"vV71KBgZ+oZWRgePGyeOgdvzqGRAc9+ZiFnezOcoHO5nwTO7xxWD9TASBT6cstJgaVjx+GTIuD2gXK3NN6etDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1883709eac2a8a78655947535883cde96b4a5a0d1ed239ade659c7fbaecdf3df","last_reissued_at":"2026-05-18T00:03:10.506390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:10.506390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07083","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-18T00:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LFwLAqXqU/TcxcXzpS8b7qP8CpBYDcK6/u1+8ZBIIuuO/MRCIaB17RFluICveNmGm69urVZSnzY8qkmxoGa/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:22.849809Z"},"content_sha256":"c700859fce7060e26cc43b5a0b12d41bdf7d220a6b32375a9a9a2d1019169036","schema_version":"1.0","event_id":"sha256:c700859fce7060e26cc43b5a0b12d41bdf7d220a6b32375a9a9a2d1019169036"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DCBXBHVMFKFHQZKZI5JVRA6N5F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.DS","authors_text":"Derong Kong, Simon Baker","submitted_at":"2018-10-16T15:36:25Z","abstract_excerpt":"Let $F=\\{\\mathbf{p}_0,\\ldots,\\mathbf{p}_n\\}$ be a collection of points in $\\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\\mathbf{x})=\\lambda \\mathbf{x} +(1-\\lambda)\\mathbf{p}_i,$$ where $\\lambda \\in(0,1)$. Given $F$ and $\\lambda$ it is well known that there exists a unique non-empty compact set $X$ satisfying $X=\\cup_{i=0}^n S_i(X)$. For each $\\mathbf{x} \\in X$ there exists a sequence $\\mathbf{a}\\in\\{0,\\ldots,n\\}^{\\mathbb{N}}$ satisfying $$\\mathbf{x}=\\lim_{j\\to\\infty}(S_{a_1}\\circ \\cdots \\circ S_{a_j})(\\mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07083","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-18T00:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AAvA5TppsCHStju5fn2XPxjwDi1g3WTLJO9T48lKN+E89YM1O0znZNL8M9zlliLTgWy+yxGijTYF4ScDpL/fDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T22:46:22.850148Z"},"content_sha256":"32475545606404b3e8e340e9c6286c756c10d6dcc2677fe43799009f86e08bb6","schema_version":"1.0","event_id":"sha256:32475545606404b3e8e340e9c6286c756c10d6dcc2677fe43799009f86e08bb6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/bundle.json","state_url":"https://pith.science/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/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-22T22:46:22Z","links":{"resolver":"https://pith.science/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F","bundle":"https://pith.science/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/bundle.json","state":"https://pith.science/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCBXBHVMFKFHQZKZI5JVRA6N5F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DCBXBHVMFKFHQZKZI5JVRA6N5F","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":"96da060869e6f743babe4afa400328997212a8191e51f5afe855b48d8cc06bfb","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-10-16T15:36:25Z","title_canon_sha256":"a48b6e19601e6f62508b73d64eca763b94270fc1dd9def7fd9b9356efb38db77"},"schema_version":"1.0","source":{"id":"1810.07083","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07083","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07083v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07083","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"DCBXBHVMFKFH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DCBXBHVMFKFHQZKZ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DCBXBHVM","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:32475545606404b3e8e340e9c6286c756c10d6dcc2677fe43799009f86e08bb6","target":"graph","created_at":"2026-05-18T00:03:10Z","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":"Let $F=\\{\\mathbf{p}_0,\\ldots,\\mathbf{p}_n\\}$ be a collection of points in $\\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\\mathbf{x})=\\lambda \\mathbf{x} +(1-\\lambda)\\mathbf{p}_i,$$ where $\\lambda \\in(0,1)$. Given $F$ and $\\lambda$ it is well known that there exists a unique non-empty compact set $X$ satisfying $X=\\cup_{i=0}^n S_i(X)$. For each $\\mathbf{x} \\in X$ there exists a sequence $\\mathbf{a}\\in\\{0,\\ldots,n\\}^{\\mathbb{N}}$ satisfying $$\\mathbf{x}=\\lim_{j\\to\\infty}(S_{a_1}\\circ \\cdots \\circ S_{a_j})(\\mat","authors_text":"Derong Kong, Simon Baker","cross_cats":["math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-10-16T15:36:25Z","title":"On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07083","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:c700859fce7060e26cc43b5a0b12d41bdf7d220a6b32375a9a9a2d1019169036","target":"record","created_at":"2026-05-18T00:03:10Z","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":"96da060869e6f743babe4afa400328997212a8191e51f5afe855b48d8cc06bfb","cross_cats_sorted":["math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-10-16T15:36:25Z","title_canon_sha256":"a48b6e19601e6f62508b73d64eca763b94270fc1dd9def7fd9b9356efb38db77"},"schema_version":"1.0","source":{"id":"1810.07083","kind":"arxiv","version":1}},"canonical_sha256":"1883709eac2a8a78655947535883cde96b4a5a0d1ed239ade659c7fbaecdf3df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1883709eac2a8a78655947535883cde96b4a5a0d1ed239ade659c7fbaecdf3df","first_computed_at":"2026-05-18T00:03:10.506390Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:10.506390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vV71KBgZ+oZWRgePGyeOgdvzqGRAc9+ZiFnezOcoHO5nwTO7xxWD9TASBT6cstJgaVjx+GTIuD2gXK3NN6etDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:10.507155Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07083","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c700859fce7060e26cc43b5a0b12d41bdf7d220a6b32375a9a9a2d1019169036","sha256:32475545606404b3e8e340e9c6286c756c10d6dcc2677fe43799009f86e08bb6"],"state_sha256":"e6310f716f96ba8ff2ebe0b282bd180db6f4145666c8b15d08cf72287df05d9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FYEkQsW2SwTNUlnT2PIj/NnnfFIYNZMv8UXCQgTEze+NgpHOLvpb0dbZHca7Y28qfBKCZTtTzA6VCJV+LeluAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T22:46:22.852055Z","bundle_sha256":"c1880f40ceae17e1e4e9e5c3fa7a301669c5c5b752619a2dab32855dc397fe0e"}}