{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3HBPSLVTB7IT6JOTQOZLTBG77N","short_pith_number":"pith:3HBPSLVT","schema_version":"1.0","canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","source":{"kind":"arxiv","id":"1507.03504","version":1},"attestation_state":"computed","paper":{"title":"A Fair Assignment of Drivers to Parking Lots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jia Yuan Yu, Nicole Taheri, Robert Shorten","submitted_at":"2015-07-13T16:00:32Z","abstract_excerpt":"Searching for a parking spot can waste time and gasoline. This waste can be reduced by assigning drivers to parking lots based on their destination and arrival time. In such a system, drivers could request a parking spot in advance and be alerted (e.g., via their phone or vehicle) of their assignment to a specific parking lot or available spot. In this paper, a parking assignment system is described to allocate parking spaces in a fair and equitable manner. Heuristics are developed to solve the underlying large scale optimization problem. The efficacy of the system is demonstrated by applying "},"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":"1507.03504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-13T16:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"e9d425ee02ba016e0d1c55c4455b2c5b69076edb0dc1b262371c5fdfd7df6e61","abstract_canon_sha256":"6b7a795cf0b89906abe60b8fa1d6f8ec3df87c9972d70f7b5a3a83e2c15efb49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:58.657178Z","signature_b64":"TY/fr7WohcnL0vYGwxxT/7jlQkiGo7H+klOMA/hZyQvVC7ZqapiflRxm8bIFO0wB9mnek34qzka0lCvQYP6aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","last_reissued_at":"2026-05-18T01:36:58.656623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:58.656623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fair Assignment of Drivers to Parking Lots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jia Yuan Yu, Nicole Taheri, Robert Shorten","submitted_at":"2015-07-13T16:00:32Z","abstract_excerpt":"Searching for a parking spot can waste time and gasoline. This waste can be reduced by assigning drivers to parking lots based on their destination and arrival time. In such a system, drivers could request a parking spot in advance and be alerted (e.g., via their phone or vehicle) of their assignment to a specific parking lot or available spot. In this paper, a parking assignment system is described to allocate parking spaces in a fair and equitable manner. Heuristics are developed to solve the underlying large scale optimization problem. The efficacy of the system is demonstrated by applying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03504","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":"1507.03504","created_at":"2026-05-18T01:36:58.656721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03504v1","created_at":"2026-05-18T01:36:58.656721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03504","created_at":"2026-05-18T01:36:58.656721+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HBPSLVTB7IT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HBPSLVTB7IT6JOT","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HBPSLVT","created_at":"2026-05-18T12:29:02.477457+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/3HBPSLVTB7IT6JOTQOZLTBG77N","json":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N.json","graph_json":"https://pith.science/api/pith-number/3HBPSLVTB7IT6JOTQOZLTBG77N/graph.json","events_json":"https://pith.science/api/pith-number/3HBPSLVTB7IT6JOTQOZLTBG77N/events.json","paper":"https://pith.science/paper/3HBPSLVT"},"agent_actions":{"view_html":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N","download_json":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N.json","view_paper":"https://pith.science/paper/3HBPSLVT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03504&json=true","fetch_graph":"https://pith.science/api/pith-number/3HBPSLVTB7IT6JOTQOZLTBG77N/graph.json","fetch_events":"https://pith.science/api/pith-number/3HBPSLVTB7IT6JOTQOZLTBG77N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/action/storage_attestation","attest_author":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/action/author_attestation","sign_citation":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/action/citation_signature","submit_replication":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/action/replication_record"}},"created_at":"2026-05-18T01:36:58.656721+00:00","updated_at":"2026-05-18T01:36:58.656721+00:00"}