{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5ZKNDWA5WDCGGKAOO2U6NH7XX6","short_pith_number":"pith:5ZKNDWA5","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"},"canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","source":{"kind":"arxiv","id":"1305.3716","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3716","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3716v1","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3716","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"5ZKNDWA5WDCG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ZKNDWA5WDCGGKAO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ZKNDWA5","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5ZKNDWA5WDCGGKAOO2U6NH7XX6","target":"record","payload":{"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"},"canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","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"},"source_kind":"arxiv","source_id":"1305.3716","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YfMXdbbqhH0mF3oyErKLGGtxFcvZ/cfUvsvzCUdew4GDsR9oNDMpG4OhXHbnmSxdIprZP6v7RNIkvO1HONgACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:55:01.828361Z"},"content_sha256":"3b1f93552e30442bb3b9caaafa5f61be687b087d4ab7c9369555848a44f663e7","schema_version":"1.0","event_id":"sha256:3b1f93552e30442bb3b9caaafa5f61be687b087d4ab7c9369555848a44f663e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5ZKNDWA5WDCGGKAOO2U6NH7XX6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:25:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaxEg3yPbWu3RyH6/jIacKVUupaxFuHPS5KRH+lDV+GtzgiMrrtA6IEuN49vju9LEGsRU8scE3u+VFNd1P+wBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T18:55:01.828702Z"},"content_sha256":"af53ee0cc6a13505c1a492e7088117db2226b612c42f17b76cd711c7c2acc9f2","schema_version":"1.0","event_id":"sha256:af53ee0cc6a13505c1a492e7088117db2226b612c42f17b76cd711c7c2acc9f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/bundle.json","state_url":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T18:55:01Z","links":{"resolver":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6","bundle":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/bundle.json","state":"https://pith.science/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZKNDWA5WDCGGKAOO2U6NH7XX6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5ZKNDWA5WDCGGKAOO2U6NH7XX6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8df50e2ba154fda032948ee5ff694f324d3dc7e109370fbe11a30803db22846a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T08:43:13Z","title_canon_sha256":"5945f72cd7961f09e8861ee8a2e92407325878db96a1f5f3199961fcc06f3bf1"},"schema_version":"1.0","source":{"id":"1305.3716","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3716","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3716v1","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3716","created_at":"2026-05-18T03:25:34Z"},{"alias_kind":"pith_short_12","alias_value":"5ZKNDWA5WDCG","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5ZKNDWA5WDCGGKAO","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5ZKNDWA5","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:af53ee0cc6a13505c1a492e7088117db2226b612c42f17b76cd711c7c2acc9f2","target":"graph","created_at":"2026-05-18T03:25:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Adrien Boussicault, Jean-Christophe Aval, Mathilde Bouvel, Matteo Silimbani","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T08:43:13Z","title":"Combinatorics of non-ambiguous trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3716","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b1f93552e30442bb3b9caaafa5f61be687b087d4ab7c9369555848a44f663e7","target":"record","created_at":"2026-05-18T03:25:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8df50e2ba154fda032948ee5ff694f324d3dc7e109370fbe11a30803db22846a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-05-16T08:43:13Z","title_canon_sha256":"5945f72cd7961f09e8861ee8a2e92407325878db96a1f5f3199961fcc06f3bf1"},"schema_version":"1.0","source":{"id":"1305.3716","kind":"arxiv","version":1}},"canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee54d1d81db0c463280e76a9e69ff7bfac70ac16689672a96ee44e76dae5c8e4","first_computed_at":"2026-05-18T03:25:34.133709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:34.133709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rUcyWvzn8Tu4nwb0P2nOgFOXcmI+21g1v6aNEYoYqTL8hKkjXlEMkYSakTEaJyG70AFJ6+4UP6mt18ai/PZnAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:34.134406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3716","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b1f93552e30442bb3b9caaafa5f61be687b087d4ab7c9369555848a44f663e7","sha256:af53ee0cc6a13505c1a492e7088117db2226b612c42f17b76cd711c7c2acc9f2"],"state_sha256":"f2a033209cbb0a2db90ad74f99dfc539feff073c544f081692eed4e5780b046d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PvG+pUyeMOZ0oNRLU7Grs2LqKnl+7kb4Imrl2OgzovVtnpzR5POcQAd7h8FmEJWTNRuq00II6aW2YCzPcI0dDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T18:55:01.830572Z","bundle_sha256":"6c2fd77eb281796fe00f392728a27717ce46bbe81144c2a4e98a3b1a29e183e6"}}