{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HRKILXXNJJSUVBYZTNMYMZ6HLR","short_pith_number":"pith:HRKILXXN","schema_version":"1.0","canonical_sha256":"3c5485deed4a654a87199b598667c75c6a71d0e305eeb25fa1bb95c49ef395cd","source":{"kind":"arxiv","id":"1710.10529","version":3},"attestation_state":"computed","paper":{"title":"Parking on transitive unimodular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Hanbaek Lyu, Janko Gravner, Matthew Junge, Michael Damron","submitted_at":"2017-10-28T21:23:20Z","abstract_excerpt":"Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot it parks there. Other cars can still drive over the site, but cannot park there. For a large class of transitive and unimodular graphs, we show that the root is almost surely visited infinitely many times when $p \\geq 1/2$, and only finitely many times otherwise."},"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":"1710.10529","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2017-10-28T21:23:20Z","cross_cats_sorted":[],"title_canon_sha256":"840cf2a3e71a29908453b90a720c4e640da167ef5835e2636a14af770c8fb4ab","abstract_canon_sha256":"ecb66ff393e3236c130dfb7ed95c4514eca036c866f3e5ad56cde625254326a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:25.418397Z","signature_b64":"ncaFOY0kGiQLab9/6nfcKLG/nzJzm1qFjVnxCTA0+XbyPLhP8x1T2+4za7oGDRAdIJ4+w3y7CZKKyblt0RIKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c5485deed4a654a87199b598667c75c6a71d0e305eeb25fa1bb95c49ef395cd","last_reissued_at":"2026-05-18T00:06:25.417744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:25.417744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parking on transitive unimodular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"David Sivakoff, Hanbaek Lyu, Janko Gravner, Matthew Junge, Michael Damron","submitted_at":"2017-10-28T21:23:20Z","abstract_excerpt":"Place a car independently with probability $p$ at each site of a graph. Each initially vacant site is a parking spot that can fit one car. Cars simultaneously perform independent random walks. When a car encounters an available parking spot it parks there. Other cars can still drive over the site, but cannot park there. For a large class of transitive and unimodular graphs, we show that the root is almost surely visited infinitely many times when $p \\geq 1/2$, and only finitely many times otherwise."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10529","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":""},"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":"1710.10529","created_at":"2026-05-18T00:06:25.417870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10529v3","created_at":"2026-05-18T00:06:25.417870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10529","created_at":"2026-05-18T00:06:25.417870+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRKILXXNJJSU","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRKILXXNJJSUVBYZ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRKILXXN","created_at":"2026-05-18T12:31:18.294218+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/HRKILXXNJJSUVBYZTNMYMZ6HLR","json":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR.json","graph_json":"https://pith.science/api/pith-number/HRKILXXNJJSUVBYZTNMYMZ6HLR/graph.json","events_json":"https://pith.science/api/pith-number/HRKILXXNJJSUVBYZTNMYMZ6HLR/events.json","paper":"https://pith.science/paper/HRKILXXN"},"agent_actions":{"view_html":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR","download_json":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR.json","view_paper":"https://pith.science/paper/HRKILXXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10529&json=true","fetch_graph":"https://pith.science/api/pith-number/HRKILXXNJJSUVBYZTNMYMZ6HLR/graph.json","fetch_events":"https://pith.science/api/pith-number/HRKILXXNJJSUVBYZTNMYMZ6HLR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR/action/storage_attestation","attest_author":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR/action/author_attestation","sign_citation":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR/action/citation_signature","submit_replication":"https://pith.science/pith/HRKILXXNJJSUVBYZTNMYMZ6HLR/action/replication_record"}},"created_at":"2026-05-18T00:06:25.417870+00:00","updated_at":"2026-05-18T00:06:25.417870+00:00"}