{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UEH4WGDZRT3VT3KGAMYNOPABFC","short_pith_number":"pith:UEH4WGDZ","schema_version":"1.0","canonical_sha256":"a10fcb18798cf759ed460330d73c012880cf8120ec1549908f988f183bd1eea3","source":{"kind":"arxiv","id":"1809.00077","version":1},"attestation_state":"computed","paper":{"title":"Collective fast delivery by energy-efficient agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas B\\\"artschi, Daniel Graf, Matus Mihalak","submitted_at":"2018-08-31T22:53:32Z","abstract_excerpt":"We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s to a given target node t. The agents can move along the edges of the graph, starting at time 0 with respect to the following: Each agent i has a weight w_i that defines the rate of energy consumption while travelling a distance in the graph, and a velocity v_i with which it can move.\n  We are interested in schedules (operating the k agents) that result in a small delivery time T (time when the package arrives at t),"},"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":"1809.00077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-31T22:53:32Z","cross_cats_sorted":[],"title_canon_sha256":"48183b33ed67d3d5c519822b8129710ea42b7039995a574cee71dfd659ef1e08","abstract_canon_sha256":"2ff75132e3520a4e69c951b64fc6ee4381a8ed1c6acc120483deeaf52afbdf60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:36.204488Z","signature_b64":"bc8CVmDDnROFG+rqzFXs5h0NoYKx9Zjd5RBIKWikhoVKixDJASzMvkPtHFjo5xJJanVKKK2uk2iIw2NolrjQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a10fcb18798cf759ed460330d73c012880cf8120ec1549908f988f183bd1eea3","last_reissued_at":"2026-05-18T00:06:36.203905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:36.203905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Collective fast delivery by energy-efficient agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas B\\\"artschi, Daniel Graf, Matus Mihalak","submitted_at":"2018-08-31T22:53:32Z","abstract_excerpt":"We consider k mobile agents initially located at distinct nodes of an undirected graph (on n nodes, with edge lengths) that have to deliver a single item from a given source node s to a given target node t. The agents can move along the edges of the graph, starting at time 0 with respect to the following: Each agent i has a weight w_i that defines the rate of energy consumption while travelling a distance in the graph, and a velocity v_i with which it can move.\n  We are interested in schedules (operating the k agents) that result in a small delivery time T (time when the package arrives at t),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00077","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":"1809.00077","created_at":"2026-05-18T00:06:36.204000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00077v1","created_at":"2026-05-18T00:06:36.204000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00077","created_at":"2026-05-18T00:06:36.204000+00:00"},{"alias_kind":"pith_short_12","alias_value":"UEH4WGDZRT3V","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UEH4WGDZRT3VT3KG","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UEH4WGDZ","created_at":"2026-05-18T12:32:56.356000+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/UEH4WGDZRT3VT3KGAMYNOPABFC","json":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC.json","graph_json":"https://pith.science/api/pith-number/UEH4WGDZRT3VT3KGAMYNOPABFC/graph.json","events_json":"https://pith.science/api/pith-number/UEH4WGDZRT3VT3KGAMYNOPABFC/events.json","paper":"https://pith.science/paper/UEH4WGDZ"},"agent_actions":{"view_html":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC","download_json":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC.json","view_paper":"https://pith.science/paper/UEH4WGDZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00077&json=true","fetch_graph":"https://pith.science/api/pith-number/UEH4WGDZRT3VT3KGAMYNOPABFC/graph.json","fetch_events":"https://pith.science/api/pith-number/UEH4WGDZRT3VT3KGAMYNOPABFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC/action/storage_attestation","attest_author":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC/action/author_attestation","sign_citation":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC/action/citation_signature","submit_replication":"https://pith.science/pith/UEH4WGDZRT3VT3KGAMYNOPABFC/action/replication_record"}},"created_at":"2026-05-18T00:06:36.204000+00:00","updated_at":"2026-05-18T00:06:36.204000+00:00"}