{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MBJQSZ53T4FSBOYW3LRUQNPKRI","short_pith_number":"pith:MBJQSZ53","schema_version":"1.0","canonical_sha256":"60530967bb9f0b20bb16dae34835ea8a18d2bd750d2dc05cac492a0db0dad195","source":{"kind":"arxiv","id":"2605.15415","version":1},"attestation_state":"computed","paper":{"title":"Boolean--Eulerian numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The number of red- or blue-colored decreasing binary trees equals 2^{n-1} times the nth Euler number.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikl\\'os B\\'ona, Vincent Vatter","submitted_at":"2026-05-14T20:59:45Z","abstract_excerpt":"We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that the exponential generating function of these trees is $1/(1-\\tan z)$. The second, to nonplane decreasing 1-2 trees paired with a binary label on each non-root vertex, proves combinatorially that the count equals $2^{n-1}$ times the~$n$th Euler number. Refining by the number of right edges yields the Boolean--Eulerian polynomials, which are an explicit algeb"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.15415","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T20:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"29abb792a04b250856929d2c6d0cf2a26764d89c9566de189dd5b77534084b2d","abstract_canon_sha256":"317adc392ec63e577d63717a34596a9b063d0012549e91530a518c4d4ed87081"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:57.407410Z","signature_b64":"I+QQoz/Cu0JE2VRSMkWuSCrxLchp+/1J5HDuyWEvFdr3Fv8GbzFgxsVTc8XCVEvIKx6mpvujMT7HMo9TsvLaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60530967bb9f0b20bb16dae34835ea8a18d2bd750d2dc05cac492a0db0dad195","last_reissued_at":"2026-05-20T00:00:57.406634Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:57.406634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boolean--Eulerian numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"The number of red- or blue-colored decreasing binary trees equals 2^{n-1} times the nth Euler number.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikl\\'os B\\'ona, Vincent Vatter","submitted_at":"2026-05-14T20:59:45Z","abstract_excerpt":"We study decreasing binary trees in which every vertex with two children is colored red or blue. We construct two bijections. The first, to ordered set partitions into odd-sized blocks each arranged as an alternating permutation, shows that the exponential generating function of these trees is $1/(1-\\tan z)$. The second, to nonplane decreasing 1-2 trees paired with a binary label on each non-root vertex, proves combinatorially that the count equals $2^{n-1}$ times the~$n$th Euler number. Refining by the number of right edges yields the Boolean--Eulerian polynomials, which are an explicit algeb"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The count equals 2^{n-1} times the nth Euler number; the Boolean-Eulerian polynomials are an explicit algebraic transform of the classical Eulerian polynomials; the Foata-Strehl orbit decomposition recast in the decreasing-binary-tree model gives a direct combinatorial proof of gamma-positivity.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The two constructed bijections are valid and preserve all the required statistics (odd block sizes, alternating permutations, right edges, binary labels). This premise is invoked in the statements of the two bijections and in the refinement by right edges (abstract, paragraphs describing the first and second bijections).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Boolean-Eulerian numbers count red-blue colored decreasing binary trees and equal 2^{n-1} times the nth Euler number; their polynomials are algebraic transforms of Eulerian polynomials that inherit gamma-positivity, real-rootedness, and zero interlacing.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The number of red- or blue-colored decreasing binary trees equals 2^{n-1} times the nth Euler number.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"abfdc61c0c3be0d28a93eae4cf2713480bcf90d3d4e744fa1dd112267a1e7841"},"source":{"id":"2605.15415","kind":"arxiv","version":1},"verdict":{"id":"023f9291-5eb6-4602-843f-89fd1458a515","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:03:19.108996Z","strongest_claim":"The count equals 2^{n-1} times the nth Euler number; the Boolean-Eulerian polynomials are an explicit algebraic transform of the classical Eulerian polynomials; the Foata-Strehl orbit decomposition recast in the decreasing-binary-tree model gives a direct combinatorial proof of gamma-positivity.","one_line_summary":"Boolean-Eulerian numbers count red-blue colored decreasing binary trees and equal 2^{n-1} times the nth Euler number; their polynomials are algebraic transforms of Eulerian polynomials that inherit gamma-positivity, real-rootedness, and zero interlacing.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The two constructed bijections are valid and preserve all the required statistics (odd block sizes, alternating permutations, right edges, binary labels). This premise is invoked in the statements of the two bijections and in the refinement by right edges (abstract, paragraphs describing the first and second bijections).","pith_extraction_headline":"The number of red- or blue-colored decreasing binary trees equals 2^{n-1} times the nth Euler number."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15415/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T16:23:37.067473Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:44.294625Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.803403Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:21:50.169962Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.147733Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.707929Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"f4cb8ec99b1c9de8938fcae5d7171da5708d7244fb4d22b79ae9e294862aca9e"},"references":{"count":11,"sample":[{"doi":"","year":null,"title":"Boolean-Narayana numbers","work_id":"3c033680-d273-4700-bfdd-17b01a2addf7","ref_index":1,"cited_arxiv_id":"2602.11355","is_internal_anchor":true},{"doi":"","year":null,"title":"Stack-sorting preimages and 0 - 1 -trees","work_id":"90e614f9-002b-4365-aac2-23cc595b8268","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1989,"title":"Unimodal, log-concave and P \\'olya frequency sequences in combinatorics","work_id":"d1d7daca-23e5-420f-9385-4c21015c6d89","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1994,"title":"The applications of total positivity to combinatorics, and conversely","work_id":"fbf77091-c1c7-4b25-b537-271a48314bce","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1970,"title":"Th\\'eorie g\\'eom\\'etrique des polyn\\^omes eul\\'eriens , vol","work_id":"7daf768e-66ef-4975-a78f-fff34ebe436e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":11,"snapshot_sha256":"693b94eea64e9492ef4e98da6f2cb4c9d5ed4d9d5758c36ffbb26d838d21a0fa","internal_anchors":1},"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":"2605.15415","created_at":"2026-05-20T00:00:57.406756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15415v1","created_at":"2026-05-20T00:00:57.406756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15415","created_at":"2026-05-20T00:00:57.406756+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBJQSZ53T4FS","created_at":"2026-05-20T00:00:57.406756+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBJQSZ53T4FSBOYW","created_at":"2026-05-20T00:00:57.406756+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBJQSZ53","created_at":"2026-05-20T00:00:57.406756+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/MBJQSZ53T4FSBOYW3LRUQNPKRI","json":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI.json","graph_json":"https://pith.science/api/pith-number/MBJQSZ53T4FSBOYW3LRUQNPKRI/graph.json","events_json":"https://pith.science/api/pith-number/MBJQSZ53T4FSBOYW3LRUQNPKRI/events.json","paper":"https://pith.science/paper/MBJQSZ53"},"agent_actions":{"view_html":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI","download_json":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI.json","view_paper":"https://pith.science/paper/MBJQSZ53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15415&json=true","fetch_graph":"https://pith.science/api/pith-number/MBJQSZ53T4FSBOYW3LRUQNPKRI/graph.json","fetch_events":"https://pith.science/api/pith-number/MBJQSZ53T4FSBOYW3LRUQNPKRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI/action/storage_attestation","attest_author":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI/action/author_attestation","sign_citation":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI/action/citation_signature","submit_replication":"https://pith.science/pith/MBJQSZ53T4FSBOYW3LRUQNPKRI/action/replication_record"}},"created_at":"2026-05-20T00:00:57.406756+00:00","updated_at":"2026-05-20T00:00:57.406756+00:00"}