{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TB7KWALAWUPFPHBRRZUIUX4GXB","short_pith_number":"pith:TB7KWALA","schema_version":"1.0","canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","source":{"kind":"arxiv","id":"1801.10285","version":1},"attestation_state":"computed","paper":{"title":"Optimal Configurations in Coverage Control with Polynomial Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.OC"],"primary_cat":"cs.SY","authors_text":"Dhagash Mehta, Jonathan D. Hauenstein, Shaunak D. Bopardikar","submitted_at":"2018-01-31T02:51:31Z","abstract_excerpt":"We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper is to demonstrate the use of tools from numerical algebraic geometry, in particular, a numerical polynomial homotopy continuation method that guarantees to find all solutions of polynomial equations, in order to characterize the \\emph{global minima} for the coverage control problem. The results are then compared against a classic distributed approach involvi"},"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":"1801.10285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-31T02:51:31Z","cross_cats_sorted":["math.AG","math.OC"],"title_canon_sha256":"87b194f058df95d8819bfbacc439510e8f209a14413709352ddaaac3e13ea120","abstract_canon_sha256":"b3b7a9c56ff3a96022f4343059cd6652feceef0114dc8247ec8b1dfe0b66bfe4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:41.216588Z","signature_b64":"k4jjDb28Pmycj3hf1RkrhgJdVpDeCYbtimTRvpPm9R4M0iNzC2UjyBePZh++0kxxx6yTjfHq/zglleEri2uECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","last_reissued_at":"2026-05-18T00:24:41.216057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:41.216057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Configurations in Coverage Control with Polynomial Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG","math.OC"],"primary_cat":"cs.SY","authors_text":"Dhagash Mehta, Jonathan D. Hauenstein, Shaunak D. Bopardikar","submitted_at":"2018-01-31T02:51:31Z","abstract_excerpt":"We revisit the static coverage control problem for placement of vehicles with simple motion on the real line, under the assumption that the cost is a polynomial function of the locations of the vehicles. The main contribution of this paper is to demonstrate the use of tools from numerical algebraic geometry, in particular, a numerical polynomial homotopy continuation method that guarantees to find all solutions of polynomial equations, in order to characterize the \\emph{global minima} for the coverage control problem. The results are then compared against a classic distributed approach involvi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10285","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":"1801.10285","created_at":"2026-05-18T00:24:41.216136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10285v1","created_at":"2026-05-18T00:24:41.216136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10285","created_at":"2026-05-18T00:24:41.216136+00:00"},{"alias_kind":"pith_short_12","alias_value":"TB7KWALAWUPF","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"TB7KWALAWUPFPHBR","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"TB7KWALA","created_at":"2026-05-18T12:32:53.628368+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/TB7KWALAWUPFPHBRRZUIUX4GXB","json":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB.json","graph_json":"https://pith.science/api/pith-number/TB7KWALAWUPFPHBRRZUIUX4GXB/graph.json","events_json":"https://pith.science/api/pith-number/TB7KWALAWUPFPHBRRZUIUX4GXB/events.json","paper":"https://pith.science/paper/TB7KWALA"},"agent_actions":{"view_html":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB","download_json":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB.json","view_paper":"https://pith.science/paper/TB7KWALA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10285&json=true","fetch_graph":"https://pith.science/api/pith-number/TB7KWALAWUPFPHBRRZUIUX4GXB/graph.json","fetch_events":"https://pith.science/api/pith-number/TB7KWALAWUPFPHBRRZUIUX4GXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/action/storage_attestation","attest_author":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/action/author_attestation","sign_citation":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/action/citation_signature","submit_replication":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/action/replication_record"}},"created_at":"2026-05-18T00:24:41.216136+00:00","updated_at":"2026-05-18T00:24:41.216136+00:00"}