{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TB7KWALAWUPFPHBRRZUIUX4GXB","short_pith_number":"pith:TB7KWALA","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"},"canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","source":{"kind":"arxiv","id":"1801.10285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10285","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10285v1","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10285","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"TB7KWALAWUPF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TB7KWALAWUPFPHBR","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TB7KWALA","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TB7KWALAWUPFPHBRRZUIUX4GXB","target":"record","payload":{"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"},"canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","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"},"source_kind":"arxiv","source_id":"1801.10285","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-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zlAT4v7mm3IAsJNX5tUq8LTndMY7/nMjMxToBPoHRN2wYPmXpJvB6IxQ30nI7ae1nmEnuovdIjjICWP3MS80Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:52:25.538552Z"},"content_sha256":"99ba26caa1f8e15178fc73e511af924b361512b331707c1d4927d323f7edc5db","schema_version":"1.0","event_id":"sha256:99ba26caa1f8e15178fc73e511af924b361512b331707c1d4927d323f7edc5db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TB7KWALAWUPFPHBRRZUIUX4GXB","target":"graph","payload":{"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"},"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-18T00:24:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7JTzWCZdxmWoWpurN1vmZm+VYR8Pit5PvyBR3IAIx0M0i0E9jEODnAtzT2P7mFLxehR9beGSwoN9Om2NT7wGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:52:25.539220Z"},"content_sha256":"15216c59e35a7b3403863df775329806514107086822b59976f64230c7bf5bd0","schema_version":"1.0","event_id":"sha256:15216c59e35a7b3403863df775329806514107086822b59976f64230c7bf5bd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/bundle.json","state_url":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/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-05-27T07:52:25Z","links":{"resolver":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB","bundle":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/bundle.json","state":"https://pith.science/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TB7KWALAWUPFPHBRRZUIUX4GXB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TB7KWALAWUPFPHBRRZUIUX4GXB","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":"b3b7a9c56ff3a96022f4343059cd6652feceef0114dc8247ec8b1dfe0b66bfe4","cross_cats_sorted":["math.AG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-31T02:51:31Z","title_canon_sha256":"87b194f058df95d8819bfbacc439510e8f209a14413709352ddaaac3e13ea120"},"schema_version":"1.0","source":{"id":"1801.10285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.10285","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"arxiv_version","alias_value":"1801.10285v1","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10285","created_at":"2026-05-18T00:24:41Z"},{"alias_kind":"pith_short_12","alias_value":"TB7KWALAWUPF","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"TB7KWALAWUPFPHBR","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"TB7KWALA","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:15216c59e35a7b3403863df775329806514107086822b59976f64230c7bf5bd0","target":"graph","created_at":"2026-05-18T00:24:41Z","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":"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","authors_text":"Dhagash Mehta, Jonathan D. Hauenstein, Shaunak D. Bopardikar","cross_cats":["math.AG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-31T02:51:31Z","title":"Optimal Configurations in Coverage Control with Polynomial Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10285","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:99ba26caa1f8e15178fc73e511af924b361512b331707c1d4927d323f7edc5db","target":"record","created_at":"2026-05-18T00:24:41Z","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":"b3b7a9c56ff3a96022f4343059cd6652feceef0114dc8247ec8b1dfe0b66bfe4","cross_cats_sorted":["math.AG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-01-31T02:51:31Z","title_canon_sha256":"87b194f058df95d8819bfbacc439510e8f209a14413709352ddaaac3e13ea120"},"schema_version":"1.0","source":{"id":"1801.10285","kind":"arxiv","version":1}},"canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"987eab0160b51e579c318e688a5f86b87b3312bec88c2e226b7d2af694d7e8a0","first_computed_at":"2026-05-18T00:24:41.216057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:41.216057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k4jjDb28Pmycj3hf1RkrhgJdVpDeCYbtimTRvpPm9R4M0iNzC2UjyBePZh++0kxxx6yTjfHq/zglleEri2uECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:41.216588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.10285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99ba26caa1f8e15178fc73e511af924b361512b331707c1d4927d323f7edc5db","sha256:15216c59e35a7b3403863df775329806514107086822b59976f64230c7bf5bd0"],"state_sha256":"b8d6962bb22711b4c9f9b851e8d515bfb10ab4118490c5def5a867b0f44db83d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JAAISZGGZiCGeryBat+yvtqkZl/UqqfB2Jj0DV93808YVzWtJXymVJiL8r59rKrszdUbxECiHRY05O6uGs6kDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:52:25.542567Z","bundle_sha256":"58014f8fd547d291749b8f7a5a536d6c290a8cc62c4ef6a92f186eed7a7d9271"}}