{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:62RMYCYH53ITRLRMEK4ZBW4DD3","short_pith_number":"pith:62RMYCYH","schema_version":"1.0","canonical_sha256":"f6a2cc0b07eed138ae2c22b990db831ef03fe609466cc688bd1142dad6902d48","source":{"kind":"arxiv","id":"2105.10055","version":2},"attestation_state":"computed","paper":{"title":"Realizing polynomial portraits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Daniel Kim, Edgar Saenz, Sarah Koch, Walter Parry, William Floyd","submitted_at":"2021-05-20T22:15:58Z","abstract_excerpt":"It is well known that the dynamical behavior of a rational map $f:\\widehat{\\mathbb C}\\to \\widehat{\\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical point has finite forward orbit, or equivalently, if every critical point eventually maps into a periodic cycle of $f$. We encode the orbits of the critical points of $f$ with a finite directed graph called a ramification portrait. In this article, we study which graphs arise as ramification portraits. We prove that every abstract polynomial portrait is real"},"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":"2105.10055","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2021-05-20T22:15:58Z","cross_cats_sorted":[],"title_canon_sha256":"883560ef23b40d7af766b2b758de4c9579292dce05a1ab3d439caf390f75b543","abstract_canon_sha256":"e6cb307989e4d43f800936017faaa9cf75d54113d8a57cefccb71608ed81e086"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:16:51.702760Z","signature_b64":"p1fsi0mZQnvPXKvKd+uZBX7L79ia32GgWg1HAqW+oth5CbdKrCEYjacrDQq1i+G+mTvtxEb619AU+6XxEWVWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a2cc0b07eed138ae2c22b990db831ef03fe609466cc688bd1142dad6902d48","last_reissued_at":"2026-07-05T04:16:51.701770Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:16:51.701770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Realizing polynomial portraits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Daniel Kim, Edgar Saenz, Sarah Koch, Walter Parry, William Floyd","submitted_at":"2021-05-20T22:15:58Z","abstract_excerpt":"It is well known that the dynamical behavior of a rational map $f:\\widehat{\\mathbb C}\\to \\widehat{\\mathbb C}$ is governed by the forward orbits of the critical points of $f$. The map $f$ is said to be postcritically finite if every critical point has finite forward orbit, or equivalently, if every critical point eventually maps into a periodic cycle of $f$. We encode the orbits of the critical points of $f$ with a finite directed graph called a ramification portrait. In this article, we study which graphs arise as ramification portraits. We prove that every abstract polynomial portrait is real"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.10055","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.10055/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.10055","created_at":"2026-07-05T04:16:51.701870+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.10055v2","created_at":"2026-07-05T04:16:51.701870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.10055","created_at":"2026-07-05T04:16:51.701870+00:00"},{"alias_kind":"pith_short_12","alias_value":"62RMYCYH53IT","created_at":"2026-07-05T04:16:51.701870+00:00"},{"alias_kind":"pith_short_16","alias_value":"62RMYCYH53ITRLRM","created_at":"2026-07-05T04:16:51.701870+00:00"},{"alias_kind":"pith_short_8","alias_value":"62RMYCYH","created_at":"2026-07-05T04:16:51.701870+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.05033","citing_title":"Profinite geometric iterated monodromy groups of postcritically finite polynomials in degree 3","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3","json":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3.json","graph_json":"https://pith.science/api/pith-number/62RMYCYH53ITRLRMEK4ZBW4DD3/graph.json","events_json":"https://pith.science/api/pith-number/62RMYCYH53ITRLRMEK4ZBW4DD3/events.json","paper":"https://pith.science/paper/62RMYCYH"},"agent_actions":{"view_html":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3","download_json":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3.json","view_paper":"https://pith.science/paper/62RMYCYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.10055&json=true","fetch_graph":"https://pith.science/api/pith-number/62RMYCYH53ITRLRMEK4ZBW4DD3/graph.json","fetch_events":"https://pith.science/api/pith-number/62RMYCYH53ITRLRMEK4ZBW4DD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3/action/storage_attestation","attest_author":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3/action/author_attestation","sign_citation":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3/action/citation_signature","submit_replication":"https://pith.science/pith/62RMYCYH53ITRLRMEK4ZBW4DD3/action/replication_record"}},"created_at":"2026-07-05T04:16:51.701870+00:00","updated_at":"2026-07-05T04:16:51.701870+00:00"}