{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IWRTJDWWVPN6JTW6AZRREDAJI6","short_pith_number":"pith:IWRTJDWW","schema_version":"1.0","canonical_sha256":"45a3348ed6abdbe4cede0663120c0947a102c5e33ff35b0476ec2b952331a1c9","source":{"kind":"arxiv","id":"1401.6210","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.6210","created_at":"2026-05-18T03:01:12.867455+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.6210v1","created_at":"2026-05-18T03:01:12.867455+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6210","created_at":"2026-05-18T03:01:12.867455+00:00"},{"alias_kind":"pith_short_12","alias_value":"IWRTJDWWVPN6","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IWRTJDWWVPN6JTW6","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IWRTJDWW","created_at":"2026-05-18T12:28:33.132498+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/IWRTJDWWVPN6JTW6AZRREDAJI6","json":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6.json","graph_json":"https://pith.science/api/pith-number/IWRTJDWWVPN6JTW6AZRREDAJI6/graph.json","events_json":"https://pith.science/api/pith-number/IWRTJDWWVPN6JTW6AZRREDAJI6/events.json","paper":"https://pith.science/paper/IWRTJDWW"},"agent_actions":{"view_html":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6","download_json":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6.json","view_paper":"https://pith.science/paper/IWRTJDWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.6210&json=true","fetch_graph":"https://pith.science/api/pith-number/IWRTJDWWVPN6JTW6AZRREDAJI6/graph.json","fetch_events":"https://pith.science/api/pith-number/IWRTJDWWVPN6JTW6AZRREDAJI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/action/storage_attestation","attest_author":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/action/author_attestation","sign_citation":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/action/citation_signature","submit_replication":"https://pith.science/pith/IWRTJDWWVPN6JTW6AZRREDAJI6/action/replication_record"}},"created_at":"2026-05-18T03:01:12.867455+00:00","updated_at":"2026-05-18T03:01:12.867455+00:00"}