{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TUBVDCTESW7IU6T3LJH6HBR3IJ","short_pith_number":"pith:TUBVDCTE","schema_version":"1.0","canonical_sha256":"9d03518a6495be8a7a7b5a4fe3863b42548d164ce2d328143aa6c6c602afc082","source":{"kind":"arxiv","id":"1505.07434","version":3},"attestation_state":"computed","paper":{"title":"Fair task allocation in transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Qing Chuan Ye, Rommert Dekker, Yingqian Zhang","submitted_at":"2015-05-27T19:03:07Z","abstract_excerpt":"Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper we study a fair task allocation problem in transportation where an optimal allocation not only has low cost but more importantly, it distributes tasks as even as possible among heterogeneous participants who have different capacities and costs to execute tasks. To tackle this fair minimum cost allocation problem we analyze and solve it in two parts using two novel polynomial-time algo"},"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":"1505.07434","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-05-27T19:03:07Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"0911c0d57b6635cb505446374483408a28198dfdab69e59507dc5c5b113e9477","abstract_canon_sha256":"709b3b2fa1f683c2ae4195b7b979d3f088c6ff81b7a6bce050eb0bc13f4447d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:39.511961Z","signature_b64":"7/xERQsOb0BZ38C1m60N4G4H335GCJvGGuTwFYU+qpXi0XFdYh+WqHkkiJ+fCMul8FNK0vJLK2bMrV4iLDjeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d03518a6495be8a7a7b5a4fe3863b42548d164ce2d328143aa6c6c602afc082","last_reissued_at":"2026-05-18T00:55:39.511431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:39.511431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair task allocation in transportation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.AI","authors_text":"Qing Chuan Ye, Rommert Dekker, Yingqian Zhang","submitted_at":"2015-05-27T19:03:07Z","abstract_excerpt":"Task allocation problems have traditionally focused on cost optimization. However, more and more attention is being given to cases in which cost should not always be the sole or major consideration. In this paper we study a fair task allocation problem in transportation where an optimal allocation not only has low cost but more importantly, it distributes tasks as even as possible among heterogeneous participants who have different capacities and costs to execute tasks. To tackle this fair minimum cost allocation problem we analyze and solve it in two parts using two novel polynomial-time algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07434","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":"1505.07434","created_at":"2026-05-18T00:55:39.511504+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07434v3","created_at":"2026-05-18T00:55:39.511504+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07434","created_at":"2026-05-18T00:55:39.511504+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUBVDCTESW7I","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUBVDCTESW7IU6T3","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUBVDCTE","created_at":"2026-05-18T12:29:42.218222+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/TUBVDCTESW7IU6T3LJH6HBR3IJ","json":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ.json","graph_json":"https://pith.science/api/pith-number/TUBVDCTESW7IU6T3LJH6HBR3IJ/graph.json","events_json":"https://pith.science/api/pith-number/TUBVDCTESW7IU6T3LJH6HBR3IJ/events.json","paper":"https://pith.science/paper/TUBVDCTE"},"agent_actions":{"view_html":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ","download_json":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ.json","view_paper":"https://pith.science/paper/TUBVDCTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07434&json=true","fetch_graph":"https://pith.science/api/pith-number/TUBVDCTESW7IU6T3LJH6HBR3IJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TUBVDCTESW7IU6T3LJH6HBR3IJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ/action/storage_attestation","attest_author":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ/action/author_attestation","sign_citation":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ/action/citation_signature","submit_replication":"https://pith.science/pith/TUBVDCTESW7IU6T3LJH6HBR3IJ/action/replication_record"}},"created_at":"2026-05-18T00:55:39.511504+00:00","updated_at":"2026-05-18T00:55:39.511504+00:00"}