{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UKMXIJWAVFLINJTKQM7HYIQJZH","short_pith_number":"pith:UKMXIJWA","schema_version":"1.0","canonical_sha256":"a2997426c0a95686a66a833e7c2209c9cd14b28b762c2a23823a8eead6f6c8e0","source":{"kind":"arxiv","id":"2103.17180","version":1},"attestation_state":"computed","paper":{"title":"Parking functions: From combinatorics to probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mei Yin, Richard Kenyon","submitted_at":"2021-03-31T15:56:23Z","abstract_excerpt":"Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function. Classical parking functions correspond to the case $m=n$; we study here combinatorial and probabilistic aspects of this generalized case.\n  We construct a family of bijections between parking functions $\\text{PF}(m, n)$ with $m$ cars and $n$ spots and spanning forests $\\mathsc"},"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":"2103.17180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-03-31T15:56:23Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"936f3e16d3f9b53a01131678790cbcab3d8e58701bfa8b9a6180a2f648da3480","abstract_canon_sha256":"4792cd0b28489905fbbb017cac3b660203fd1e073aa34aa97c57ac4c39d47037"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:28:13.485196Z","signature_b64":"GeuNofD3CXUE2Xxe4cyuNNgBNJ1V3ptx3UCCMPm9LE7kKpxmMvDW1y9smIf8wWwfYoy/Vf03eBSmdJIHZOqDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2997426c0a95686a66a833e7c2209c9cd14b28b762c2a23823a8eead6f6c8e0","last_reissued_at":"2026-07-05T02:28:13.484805Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:28:13.484805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking functions: From combinatorics to probability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mei Yin, Richard Kenyon","submitted_at":"2021-03-31T15:56:23Z","abstract_excerpt":"Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spots. In order, each driver goes to their chosen spot and parks there if possible, and otherwise takes the next available spot if it exists. If all drivers park successfully, the sequence of choices is called a parking function. Classical parking functions correspond to the case $m=n$; we study here combinatorial and probabilistic aspects of this generalized case.\n  We construct a family of bijections between parking functions $\\text{PF}(m, n)$ with $m$ cars and $n$ spots and spanning forests $\\mathsc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.17180","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/2103.17180/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":"2103.17180","created_at":"2026-07-05T02:28:13.484862+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.17180v1","created_at":"2026-07-05T02:28:13.484862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.17180","created_at":"2026-07-05T02:28:13.484862+00:00"},{"alias_kind":"pith_short_12","alias_value":"UKMXIJWAVFLI","created_at":"2026-07-05T02:28:13.484862+00:00"},{"alias_kind":"pith_short_16","alias_value":"UKMXIJWAVFLINJTK","created_at":"2026-07-05T02:28:13.484862+00:00"},{"alias_kind":"pith_short_8","alias_value":"UKMXIJWA","created_at":"2026-07-05T02:28:13.484862+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/UKMXIJWAVFLINJTKQM7HYIQJZH","json":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH.json","graph_json":"https://pith.science/api/pith-number/UKMXIJWAVFLINJTKQM7HYIQJZH/graph.json","events_json":"https://pith.science/api/pith-number/UKMXIJWAVFLINJTKQM7HYIQJZH/events.json","paper":"https://pith.science/paper/UKMXIJWA"},"agent_actions":{"view_html":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH","download_json":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH.json","view_paper":"https://pith.science/paper/UKMXIJWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.17180&json=true","fetch_graph":"https://pith.science/api/pith-number/UKMXIJWAVFLINJTKQM7HYIQJZH/graph.json","fetch_events":"https://pith.science/api/pith-number/UKMXIJWAVFLINJTKQM7HYIQJZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH/action/storage_attestation","attest_author":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH/action/author_attestation","sign_citation":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH/action/citation_signature","submit_replication":"https://pith.science/pith/UKMXIJWAVFLINJTKQM7HYIQJZH/action/replication_record"}},"created_at":"2026-07-05T02:28:13.484862+00:00","updated_at":"2026-07-05T02:28:13.484862+00:00"}