{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MPVXJH422ZJLEFM6DSEKGS7KLO","short_pith_number":"pith:MPVXJH42","schema_version":"1.0","canonical_sha256":"63eb749f9ad652b2159e1c88a34bea5b85df1128dc100524c69bcd1011c281d8","source":{"kind":"arxiv","id":"2306.04278","version":2},"attestation_state":"computed","paper":{"title":"The permuton limit of random recursive separable permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Kelvin Rivera-Lopez, Valentin F\\'eray","submitted_at":"2023-06-07T09:29:08Z","abstract_excerpt":"We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the recursive separable permuton. We then prove several results on this new limiting object: a characterization of its distribution via a fixed-point equation, a combinatorial formula for its expected pattern densities, an explicit integral formula for its intensity measure, and lastly, we prove that its distribution is absolutely singular with respect to that of the"},"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":"2306.04278","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.PR","submitted_at":"2023-06-07T09:29:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4d74fc4c49b2e3340fdac998e7e68b1df2e77260c13bbbe47bcba0ef63223bfd","abstract_canon_sha256":"d3f1dfc39bfa68c01bcc29527e947a836bee1e9fdde95b2285b808e58f30e741"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:33.513810Z","signature_b64":"rsz6Tlep4MAsWckOKokazX7fwO8KWu6ycg7T627HPGlFlgpgcSc4htTD7Mle2nDaUZDlYEELroEC3SuNYNkFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63eb749f9ad652b2159e1c88a34bea5b85df1128dc100524c69bcd1011c281d8","last_reissued_at":"2026-07-05T07:34:33.513345Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:33.513345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The permuton limit of random recursive separable permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Kelvin Rivera-Lopez, Valentin F\\'eray","submitted_at":"2023-06-07T09:29:08Z","abstract_excerpt":"We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the recursive separable permuton. We then prove several results on this new limiting object: a characterization of its distribution via a fixed-point equation, a combinatorial formula for its expected pattern densities, an explicit integral formula for its intensity measure, and lastly, we prove that its distribution is absolutely singular with respect to that of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.04278","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.04278/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":"2306.04278","created_at":"2026-07-05T07:34:33.513402+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.04278v2","created_at":"2026-07-05T07:34:33.513402+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.04278","created_at":"2026-07-05T07:34:33.513402+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPVXJH422ZJL","created_at":"2026-07-05T07:34:33.513402+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPVXJH422ZJLEFM6","created_at":"2026-07-05T07:34:33.513402+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPVXJH42","created_at":"2026-07-05T07:34:33.513402+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.19123","citing_title":"The longest increasing subsequence of Brownian separable permutons","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO","json":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO.json","graph_json":"https://pith.science/api/pith-number/MPVXJH422ZJLEFM6DSEKGS7KLO/graph.json","events_json":"https://pith.science/api/pith-number/MPVXJH422ZJLEFM6DSEKGS7KLO/events.json","paper":"https://pith.science/paper/MPVXJH42"},"agent_actions":{"view_html":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO","download_json":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO.json","view_paper":"https://pith.science/paper/MPVXJH42","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.04278&json=true","fetch_graph":"https://pith.science/api/pith-number/MPVXJH422ZJLEFM6DSEKGS7KLO/graph.json","fetch_events":"https://pith.science/api/pith-number/MPVXJH422ZJLEFM6DSEKGS7KLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO/action/storage_attestation","attest_author":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO/action/author_attestation","sign_citation":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO/action/citation_signature","submit_replication":"https://pith.science/pith/MPVXJH422ZJLEFM6DSEKGS7KLO/action/replication_record"}},"created_at":"2026-07-05T07:34:33.513402+00:00","updated_at":"2026-07-05T07:34:33.513402+00:00"}