{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ANTKOJRYZE7FG2CPOR54E2ZHOO","short_pith_number":"pith:ANTKOJRY","schema_version":"1.0","canonical_sha256":"0366a72638c93e53684f747bc26b2773b2ea09b1a440b9b08fc8aee0782988c0","source":{"kind":"arxiv","id":"1804.01616","version":1},"attestation_state":"computed","paper":{"title":"Prime Parking Functions on Rooted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine H. Yan, Westin King","submitted_at":"2018-04-04T22:09:14Z","abstract_excerpt":"For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the first unoccupied spot along the directed path to the root. If all $n$ drivers park, the sequence of spot preferences is called a parking function. We consider the sequences, called \\emph{prime} parking functions, for which each driver parks and each edge in the tree is traversed by some driver after failing to park at her preferred spot. We prove that the tota"},"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":"1804.01616","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-04T22:09:14Z","cross_cats_sorted":[],"title_canon_sha256":"a0eb815d5013dd7e959308560f104140825df993b153e311d4b4322f14dac7ff","abstract_canon_sha256":"ba71c9ac636f453f817288c863beec57c0ccf8934e194e16201457939d0cc442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:10.704050Z","signature_b64":"kipcw4y1jR4AA3i45M5FJm7EDsJaI1m4TXWbKLzRnPQ3G4/6DAE/cUJcaxGbF7ikvK7uSW/cymjkLyqXRhTcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0366a72638c93e53684f747bc26b2773b2ea09b1a440b9b08fc8aee0782988c0","last_reissued_at":"2026-05-18T00:19:10.703547Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:10.703547Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Prime Parking Functions on Rooted Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Catherine H. Yan, Westin King","submitted_at":"2018-04-04T22:09:14Z","abstract_excerpt":"For a labeled, rooted tree with edges oriented towards the root, we consider the vertices as parking spots and the edge orientation as a one-way street. Each driver, starting with her preferred parking spot, searches for and parks in the first unoccupied spot along the directed path to the root. If all $n$ drivers park, the sequence of spot preferences is called a parking function. We consider the sequences, called \\emph{prime} parking functions, for which each driver parks and each edge in the tree is traversed by some driver after failing to park at her preferred spot. We prove that the tota"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01616","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":"1804.01616","created_at":"2026-05-18T00:19:10.703619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01616v1","created_at":"2026-05-18T00:19:10.703619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01616","created_at":"2026-05-18T00:19:10.703619+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANTKOJRYZE7F","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANTKOJRYZE7FG2CP","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANTKOJRY","created_at":"2026-05-18T12:32:13.499390+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/ANTKOJRYZE7FG2CPOR54E2ZHOO","json":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO.json","graph_json":"https://pith.science/api/pith-number/ANTKOJRYZE7FG2CPOR54E2ZHOO/graph.json","events_json":"https://pith.science/api/pith-number/ANTKOJRYZE7FG2CPOR54E2ZHOO/events.json","paper":"https://pith.science/paper/ANTKOJRY"},"agent_actions":{"view_html":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO","download_json":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO.json","view_paper":"https://pith.science/paper/ANTKOJRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01616&json=true","fetch_graph":"https://pith.science/api/pith-number/ANTKOJRYZE7FG2CPOR54E2ZHOO/graph.json","fetch_events":"https://pith.science/api/pith-number/ANTKOJRYZE7FG2CPOR54E2ZHOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO/action/storage_attestation","attest_author":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO/action/author_attestation","sign_citation":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO/action/citation_signature","submit_replication":"https://pith.science/pith/ANTKOJRYZE7FG2CPOR54E2ZHOO/action/replication_record"}},"created_at":"2026-05-18T00:19:10.703619+00:00","updated_at":"2026-05-18T00:19:10.703619+00:00"}