{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JGAIWSBTYGHKUS5N2RNSXSWOPK","short_pith_number":"pith:JGAIWSBT","canonical_record":{"source":{"id":"1904.04374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T21:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"7190fb12a72004039802ca8ee9342a645dea447c87a5680e96fc91e211978706","abstract_canon_sha256":"a326f6cc8add476801a60f723c4a8801837d451d1a2304bc52d2a7a53cb66d5c"},"schema_version":"1.0"},"canonical_sha256":"49808b4833c18eaa4badd45b2bcace7a9d2690484b6e7688fbd94553ed0e0fca","source":{"kind":"arxiv","id":"1904.04374","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04374","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04374v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04374","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"JGAIWSBTYGHK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGAIWSBTYGHKUS5N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGAIWSBT","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JGAIWSBTYGHKUS5N2RNSXSWOPK","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04374","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T21:48:41Z","cross_cats_sorted":[],"title_canon_sha256":"7190fb12a72004039802ca8ee9342a645dea447c87a5680e96fc91e211978706","abstract_canon_sha256":"a326f6cc8add476801a60f723c4a8801837d451d1a2304bc52d2a7a53cb66d5c"},"schema_version":"1.0"},"canonical_sha256":"49808b4833c18eaa4badd45b2bcace7a9d2690484b6e7688fbd94553ed0e0fca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:59.151816Z","signature_b64":"A/FtQbHkWa2GJF2RNGQeY0ugm7D6FpYAeQP8OSgDN4T04wMVXQsGGrg6Rltn3fv24qUpSuN9/GnCQdsXt7lgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49808b4833c18eaa4badd45b2bcace7a9d2690484b6e7688fbd94553ed0e0fca","last_reissued_at":"2026-05-17T23:48:59.151447Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:59.151447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04374","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-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkUDF8cMHa+bhBNA3JTshZHledFBrOPXBQnwrUMjSmZRzwxPEOq7kl7cvCOR82xg47UYDum9Z3j55O7w+ov3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:59.325914Z"},"content_sha256":"c66169bee38d8a7e8f462a28384c4de9f5a1897e80df0abc77f68f6b0b68543d","schema_version":"1.0","event_id":"sha256:c66169bee38d8a7e8f462a28384c4de9f5a1897e80df0abc77f68f6b0b68543d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JGAIWSBTYGHKUS5N2RNSXSWOPK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Collision-aware Task Assignment for Multi-Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fang Wu, Giovanni Beltrame, Vivek Shankar Varadharajan","submitted_at":"2019-04-08T21:48:41Z","abstract_excerpt":"We propose a novel formulation of the collision-aware task assignment (CATA) problem and a decentralized auction-based algorithm to solve the problem with optimality bound. Using a collision cone, we predict potential collisions and introduce a binary decision variable into the local reward function for task bidding. We further improve CATA by implementing a receding collision horizon to address the stopping robot scenario, i.e. when robots are confined to their task location and become static obstacles to other moving robots. The auction-based algorithm encourages the robots to bid for tasks "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04374","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-17T23:48:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtQkbE9w/u3qOStkJK/HFMw4of0vu1oX6CIu4N4tPNSRfKlanVgHluxTfSH+3CcYt8qesFL5fJ555QbY+shvBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:59.326659Z"},"content_sha256":"b1c15b1b2b9a6ee448a32eccc47660f7965fddc6b71bc7cd9677921f5651273f","schema_version":"1.0","event_id":"sha256:b1c15b1b2b9a6ee448a32eccc47660f7965fddc6b71bc7cd9677921f5651273f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/bundle.json","state_url":"https://pith.science/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/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-06-09T23:25:59Z","links":{"resolver":"https://pith.science/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK","bundle":"https://pith.science/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/bundle.json","state":"https://pith.science/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGAIWSBTYGHKUS5N2RNSXSWOPK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JGAIWSBTYGHKUS5N2RNSXSWOPK","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":"a326f6cc8add476801a60f723c4a8801837d451d1a2304bc52d2a7a53cb66d5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T21:48:41Z","title_canon_sha256":"7190fb12a72004039802ca8ee9342a645dea447c87a5680e96fc91e211978706"},"schema_version":"1.0","source":{"id":"1904.04374","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04374","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04374v1","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04374","created_at":"2026-05-17T23:48:59Z"},{"alias_kind":"pith_short_12","alias_value":"JGAIWSBTYGHK","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"JGAIWSBTYGHKUS5N","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"JGAIWSBT","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:b1c15b1b2b9a6ee448a32eccc47660f7965fddc6b71bc7cd9677921f5651273f","target":"graph","created_at":"2026-05-17T23:48:59Z","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":"We propose a novel formulation of the collision-aware task assignment (CATA) problem and a decentralized auction-based algorithm to solve the problem with optimality bound. Using a collision cone, we predict potential collisions and introduce a binary decision variable into the local reward function for task bidding. We further improve CATA by implementing a receding collision horizon to address the stopping robot scenario, i.e. when robots are confined to their task location and become static obstacles to other moving robots. The auction-based algorithm encourages the robots to bid for tasks ","authors_text":"Fang Wu, Giovanni Beltrame, Vivek Shankar Varadharajan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T21:48:41Z","title":"Collision-aware Task Assignment for Multi-Robot Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04374","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:c66169bee38d8a7e8f462a28384c4de9f5a1897e80df0abc77f68f6b0b68543d","target":"record","created_at":"2026-05-17T23:48:59Z","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":"a326f6cc8add476801a60f723c4a8801837d451d1a2304bc52d2a7a53cb66d5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-04-08T21:48:41Z","title_canon_sha256":"7190fb12a72004039802ca8ee9342a645dea447c87a5680e96fc91e211978706"},"schema_version":"1.0","source":{"id":"1904.04374","kind":"arxiv","version":1}},"canonical_sha256":"49808b4833c18eaa4badd45b2bcace7a9d2690484b6e7688fbd94553ed0e0fca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49808b4833c18eaa4badd45b2bcace7a9d2690484b6e7688fbd94553ed0e0fca","first_computed_at":"2026-05-17T23:48:59.151447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:59.151447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/FtQbHkWa2GJF2RNGQeY0ugm7D6FpYAeQP8OSgDN4T04wMVXQsGGrg6Rltn3fv24qUpSuN9/GnCQdsXt7lgDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:59.151816Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04374","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c66169bee38d8a7e8f462a28384c4de9f5a1897e80df0abc77f68f6b0b68543d","sha256:b1c15b1b2b9a6ee448a32eccc47660f7965fddc6b71bc7cd9677921f5651273f"],"state_sha256":"e910716b88e8102283c8ea05fc0246aa04c983f1ebd1e385ea2f665f332a49f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOYf1dOc4j9fCvn4lZe6SudwrJQo49figO6Jrje31OcDQqByzSPX/pySK5k5mjfrxZyp3yR9GjA4nsm7iqvKCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:25:59.330854Z","bundle_sha256":"6dae03a290c5918ab1f165a413afe22dc212c6619910dced3a6adcf6edc20287"}}