{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5ZKNDWA5WDCGGKAOO2U6NH7XX6","short_pith_number":"pith:5ZKNDWA5","schema_version":"1.0","canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","source":{"kind":"arxiv","id":"1305.3716","version":1},"attestation_state":"computed","paper":{"title":"Combinatorics of non-ambiguous trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault, Jean-Christophe Aval, Mathilde Bouvel, Matteo Silimbani","submitted_at":"2013-05-16T08:43:13Z","abstract_excerpt":"This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of identities due to Carlitz, and to Ehrenborg and Steingr\\'imsson. We also provide a hook formula to count the number of non-ambiguous trees with a given underlying tree. Finally, we use non-ambiguous trees t"},"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":"1305.3716","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T08:43:13Z","cross_cats_sorted":[],"title_canon_sha256":"5945f72cd7961f09e8861ee8a2e92407325878db96a1f5f3199961fcc06f3bf1","abstract_canon_sha256":"8df50e2ba154fda032948ee5ff694f324d3dc7e109370fbe11a30803db22846a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:34.134406Z","signature_b64":"rUcyWvzn8Tu4nwb0P2nOgFOXcmI+21g1v6aNEYoYqTL8hKkjXlEMkYSakTEaJyG70AFJ6+4UP6mt18ai/PZnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","last_reissued_at":"2026-05-18T03:25:34.133709Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:34.133709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorics of non-ambiguous trees","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault, Jean-Christophe Aval, Mathilde Bouvel, Matteo Silimbani","submitted_at":"2013-05-16T08:43:13Z","abstract_excerpt":"This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by Aval, Boussicault and Nadeau. The enumeration of non-ambiguous trees satisfying some additional constraints allows us to give elegant combinatorial proofs of identities due to Carlitz, and to Ehrenborg and Steingr\\'imsson. We also provide a hook formula to count the number of non-ambiguous trees with a given underlying tree. Finally, we use non-ambiguous trees t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3716","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":"1305.3716","created_at":"2026-05-18T03:25:34.133817+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.3716v1","created_at":"2026-05-18T03:25:34.133817+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3716","created_at":"2026-05-18T03:25:34.133817+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZKNDWA5WDCG","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZKNDWA5WDCGGKAO","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZKNDWA5","created_at":"2026-05-18T12:27:34.582898+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/5ZKNDWA5WDCGGKAOO2U6NH7XX6","json":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6.json","graph_json":"https://pith.science/api/pith-number/5ZKNDWA5WDCGGKAOO2U6NH7XX6/graph.json","events_json":"https://pith.science/api/pith-number/5ZKNDWA5WDCGGKAOO2U6NH7XX6/events.json","paper":"https://pith.science/paper/5ZKNDWA5"},"agent_actions":{"view_html":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6","download_json":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6.json","view_paper":"https://pith.science/paper/5ZKNDWA5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.3716&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZKNDWA5WDCGGKAOO2U6NH7XX6/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZKNDWA5WDCGGKAOO2U6NH7XX6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/action/storage_attestation","attest_author":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/action/author_attestation","sign_citation":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/action/citation_signature","submit_replication":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/action/replication_record"}},"created_at":"2026-05-18T03:25:34.133817+00:00","updated_at":"2026-05-18T03:25:34.133817+00:00"}