{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QHEB72ZOTFOSP2JBY42QHQP3UN","short_pith_number":"pith:QHEB72ZO","schema_version":"1.0","canonical_sha256":"81c81feb2e995d27e921c73503c1fba359b2cf67eb2e007491d881bd3a58db1a","source":{"kind":"arxiv","id":"1701.00443","version":1},"attestation_state":"computed","paper":{"title":"Presentations of NET 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":"2017-01-02T16:55:44Z","abstract_excerpt":"A branched covering $f: S^2 \\to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. We show that up to equivalence, each NET map admits a normal form in terms of simple affine data. This data can then be used as input for algorithms developed for the computation of fundamental invariants, now systematically tabulated in a large census."},"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":"1701.00443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2017-01-02T16:55:44Z","cross_cats_sorted":[],"title_canon_sha256":"30b07b370b766dd6ed9239fe6c1e327ded789eac1ca8704c2db7771d6a45852d","abstract_canon_sha256":"b7eb34b727f7068ab2578e78a2e99c31a16d0314d402b447abe5ab9d9d3e416d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:35.593021Z","signature_b64":"/yPFORoAcdpGxjWdxsUUQFGeqhScq3FaW/cWTYKE43uPVBuwA5U8OIQqHXmKqFk5QflLeCgKdjvmgMpCg7zkDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81c81feb2e995d27e921c73503c1fba359b2cf67eb2e007491d881bd3a58db1a","last_reissued_at":"2026-05-18T00:53:35.592540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:35.592540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Presentations of NET 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":"2017-01-02T16:55:44Z","abstract_excerpt":"A branched covering $f: S^2 \\to S^2$ is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. We show that up to equivalence, each NET map admits a normal form in terms of simple affine data. This data can then be used as input for algorithms developed for the computation of fundamental invariants, now systematically tabulated in a large census."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.00443","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":"1701.00443","created_at":"2026-05-18T00:53:35.592612+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.00443v1","created_at":"2026-05-18T00:53:35.592612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.00443","created_at":"2026-05-18T00:53:35.592612+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHEB72ZOTFOS","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHEB72ZOTFOSP2JB","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHEB72ZO","created_at":"2026-05-18T12:31:37.085036+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/QHEB72ZOTFOSP2JBY42QHQP3UN","json":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN.json","graph_json":"https://pith.science/api/pith-number/QHEB72ZOTFOSP2JBY42QHQP3UN/graph.json","events_json":"https://pith.science/api/pith-number/QHEB72ZOTFOSP2JBY42QHQP3UN/events.json","paper":"https://pith.science/paper/QHEB72ZO"},"agent_actions":{"view_html":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN","download_json":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN.json","view_paper":"https://pith.science/paper/QHEB72ZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.00443&json=true","fetch_graph":"https://pith.science/api/pith-number/QHEB72ZOTFOSP2JBY42QHQP3UN/graph.json","fetch_events":"https://pith.science/api/pith-number/QHEB72ZOTFOSP2JBY42QHQP3UN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN/action/storage_attestation","attest_author":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN/action/author_attestation","sign_citation":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN/action/citation_signature","submit_replication":"https://pith.science/pith/QHEB72ZOTFOSP2JBY42QHQP3UN/action/replication_record"}},"created_at":"2026-05-18T00:53:35.592612+00:00","updated_at":"2026-05-18T00:53:35.592612+00:00"}