{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:VEW24XC47G5B653HDERTSDRV2N","short_pith_number":"pith:VEW24XC4","schema_version":"1.0","canonical_sha256":"a92dae5c5cf9ba1f77671923390e35d3787d2ab5c1cdde9068d16a824c213325","source":{"kind":"arxiv","id":"1702.07665","version":2},"attestation_state":"computed","paper":{"title":"Truthful Mechanisms for Delivery with Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Andreas B\\\"artschi, Daniel Graf, Paolo Penna","submitted_at":"2017-02-24T17:09:22Z","abstract_excerpt":"We study the game-theoretic task of selecting mobile agents to deliver multiple items on a network. An instance is given by $m$ messages (physical objects) which have to be transported between specified source-target pairs in a weighted undirected graph, and $k$ mobile heterogeneous agents, each being able to transport one message at a time. Following a recent model by [B\\\"artschi et al. 2016], each agent $i$ consumes energy proportional to the distance it travels in the graph, where the different rates of energy consumption are given by weight factors $w_i$. We are interested in optimizing or"},"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":"1702.07665","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-02-24T17:09:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a3df9c0ae9e98b574880feb3a722930278c01e5b43275609e6bca7a513d72f5f","abstract_canon_sha256":"8079f6ec64a9825caa2b7469950b43d00ed0e19f272c73b37a44835e9e5621ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.650263Z","signature_b64":"KNjpVVpgaebvPbox16awaYk15dxX/VqodBe4k9h3yy8DooxZCTpsRRY6NWpCQ4RHgPUryXuZv3dtEB+KpCDGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a92dae5c5cf9ba1f77671923390e35d3787d2ab5c1cdde9068d16a824c213325","last_reissued_at":"2026-05-17T23:48:34.649771Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.649771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truthful Mechanisms for Delivery with Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Andreas B\\\"artschi, Daniel Graf, Paolo Penna","submitted_at":"2017-02-24T17:09:22Z","abstract_excerpt":"We study the game-theoretic task of selecting mobile agents to deliver multiple items on a network. An instance is given by $m$ messages (physical objects) which have to be transported between specified source-target pairs in a weighted undirected graph, and $k$ mobile heterogeneous agents, each being able to transport one message at a time. Following a recent model by [B\\\"artschi et al. 2016], each agent $i$ consumes energy proportional to the distance it travels in the graph, where the different rates of energy consumption are given by weight factors $w_i$. We are interested in optimizing or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07665","kind":"arxiv","version":2},"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":"1702.07665","created_at":"2026-05-17T23:48:34.649841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.07665v2","created_at":"2026-05-17T23:48:34.649841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07665","created_at":"2026-05-17T23:48:34.649841+00:00"},{"alias_kind":"pith_short_12","alias_value":"VEW24XC47G5B","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"VEW24XC47G5B653H","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"VEW24XC4","created_at":"2026-05-18T12:31:49.984773+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/VEW24XC47G5B653HDERTSDRV2N","json":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N.json","graph_json":"https://pith.science/api/pith-number/VEW24XC47G5B653HDERTSDRV2N/graph.json","events_json":"https://pith.science/api/pith-number/VEW24XC47G5B653HDERTSDRV2N/events.json","paper":"https://pith.science/paper/VEW24XC4"},"agent_actions":{"view_html":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N","download_json":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N.json","view_paper":"https://pith.science/paper/VEW24XC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.07665&json=true","fetch_graph":"https://pith.science/api/pith-number/VEW24XC47G5B653HDERTSDRV2N/graph.json","fetch_events":"https://pith.science/api/pith-number/VEW24XC47G5B653HDERTSDRV2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N/action/storage_attestation","attest_author":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N/action/author_attestation","sign_citation":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N/action/citation_signature","submit_replication":"https://pith.science/pith/VEW24XC47G5B653HDERTSDRV2N/action/replication_record"}},"created_at":"2026-05-17T23:48:34.649841+00:00","updated_at":"2026-05-17T23:48:34.649841+00:00"}