{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:R3WJBQJQAH3U2XRSKBDLRFTEUO","short_pith_number":"pith:R3WJBQJQ","canonical_record":{"source":{"id":"2406.18689","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-26T18:48:30Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"3f82cfbc84d7c49e4c7ffc26f379c1b9e8159096c00c7121a5e7cfd749122f13","abstract_canon_sha256":"909dbcf21e394087f602597067ccb4fe0bccbde6762875a310aa6f98d438c5df"},"schema_version":"1.0"},"canonical_sha256":"8eec90c13001f74d5e325046b89664a3a4be2898021802a71a90c8c1ba72dfd7","source":{"kind":"arxiv","id":"2406.18689","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.18689","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"2406.18689v2","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18689","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"R3WJBQJQAH3U","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_16","alias_value":"R3WJBQJQAH3U2XRS","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_8","alias_value":"R3WJBQJQ","created_at":"2026-07-05T09:46:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:R3WJBQJQAH3U2XRSKBDLRFTEUO","target":"record","payload":{"canonical_record":{"source":{"id":"2406.18689","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-26T18:48:30Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"3f82cfbc84d7c49e4c7ffc26f379c1b9e8159096c00c7121a5e7cfd749122f13","abstract_canon_sha256":"909dbcf21e394087f602597067ccb4fe0bccbde6762875a310aa6f98d438c5df"},"schema_version":"1.0"},"canonical_sha256":"8eec90c13001f74d5e325046b89664a3a4be2898021802a71a90c8c1ba72dfd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:48.523793Z","signature_b64":"sIShrSB3Ukk/HqJa2XV98xTE9GlpNW/CPYN0PuJSj/gTmqLDnpTCJ0u758RltLMPQQLgrZqbA5g0iCOo3EUQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eec90c13001f74d5e325046b89664a3a4be2898021802a71a90c8c1ba72dfd7","last_reissued_at":"2026-07-05T09:46:48.523282Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:48.523282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.18689","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-07-05T09:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JL3UjwdcePqPU0ABTxQT5XyFlRKtK+teMTpQmcTjihiS5O+GtyV4LAw0lqX/CoWW4kbj7mk+oki3fH7IkkSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:36:43.267905Z"},"content_sha256":"e95729c6a8982c49638bddcc9b5ef27f2168c82b185e57e5b0992f52737148c1","schema_version":"1.0","event_id":"sha256:e95729c6a8982c49638bddcc9b5ef27f2168c82b185e57e5b0992f52737148c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:R3WJBQJQAH3U2XRSKBDLRFTEUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A finiteness condition for complex continued fraction algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"math.NT","authors_text":"Charlene Kalle, Fanni M. S\\'elley, J\\\"org M. Thuswaldner","submitted_at":"2024-06-26T18:48:30Z","abstract_excerpt":"It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show that this condition holds for complex $\\boldsymbol{\\alpha}$-Hurwitz algorithms with parameters $\\boldsymbol{\\alpha}\\in\\mathbb{Q}^2$. This is equivalent to the existence of certain finite partitions related to these algorithms and lies at the root of explorations into their Diophantine properties. Our result provides a partial answer to a recent question formula"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18689","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.18689/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"},"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-07-05T09:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gy7e3DTzeCKzWHLIRmizm98snVjOY6idEKiT9JObT38dKADogJD9l3kQx/ugU8UTZ+DKDBj19YoMp/ifPGp/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T17:36:43.268473Z"},"content_sha256":"606f45d5ff23adf4d5dd49919891fc54f6bc522f3089b6d0ade6e5e2d02fcd4d","schema_version":"1.0","event_id":"sha256:606f45d5ff23adf4d5dd49919891fc54f6bc522f3089b6d0ade6e5e2d02fcd4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/bundle.json","state_url":"https://pith.science/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/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-08-08T17:36:43Z","links":{"resolver":"https://pith.science/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO","bundle":"https://pith.science/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/bundle.json","state":"https://pith.science/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3WJBQJQAH3U2XRSKBDLRFTEUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:R3WJBQJQAH3U2XRSKBDLRFTEUO","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":"909dbcf21e394087f602597067ccb4fe0bccbde6762875a310aa6f98d438c5df","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-26T18:48:30Z","title_canon_sha256":"3f82cfbc84d7c49e4c7ffc26f379c1b9e8159096c00c7121a5e7cfd749122f13"},"schema_version":"1.0","source":{"id":"2406.18689","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.18689","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"2406.18689v2","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18689","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"R3WJBQJQAH3U","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_16","alias_value":"R3WJBQJQAH3U2XRS","created_at":"2026-07-05T09:46:48Z"},{"alias_kind":"pith_short_8","alias_value":"R3WJBQJQ","created_at":"2026-07-05T09:46:48Z"}],"graph_snapshots":[{"event_id":"sha256:606f45d5ff23adf4d5dd49919891fc54f6bc522f3089b6d0ade6e5e2d02fcd4d","target":"graph","created_at":"2026-07-05T09:46:48Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.18689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"It is desirable that a given continued fraction algorithm is simple in the sense that the possible representations can be characterized in an easy way. In this context the so-called finite range condition plays a prominent role. We show that this condition holds for complex $\\boldsymbol{\\alpha}$-Hurwitz algorithms with parameters $\\boldsymbol{\\alpha}\\in\\mathbb{Q}^2$. This is equivalent to the existence of certain finite partitions related to these algorithms and lies at the root of explorations into their Diophantine properties. Our result provides a partial answer to a recent question formula","authors_text":"Charlene Kalle, Fanni M. S\\'elley, J\\\"org M. Thuswaldner","cross_cats":["math.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-26T18:48:30Z","title":"A finiteness condition for complex continued fraction algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18689","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:e95729c6a8982c49638bddcc9b5ef27f2168c82b185e57e5b0992f52737148c1","target":"record","created_at":"2026-07-05T09:46:48Z","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":"909dbcf21e394087f602597067ccb4fe0bccbde6762875a310aa6f98d438c5df","cross_cats_sorted":["math.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2024-06-26T18:48:30Z","title_canon_sha256":"3f82cfbc84d7c49e4c7ffc26f379c1b9e8159096c00c7121a5e7cfd749122f13"},"schema_version":"1.0","source":{"id":"2406.18689","kind":"arxiv","version":2}},"canonical_sha256":"8eec90c13001f74d5e325046b89664a3a4be2898021802a71a90c8c1ba72dfd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8eec90c13001f74d5e325046b89664a3a4be2898021802a71a90c8c1ba72dfd7","first_computed_at":"2026-07-05T09:46:48.523282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:48.523282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sIShrSB3Ukk/HqJa2XV98xTE9GlpNW/CPYN0PuJSj/gTmqLDnpTCJ0u758RltLMPQQLgrZqbA5g0iCOo3EUQDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:48.523793Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.18689","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e95729c6a8982c49638bddcc9b5ef27f2168c82b185e57e5b0992f52737148c1","sha256:606f45d5ff23adf4d5dd49919891fc54f6bc522f3089b6d0ade6e5e2d02fcd4d"],"state_sha256":"00585cb56ae2bbb44b8ff993300278713348e76f9f5c5987c918dc2c32b8e11a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2TSGsrhrK2+++uptccZCDWE+hKM/2PLtLPtZNNgQsWuOmKLjShEqy+n02FSbyot1ykm1Jv72bWTC371JEJJcDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T17:36:43.272105Z","bundle_sha256":"3adb0244dfd5473ee59b8454db53bedececa220c5ff828ea16d6357b12d5cf41"}}