{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3PB7XNHJIYE6XAAVS5G6NGXQTP","short_pith_number":"pith:3PB7XNHJ","schema_version":"1.0","canonical_sha256":"dbc3fbb4e94609eb8015974de69af09bc6b92c8834fedea2aea87ecad203e47d","source":{"kind":"arxiv","id":"1109.0371","version":2},"attestation_state":"computed","paper":{"title":"Tree-like tableaux","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault (LaBRI), Jean-Christophe Aval (LaBRI), Philippe Nadeau (ICJ)","submitted_at":"2011-09-02T07:05:57Z","abstract_excerpt":"In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally on alternative and permutation tableaux. Our insertion procedure allows to define in particular two simple new bijections between tree-like tableaux and permutations: the first one is conceived specifical"},"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":"1109.0371","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-02T07:05:57Z","cross_cats_sorted":[],"title_canon_sha256":"491293d61b64c7a03e778f922bc230e070ca9e555075db62f6cf3c05c68284c4","abstract_canon_sha256":"871ab768e0a11be1a4673f26cc729129a311d2a00217e51739270a07c6b1323d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.857157Z","signature_b64":"qrynsTB7i9MlPr0ctvtKZFdmWIAbQCrJKxRqD2GDJYifkzin7BOj83JsqROqG96UYxR34309X8SLCroFGp2kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbc3fbb4e94609eb8015974de69af09bc6b92c8834fedea2aea87ecad203e47d","last_reissued_at":"2026-05-18T02:54:21.856764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.856764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-like tableaux","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adrien Boussicault (LaBRI), Jean-Christophe Aval (LaBRI), Philippe Nadeau (ICJ)","submitted_at":"2011-09-02T07:05:57Z","abstract_excerpt":"In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux. We exhibit an elementary insertion procedure on our tableaux which gives a clear proof that tree-like tableaux of size n are counted by n!, and which moreover respects most of the well-known statistics studied originally on alternative and permutation tableaux. Our insertion procedure allows to define in particular two simple new bijections between tree-like tableaux and permutations: the first one is conceived specifical"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0371","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":""},"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":"1109.0371","created_at":"2026-05-18T02:54:21.856827+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.0371v2","created_at":"2026-05-18T02:54:21.856827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0371","created_at":"2026-05-18T02:54:21.856827+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PB7XNHJIYE6","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PB7XNHJIYE6XAAV","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PB7XNHJ","created_at":"2026-05-18T12:26:18.847500+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/3PB7XNHJIYE6XAAVS5G6NGXQTP","json":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP.json","graph_json":"https://pith.science/api/pith-number/3PB7XNHJIYE6XAAVS5G6NGXQTP/graph.json","events_json":"https://pith.science/api/pith-number/3PB7XNHJIYE6XAAVS5G6NGXQTP/events.json","paper":"https://pith.science/paper/3PB7XNHJ"},"agent_actions":{"view_html":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP","download_json":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP.json","view_paper":"https://pith.science/paper/3PB7XNHJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.0371&json=true","fetch_graph":"https://pith.science/api/pith-number/3PB7XNHJIYE6XAAVS5G6NGXQTP/graph.json","fetch_events":"https://pith.science/api/pith-number/3PB7XNHJIYE6XAAVS5G6NGXQTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP/action/storage_attestation","attest_author":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP/action/author_attestation","sign_citation":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP/action/citation_signature","submit_replication":"https://pith.science/pith/3PB7XNHJIYE6XAAVS5G6NGXQTP/action/replication_record"}},"created_at":"2026-05-18T02:54:21.856827+00:00","updated_at":"2026-05-18T02:54:21.856827+00:00"}