{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MFDXZ6QMYDO4ZY5JBNUYULJYNK","short_pith_number":"pith:MFDXZ6QM","schema_version":"1.0","canonical_sha256":"61477cfa0cc0ddcce3a90b698a2d386a9c0fece0e8cd002ebcb9fea712d3dc5a","source":{"kind":"arxiv","id":"1901.10140","version":1},"attestation_state":"computed","paper":{"title":"Smirnov Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matja\\v{z} Konvalinka, Vasu Tewari","submitted_at":"2019-01-29T07:14:26Z","abstract_excerpt":"We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is $e$-positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection."},"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":"1901.10140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-29T07:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"8654c459556a3a6d3062f72226fe5b59c4775698b9415c12fd1887143966ce78","abstract_canon_sha256":"79692218cd6f601a29852bd2c5e85a4199a844de334ec6ca6038b95e9eaf6693"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:16.051448Z","signature_b64":"p4SxYqb2fbLqiqMxiK+Sf2zBCFOqTHz33tSO7QD7wusXtKtf9If8Ps2bQ07ifVP3mxLJ3DSsOuL55xTlGtjKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61477cfa0cc0ddcce3a90b698a2d386a9c0fece0e8cd002ebcb9fea712d3dc5a","last_reissued_at":"2026-05-17T23:55:16.050913Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:16.050913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smirnov Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matja\\v{z} Konvalinka, Vasu Tewari","submitted_at":"2019-01-29T07:14:26Z","abstract_excerpt":"We introduce a generalization of Smirnov words in the context of labeled binary trees, which we call Smirnov trees. We study the generating function for ascent-descent statistics on Smirnov trees and establish that it is $e$-positive, which is akin to the classical case of Smirnov words. Our proof relies on an intricate weight-preserving bijection."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.10140","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":"1901.10140","created_at":"2026-05-17T23:55:16.050987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.10140v1","created_at":"2026-05-17T23:55:16.050987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.10140","created_at":"2026-05-17T23:55:16.050987+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFDXZ6QMYDO4","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFDXZ6QMYDO4ZY5J","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFDXZ6QM","created_at":"2026-05-18T12:33:21.387695+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/MFDXZ6QMYDO4ZY5JBNUYULJYNK","json":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK.json","graph_json":"https://pith.science/api/pith-number/MFDXZ6QMYDO4ZY5JBNUYULJYNK/graph.json","events_json":"https://pith.science/api/pith-number/MFDXZ6QMYDO4ZY5JBNUYULJYNK/events.json","paper":"https://pith.science/paper/MFDXZ6QM"},"agent_actions":{"view_html":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK","download_json":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK.json","view_paper":"https://pith.science/paper/MFDXZ6QM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.10140&json=true","fetch_graph":"https://pith.science/api/pith-number/MFDXZ6QMYDO4ZY5JBNUYULJYNK/graph.json","fetch_events":"https://pith.science/api/pith-number/MFDXZ6QMYDO4ZY5JBNUYULJYNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK/action/storage_attestation","attest_author":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK/action/author_attestation","sign_citation":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK/action/citation_signature","submit_replication":"https://pith.science/pith/MFDXZ6QMYDO4ZY5JBNUYULJYNK/action/replication_record"}},"created_at":"2026-05-17T23:55:16.050987+00:00","updated_at":"2026-05-17T23:55:16.050987+00:00"}