{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:U4QDUARI7F5KX3UPBBQEJEWRBI","short_pith_number":"pith:U4QDUARI","schema_version":"1.0","canonical_sha256":"a7203a0228f97aabee8f08604492d10a043b640a970e998f0f3ce458594a6ae8","source":{"kind":"arxiv","id":"1109.2946","version":2},"attestation_state":"computed","paper":{"title":"Computability of the Julia set. Nonrecurrent critical orbits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Artem Dudko","submitted_at":"2011-09-13T22:57:13Z","abstract_excerpt":"We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits."},"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":"1109.2946","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2011-09-13T22:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"0f8158171bd4a487b84b65048d25763fb38a20ddaf5aa14d02583c1c2f380d2c","abstract_canon_sha256":"5a54b3423fe4d3a213387d5973e2de7cf9754a9ed646466ba5ff76f4a80514b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:11.457867Z","signature_b64":"bpdpdRl5yQnMTJQu7P/aiFR+qcwc2Z3UpauXOi/j0oByuJVaT1YW9BtlsLvbbClblNsGPnynGPjwAZrwM1XvAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7203a0228f97aabee8f08604492d10a043b640a970e998f0f3ce458594a6ae8","last_reissued_at":"2026-05-18T04:12:11.457464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:11.457464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computability of the Julia set. Nonrecurrent critical orbits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Artem Dudko","submitted_at":"2011-09-13T22:57:13Z","abstract_excerpt":"We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2946","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.2946","created_at":"2026-05-18T04:12:11.457520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2946v2","created_at":"2026-05-18T04:12:11.457520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2946","created_at":"2026-05-18T04:12:11.457520+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4QDUARI7F5K","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4QDUARI7F5KX3UP","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4QDUARI","created_at":"2026-05-18T12:26:42.757692+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/U4QDUARI7F5KX3UPBBQEJEWRBI","json":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI.json","graph_json":"https://pith.science/api/pith-number/U4QDUARI7F5KX3UPBBQEJEWRBI/graph.json","events_json":"https://pith.science/api/pith-number/U4QDUARI7F5KX3UPBBQEJEWRBI/events.json","paper":"https://pith.science/paper/U4QDUARI"},"agent_actions":{"view_html":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI","download_json":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI.json","view_paper":"https://pith.science/paper/U4QDUARI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2946&json=true","fetch_graph":"https://pith.science/api/pith-number/U4QDUARI7F5KX3UPBBQEJEWRBI/graph.json","fetch_events":"https://pith.science/api/pith-number/U4QDUARI7F5KX3UPBBQEJEWRBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI/action/storage_attestation","attest_author":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI/action/author_attestation","sign_citation":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI/action/citation_signature","submit_replication":"https://pith.science/pith/U4QDUARI7F5KX3UPBBQEJEWRBI/action/replication_record"}},"created_at":"2026-05-18T04:12:11.457520+00:00","updated_at":"2026-05-18T04:12:11.457520+00:00"}