{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:45LFEC5REMUXMBE4GFNMEVI4VU","short_pith_number":"pith:45LFEC5R","schema_version":"1.0","canonical_sha256":"e756520bb1232976049c315ac2551cad1e5d0f98b66560720cb5b8fb0bca4042","source":{"kind":"arxiv","id":"1610.08786","version":2},"attestation_state":"computed","paper":{"title":"Parking on a random tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christina Goldschmidt, Micha{\\l} Przykucki","submitted_at":"2016-10-27T14:07:39Z","abstract_excerpt":"Consider a uniform random rooted tree on vertices labelled by $[n] = \\{1,2,\\ldots,n\\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \\le n$ of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path oriented towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Consider $m =[\\alpha n]$ and let $A_{n,\\alpha}$ denote the event that a"},"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":"1610.08786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-10-27T14:07:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9df00951426b82190f72b42997986a5fb3d8d51db7d94a8c2ada6818800feb0f","abstract_canon_sha256":"9809a6ac9928617e6f80be477262b4e03dce432964f0aa572f0ec33e0722b9d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:08.639193Z","signature_b64":"a+YPEAkJVBQZzfXuHkvAKBoD8Ez7k++4F7G+eJ5tM5c5B+tVCfsihgF0WdyxgsJqEK/X91bAVT0Nasww8ns3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e756520bb1232976049c315ac2551cad1e5d0f98b66560720cb5b8fb0bca4042","last_reissued_at":"2026-05-17T23:52:08.638816Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:08.638816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking on a random tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christina Goldschmidt, Micha{\\l} Przykucki","submitted_at":"2016-10-27T14:07:39Z","abstract_excerpt":"Consider a uniform random rooted tree on vertices labelled by $[n] = \\{1,2,\\ldots,n\\}$, with edges directed towards the root. We imagine that each node of the tree has space for a single car to park. A number $m \\le n$ of cars arrive one by one, each at a node chosen independently and uniformly at random. If a car arrives at a space which is already occupied, it follows the unique path oriented towards the root until it encounters an empty space, in which case it parks there; if there is no empty space, it leaves the tree. Consider $m =[\\alpha n]$ and let $A_{n,\\alpha}$ denote the event that a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08786","kind":"arxiv","version":2},"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":"1610.08786","created_at":"2026-05-17T23:52:08.638873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.08786v2","created_at":"2026-05-17T23:52:08.638873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08786","created_at":"2026-05-17T23:52:08.638873+00:00"},{"alias_kind":"pith_short_12","alias_value":"45LFEC5REMUX","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"45LFEC5REMUXMBE4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"45LFEC5R","created_at":"2026-05-18T12:29:58.707656+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/45LFEC5REMUXMBE4GFNMEVI4VU","json":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU.json","graph_json":"https://pith.science/api/pith-number/45LFEC5REMUXMBE4GFNMEVI4VU/graph.json","events_json":"https://pith.science/api/pith-number/45LFEC5REMUXMBE4GFNMEVI4VU/events.json","paper":"https://pith.science/paper/45LFEC5R"},"agent_actions":{"view_html":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU","download_json":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU.json","view_paper":"https://pith.science/paper/45LFEC5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.08786&json=true","fetch_graph":"https://pith.science/api/pith-number/45LFEC5REMUXMBE4GFNMEVI4VU/graph.json","fetch_events":"https://pith.science/api/pith-number/45LFEC5REMUXMBE4GFNMEVI4VU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU/action/storage_attestation","attest_author":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU/action/author_attestation","sign_citation":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU/action/citation_signature","submit_replication":"https://pith.science/pith/45LFEC5REMUXMBE4GFNMEVI4VU/action/replication_record"}},"created_at":"2026-05-17T23:52:08.638873+00:00","updated_at":"2026-05-17T23:52:08.638873+00:00"}