{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3XXN2Y2T4AYVL2CGNBPHPYRVVX","short_pith_number":"pith:3XXN2Y2T","schema_version":"1.0","canonical_sha256":"ddeedd6353e03155e846685e77e235adcc511429b877106862fd0ef5b8431d3b","source":{"kind":"arxiv","id":"1708.04201","version":1},"attestation_state":"computed","paper":{"title":"A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Xiangyu Meng, Xinmiao Sun","submitted_at":"2017-08-14T16:45:36Z","abstract_excerpt":"We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event detection probability. The objective function of this problem is non-convex and no global optimum is guaranteed by gradient-based algorithms developed to date. We first show that the objective function is monotone submodular, a class of functions for which a simple greedy algorithm is known to be within 0.63 of the optimal solution. We then derive two tighter lower bounds by exploiting the curvature information (total curvature and elemental curvature) of "},"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":"1708.04201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-14T16:45:36Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"d6036ec4594e0b8c8efcb951ee6ce0c575236530f97104e89f58d09f29489061","abstract_canon_sha256":"49846769874ac9c12b72d27adb8415635f3b2a8ecf6d7a993631878d5180855a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:06.821308Z","signature_b64":"g2/MPorVA9bpGI8l0wlHqlsopbWdXD/IBoIU6KGXxbetuX1f9xsxvfY6346fk2YmaPXCyR3KqYT5zdtFYdqSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddeedd6353e03155e846685e77e235adcc511429b877106862fd0ef5b8431d3b","last_reissued_at":"2026-05-18T00:38:06.820806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:06.820806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Christos G. Cassandras, Xiangyu Meng, Xinmiao Sun","submitted_at":"2017-08-14T16:45:36Z","abstract_excerpt":"We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event detection probability. The objective function of this problem is non-convex and no global optimum is guaranteed by gradient-based algorithms developed to date. We first show that the objective function is monotone submodular, a class of functions for which a simple greedy algorithm is known to be within 0.63 of the optimal solution. We then derive two tighter lower bounds by exploiting the curvature information (total curvature and elemental curvature) of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04201","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":"1708.04201","created_at":"2026-05-18T00:38:06.820895+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04201v1","created_at":"2026-05-18T00:38:06.820895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04201","created_at":"2026-05-18T00:38:06.820895+00:00"},{"alias_kind":"pith_short_12","alias_value":"3XXN2Y2T4AYV","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3XXN2Y2T4AYVL2CG","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3XXN2Y2T","created_at":"2026-05-18T12:30:58.224056+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/3XXN2Y2T4AYVL2CGNBPHPYRVVX","json":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX.json","graph_json":"https://pith.science/api/pith-number/3XXN2Y2T4AYVL2CGNBPHPYRVVX/graph.json","events_json":"https://pith.science/api/pith-number/3XXN2Y2T4AYVL2CGNBPHPYRVVX/events.json","paper":"https://pith.science/paper/3XXN2Y2T"},"agent_actions":{"view_html":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX","download_json":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX.json","view_paper":"https://pith.science/paper/3XXN2Y2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04201&json=true","fetch_graph":"https://pith.science/api/pith-number/3XXN2Y2T4AYVL2CGNBPHPYRVVX/graph.json","fetch_events":"https://pith.science/api/pith-number/3XXN2Y2T4AYVL2CGNBPHPYRVVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX/action/storage_attestation","attest_author":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX/action/author_attestation","sign_citation":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX/action/citation_signature","submit_replication":"https://pith.science/pith/3XXN2Y2T4AYVL2CGNBPHPYRVVX/action/replication_record"}},"created_at":"2026-05-18T00:38:06.820895+00:00","updated_at":"2026-05-18T00:38:06.820895+00:00"}