{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:U4VRNEWPYBHGK36EG7OR4OI3R3","short_pith_number":"pith:U4VRNEWP","schema_version":"1.0","canonical_sha256":"a72b1692cfc04e656fc437dd1e391b8ee2fc69a4d4ef596470070117ab3d432e","source":{"kind":"arxiv","id":"1511.09455","version":1},"attestation_state":"computed","paper":{"title":"Non-ambiguous trees: new results and generalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault, Berenice Delcroix-Oger, Florent Hivert, Jean-Christophe Aval, Patxi Laborde-Zubieta","submitted_at":"2015-11-30T20:23:33Z","abstract_excerpt":"We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our formula. And we generalize NATs to higher dimension."},"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":"1511.09455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-30T20:23:33Z","cross_cats_sorted":[],"title_canon_sha256":"854e53a011e91b302850d523508034faf750591ddcf50b92c31f45f904a5470d","abstract_canon_sha256":"22a87d02ccb7a1994393416688c64e0a32b7e06875a2a66e0d034a79b9aca1ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:40.217009Z","signature_b64":"TOIeoTAZUzBj6Bo1uOQ3I8QSTknaW9WsMMajfe/hc9jBDDgKSup8U5UiA7So73GNeWSL2zF+Hzn+ICGWXCCHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a72b1692cfc04e656fc437dd1e391b8ee2fc69a4d4ef596470070117ab3d432e","last_reissued_at":"2026-05-18T01:25:40.216342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:40.216342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-ambiguous trees: new results and generalisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault, Berenice Delcroix-Oger, Florent Hivert, Jean-Christophe Aval, Patxi Laborde-Zubieta","submitted_at":"2015-11-30T20:23:33Z","abstract_excerpt":"We present a new definition of non-ambiguous trees (NATs) as labelled binary trees. We thus get a differential equation whose solution can be described combinatorially. This yield a new formula for the number of NATs. We also obtain q-versions of our formula. And we generalize NATs to higher dimension."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.09455","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":"1511.09455","created_at":"2026-05-18T01:25:40.216449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.09455v1","created_at":"2026-05-18T01:25:40.216449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.09455","created_at":"2026-05-18T01:25:40.216449+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4VRNEWPYBHG","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4VRNEWPYBHGK36E","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4VRNEWP","created_at":"2026-05-18T12:29:44.643036+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/U4VRNEWPYBHGK36EG7OR4OI3R3","json":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3.json","graph_json":"https://pith.science/api/pith-number/U4VRNEWPYBHGK36EG7OR4OI3R3/graph.json","events_json":"https://pith.science/api/pith-number/U4VRNEWPYBHGK36EG7OR4OI3R3/events.json","paper":"https://pith.science/paper/U4VRNEWP"},"agent_actions":{"view_html":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3","download_json":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3.json","view_paper":"https://pith.science/paper/U4VRNEWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.09455&json=true","fetch_graph":"https://pith.science/api/pith-number/U4VRNEWPYBHGK36EG7OR4OI3R3/graph.json","fetch_events":"https://pith.science/api/pith-number/U4VRNEWPYBHGK36EG7OR4OI3R3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3/action/storage_attestation","attest_author":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3/action/author_attestation","sign_citation":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3/action/citation_signature","submit_replication":"https://pith.science/pith/U4VRNEWPYBHGK36EG7OR4OI3R3/action/replication_record"}},"created_at":"2026-05-18T01:25:40.216449+00:00","updated_at":"2026-05-18T01:25:40.216449+00:00"}