{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6BQZI6QBOZIY2S7JCKJ3EEEW2E","short_pith_number":"pith:6BQZI6QB","schema_version":"1.0","canonical_sha256":"f061947a0176518d4be91293b21096d129d048e14d6be55395f587a9f39a5ee3","source":{"kind":"arxiv","id":"1709.08018","version":1},"attestation_state":"computed","paper":{"title":"A new indexed approach to render the attractors of Kleinian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.FL","authors_text":"Alessandro Rosa","submitted_at":"2017-09-23T08:00:31Z","abstract_excerpt":"One widespread procedure to render the attractor of Kleinian groups, published in the renown book \"Indra's Pearls\" and based upon a combinatorial tree model, wants huge memory resources to compute and store all the words required. We will present here a new faster and lighter version which drops the original words array and pulls out words from integer numbers."},"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":"1709.08018","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-09-23T08:00:31Z","cross_cats_sorted":["cs.MS"],"title_canon_sha256":"12f7cd0b9b4d496c7adbab44ca00c6bdd3deb6971f98f4db9f75958351ba977e","abstract_canon_sha256":"5800ae8b099ceab8d9c3d6581362177eceb7ac7ec2b7c8af62fe972901272d5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:28.222774Z","signature_b64":"fcCBznTRcjUvgNuq+CxhOsLvByLwl6eqrXptIjPON3a2jZf8Vj30m/2E6CHRoKNdiPQOnsS8TGZTd7VodjAcCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f061947a0176518d4be91293b21096d129d048e14d6be55395f587a9f39a5ee3","last_reissued_at":"2026-05-18T00:34:28.222259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:28.222259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new indexed approach to render the attractors of Kleinian groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS"],"primary_cat":"cs.FL","authors_text":"Alessandro Rosa","submitted_at":"2017-09-23T08:00:31Z","abstract_excerpt":"One widespread procedure to render the attractor of Kleinian groups, published in the renown book \"Indra's Pearls\" and based upon a combinatorial tree model, wants huge memory resources to compute and store all the words required. We will present here a new faster and lighter version which drops the original words array and pulls out words from integer numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08018","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.08018","created_at":"2026-05-18T00:34:28.222355+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08018v1","created_at":"2026-05-18T00:34:28.222355+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08018","created_at":"2026-05-18T00:34:28.222355+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BQZI6QBOZIY","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BQZI6QBOZIY2S7J","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BQZI6QB","created_at":"2026-05-18T12:31:03.183658+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/6BQZI6QBOZIY2S7JCKJ3EEEW2E","json":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E.json","graph_json":"https://pith.science/api/pith-number/6BQZI6QBOZIY2S7JCKJ3EEEW2E/graph.json","events_json":"https://pith.science/api/pith-number/6BQZI6QBOZIY2S7JCKJ3EEEW2E/events.json","paper":"https://pith.science/paper/6BQZI6QB"},"agent_actions":{"view_html":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E","download_json":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E.json","view_paper":"https://pith.science/paper/6BQZI6QB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08018&json=true","fetch_graph":"https://pith.science/api/pith-number/6BQZI6QBOZIY2S7JCKJ3EEEW2E/graph.json","fetch_events":"https://pith.science/api/pith-number/6BQZI6QBOZIY2S7JCKJ3EEEW2E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E/action/storage_attestation","attest_author":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E/action/author_attestation","sign_citation":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E/action/citation_signature","submit_replication":"https://pith.science/pith/6BQZI6QBOZIY2S7JCKJ3EEEW2E/action/replication_record"}},"created_at":"2026-05-18T00:34:28.222355+00:00","updated_at":"2026-05-18T00:34:28.222355+00:00"}