{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:A7IQYAS635BAIE2HDWF2NUOJ2T","short_pith_number":"pith:A7IQYAS6","schema_version":"1.0","canonical_sha256":"07d10c025edf420413471d8ba6d1c9d4e432f21d78e26f2bdc41a000748dc8d4","source":{"kind":"arxiv","id":"2312.11183","version":1},"attestation_state":"computed","paper":{"title":"Local limits of descent-biased permutations and trees","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Paul Th\\'evenin, Stephan Wagner","submitted_at":"2023-12-18T13:24:28Z","abstract_excerpt":"We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\\sigma$ is a pair of consecutive elements $\\sigma(i), \\sigma(i+1)$ such that $\\sigma(i) > \\sigma(i+1)$. Likewise, a descent in a rooted tree with labelled vertices is a pair of a parent vertex and a child such that the label of the parent is greater than the label of the child. For some nonnegative real number $q$, we consider the probability measures on permutations and on rooted labelled trees of a given size where each permutation or tree is chosen with a"},"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":"2312.11183","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.PR","submitted_at":"2023-12-18T13:24:28Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"6e8e46cdae57f1a41faaebd28bc738a0b0b32dddbed4168ffb02d6252ec564d5","abstract_canon_sha256":"de1482235080aeb76dc1e54ce57d4e4848cb612d768513cedc4af5fdc590dfc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:25:29.379065Z","signature_b64":"BFAJKrbO6uutfuvEROS0j2/qwgEFbtdQMr6ExF5zdHGC3zZjv1uZRcH4YWLJieoh0vSIJQPdDTabqXwNdT+sBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07d10c025edf420413471d8ba6d1c9d4e432f21d78e26f2bdc41a000748dc8d4","last_reissued_at":"2026-07-05T07:25:29.378717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:25:29.378717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local limits of descent-biased permutations and trees","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Paul Th\\'evenin, Stephan Wagner","submitted_at":"2023-12-18T13:24:28Z","abstract_excerpt":"We study two related probabilistic models of permutations and trees biased by their number of descents. Here, a descent in a permutation $\\sigma$ is a pair of consecutive elements $\\sigma(i), \\sigma(i+1)$ such that $\\sigma(i) > \\sigma(i+1)$. Likewise, a descent in a rooted tree with labelled vertices is a pair of a parent vertex and a child such that the label of the parent is greater than the label of the child. For some nonnegative real number $q$, we consider the probability measures on permutations and on rooted labelled trees of a given size where each permutation or tree is chosen with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.11183","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.11183/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.11183","created_at":"2026-07-05T07:25:29.378778+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.11183v1","created_at":"2026-07-05T07:25:29.378778+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.11183","created_at":"2026-07-05T07:25:29.378778+00:00"},{"alias_kind":"pith_short_12","alias_value":"A7IQYAS635BA","created_at":"2026-07-05T07:25:29.378778+00:00"},{"alias_kind":"pith_short_16","alias_value":"A7IQYAS635BAIE2H","created_at":"2026-07-05T07:25:29.378778+00:00"},{"alias_kind":"pith_short_8","alias_value":"A7IQYAS6","created_at":"2026-07-05T07:25:29.378778+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/A7IQYAS635BAIE2HDWF2NUOJ2T","json":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T.json","graph_json":"https://pith.science/api/pith-number/A7IQYAS635BAIE2HDWF2NUOJ2T/graph.json","events_json":"https://pith.science/api/pith-number/A7IQYAS635BAIE2HDWF2NUOJ2T/events.json","paper":"https://pith.science/paper/A7IQYAS6"},"agent_actions":{"view_html":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T","download_json":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T.json","view_paper":"https://pith.science/paper/A7IQYAS6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.11183&json=true","fetch_graph":"https://pith.science/api/pith-number/A7IQYAS635BAIE2HDWF2NUOJ2T/graph.json","fetch_events":"https://pith.science/api/pith-number/A7IQYAS635BAIE2HDWF2NUOJ2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T/action/storage_attestation","attest_author":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T/action/author_attestation","sign_citation":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T/action/citation_signature","submit_replication":"https://pith.science/pith/A7IQYAS635BAIE2HDWF2NUOJ2T/action/replication_record"}},"created_at":"2026-07-05T07:25:29.378778+00:00","updated_at":"2026-07-05T07:25:29.378778+00:00"}