{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:IWRTJDWWVPN6JTW6AZRREDAJI6","short_pith_number":"pith:IWRTJDWW","canonical_record":{"source":{"id":"1401.6210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-23T23:00:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aa984210615a7661238083e2932f388bfa83c1418e2a95c5ba1ec3d73f52d8b3","abstract_canon_sha256":"bb63a604fb5c7fe8a31344892b8be9e470f6e89061905381a08b3c8274d181b1"},"schema_version":"1.0"},"canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","source":{"kind":"arxiv","id":"1401.6210","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6210","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6210v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6210","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"IWRTJDWWVPN6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWRTJDWWVPN6JTW6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWRTJDWW","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:IWRTJDWWVPN6JTW6AZRREDAJI6","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6210","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-23T23:00:56Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"aa984210615a7661238083e2932f388bfa83c1418e2a95c5ba1ec3d73f52d8b3","abstract_canon_sha256":"bb63a604fb5c7fe8a31344892b8be9e470f6e89061905381a08b3c8274d181b1"},"schema_version":"1.0"},"canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:12.868122Z","signature_b64":"x+rq69kP3pFOq82wEbYW12r/4PpJPBLsBt6aBxCK3urZcTSiec6dW58NKPG4WF54f0rBViQ0OFtJ3rYKOZOUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","last_reissued_at":"2026-05-18T03:01:12.867308Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:12.867308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6210","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+lqmddg3vKq5rq11mQld3Hpfoy3mqqonkwwiky+BCxiNouRbm27V3KlSBD85v0jl4sgaV+mZLrV+FkxQyBy1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:33:40.355479Z"},"content_sha256":"85cf3348854535e88cfd6e86bf0d1c6a9351290b80a3059ac0e37faf306c2e15","schema_version":"1.0","event_id":"sha256:85cf3348854535e88cfd6e86bf0d1c6a9351290b80a3059ac0e37faf306c2e15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:IWRTJDWWVPN6JTW6AZRREDAJI6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Semi Distributed Approach for Min-Max Fair Car-Parking Slot Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Carlo Fischione, Elisabetta Alfonsetti, Pradeep Chathuranga Weeraddana","submitted_at":"2014-01-23T23:00:56Z","abstract_excerpt":"Designing efficient car parking mechanisms that can be potentially integrated into future intelligent transportation systems is of crucial importance. Usually, the related design problems are combinatorial and the worst-case complexity of optimal solution approaches grows exponentially with the problem sizes. Therefore, such optimal approaches are not scalable and practically undesirable. As a result, almost all existing methods for parking slot assignment are simple and greedy approaches, where each car is assigned a free parking slot, which is closer to its destination. Moreover, no emphasis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6210","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-18T03:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ufYNWTYZw5E7nNsNsXcuO/QaLr53QiaL/Z00AlklI51fdwqtoyY69OgZ/xn68ZkzIn0yW/UZpZWR2820vBkaCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T17:33:40.356120Z"},"content_sha256":"955b01d9023cf088fd8361728ebb165d0bed2475168dc213c7a37217614044e8","schema_version":"1.0","event_id":"sha256:955b01d9023cf088fd8361728ebb165d0bed2475168dc213c7a37217614044e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/bundle.json","state_url":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/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-05-27T17:33:40Z","links":{"resolver":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6","bundle":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/bundle.json","state":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:IWRTJDWWVPN6JTW6AZRREDAJI6","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":"bb63a604fb5c7fe8a31344892b8be9e470f6e89061905381a08b3c8274d181b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-23T23:00:56Z","title_canon_sha256":"aa984210615a7661238083e2932f388bfa83c1418e2a95c5ba1ec3d73f52d8b3"},"schema_version":"1.0","source":{"id":"1401.6210","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6210","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6210v1","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6210","created_at":"2026-05-18T03:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"IWRTJDWWVPN6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"IWRTJDWWVPN6JTW6","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"IWRTJDWW","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:955b01d9023cf088fd8361728ebb165d0bed2475168dc213c7a37217614044e8","target":"graph","created_at":"2026-05-18T03:01:12Z","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":"Designing efficient car parking mechanisms that can be potentially integrated into future intelligent transportation systems is of crucial importance. Usually, the related design problems are combinatorial and the worst-case complexity of optimal solution approaches grows exponentially with the problem sizes. Therefore, such optimal approaches are not scalable and practically undesirable. As a result, almost all existing methods for parking slot assignment are simple and greedy approaches, where each car is assigned a free parking slot, which is closer to its destination. Moreover, no emphasis","authors_text":"Carlo Fischione, Elisabetta Alfonsetti, Pradeep Chathuranga Weeraddana","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-23T23:00:56Z","title":"A Semi Distributed Approach for Min-Max Fair Car-Parking Slot Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6210","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:85cf3348854535e88cfd6e86bf0d1c6a9351290b80a3059ac0e37faf306c2e15","target":"record","created_at":"2026-05-18T03:01:12Z","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":"bb63a604fb5c7fe8a31344892b8be9e470f6e89061905381a08b3c8274d181b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-01-23T23:00:56Z","title_canon_sha256":"aa984210615a7661238083e2932f388bfa83c1418e2a95c5ba1ec3d73f52d8b3"},"schema_version":"1.0","source":{"id":"1401.6210","kind":"arxiv","version":1}},"canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","first_computed_at":"2026-05-18T03:01:12.867308Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:12.867308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x+rq69kP3pFOq82wEbYW12r/4PpJPBLsBt6aBxCK3urZcTSiec6dW58NKPG4WF54f0rBViQ0OFtJ3rYKOZOUBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:12.868122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6210","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85cf3348854535e88cfd6e86bf0d1c6a9351290b80a3059ac0e37faf306c2e15","sha256:955b01d9023cf088fd8361728ebb165d0bed2475168dc213c7a37217614044e8"],"state_sha256":"8e40d3803da0d95010f251e0a61bcc76b062cc5e06ca425bd6288d158ce88dd8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18RfQvniE1Oqba5mZxUMD+t0JxNlRP0lbin4lxj4M5hpeh7ekYON27u/poTxNzMqa9hNX0KY+PwZP6mrszuVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T17:33:40.359359Z","bundle_sha256":"7a8cd50c80d67dc50fef59dfdbb32d68f1a1404e182be044fe785ccb42426a03"}}