{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:I7BIVTSWZWZYUA4MLA3MJOMGYY","short_pith_number":"pith:I7BIVTSW","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"},"canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","source":{"kind":"arxiv","id":"1807.07957","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07957","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07957v1","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07957","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"I7BIVTSWZWZY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7BIVTSWZWZYUA4M","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7BIVTSW","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:I7BIVTSWZWZYUA4MLA3MJOMGYY","target":"record","payload":{"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"},"canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","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"},"source_kind":"arxiv","source_id":"1807.07957","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J9EZKbTA8Bq5eJzW1YE9cJlkD3Pq9Nyn89qD2lXzWP3L9jg8Cyx4L67L1GntIS852v000mKRRysjOqC6qeTaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:08.579075Z"},"content_sha256":"e86ed8e6e45dc11a533894b8016c3bed4f2defa29c0990f615393034ddd8988e","schema_version":"1.0","event_id":"sha256:e86ed8e6e45dc11a533894b8016c3bed4f2defa29c0990f615393034ddd8988e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:I7BIVTSWZWZYUA4MLA3MJOMGYY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p74n15qa4+jUZX2vov+xDQgEx8Kqi+8NTTZZ1/Uj4QmIEN3Gh1+1x7fcPImscNcq5Cunh1InWUlg5OGThqssAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:45:08.579801Z"},"content_sha256":"5e558d86b114f484763be1e949a53e2ed2423302305787beae623e798bbf252b","schema_version":"1.0","event_id":"sha256:5e558d86b114f484763be1e949a53e2ed2423302305787beae623e798bbf252b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/bundle.json","state_url":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T10:45:08Z","links":{"resolver":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY","bundle":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/bundle.json","state":"https://pith.science/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7BIVTSWZWZYUA4MLA3MJOMGYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:I7BIVTSWZWZYUA4MLA3MJOMGYY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4548da7c93e87a75733e996bda345fb374ebe8368751ea2fa782e2889467a3d0","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-07-20T17:59:58Z","title_canon_sha256":"01d32180e93f40edf6c09becc34995725c5d0d16bc1d5af9b04ba18018440e4f"},"schema_version":"1.0","source":{"id":"1807.07957","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07957","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07957v1","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07957","created_at":"2026-05-18T00:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"I7BIVTSWZWZY","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"I7BIVTSWZWZYUA4M","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"I7BIVTSW","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5e558d86b114f484763be1e949a53e2ed2423302305787beae623e798bbf252b","target":"graph","created_at":"2026-05-18T00:10:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Payam Ghassemi, Souma Chowdhury","cross_cats":["cs.AI","cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-07-20T17:59:58Z","title":"Decentralized Task Allocation in Multi-Robot Systems via Bipartite Graph Matching Augmented with Fuzzy Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07957","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e86ed8e6e45dc11a533894b8016c3bed4f2defa29c0990f615393034ddd8988e","target":"record","created_at":"2026-05-18T00:10:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4548da7c93e87a75733e996bda345fb374ebe8368751ea2fa782e2889467a3d0","cross_cats_sorted":["cs.AI","cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2018-07-20T17:59:58Z","title_canon_sha256":"01d32180e93f40edf6c09becc34995725c5d0d16bc1d5af9b04ba18018440e4f"},"schema_version":"1.0","source":{"id":"1807.07957","kind":"arxiv","version":1}},"canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47c28ace56cdb38a038c5836c4b986c6344aaabe1d7196975ed35a61ae41e36e","first_computed_at":"2026-05-18T00:10:14.847758Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:14.847758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BpiV3XH660txUntwrPgoO5BDInHs8LmaioqqvafLkwHK8fQQFpteVWDutztH7vmRGyRrWebopZg7+5/xY1sWAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:14.848428Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07957","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e86ed8e6e45dc11a533894b8016c3bed4f2defa29c0990f615393034ddd8988e","sha256:5e558d86b114f484763be1e949a53e2ed2423302305787beae623e798bbf252b"],"state_sha256":"95674717faf6ac902c3a978fa0997f0290e2e310c638c5b7e1dc21f4b2dcca87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QJtoSpQrgnXnZ8iTOhAtIozPCXkf59MwQRuucpiHm9zfkTuA1AflmYfwIf/2gcbUygE+NfBRy3brHMtmGj0gCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:45:08.583527Z","bundle_sha256":"2cf410b6995812765c8a5b4434c4536b77b1a4db6b926ae79c5bb614d3a68acc"}}