{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:I7BIVTSWZWZYUA4MLA3MJOMGYY","short_pith_number":"pith:I7BIVTSW","schema_version":"1.0","canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","source":{"kind":"arxiv","id":"1807.07957","version":1},"attestation_state":"computed","paper":{"title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Payam Ghassemi, Souma Chowdhury","submitted_at":"2018-07-20T17:59:58Z","abstract_excerpt":"Robotic systems, working together as a team, are becoming valuable players in different real-world applications, from disaster response to warehouse fulfillment services. Centralized solutions for coordinating multi-robot teams often suffer from poor scalability and vulnerability to communication disruptions. This paper develops a decentralized multi-agent task allocation (Dec-MATA) algorithm for multi-robot applications. The task planning problem is posed as a maximum-weighted matching of a bipartite graph, the solution of which using the blossom algorithm allows each robot to autonomously id"},"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":"1807.07957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-07-20T17:59:58Z","cross_cats_sorted":["cs.AI","cs.RO"],"title_canon_sha256":"01d32180e93f40edf6c09becc34995725c5d0d16bc1d5af9b04ba18018440e4f","abstract_canon_sha256":"4548da7c93e87a75733e996bda345fb374ebe8368751ea2fa782e2889467a3d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:14.848428Z","signature_b64":"BpiV3XH660txUntwrPgoO5BDInHs8LmaioqqvafLkwHK8fQQFpteVWDutztH7vmRGyRrWebopZg7+5/xY1sWAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","last_reissued_at":"2026-05-18T00:10:14.847758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:14.847758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.RO"],"primary_cat":"cs.MA","authors_text":"Payam Ghassemi, Souma Chowdhury","submitted_at":"2018-07-20T17:59:58Z","abstract_excerpt":"Robotic systems, working together as a team, are becoming valuable players in different real-world applications, from disaster response to warehouse fulfillment services. Centralized solutions for coordinating multi-robot teams often suffer from poor scalability and vulnerability to communication disruptions. This paper develops a decentralized multi-agent task allocation (Dec-MATA) algorithm for multi-robot applications. The task planning problem is posed as a maximum-weighted matching of a bipartite graph, the solution of which using the blossom algorithm allows each robot to autonomously id"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07957","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":"1807.07957","created_at":"2026-05-18T00:10:14.847859+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.07957v1","created_at":"2026-05-18T00:10:14.847859+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07957","created_at":"2026-05-18T00:10:14.847859+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7BIVTSWZWZY","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7BIVTSWZWZYUA4M","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7BIVTSW","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/I7BIVTSWZWZYUA4MLA3MJOMGYY","json":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY.json","graph_json":"https://pith.science/api/pith-number/I7BIVTSWZWZYUA4MLA3MJOMGYY/graph.json","events_json":"https://pith.science/api/pith-number/I7BIVTSWZWZYUA4MLA3MJOMGYY/events.json","paper":"https://pith.science/paper/I7BIVTSW"},"agent_actions":{"view_html":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY","download_json":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY.json","view_paper":"https://pith.science/paper/I7BIVTSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.07957&json=true","fetch_graph":"https://pith.science/api/pith-number/I7BIVTSWZWZYUA4MLA3MJOMGYY/graph.json","fetch_events":"https://pith.science/api/pith-number/I7BIVTSWZWZYUA4MLA3MJOMGYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/action/storage_attestation","attest_author":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/action/author_attestation","sign_citation":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/action/citation_signature","submit_replication":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/action/replication_record"}},"created_at":"2026-05-18T00:10:14.847859+00:00","updated_at":"2026-05-18T00:10:14.847859+00:00"}