{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IUES4ADWZKTBFONL7JTN5EOCLC","short_pith_number":"pith:IUES4ADW","canonical_record":{"source":{"id":"1708.03055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-10T02:20:00Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"97aea1cf316941f3f6094e4eed2d72b6d65f6b9b0369fec006ff2cd9b2621773","abstract_canon_sha256":"a6878ff033e03c4720c26b9140d2e40485ef386d6dddf80ca6f400d5d177c130"},"schema_version":"1.0"},"canonical_sha256":"45092e0076caa612b9abfa66de91c258933cb525ceb2c0b2c3b1ab0822c3a1f5","source":{"kind":"arxiv","id":"1708.03055","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03055","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03055v1","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03055","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"pith_short_12","alias_value":"IUES4ADWZKTB","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUES4ADWZKTBFONL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUES4ADW","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IUES4ADWZKTBFONL7JTN5EOCLC","target":"record","payload":{"canonical_record":{"source":{"id":"1708.03055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-10T02:20:00Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"97aea1cf316941f3f6094e4eed2d72b6d65f6b9b0369fec006ff2cd9b2621773","abstract_canon_sha256":"a6878ff033e03c4720c26b9140d2e40485ef386d6dddf80ca6f400d5d177c130"},"schema_version":"1.0"},"canonical_sha256":"45092e0076caa612b9abfa66de91c258933cb525ceb2c0b2c3b1ab0822c3a1f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:15.067481Z","signature_b64":"vhz+7wGRgn2w3oS6bsWJ13sRbl2CdWbf74xEDzclxjLdG5OipY5w1Fufwu7QJaXCD9snf27SW/ZGNOSXL0nrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45092e0076caa612b9abfa66de91c258933cb525ceb2c0b2c3b1ab0822c3a1f5","last_reissued_at":"2026-05-18T00:38:15.066927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:15.066927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.03055","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:38:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bjrDBrsEtRSHOP/BRWbnpnvCMwFFXnurr/hPg+iHLg+UwC7mLTQ8AGbWluCvljiTyWje1ZitsNnbB533HfLLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:32:30.576745Z"},"content_sha256":"652f9aa839ff4fc666460e56e0597efa26812dc04f396e7ae9e6afcb1d740100","schema_version":"1.0","event_id":"sha256:652f9aa839ff4fc666460e56e0597efa26812dc04f396e7ae9e6afcb1d740100"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IUES4ADWZKTBFONL7JTN5EOCLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Control for Constrained Coverage Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.RO","authors_text":"Ankit Manerikar, Debasmit Das, Pranay Banerjee","submitted_at":"2017-08-10T02:20:00Z","abstract_excerpt":"The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the effects of variation of different parameters on the performance of the modified method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03055","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:38:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bXARht2EoJd7WvJzXgB6rlm6qntySyZNd/uXx4Chm/rvxIyu8Z/ybLh/70eCmx89Ordx7Ki4cpVv+KZpGOwCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:32:30.577461Z"},"content_sha256":"1670df80d4f2f7710f5a3c4b3cb65eaa0993b1cb2ace020bbf388045e5053288","schema_version":"1.0","event_id":"sha256:1670df80d4f2f7710f5a3c4b3cb65eaa0993b1cb2ace020bbf388045e5053288"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IUES4ADWZKTBFONL7JTN5EOCLC/bundle.json","state_url":"https://pith.science/pith/IUES4ADWZKTBFONL7JTN5EOCLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IUES4ADWZKTBFONL7JTN5EOCLC/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-07T14:32:30Z","links":{"resolver":"https://pith.science/pith/IUES4ADWZKTBFONL7JTN5EOCLC","bundle":"https://pith.science/pith/IUES4ADWZKTBFONL7JTN5EOCLC/bundle.json","state":"https://pith.science/pith/IUES4ADWZKTBFONL7JTN5EOCLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IUES4ADWZKTBFONL7JTN5EOCLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IUES4ADWZKTBFONL7JTN5EOCLC","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":"a6878ff033e03c4720c26b9140d2e40485ef386d6dddf80ca6f400d5d177c130","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-10T02:20:00Z","title_canon_sha256":"97aea1cf316941f3f6094e4eed2d72b6d65f6b9b0369fec006ff2cd9b2621773"},"schema_version":"1.0","source":{"id":"1708.03055","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.03055","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.03055v1","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.03055","created_at":"2026-05-18T00:38:15Z"},{"alias_kind":"pith_short_12","alias_value":"IUES4ADWZKTB","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IUES4ADWZKTBFONL","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IUES4ADW","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:1670df80d4f2f7710f5a3c4b3cb65eaa0993b1cb2ace020bbf388045e5053288","target":"graph","created_at":"2026-05-18T00:38:15Z","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":"The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the effects of variation of different parameters on the performance of the modified method.","authors_text":"Ankit Manerikar, Debasmit Das, Pranay Banerjee","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-10T02:20:00Z","title":"Optimal Control for Constrained Coverage Path Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.03055","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:652f9aa839ff4fc666460e56e0597efa26812dc04f396e7ae9e6afcb1d740100","target":"record","created_at":"2026-05-18T00:38:15Z","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":"a6878ff033e03c4720c26b9140d2e40485ef386d6dddf80ca6f400d5d177c130","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-08-10T02:20:00Z","title_canon_sha256":"97aea1cf316941f3f6094e4eed2d72b6d65f6b9b0369fec006ff2cd9b2621773"},"schema_version":"1.0","source":{"id":"1708.03055","kind":"arxiv","version":1}},"canonical_sha256":"45092e0076caa612b9abfa66de91c258933cb525ceb2c0b2c3b1ab0822c3a1f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45092e0076caa612b9abfa66de91c258933cb525ceb2c0b2c3b1ab0822c3a1f5","first_computed_at":"2026-05-18T00:38:15.066927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:15.066927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhz+7wGRgn2w3oS6bsWJ13sRbl2CdWbf74xEDzclxjLdG5OipY5w1Fufwu7QJaXCD9snf27SW/ZGNOSXL0nrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:15.067481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.03055","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:652f9aa839ff4fc666460e56e0597efa26812dc04f396e7ae9e6afcb1d740100","sha256:1670df80d4f2f7710f5a3c4b3cb65eaa0993b1cb2ace020bbf388045e5053288"],"state_sha256":"d2735b71589a8bd1e7facf3214c188967e1d2c742fd42deae79eba8d5fcbc802"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALwDRzB/bTFhUGlvAHxSK68XjRBTyK9SzEME703USRJk0UymQDYdTSD0h8b2zRRvMRyKZ0nu5+RlwdOeguVlCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:32:30.584016Z","bundle_sha256":"c56b0920dce4cd6db97442cad818653fad8e88a45b43b69a835172fc0ecaa0ec"}}