{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M3A2TZCG7SWMB7X5T6F74VGWG2","short_pith_number":"pith:M3A2TZCG","canonical_record":{"source":{"id":"1901.03258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-10T16:36:22Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"6fcafb7a09977d55dfca0ae172265c18d6b4bac2bda82e09c9c9fccba57472d5","abstract_canon_sha256":"ddbdf5e175826393b64e2e90a6149513fabbc7efa48040b899d10d184c29561c"},"schema_version":"1.0"},"canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","source":{"kind":"arxiv","id":"1901.03258","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03258","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03258v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03258","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"M3A2TZCG7SWM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M3A2TZCG7SWMB7X5","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M3A2TZCG","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M3A2TZCG7SWMB7X5T6F74VGWG2","target":"record","payload":{"canonical_record":{"source":{"id":"1901.03258","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-10T16:36:22Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"6fcafb7a09977d55dfca0ae172265c18d6b4bac2bda82e09c9c9fccba57472d5","abstract_canon_sha256":"ddbdf5e175826393b64e2e90a6149513fabbc7efa48040b899d10d184c29561c"},"schema_version":"1.0"},"canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:34.927143Z","signature_b64":"FyI55BuPX4ps44qXLBVP4saMhrXavKVFV/FAFCobFOlaExzVgyjDXmYgwtMWWNguWfel8QEN3aQtRKZoTG66Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","last_reissued_at":"2026-05-17T23:56:34.926621Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:34.926621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.03258","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYyAOuq3CYf3e6xv+tZuaUnYVE84v4wqr1t/3PO+P3kvqPx8dban7UvcZCOieZfnCXzRbEEus2LKLbvMO3GsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:18.243250Z"},"content_sha256":"18185447fd342bc8fd3d4cdd36073f0f5a157c7e3200ced231e41998a5be067a","schema_version":"1.0","event_id":"sha256:18185447fd342bc8fd3d4cdd36073f0f5a157c7e3200ced231e41998a5be067a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M3A2TZCG7SWMB7X5T6F74VGWG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Greedy Based Task Allocation for Multiple Robot Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.MA","authors_text":"Hyo-Sang Shin, Pau Segui-Gasco, Teng Li","submitted_at":"2019-01-10T16:36:22Z","abstract_excerpt":"This paper addresses the task allocation problem for multi-robot systems. The main issue with the task allocation problem is inherent complexity that makes finding an optimal solution within a reasonable time almost impossible. To hand the issue, this paper develops a task allocation algorithm that can be decentralised by leveraging the submodularity concepts and sampling process. The theoretical analysis reveals that the proposed algorithm can provide approximation guarantee of $1/2$ for the monotone submodular case and $1/4$ for the non-monotone submodular case in average sense with polynomi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03258","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:56:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o+3DcJtSxmv7MurnIROTuHusBTOhs4KPtoJnUxmsBJRJ//2ektFsC7/yaO5VfeX1bpmvGUdgShbJTF2/kN9ZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T15:00:18.243609Z"},"content_sha256":"a0d13cd0e3e6d58000c52695a83c0af44c5d64f23ebceb3eed70a9fefc643e0b","schema_version":"1.0","event_id":"sha256:a0d13cd0e3e6d58000c52695a83c0af44c5d64f23ebceb3eed70a9fefc643e0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/bundle.json","state_url":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/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-05T15:00:18Z","links":{"resolver":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2","bundle":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/bundle.json","state":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M3A2TZCG7SWMB7X5T6F74VGWG2","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":"ddbdf5e175826393b64e2e90a6149513fabbc7efa48040b899d10d184c29561c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-10T16:36:22Z","title_canon_sha256":"6fcafb7a09977d55dfca0ae172265c18d6b4bac2bda82e09c9c9fccba57472d5"},"schema_version":"1.0","source":{"id":"1901.03258","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.03258","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"arxiv_version","alias_value":"1901.03258v1","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03258","created_at":"2026-05-17T23:56:34Z"},{"alias_kind":"pith_short_12","alias_value":"M3A2TZCG7SWM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M3A2TZCG7SWMB7X5","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M3A2TZCG","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a0d13cd0e3e6d58000c52695a83c0af44c5d64f23ebceb3eed70a9fefc643e0b","target":"graph","created_at":"2026-05-17T23:56:34Z","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":"This paper addresses the task allocation problem for multi-robot systems. The main issue with the task allocation problem is inherent complexity that makes finding an optimal solution within a reasonable time almost impossible. To hand the issue, this paper develops a task allocation algorithm that can be decentralised by leveraging the submodularity concepts and sampling process. The theoretical analysis reveals that the proposed algorithm can provide approximation guarantee of $1/2$ for the monotone submodular case and $1/4$ for the non-monotone submodular case in average sense with polynomi","authors_text":"Hyo-Sang Shin, Pau Segui-Gasco, Teng Li","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-10T16:36:22Z","title":"Sample Greedy Based Task Allocation for Multiple Robot Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.03258","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:18185447fd342bc8fd3d4cdd36073f0f5a157c7e3200ced231e41998a5be067a","target":"record","created_at":"2026-05-17T23:56:34Z","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":"ddbdf5e175826393b64e2e90a6149513fabbc7efa48040b899d10d184c29561c","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-01-10T16:36:22Z","title_canon_sha256":"6fcafb7a09977d55dfca0ae172265c18d6b4bac2bda82e09c9c9fccba57472d5"},"schema_version":"1.0","source":{"id":"1901.03258","kind":"arxiv","version":1}},"canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","first_computed_at":"2026-05-17T23:56:34.926621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:34.926621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FyI55BuPX4ps44qXLBVP4saMhrXavKVFV/FAFCobFOlaExzVgyjDXmYgwtMWWNguWfel8QEN3aQtRKZoTG66Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:34.927143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.03258","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18185447fd342bc8fd3d4cdd36073f0f5a157c7e3200ced231e41998a5be067a","sha256:a0d13cd0e3e6d58000c52695a83c0af44c5d64f23ebceb3eed70a9fefc643e0b"],"state_sha256":"d35d773e6e3b707a61481a9c8313b17066ca0c9199511fa70c98cb31165887bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MInHdbCI3bZA0QXsWFRH0gSTvf12X/5MsF9JyNMZqiVW95XBE1XBtTSCAPp5x8S24w048SHVFa2fLjb8wt9JBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T15:00:18.245610Z","bundle_sha256":"e8b5e0af81e69bd6c6e655940ccc53622fa5123414405065970fda113f88c515"}}