{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7J35CA7Y77THP2RLGIQO7CZQPQ","short_pith_number":"pith:7J35CA7Y","schema_version":"1.0","canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","source":{"kind":"arxiv","id":"1812.01066","version":1},"attestation_state":"computed","paper":{"title":"Rationality is decidable for nearly Euclidean Thurston maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Kevin M. Pilgrim, Walter Parry, William Floyd","submitted_at":"2018-12-03T20:25:52Z","abstract_excerpt":"Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at most $C$, the problem of determining whether $F$ is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of $C$ and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality."},"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":"1812.01066","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-12-03T20:25:52Z","cross_cats_sorted":[],"title_canon_sha256":"15b690038d856524bc8acc6ce7f38b820c8bf0288325ce10f7464ca48054d8ab","abstract_canon_sha256":"99d95787a007536ad513a47c31b7f8206086f64f54276a088a0030defdcb3518"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:13.394723Z","signature_b64":"4nxTc3lYCIsZUH9lthBvRue9dACi1n6E/hGKD88kjTVficnQwS2J9e2yZMLhvogBe/QEKoQL3MuHhVCvDy8YAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","last_reissued_at":"2026-05-17T23:59:13.394250Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:13.394250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rationality is decidable for nearly Euclidean Thurston maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Kevin M. Pilgrim, Walter Parry, William Floyd","submitted_at":"2018-12-03T20:25:52Z","abstract_excerpt":"Nearly Euclidean Thurston (NET) maps are described by simple diagrams which admit a natural notion of size. Given a size bound $C$, there are finitely many diagrams of size at most $C$. Given a NET map $F$ presented by a diagram of size at most $C$, the problem of determining whether $F$ is equivalent to a rational function is, in theory, a finite computation. We give bounds for the size of this computation in terms of $C$ and one other natural geometric quantity. This result partially explains the observed effectiveness of the computer program NETmap in deciding rationality."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01066","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":"1812.01066","created_at":"2026-05-17T23:59:13.394324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01066v1","created_at":"2026-05-17T23:59:13.394324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01066","created_at":"2026-05-17T23:59:13.394324+00:00"},{"alias_kind":"pith_short_12","alias_value":"7J35CA7Y77TH","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7J35CA7Y77THP2RL","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7J35CA7Y","created_at":"2026-05-18T12:32:11.075285+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/7J35CA7Y77THP2RLGIQO7CZQPQ","json":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ.json","graph_json":"https://pith.science/api/pith-number/7J35CA7Y77THP2RLGIQO7CZQPQ/graph.json","events_json":"https://pith.science/api/pith-number/7J35CA7Y77THP2RLGIQO7CZQPQ/events.json","paper":"https://pith.science/paper/7J35CA7Y"},"agent_actions":{"view_html":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ","download_json":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ.json","view_paper":"https://pith.science/paper/7J35CA7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01066&json=true","fetch_graph":"https://pith.science/api/pith-number/7J35CA7Y77THP2RLGIQO7CZQPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7J35CA7Y77THP2RLGIQO7CZQPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/action/storage_attestation","attest_author":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/action/author_attestation","sign_citation":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/action/citation_signature","submit_replication":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/action/replication_record"}},"created_at":"2026-05-17T23:59:13.394324+00:00","updated_at":"2026-05-17T23:59:13.394324+00:00"}