{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:M3A2TZCG7SWMB7X5T6F74VGWG2","short_pith_number":"pith:M3A2TZCG","schema_version":"1.0","canonical_sha256":"66c1a9e446fcacc0fefd9f8bfe54d63687cc32c89ce8c80b7e0a6904eb122cde","source":{"kind":"arxiv","id":"1901.03258","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1901.03258","created_at":"2026-05-17T23:56:34.926690+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.03258v1","created_at":"2026-05-17T23:56:34.926690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.03258","created_at":"2026-05-17T23:56:34.926690+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3A2TZCG7SWM","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3A2TZCG7SWMB7X5","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3A2TZCG","created_at":"2026-05-18T12:33:21.387695+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/M3A2TZCG7SWMB7X5T6F74VGWG2","json":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2.json","graph_json":"https://pith.science/api/pith-number/M3A2TZCG7SWMB7X5T6F74VGWG2/graph.json","events_json":"https://pith.science/api/pith-number/M3A2TZCG7SWMB7X5T6F74VGWG2/events.json","paper":"https://pith.science/paper/M3A2TZCG"},"agent_actions":{"view_html":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2","download_json":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2.json","view_paper":"https://pith.science/paper/M3A2TZCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.03258&json=true","fetch_graph":"https://pith.science/api/pith-number/M3A2TZCG7SWMB7X5T6F74VGWG2/graph.json","fetch_events":"https://pith.science/api/pith-number/M3A2TZCG7SWMB7X5T6F74VGWG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/action/storage_attestation","attest_author":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/action/author_attestation","sign_citation":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/action/citation_signature","submit_replication":"https://pith.science/pith/M3A2TZCG7SWMB7X5T6F74VGWG2/action/replication_record"}},"created_at":"2026-05-17T23:56:34.926690+00:00","updated_at":"2026-05-17T23:56:34.926690+00:00"}