{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N4MMNTVDDAWH5P2SYWGWN7O6KN","short_pith_number":"pith:N4MMNTVD","schema_version":"1.0","canonical_sha256":"6f18c6cea3182c7ebf52c58d66fdde535f4f2a86cd2e7e1e5f96986b65924756","source":{"kind":"arxiv","id":"2107.01767","version":3},"attestation_state":"computed","paper":{"title":"Parking functions: Interdisciplinary connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mei Yin","submitted_at":"2021-07-05T03:09:28Z","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$.\n  We investigate various probabilistic properties of a uniform parking function. Through a combinatorial construction termed a parking function multi-shuffle, we give a formula for the law of multiple coordinates in 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":"2107.01767","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-05T03:09:28Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"429fe4284b7bd9e38df331208a7c451c27f9ba833471ac11ded1475eadc95ff1","abstract_canon_sha256":"f936a1175ea8b84a9a5ddece4350c31bcbef32d146a3db9be46ef0c6c1b92ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:20:02.876518Z","signature_b64":"req8qkcJw3VoiLWMK8xXqz4WrWvLb/3pBGMk/imtGej2Lfb+BYwM/ME2rmQKX0otv8MmbhAyHr3dnHxb3SnZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f18c6cea3182c7ebf52c58d66fdde535f4f2a86cd2e7e1e5f96986b65924756","last_reissued_at":"2026-07-05T03:20:02.876117Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:20:02.876117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking functions: Interdisciplinary connections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Mei Yin","submitted_at":"2021-07-05T03:09:28Z","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$.\n  We investigate various probabilistic properties of a uniform parking function. Through a combinatorial construction termed a parking function multi-shuffle, we give a formula for the law of multiple coordinates in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.01767","kind":"arxiv","version":3},"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/2107.01767/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":"2107.01767","created_at":"2026-07-05T03:20:02.876173+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.01767v3","created_at":"2026-07-05T03:20:02.876173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.01767","created_at":"2026-07-05T03:20:02.876173+00:00"},{"alias_kind":"pith_short_12","alias_value":"N4MMNTVDDAWH","created_at":"2026-07-05T03:20:02.876173+00:00"},{"alias_kind":"pith_short_16","alias_value":"N4MMNTVDDAWH5P2S","created_at":"2026-07-05T03:20:02.876173+00:00"},{"alias_kind":"pith_short_8","alias_value":"N4MMNTVD","created_at":"2026-07-05T03:20:02.876173+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/N4MMNTVDDAWH5P2SYWGWN7O6KN","json":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN.json","graph_json":"https://pith.science/api/pith-number/N4MMNTVDDAWH5P2SYWGWN7O6KN/graph.json","events_json":"https://pith.science/api/pith-number/N4MMNTVDDAWH5P2SYWGWN7O6KN/events.json","paper":"https://pith.science/paper/N4MMNTVD"},"agent_actions":{"view_html":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN","download_json":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN.json","view_paper":"https://pith.science/paper/N4MMNTVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.01767&json=true","fetch_graph":"https://pith.science/api/pith-number/N4MMNTVDDAWH5P2SYWGWN7O6KN/graph.json","fetch_events":"https://pith.science/api/pith-number/N4MMNTVDDAWH5P2SYWGWN7O6KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN/action/storage_attestation","attest_author":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN/action/author_attestation","sign_citation":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN/action/citation_signature","submit_replication":"https://pith.science/pith/N4MMNTVDDAWH5P2SYWGWN7O6KN/action/replication_record"}},"created_at":"2026-07-05T03:20:02.876173+00:00","updated_at":"2026-07-05T03:20:02.876173+00:00"}