{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:PFYHFLTQS7AMWNOLGQX4TTGJGM","short_pith_number":"pith:PFYHFLTQ","schema_version":"1.0","canonical_sha256":"797072ae7097c0cb35cb342fc9ccc933312ad68754179be7a78c12b9a896a1cf","source":{"kind":"arxiv","id":"math/0701539","version":1},"attestation_state":"computed","paper":{"title":"Trees, functional equations, and combinatorial Hopf algebras","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon","submitted_at":"2007-01-19T15:13:09Z","abstract_excerpt":"One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in power series rings. When analyzed in terms of combinatorial Hopf algebras, the simplest examples yield interesting algebraic identities or enumerative results."},"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":"math/0701539","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-01-19T15:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"483dc04a446fd6b3de13a1e7bfd878fc7c77e6f862c5f59e9e70f29c57cc9a05","abstract_canon_sha256":"c1f9c75f5e0ca42c2a2acd2f6722d8cf71412625f0e1313ab64d2f5453fb5519"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:00.421848Z","signature_b64":"OcSZS+L/znCJkBolSjd3z4h69vJahPPee4o5jI/t7CexYGEJOxS+9PXaXbCeyVUj2eFqPyQkEkLU6d9UPT0TCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"797072ae7097c0cb35cb342fc9ccc933312ad68754179be7a78c12b9a896a1cf","last_reissued_at":"2026-05-18T03:34:00.421184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:00.421184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Trees, functional equations, and combinatorial Hopf algebras","license":"","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon","submitted_at":"2007-01-19T15:13:09Z","abstract_excerpt":"One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in power series rings. When analyzed in terms of combinatorial Hopf algebras, the simplest examples yield interesting algebraic identities or enumerative results."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0701539","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":"math/0701539","created_at":"2026-05-18T03:34:00.421283+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0701539v1","created_at":"2026-05-18T03:34:00.421283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0701539","created_at":"2026-05-18T03:34:00.421283+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFYHFLTQS7AM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFYHFLTQS7AMWNOL","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFYHFLTQ","created_at":"2026-05-18T12:25:55.427421+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/PFYHFLTQS7AMWNOLGQX4TTGJGM","json":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM.json","graph_json":"https://pith.science/api/pith-number/PFYHFLTQS7AMWNOLGQX4TTGJGM/graph.json","events_json":"https://pith.science/api/pith-number/PFYHFLTQS7AMWNOLGQX4TTGJGM/events.json","paper":"https://pith.science/paper/PFYHFLTQ"},"agent_actions":{"view_html":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM","download_json":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM.json","view_paper":"https://pith.science/paper/PFYHFLTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0701539&json=true","fetch_graph":"https://pith.science/api/pith-number/PFYHFLTQS7AMWNOLGQX4TTGJGM/graph.json","fetch_events":"https://pith.science/api/pith-number/PFYHFLTQS7AMWNOLGQX4TTGJGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM/action/storage_attestation","attest_author":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM/action/author_attestation","sign_citation":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM/action/citation_signature","submit_replication":"https://pith.science/pith/PFYHFLTQS7AMWNOLGQX4TTGJGM/action/replication_record"}},"created_at":"2026-05-18T03:34:00.421283+00:00","updated_at":"2026-05-18T03:34:00.421283+00:00"}