{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:Z7T57L7VIAYKTQCAWSNRQTCU6W","short_pith_number":"pith:Z7T57L7V","schema_version":"1.0","canonical_sha256":"cfe7dfaff54030a9c040b49b184c54f5a18f9561931f71835760bf163570642f","source":{"kind":"arxiv","id":"0801.4662","version":1},"attestation_state":"computed","paper":{"title":"Admissibility of kneading sequences and structure of Hubbard trees for quadratic polynomials","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Dierk Schleicher, Henk Bruin","submitted_at":"2008-01-30T12:36:09Z","abstract_excerpt":"Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \\cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets in a combinatorial way. The itinerary of the critical orbit within the Hubbard tree is encoded by a (pre)periodic sequence on $\\{\\0,\\1\\}$ called \\emph{kneading sequence}.\n  We prove that the kneading sequence completely encodes the Hubbard tree and its dynamics, and we show how to reconstruct the tree and in particular its branch points (together with their "},"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":"0801.4662","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.DS","submitted_at":"2008-01-30T12:36:09Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bc59cb92c168f973fc28acb14d30a55290fd7de4e06aaf356f966cc1b653e6fc","abstract_canon_sha256":"0b1ba846c8770e148d45310fac53ded778af37a6a465f58503bec5dbf5451548"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:11.875765Z","signature_b64":"+BLVR9qLUrEEcY2MA8sUi3+wNBWF90GY2Wbznhz6ZrLm1NschYo+rsFAq3atnEwzRWiIDv9jAbLyYQlsvnBgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfe7dfaff54030a9c040b49b184c54f5a18f9561931f71835760bf163570642f","last_reissued_at":"2026-05-18T02:58:11.874818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:11.874818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Admissibility of kneading sequences and structure of Hubbard trees for quadratic polynomials","license":"","headline":"","cross_cats":["math.CO"],"primary_cat":"math.DS","authors_text":"Dierk Schleicher, Henk Bruin","submitted_at":"2008-01-30T12:36:09Z","abstract_excerpt":"Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard \\cite{Orsay} introduced these trees and showed that they encode the essential information of Julia sets in a combinatorial way. The itinerary of the critical orbit within the Hubbard tree is encoded by a (pre)periodic sequence on $\\{\\0,\\1\\}$ called \\emph{kneading sequence}.\n  We prove that the kneading sequence completely encodes the Hubbard tree and its dynamics, and we show how to reconstruct the tree and in particular its branch points (together with their "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0801.4662","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":"0801.4662","created_at":"2026-05-18T02:58:11.874969+00:00"},{"alias_kind":"arxiv_version","alias_value":"0801.4662v1","created_at":"2026-05-18T02:58:11.874969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0801.4662","created_at":"2026-05-18T02:58:11.874969+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z7T57L7VIAYK","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z7T57L7VIAYKTQCA","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z7T57L7V","created_at":"2026-05-18T12:25:58.018023+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/Z7T57L7VIAYKTQCAWSNRQTCU6W","json":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W.json","graph_json":"https://pith.science/api/pith-number/Z7T57L7VIAYKTQCAWSNRQTCU6W/graph.json","events_json":"https://pith.science/api/pith-number/Z7T57L7VIAYKTQCAWSNRQTCU6W/events.json","paper":"https://pith.science/paper/Z7T57L7V"},"agent_actions":{"view_html":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W","download_json":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W.json","view_paper":"https://pith.science/paper/Z7T57L7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0801.4662&json=true","fetch_graph":"https://pith.science/api/pith-number/Z7T57L7VIAYKTQCAWSNRQTCU6W/graph.json","fetch_events":"https://pith.science/api/pith-number/Z7T57L7VIAYKTQCAWSNRQTCU6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W/action/storage_attestation","attest_author":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W/action/author_attestation","sign_citation":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W/action/citation_signature","submit_replication":"https://pith.science/pith/Z7T57L7VIAYKTQCAWSNRQTCU6W/action/replication_record"}},"created_at":"2026-05-18T02:58:11.874969+00:00","updated_at":"2026-05-18T02:58:11.874969+00:00"}