{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FDIIOLYV6RO3SFNT4T3BVVHLFC","short_pith_number":"pith:FDIIOLYV","schema_version":"1.0","canonical_sha256":"28d0872f15f45db915b3e4f61ad4eb28b47d7e41df5fe35c819ac7c80701553a","source":{"kind":"arxiv","id":"1407.0628","version":1},"attestation_state":"computed","paper":{"title":"Exact and approximate algorithms for movement problems on (special classes of) graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o Luciano Gual\\`a, Guido Proietti, Stefano Leucci","submitted_at":"2014-07-02T16:12:45Z","abstract_excerpt":"When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from their initial position to a final configuration enjoying some global property. In such a scenario, the problem of minimizing some function of the distance travelled, and therefore energy consumption, is of vital importance. In this paper we study several motion planning problems that arise when the objects must be moved on a graph, in order to reach certain goals which are of interest for several network applications. "},"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":"1407.0628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-02T16:12:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"caeb2b33e2065d57329633a38686b43c5c789f01cb42ca9a80e278397625e2f1","abstract_canon_sha256":"63992082596ba50690b4da7a1b5ccfd853654f55fe23ace2d6c7f54419411c4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:26.459605Z","signature_b64":"AsYMn/PUAWHRPemdmtzlxGzXx9mNlKOTKju8/SypnfH4IwVtVe3oVM+IcMh0Y1j60RXhDHpdo1NQxx3XVz66Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28d0872f15f45db915b3e4f61ad4eb28b47d7e41df5fe35c819ac7c80701553a","last_reissued_at":"2026-05-18T02:48:26.459033Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:26.459033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact and approximate algorithms for movement problems on (special classes of) graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Davide Bil\\`o Luciano Gual\\`a, Guido Proietti, Stefano Leucci","submitted_at":"2014-07-02T16:12:45Z","abstract_excerpt":"When a large collection of objects (e.g., robots, sensors, etc.) has to be deployed in a given environment, it is often required to plan a coordinated motion of the objects from their initial position to a final configuration enjoying some global property. In such a scenario, the problem of minimizing some function of the distance travelled, and therefore energy consumption, is of vital importance. In this paper we study several motion planning problems that arise when the objects must be moved on a graph, in order to reach certain goals which are of interest for several network applications. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0628","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":"1407.0628","created_at":"2026-05-18T02:48:26.459114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0628v1","created_at":"2026-05-18T02:48:26.459114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0628","created_at":"2026-05-18T02:48:26.459114+00:00"},{"alias_kind":"pith_short_12","alias_value":"FDIIOLYV6RO3","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FDIIOLYV6RO3SFNT","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FDIIOLYV","created_at":"2026-05-18T12:28:28.263976+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/FDIIOLYV6RO3SFNT4T3BVVHLFC","json":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC.json","graph_json":"https://pith.science/api/pith-number/FDIIOLYV6RO3SFNT4T3BVVHLFC/graph.json","events_json":"https://pith.science/api/pith-number/FDIIOLYV6RO3SFNT4T3BVVHLFC/events.json","paper":"https://pith.science/paper/FDIIOLYV"},"agent_actions":{"view_html":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC","download_json":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC.json","view_paper":"https://pith.science/paper/FDIIOLYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0628&json=true","fetch_graph":"https://pith.science/api/pith-number/FDIIOLYV6RO3SFNT4T3BVVHLFC/graph.json","fetch_events":"https://pith.science/api/pith-number/FDIIOLYV6RO3SFNT4T3BVVHLFC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC/action/storage_attestation","attest_author":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC/action/author_attestation","sign_citation":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC/action/citation_signature","submit_replication":"https://pith.science/pith/FDIIOLYV6RO3SFNT4T3BVVHLFC/action/replication_record"}},"created_at":"2026-05-18T02:48:26.459114+00:00","updated_at":"2026-05-18T02:48:26.459114+00:00"}