{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7XEQZGV4M5XQ7EM5RIY3SHID6R","short_pith_number":"pith:7XEQZGV4","schema_version":"1.0","canonical_sha256":"fdc90c9abc676f0f919d8a31b91d03f478c624302fb05230dd82a15dc8c37c5b","source":{"kind":"arxiv","id":"1905.12010","version":1},"attestation_state":"computed","paper":{"title":"Parking Functions on Directed Graphs and Some Directed Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Yan, Westin King","submitted_at":"2019-05-28T18:16:05Z","abstract_excerpt":"Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of $n$ vertices (parking spots) arranged in a directed path. We generalize this notion to allow for more complicated \"parking lots\" and define parking functions on arbitrary directed graphs. We then consider a relationship proved by Lackner and Panholzer between parking functions on trees and \"mapping digraphs\" and we show that a similar relationship holds when edge orientations are reversed"},"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":"1905.12010","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-28T18:16:05Z","cross_cats_sorted":[],"title_canon_sha256":"1b1630d11b58f366049ff3e32075b5936e17f3d41d402c9b16b4b1df21465777","abstract_canon_sha256":"f1230e108dc78cb79129e5352e132fa6b34d16a46d35f5bcb92b028b7b43bf12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:49.218037Z","signature_b64":"CgmUReugsyry2y2LSeaD7SQI0my5w0GtgDZ1VlaVDE23fNHrjakOjM1RojsT1WMkDPOlkq0NFuVOY1bIJWcPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdc90c9abc676f0f919d8a31b91d03f478c624302fb05230dd82a15dc8c37c5b","last_reissued_at":"2026-05-17T23:44:49.217512Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:49.217512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking Functions on Directed Graphs and Some Directed Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine Yan, Westin King","submitted_at":"2019-05-28T18:16:05Z","abstract_excerpt":"Classical parking functions can be defined in terms of drivers with preferred parking spaces searching a linear parking lot for an open parking spot. We may consider this linear parking lot as a collection of $n$ vertices (parking spots) arranged in a directed path. We generalize this notion to allow for more complicated \"parking lots\" and define parking functions on arbitrary directed graphs. We then consider a relationship proved by Lackner and Panholzer between parking functions on trees and \"mapping digraphs\" and we show that a similar relationship holds when edge orientations are reversed"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12010","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":""},"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":"1905.12010","created_at":"2026-05-17T23:44:49.217599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12010v1","created_at":"2026-05-17T23:44:49.217599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12010","created_at":"2026-05-17T23:44:49.217599+00:00"},{"alias_kind":"pith_short_12","alias_value":"7XEQZGV4M5XQ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7XEQZGV4M5XQ7EM5","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7XEQZGV4","created_at":"2026-05-18T12:33:12.712433+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/7XEQZGV4M5XQ7EM5RIY3SHID6R","json":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R.json","graph_json":"https://pith.science/api/pith-number/7XEQZGV4M5XQ7EM5RIY3SHID6R/graph.json","events_json":"https://pith.science/api/pith-number/7XEQZGV4M5XQ7EM5RIY3SHID6R/events.json","paper":"https://pith.science/paper/7XEQZGV4"},"agent_actions":{"view_html":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R","download_json":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R.json","view_paper":"https://pith.science/paper/7XEQZGV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12010&json=true","fetch_graph":"https://pith.science/api/pith-number/7XEQZGV4M5XQ7EM5RIY3SHID6R/graph.json","fetch_events":"https://pith.science/api/pith-number/7XEQZGV4M5XQ7EM5RIY3SHID6R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R/action/storage_attestation","attest_author":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R/action/author_attestation","sign_citation":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R/action/citation_signature","submit_replication":"https://pith.science/pith/7XEQZGV4M5XQ7EM5RIY3SHID6R/action/replication_record"}},"created_at":"2026-05-17T23:44:49.217599+00:00","updated_at":"2026-05-17T23:44:49.217599+00:00"}