{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HCDT2D4VA4AGKZPXLYGVERV3Q7","short_pith_number":"pith:HCDT2D4V","schema_version":"1.0","canonical_sha256":"38873d0f9507006565f75e0d5246bb87d135de1b92f15fb87e5475847ddba391","source":{"kind":"arxiv","id":"1805.08712","version":1},"attestation_state":"computed","paper":{"title":"A Distributed Version of the Hungarian Method for Multi-Robot Assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Magnus Egerstedt, Matthew Rice, Smriti Chopra","submitted_at":"2018-05-22T16:20:35Z","abstract_excerpt":"In this paper, we propose a distributed version of the Hungarian Method to solve the well known assignment problem. In the context of multi-robot applications, all robots cooperatively compute a common assignment that optimizes a given global criterion (e.g. the total distance traveled) within a finite set of local computations and communications over a peer-to-peer network. As a motivating application, we consider a class of multi-robot routing problems with \"spatio-temporal\" constraints, i.e. spatial targets that require servicing at particular time instants. As a means of demonstrating the "},"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":"1805.08712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-05-22T16:20:35Z","cross_cats_sorted":[],"title_canon_sha256":"3ef753451e3b6265b71dec5abdfc46aa1a3b7f978e5965f0271a0ecd01c8556a","abstract_canon_sha256":"61a827247b8756ac8acec691badec1ef9c3c67770f386d6c1ce0c1ddc2c00f35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.272808Z","signature_b64":"+WMEZ73x32XbDn/CFWEg3ZvOYXRH/NvZ1K+e67vmr3QkEBatfBsucx3T53XbHPDWMZA+Kyk2hTwnucHlHf+RCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38873d0f9507006565f75e0d5246bb87d135de1b92f15fb87e5475847ddba391","last_reissued_at":"2026-05-18T00:15:25.272181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.272181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Version of the Hungarian Method for Multi-Robot Assignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Giuseppe Notarstefano, Magnus Egerstedt, Matthew Rice, Smriti Chopra","submitted_at":"2018-05-22T16:20:35Z","abstract_excerpt":"In this paper, we propose a distributed version of the Hungarian Method to solve the well known assignment problem. In the context of multi-robot applications, all robots cooperatively compute a common assignment that optimizes a given global criterion (e.g. the total distance traveled) within a finite set of local computations and communications over a peer-to-peer network. As a motivating application, we consider a class of multi-robot routing problems with \"spatio-temporal\" constraints, i.e. spatial targets that require servicing at particular time instants. As a means of demonstrating the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08712","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":"1805.08712","created_at":"2026-05-18T00:15:25.272269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08712v1","created_at":"2026-05-18T00:15:25.272269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08712","created_at":"2026-05-18T00:15:25.272269+00:00"},{"alias_kind":"pith_short_12","alias_value":"HCDT2D4VA4AG","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HCDT2D4VA4AGKZPX","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HCDT2D4V","created_at":"2026-05-18T12:32:28.185984+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/HCDT2D4VA4AGKZPXLYGVERV3Q7","json":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7.json","graph_json":"https://pith.science/api/pith-number/HCDT2D4VA4AGKZPXLYGVERV3Q7/graph.json","events_json":"https://pith.science/api/pith-number/HCDT2D4VA4AGKZPXLYGVERV3Q7/events.json","paper":"https://pith.science/paper/HCDT2D4V"},"agent_actions":{"view_html":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7","download_json":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7.json","view_paper":"https://pith.science/paper/HCDT2D4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08712&json=true","fetch_graph":"https://pith.science/api/pith-number/HCDT2D4VA4AGKZPXLYGVERV3Q7/graph.json","fetch_events":"https://pith.science/api/pith-number/HCDT2D4VA4AGKZPXLYGVERV3Q7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7/action/storage_attestation","attest_author":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7/action/author_attestation","sign_citation":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7/action/citation_signature","submit_replication":"https://pith.science/pith/HCDT2D4VA4AGKZPXLYGVERV3Q7/action/replication_record"}},"created_at":"2026-05-18T00:15:25.272269+00:00","updated_at":"2026-05-18T00:15:25.272269+00:00"}