{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:V2J2BODYYKHOPC2OWCG3TCVXSQ","short_pith_number":"pith:V2J2BODY","canonical_record":{"source":{"id":"2209.14417","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-28T21:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"8d575a50369d2e670e728a0fc6421e05fb4b8d1010f82bcc289a53e9454bed39","abstract_canon_sha256":"bda7943c6214d5f08529842ff4a96edf1961ff79470d8eedee5d89252135221e"},"schema_version":"1.0"},"canonical_sha256":"ae93a0b878c28ee78b4eb08db98ab7941c9e8051775f2b733578fd601c2fb02e","source":{"kind":"arxiv","id":"2209.14417","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14417","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14417v2","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14417","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"V2J2BODYYKHO","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"V2J2BODYYKHOPC2O","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"V2J2BODY","created_at":"2026-07-05T06:13:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:V2J2BODYYKHOPC2OWCG3TCVXSQ","target":"record","payload":{"canonical_record":{"source":{"id":"2209.14417","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-28T21:03:31Z","cross_cats_sorted":[],"title_canon_sha256":"8d575a50369d2e670e728a0fc6421e05fb4b8d1010f82bcc289a53e9454bed39","abstract_canon_sha256":"bda7943c6214d5f08529842ff4a96edf1961ff79470d8eedee5d89252135221e"},"schema_version":"1.0"},"canonical_sha256":"ae93a0b878c28ee78b4eb08db98ab7941c9e8051775f2b733578fd601c2fb02e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:16.589561Z","signature_b64":"t2QOPmKrVyL5FdXom9OYaPsO2FasWk+PfdfUPJCU0XHuHkU5K5u28QXJ2d9GqSHbi+bEUGiUGdcktdA7NQLnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae93a0b878c28ee78b4eb08db98ab7941c9e8051775f2b733578fd601c2fb02e","last_reissued_at":"2026-07-05T06:13:16.589047Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:16.589047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.14417","source_version":2,"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-07-05T06:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9YmLAx5pl24hHGPnIU1uu48Ip/lcwYxt2FOGCA+D4XwTqDGX7CMPGD3PnyziGGjUvbmoyIz5o6wcqdE7d5sODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:48:38.512318Z"},"content_sha256":"3483048a98b65c365db78d5a3fe0ae1b6551de8e18b38cac28211ac523935e07","schema_version":"1.0","event_id":"sha256:3483048a98b65c365db78d5a3fe0ae1b6551de8e18b38cac28211ac523935e07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:V2J2BODYYKHOPC2OWCG3TCVXSQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Robot Coordination and Cooperation with Task Precedence Relationships","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Matthew Malencia, Saaketh Narayan, Saurav Agarwal, Siddharth Mayya, Vijay Kumar, Walker Gosrich","submitted_at":"2022-09-28T21:03:31Z","abstract_excerpt":"We propose a new formulation for the multi-robot task planning and allocation problem that incorporates (a) precedence relationships between tasks; (b) coordination for tasks allowing multiple robots to achieve increased efficiency; and (c) cooperation through the formation of robot coalitions for tasks that cannot be performed by individual robots alone. In our formulation, the tasks and the relationships between the tasks are specified by a task graph. We define a set of reward functions over the task graph's nodes and edges. These functions model the effect of robot coalition size on the ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14417","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.14417/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MpGmGReg0k+d+ikX/9pRn1GXjUxHTl9OlrJoPIToNaVPHhgn579HTJvPMsQ+MIhQyae8GMlYdoJLzh27DMoABg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T20:48:38.512857Z"},"content_sha256":"2af5c86add1a0b1342adb44a8aa095d355a754aebddfdaab65a2026217d45f68","schema_version":"1.0","event_id":"sha256:2af5c86add1a0b1342adb44a8aa095d355a754aebddfdaab65a2026217d45f68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/bundle.json","state_url":"https://pith.science/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/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-08-05T20:48:38Z","links":{"resolver":"https://pith.science/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ","bundle":"https://pith.science/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/bundle.json","state":"https://pith.science/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V2J2BODYYKHOPC2OWCG3TCVXSQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:V2J2BODYYKHOPC2OWCG3TCVXSQ","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":"bda7943c6214d5f08529842ff4a96edf1961ff79470d8eedee5d89252135221e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-28T21:03:31Z","title_canon_sha256":"8d575a50369d2e670e728a0fc6421e05fb4b8d1010f82bcc289a53e9454bed39"},"schema_version":"1.0","source":{"id":"2209.14417","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.14417","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2209.14417v2","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.14417","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"V2J2BODYYKHO","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"V2J2BODYYKHOPC2O","created_at":"2026-07-05T06:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"V2J2BODY","created_at":"2026-07-05T06:13:16Z"}],"graph_snapshots":[{"event_id":"sha256:2af5c86add1a0b1342adb44a8aa095d355a754aebddfdaab65a2026217d45f68","target":"graph","created_at":"2026-07-05T06:13:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.14417/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new formulation for the multi-robot task planning and allocation problem that incorporates (a) precedence relationships between tasks; (b) coordination for tasks allowing multiple robots to achieve increased efficiency; and (c) cooperation through the formation of robot coalitions for tasks that cannot be performed by individual robots alone. In our formulation, the tasks and the relationships between the tasks are specified by a task graph. We define a set of reward functions over the task graph's nodes and edges. These functions model the effect of robot coalition size on the ta","authors_text":"Matthew Malencia, Saaketh Narayan, Saurav Agarwal, Siddharth Mayya, Vijay Kumar, Walker Gosrich","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-28T21:03:31Z","title":"Multi-Robot Coordination and Cooperation with Task Precedence Relationships"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.14417","kind":"arxiv","version":2},"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:3483048a98b65c365db78d5a3fe0ae1b6551de8e18b38cac28211ac523935e07","target":"record","created_at":"2026-07-05T06:13:16Z","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":"bda7943c6214d5f08529842ff4a96edf1961ff79470d8eedee5d89252135221e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-28T21:03:31Z","title_canon_sha256":"8d575a50369d2e670e728a0fc6421e05fb4b8d1010f82bcc289a53e9454bed39"},"schema_version":"1.0","source":{"id":"2209.14417","kind":"arxiv","version":2}},"canonical_sha256":"ae93a0b878c28ee78b4eb08db98ab7941c9e8051775f2b733578fd601c2fb02e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae93a0b878c28ee78b4eb08db98ab7941c9e8051775f2b733578fd601c2fb02e","first_computed_at":"2026-07-05T06:13:16.589047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:13:16.589047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t2QOPmKrVyL5FdXom9OYaPsO2FasWk+PfdfUPJCU0XHuHkU5K5u28QXJ2d9GqSHbi+bEUGiUGdcktdA7NQLnAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:13:16.589561Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.14417","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3483048a98b65c365db78d5a3fe0ae1b6551de8e18b38cac28211ac523935e07","sha256:2af5c86add1a0b1342adb44a8aa095d355a754aebddfdaab65a2026217d45f68"],"state_sha256":"c0b6382cafd118b10f39754522e07f901e3531a54dece4cc3faf4e7ca32a5291"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5335FZ4iQZbE5/o4nnekG8H0jyTmFy9Z4dN8FDYLEZvqBLhUg5+BLxALx0encC+XXrPLDELqsH/7pTXc0C1BDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T20:48:38.516911Z","bundle_sha256":"0a594b26d25790e8e70cd16c17280ef5eafccd3ba634f01db3b425ff78be25f8"}}