{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DH6WFY2V4YNFDJW4D7XYYWFRNR","short_pith_number":"pith:DH6WFY2V","schema_version":"1.0","canonical_sha256":"19fd62e355e61a51a6dc1fef8c58b16c6a836d5db4f2be2c2a3f3dd52a95a25a","source":{"kind":"arxiv","id":"1504.04972","version":1},"attestation_state":"computed","paper":{"title":"Parking functions for trees and mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alois Panholzer, Marie-Louise Bruner","submitted_at":"2015-04-20T08:51:37Z","abstract_excerpt":"We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \\to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has a preferred parking space and starting with this node he follows the edges in the graph until he either finds a free parking space or all reachable parking spaces are occupied. If all drivers are successful we speak about a parking function for the tree or mapping. We transfer well-known characterizations of parking functions to trees and mappings. Especial"},"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":"1504.04972","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-04-20T08:51:37Z","cross_cats_sorted":[],"title_canon_sha256":"f5f04cf94536edf025a8456b6d6015617ff9612bed7d2af537b3ca72e74b286f","abstract_canon_sha256":"083994d05fad4fa94fc7c4d7a4369a563b05294b402204b47b49b0f5476d58f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:23.072235Z","signature_b64":"wZCqRAtmVB0hif7APj1zyuDE346JyyE+JsS4nuUTXz9ceI2DeVsvDds5GwHfaAHyaqjApUZ80psSQ3LQjOjjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19fd62e355e61a51a6dc1fef8c58b16c6a836d5db4f2be2c2a3f3dd52a95a25a","last_reissued_at":"2026-05-18T02:18:23.071527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:23.071527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking functions for trees and mappings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alois Panholzer, Marie-Louise Bruner","submitted_at":"2015-04-20T08:51:37Z","abstract_excerpt":"We apply the concept of parking functions to rooted labelled trees and functional digraphs of mappings (i.e., functions $f : [n] \\to [n]$) by considering the nodes as parking spaces and the directed edges as one-way streets: Each driver has a preferred parking space and starting with this node he follows the edges in the graph until he either finds a free parking space or all reachable parking spaces are occupied. If all drivers are successful we speak about a parking function for the tree or mapping. We transfer well-known characterizations of parking functions to trees and mappings. Especial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04972","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":"1504.04972","created_at":"2026-05-18T02:18:23.071633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04972v1","created_at":"2026-05-18T02:18:23.071633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04972","created_at":"2026-05-18T02:18:23.071633+00:00"},{"alias_kind":"pith_short_12","alias_value":"DH6WFY2V4YNF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DH6WFY2V4YNFDJW4","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DH6WFY2V","created_at":"2026-05-18T12:29:17.054201+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/DH6WFY2V4YNFDJW4D7XYYWFRNR","json":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR.json","graph_json":"https://pith.science/api/pith-number/DH6WFY2V4YNFDJW4D7XYYWFRNR/graph.json","events_json":"https://pith.science/api/pith-number/DH6WFY2V4YNFDJW4D7XYYWFRNR/events.json","paper":"https://pith.science/paper/DH6WFY2V"},"agent_actions":{"view_html":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR","download_json":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR.json","view_paper":"https://pith.science/paper/DH6WFY2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04972&json=true","fetch_graph":"https://pith.science/api/pith-number/DH6WFY2V4YNFDJW4D7XYYWFRNR/graph.json","fetch_events":"https://pith.science/api/pith-number/DH6WFY2V4YNFDJW4D7XYYWFRNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR/action/storage_attestation","attest_author":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR/action/author_attestation","sign_citation":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR/action/citation_signature","submit_replication":"https://pith.science/pith/DH6WFY2V4YNFDJW4D7XYYWFRNR/action/replication_record"}},"created_at":"2026-05-18T02:18:23.071633+00:00","updated_at":"2026-05-18T02:18:23.071633+00:00"}