{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3HBPSLVTB7IT6JOTQOZLTBG77N","short_pith_number":"pith:3HBPSLVT","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"},"canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","source":{"kind":"arxiv","id":"1507.03504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03504","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03504v1","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03504","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"3HBPSLVTB7IT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HBPSLVTB7IT6JOT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HBPSLVT","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3HBPSLVTB7IT6JOTQOZLTBG77N","target":"record","payload":{"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"},"canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","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"},"source_kind":"arxiv","source_id":"1507.03504","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zd0JiTEJZZtcTaJrv2k/mDToqfi0cEi/U49wsYR9J63Uu6l/mc4UxgsFApCweOk0XeG1VF9HMPq1T2B2RLgbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:25:04.490969Z"},"content_sha256":"1de7f757eb9f4a240f456b38bf9db3d480da8d83dd04785e763959c7f0a7a18c","schema_version":"1.0","event_id":"sha256:1de7f757eb9f4a240f456b38bf9db3d480da8d83dd04785e763959c7f0a7a18c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3HBPSLVTB7IT6JOTQOZLTBG77N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:36:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8x2yG5O7jgkC0Ux3Q4dvGYCRmuc5fUq66AcdtowN/sBYEk43Y1DWY+oWVUh2Jpeh1p9z0Cv4il8YIQmgXpxiDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T03:25:04.491616Z"},"content_sha256":"ce133aca6ea1ff4d26bc51a38e7181bb107276c97a3c360cc5f772655bad06af","schema_version":"1.0","event_id":"sha256:ce133aca6ea1ff4d26bc51a38e7181bb107276c97a3c360cc5f772655bad06af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/bundle.json","state_url":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T03:25:04Z","links":{"resolver":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N","bundle":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/bundle.json","state":"https://pith.science/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HBPSLVTB7IT6JOTQOZLTBG77N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3HBPSLVTB7IT6JOTQOZLTBG77N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b7a795cf0b89906abe60b8fa1d6f8ec3df87c9972d70f7b5a3a83e2c15efb49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-13T16:00:32Z","title_canon_sha256":"e9d425ee02ba016e0d1c55c4455b2c5b69076edb0dc1b262371c5fdfd7df6e61"},"schema_version":"1.0","source":{"id":"1507.03504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03504","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03504v1","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03504","created_at":"2026-05-18T01:36:58Z"},{"alias_kind":"pith_short_12","alias_value":"3HBPSLVTB7IT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3HBPSLVTB7IT6JOT","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3HBPSLVT","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:ce133aca6ea1ff4d26bc51a38e7181bb107276c97a3c360cc5f772655bad06af","target":"graph","created_at":"2026-05-18T01:36:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Jia Yuan Yu, Nicole Taheri, Robert Shorten","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-13T16:00:32Z","title":"A Fair Assignment of Drivers to Parking Lots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03504","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1de7f757eb9f4a240f456b38bf9db3d480da8d83dd04785e763959c7f0a7a18c","target":"record","created_at":"2026-05-18T01:36:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b7a795cf0b89906abe60b8fa1d6f8ec3df87c9972d70f7b5a3a83e2c15efb49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-07-13T16:00:32Z","title_canon_sha256":"e9d425ee02ba016e0d1c55c4455b2c5b69076edb0dc1b262371c5fdfd7df6e61"},"schema_version":"1.0","source":{"id":"1507.03504","kind":"arxiv","version":1}},"canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9c2f92eb30fd13f25d383b2b984dffb5a9121ef5da1a47cd56a2b22420d2186","first_computed_at":"2026-05-18T01:36:58.656623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:58.656623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TY/fr7WohcnL0vYGwxxT/7jlQkiGo7H+klOMA/hZyQvVC7ZqapiflRxm8bIFO0wB9mnek34qzka0lCvQYP6aBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:58.657178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1de7f757eb9f4a240f456b38bf9db3d480da8d83dd04785e763959c7f0a7a18c","sha256:ce133aca6ea1ff4d26bc51a38e7181bb107276c97a3c360cc5f772655bad06af"],"state_sha256":"c946ec8b32822d1729c72f7325a603c47334dcd7c5f4e9b80beb89a77ee979d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIKOVGWWADJII3QmeomRtey81MgEuLQRez0m8HAZPXveO7laf9UCCiBBK9WPegoeagHQTsCDpCmvjrrsT70ZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T03:25:04.494761Z","bundle_sha256":"3953a67f6e32dbe5645dbdea72b6687c71373054c886e9b1a0b15a2d88da7207"}}