{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6CRR4AWNOSWCF3YZD2K2E7TF3F","short_pith_number":"pith:6CRR4AWN","schema_version":"1.0","canonical_sha256":"f0a31e02cd74ac22ef191e95a27e65d94448bdbe40579d26576f09e5c7c67761","source":{"kind":"arxiv","id":"2506.05703","version":1},"attestation_state":"computed","paper":{"title":"Operators of stochastic adding machines and Julia sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ali Messaoudi, Danilo Caprio, Glauco Valle, Ioannis Tsokanos","submitted_at":"2025-06-06T03:07:56Z","abstract_excerpt":"A stochastic adding machine is a Markov chain on the set of non-negative integers $\\mathbb{Z}_{+}$ that models the process of adding one by successively updating the digits of a number's expansion in a given numeration system. At each step, random failures may occur, interrupting the procedure and preventing it from continuing beyond a certain point.\n  The first model of such a stochastic adding machine, constructed for the binary base, was introduced by Killeen and Taylor. Their work was motivated by applications to biological clocks, aiming to model phenomena related to time discrimination a"},"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":"2506.05703","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.DS","submitted_at":"2025-06-06T03:07:56Z","cross_cats_sorted":[],"title_canon_sha256":"0afa65333f34850e4b01526a398bbd1208a9eede5c02c5490abfd750c57b992b","abstract_canon_sha256":"27ccc34db7ea1415bc71f3e461cdb38c15dbdc2983ec92fc935892f2059073e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:08.313968Z","signature_b64":"6DHWIG9kLcxid9OGTi2t9U5tQPGBXILJiFT896iwYF8k3Ls1Z4ZsfaJoYKvCqhLhXmA1ZhdEtqdWnHqRx3VtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a31e02cd74ac22ef191e95a27e65d94448bdbe40579d26576f09e5c7c67761","last_reissued_at":"2026-07-05T11:17:08.313455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:08.313455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Operators of stochastic adding machines and Julia sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Ali Messaoudi, Danilo Caprio, Glauco Valle, Ioannis Tsokanos","submitted_at":"2025-06-06T03:07:56Z","abstract_excerpt":"A stochastic adding machine is a Markov chain on the set of non-negative integers $\\mathbb{Z}_{+}$ that models the process of adding one by successively updating the digits of a number's expansion in a given numeration system. At each step, random failures may occur, interrupting the procedure and preventing it from continuing beyond a certain point.\n  The first model of such a stochastic adding machine, constructed for the binary base, was introduced by Killeen and Taylor. Their work was motivated by applications to biological clocks, aiming to model phenomena related to time discrimination a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.05703/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2506.05703","created_at":"2026-07-05T11:17:08.313518+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.05703v1","created_at":"2026-07-05T11:17:08.313518+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05703","created_at":"2026-07-05T11:17:08.313518+00:00"},{"alias_kind":"pith_short_12","alias_value":"6CRR4AWNOSWC","created_at":"2026-07-05T11:17:08.313518+00:00"},{"alias_kind":"pith_short_16","alias_value":"6CRR4AWNOSWCF3YZ","created_at":"2026-07-05T11:17:08.313518+00:00"},{"alias_kind":"pith_short_8","alias_value":"6CRR4AWN","created_at":"2026-07-05T11:17:08.313518+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/6CRR4AWNOSWCF3YZD2K2E7TF3F","json":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F.json","graph_json":"https://pith.science/api/pith-number/6CRR4AWNOSWCF3YZD2K2E7TF3F/graph.json","events_json":"https://pith.science/api/pith-number/6CRR4AWNOSWCF3YZD2K2E7TF3F/events.json","paper":"https://pith.science/paper/6CRR4AWN"},"agent_actions":{"view_html":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F","download_json":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F.json","view_paper":"https://pith.science/paper/6CRR4AWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.05703&json=true","fetch_graph":"https://pith.science/api/pith-number/6CRR4AWNOSWCF3YZD2K2E7TF3F/graph.json","fetch_events":"https://pith.science/api/pith-number/6CRR4AWNOSWCF3YZD2K2E7TF3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F/action/storage_attestation","attest_author":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F/action/author_attestation","sign_citation":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F/action/citation_signature","submit_replication":"https://pith.science/pith/6CRR4AWNOSWCF3YZD2K2E7TF3F/action/replication_record"}},"created_at":"2026-07-05T11:17:08.313518+00:00","updated_at":"2026-07-05T11:17:08.313518+00:00"}