{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7J35CA7Y77THP2RLGIQO7CZQPQ","short_pith_number":"pith:7J35CA7Y","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"},"canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","source":{"kind":"arxiv","id":"1812.01066","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01066","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01066v1","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01066","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"7J35CA7Y77TH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7J35CA7Y77THP2RL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7J35CA7Y","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7J35CA7Y77THP2RLGIQO7CZQPQ","target":"record","payload":{"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"},"canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","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"},"source_kind":"arxiv","source_id":"1812.01066","source_version":1,"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-05-17T23:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+S17I5VDIhJ0WAhk21+buCEecP8fC8JE+socT4hrAWt9WqvjJ0NYYumdZlDALdITPLyIu+O55Y/KTOaAD1H8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:11.431436Z"},"content_sha256":"8576f5f8f871115079305212bee752725482880115285b59f154e0ef6c1f8dd9","schema_version":"1.0","event_id":"sha256:8576f5f8f871115079305212bee752725482880115285b59f154e0ef6c1f8dd9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7J35CA7Y77THP2RLGIQO7CZQPQ","target":"graph","payload":{"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"},"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-05-17T23:59:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFFh7R0AIYYNHcf/bQcKIkKPFfFjTkVMzkpZezpsbWK9UfJ4TWHdNcZJUlObfvfRwajyOuHeWQ/0KsXaM4ccAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:11.431785Z"},"content_sha256":"51a1a4a2cf70deec4060b9da79257b93653bfec79a7af217f5b3fa4d90241e43","schema_version":"1.0","event_id":"sha256:51a1a4a2cf70deec4060b9da79257b93653bfec79a7af217f5b3fa4d90241e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/bundle.json","state_url":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/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-06-21T23:04:11Z","links":{"resolver":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ","bundle":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/bundle.json","state":"https://pith.science/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7J35CA7Y77THP2RLGIQO7CZQPQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7J35CA7Y77THP2RLGIQO7CZQPQ","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":"99d95787a007536ad513a47c31b7f8206086f64f54276a088a0030defdcb3518","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-12-03T20:25:52Z","title_canon_sha256":"15b690038d856524bc8acc6ce7f38b820c8bf0288325ce10f7464ca48054d8ab"},"schema_version":"1.0","source":{"id":"1812.01066","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.01066","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"arxiv_version","alias_value":"1812.01066v1","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01066","created_at":"2026-05-17T23:59:13Z"},{"alias_kind":"pith_short_12","alias_value":"7J35CA7Y77TH","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7J35CA7Y77THP2RL","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7J35CA7Y","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:51a1a4a2cf70deec4060b9da79257b93653bfec79a7af217f5b3fa4d90241e43","target":"graph","created_at":"2026-05-17T23:59:13Z","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"},"paper":{"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.","authors_text":"Kevin M. Pilgrim, Walter Parry, William Floyd","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-12-03T20:25:52Z","title":"Rationality is decidable for nearly Euclidean Thurston maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01066","kind":"arxiv","version":1},"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:8576f5f8f871115079305212bee752725482880115285b59f154e0ef6c1f8dd9","target":"record","created_at":"2026-05-17T23:59:13Z","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":"99d95787a007536ad513a47c31b7f8206086f64f54276a088a0030defdcb3518","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2018-12-03T20:25:52Z","title_canon_sha256":"15b690038d856524bc8acc6ce7f38b820c8bf0288325ce10f7464ca48054d8ab"},"schema_version":"1.0","source":{"id":"1812.01066","kind":"arxiv","version":1}},"canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa77d103f8ffe677ea2b3220ef8b307c2a7f94885b2c95b4660ac83a2cb023a7","first_computed_at":"2026-05-17T23:59:13.394250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:13.394250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4nxTc3lYCIsZUH9lthBvRue9dACi1n6E/hGKD88kjTVficnQwS2J9e2yZMLhvogBe/QEKoQL3MuHhVCvDy8YAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:13.394723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.01066","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8576f5f8f871115079305212bee752725482880115285b59f154e0ef6c1f8dd9","sha256:51a1a4a2cf70deec4060b9da79257b93653bfec79a7af217f5b3fa4d90241e43"],"state_sha256":"4d768f54476f7019cc8d4bffc996eb0d0fc5279fe616223762e46ca77a857dae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6uVjTQxD66r7QC8/ePYWCs/GkEL+SscDpgR7xCAzLUszo0r7a9Ng0bYB8WaVJU3Y+vSiS+2dLesz2UgE0jROBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:04:11.433938Z","bundle_sha256":"e9cbf29d5b9bceeaaff06d89d7d3aa1ff15892828ccae4f71afa2338ff48d7fa"}}