{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UNK2PWDAVKLCQHW5JY7UIJCD3A","short_pith_number":"pith:UNK2PWDA","schema_version":"1.0","canonical_sha256":"a355a7d860aa96281edd4e3f442443d80ef0e14614012756af29db6818a0c1c4","source":{"kind":"arxiv","id":"1903.07522","version":4},"attestation_state":"computed","paper":{"title":"Scaling limits of permutation classes with a finite specification: a dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Adeline Pierrot, Fr\\'ed\\'erique Bassino, Lucas Gerin, Mathilde Bouvel, Micka\\\"el Maazoun, Valentin F\\'eray","submitted_at":"2019-03-18T15:53:54Z","abstract_excerpt":"We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple permutations. Our goal is to study their limiting behavior in the sense of permutons.\n  The limit depends on the structure of the specification restricted to families with the largest growth rate. When it is strongly connected, two cases occur. If the associated system of equations is linear, the limiting permuton is a deterministic $X$-shape. Otherwise, the limiti"},"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":"1903.07522","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-03-18T15:53:54Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3d497ec6539ef8630203c8f917b55745e83544939b905bdcaac9d9557c8a3b67","abstract_canon_sha256":"db667cfbb57e189cf0636dcb223a9029732d10d11b0ae49547ba447d1498cba2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:15:35.908161Z","signature_b64":"gUmEU3lfBw/wGJA3BJSBjy/U2f6Qtk25ywzHhFUM/CmyN300d5XwLULO5GB0UjjIv6Gzrpp/6Oz2YCRT82quBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a355a7d860aa96281edd4e3f442443d80ef0e14614012756af29db6818a0c1c4","last_reissued_at":"2026-07-05T00:15:35.907658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:15:35.907658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling limits of permutation classes with a finite specification: a dichotomy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Adeline Pierrot, Fr\\'ed\\'erique Bassino, Lucas Gerin, Mathilde Bouvel, Micka\\\"el Maazoun, Valentin F\\'eray","submitted_at":"2019-03-18T15:53:54Z","abstract_excerpt":"We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple permutations. Our goal is to study their limiting behavior in the sense of permutons.\n  The limit depends on the structure of the specification restricted to families with the largest growth rate. When it is strongly connected, two cases occur. If the associated system of equations is linear, the limiting permuton is a deterministic $X$-shape. Otherwise, the limiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07522","kind":"arxiv","version":4},"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/1903.07522/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":"1903.07522","created_at":"2026-07-05T00:15:35.907732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07522v4","created_at":"2026-07-05T00:15:35.907732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07522","created_at":"2026-07-05T00:15:35.907732+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNK2PWDAVKLC","created_at":"2026-07-05T00:15:35.907732+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNK2PWDAVKLCQHW5","created_at":"2026-07-05T00:15:35.907732+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNK2PWDA","created_at":"2026-07-05T00:15:35.907732+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1906.10355","citing_title":"Graphon convergence of random cographs","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A","json":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A.json","graph_json":"https://pith.science/api/pith-number/UNK2PWDAVKLCQHW5JY7UIJCD3A/graph.json","events_json":"https://pith.science/api/pith-number/UNK2PWDAVKLCQHW5JY7UIJCD3A/events.json","paper":"https://pith.science/paper/UNK2PWDA"},"agent_actions":{"view_html":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A","download_json":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A.json","view_paper":"https://pith.science/paper/UNK2PWDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07522&json=true","fetch_graph":"https://pith.science/api/pith-number/UNK2PWDAVKLCQHW5JY7UIJCD3A/graph.json","fetch_events":"https://pith.science/api/pith-number/UNK2PWDAVKLCQHW5JY7UIJCD3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A/action/storage_attestation","attest_author":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A/action/author_attestation","sign_citation":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A/action/citation_signature","submit_replication":"https://pith.science/pith/UNK2PWDAVKLCQHW5JY7UIJCD3A/action/replication_record"}},"created_at":"2026-07-05T00:15:35.907732+00:00","updated_at":"2026-07-05T00:15:35.907732+00:00"}