{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HLQH3QLWGE3UJ7V7SAPBWW6BDX","short_pith_number":"pith:HLQH3QLW","schema_version":"1.0","canonical_sha256":"3ae07dc176313744febf901e1b5bc11de606887a4f727a2f9f0eb4e5d0c3d541","source":{"kind":"arxiv","id":"2412.07258","version":2},"attestation_state":"computed","paper":{"title":"Permuton limit of a generalization of the Mallows and $k$-card-minimum models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Bal\\'azs R\\'ath, Joanna Jasi\\'nska","submitted_at":"2024-12-10T07:39:33Z","abstract_excerpt":"We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce the law of large numbers for pattern densities. Moreover, we prove a universality result about the band structure of the limiting permuton, confirming a conjecture of Travers about the $k$-card minimum model. More specifically, we show that if a certain model parameter goes to infinity then the appropriately scaled restriction of the permuton measure to a l"},"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":"2412.07258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2024-12-10T07:39:33Z","cross_cats_sorted":[],"title_canon_sha256":"dcc3feb23226939bde1f24268ae5bb3dbaa59b55075437c11c93370f4de3092b","abstract_canon_sha256":"f057830e2e5960cdc6e6480fec4e944488565988986e85c707d3f7d93e08d44d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:32.130051Z","signature_b64":"q92vi7JcFcxMMQSi4yBHUZ2PdW8HfZDd9gYrTq0tUYavjc2QcvUYK/QW5ENqhxJnUfVzgqptDS5TWZe3IhIwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ae07dc176313744febf901e1b5bc11de606887a4f727a2f9f0eb4e5d0c3d541","last_reissued_at":"2026-07-05T10:19:32.129572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:32.129572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Permuton limit of a generalization of the Mallows and $k$-card-minimum models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Bal\\'azs R\\'ath, Joanna Jasi\\'nska","submitted_at":"2024-12-10T07:39:33Z","abstract_excerpt":"We introduce and study a new random permutation model that generalizes the $k$-card minimum model defined by Travers and the Mallows model. We calculate the permuton limit of such a sequence of random permutations. As a corollary, we deduce the law of large numbers for pattern densities. Moreover, we prove a universality result about the band structure of the limiting permuton, confirming a conjecture of Travers about the $k$-card minimum model. More specifically, we show that if a certain model parameter goes to infinity then the appropriately scaled restriction of the permuton measure to a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.07258","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/2412.07258/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":"2412.07258","created_at":"2026-07-05T10:19:32.129637+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.07258v2","created_at":"2026-07-05T10:19:32.129637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.07258","created_at":"2026-07-05T10:19:32.129637+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLQH3QLWGE3U","created_at":"2026-07-05T10:19:32.129637+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLQH3QLWGE3UJ7V7","created_at":"2026-07-05T10:19:32.129637+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLQH3QLW","created_at":"2026-07-05T10:19:32.129637+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29376","citing_title":"SAD-GS: Learning Reliable 3D Semantic Gaussian Fields via Dynamic Geo-Semantic Anchoring","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX","json":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX.json","graph_json":"https://pith.science/api/pith-number/HLQH3QLWGE3UJ7V7SAPBWW6BDX/graph.json","events_json":"https://pith.science/api/pith-number/HLQH3QLWGE3UJ7V7SAPBWW6BDX/events.json","paper":"https://pith.science/paper/HLQH3QLW"},"agent_actions":{"view_html":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX","download_json":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX.json","view_paper":"https://pith.science/paper/HLQH3QLW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.07258&json=true","fetch_graph":"https://pith.science/api/pith-number/HLQH3QLWGE3UJ7V7SAPBWW6BDX/graph.json","fetch_events":"https://pith.science/api/pith-number/HLQH3QLWGE3UJ7V7SAPBWW6BDX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX/action/storage_attestation","attest_author":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX/action/author_attestation","sign_citation":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX/action/citation_signature","submit_replication":"https://pith.science/pith/HLQH3QLWGE3UJ7V7SAPBWW6BDX/action/replication_record"}},"created_at":"2026-07-05T10:19:32.129637+00:00","updated_at":"2026-07-05T10:19:32.129637+00:00"}