{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:A6YGXRYV2JVLOTABPJ2CEE54PU","short_pith_number":"pith:A6YGXRYV","canonical_record":{"source":{"id":"1609.07038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-22T15:55:14Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"6bbd9b2804feb3bccfac0f88b3eedfb4512565ac14e55a2b43749588f64476df","abstract_canon_sha256":"60480d7d22fd62ef521fa539ee8c3af13898007e733a48c07e95bb192e31f69d"},"schema_version":"1.0"},"canonical_sha256":"07b06bc715d26ab74c017a742213bc7d3b9a412a141e852c58545e1d194cb9c4","source":{"kind":"arxiv","id":"1609.07038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07038","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07038v1","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07038","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"A6YGXRYV2JVL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A6YGXRYV2JVLOTAB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A6YGXRYV","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:A6YGXRYV2JVLOTABPJ2CEE54PU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-22T15:55:14Z","cross_cats_sorted":["cs.RO","cs.SY"],"title_canon_sha256":"6bbd9b2804feb3bccfac0f88b3eedfb4512565ac14e55a2b43749588f64476df","abstract_canon_sha256":"60480d7d22fd62ef521fa539ee8c3af13898007e733a48c07e95bb192e31f69d"},"schema_version":"1.0"},"canonical_sha256":"07b06bc715d26ab74c017a742213bc7d3b9a412a141e852c58545e1d194cb9c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:04.578619Z","signature_b64":"0AGNXb/B+0IFjyVJxkICRSCyAjQ+tpWtYszzPdV0DfI88tTeTd55eTnyV2IlI2Ssv12NRKv3a2hxDmcHk9MqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07b06bc715d26ab74c017a742213bc7d3b9a412a141e852c58545e1d194cb9c4","last_reissued_at":"2026-05-18T01:04:04.578167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:04.578167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07038","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-18T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9V+JtUe9tdZyAzZdCX/xhQS1PzgQnK0mGyL/bJd+H0odJRdhdFAvKGVVum1Kjuh9O2HhpCP34SHaz63ZQAkzAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:32.624491Z"},"content_sha256":"d1661a389d53c4db4744645d430d2bb331f6da8a9038ef24583036d504584179","schema_version":"1.0","event_id":"sha256:d1661a389d53c4db4744645d430d2bb331f6da8a9038ef24583036d504584179"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:A6YGXRYV2JVLOTABPJ2CEE54PU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Intermittent Communication Control and Path Optimization in Networks of Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO","cs.SY"],"primary_cat":"cs.MA","authors_text":"Michael M. Zavlanos, Yiannis Kantaros","submitted_at":"2016-09-22T15:55:14Z","abstract_excerpt":"In this paper, we propose an intermittent communication framework for mobile robot networks. Specifically, we consider robots that move along the edges of a connected mobility graph and communicate only when they meet at the nodes of that graph giving rise to a dynamic communication network. Our proposed distributed controllers ensure intermittent connectivity of the network and path optimization, simultaneously. We show that the intermittent connectivity requirement can be encapsulated by a global Linear Temporal Logic (LTL) formula. Then we approximately decompose it into local LTL expressio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07038","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-18T01:04:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/YrzwmOcio0jhNRVEk8tKeP7KM85ZyvIVu+xcYblgBVpES9zZVc57D3fENIrPn7uemxLnj1RsigvUWdYM6FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:11:32.625203Z"},"content_sha256":"2c8fe095a5794b1d9d0044420054888798ead5b2fe22085d61473cb7bd78fe88","schema_version":"1.0","event_id":"sha256:2c8fe095a5794b1d9d0044420054888798ead5b2fe22085d61473cb7bd78fe88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/bundle.json","state_url":"https://pith.science/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/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-10T04:11:32Z","links":{"resolver":"https://pith.science/pith/A6YGXRYV2JVLOTABPJ2CEE54PU","bundle":"https://pith.science/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/bundle.json","state":"https://pith.science/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6YGXRYV2JVLOTABPJ2CEE54PU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:A6YGXRYV2JVLOTABPJ2CEE54PU","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":"60480d7d22fd62ef521fa539ee8c3af13898007e733a48c07e95bb192e31f69d","cross_cats_sorted":["cs.RO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-22T15:55:14Z","title_canon_sha256":"6bbd9b2804feb3bccfac0f88b3eedfb4512565ac14e55a2b43749588f64476df"},"schema_version":"1.0","source":{"id":"1609.07038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07038","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07038v1","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07038","created_at":"2026-05-18T01:04:04Z"},{"alias_kind":"pith_short_12","alias_value":"A6YGXRYV2JVL","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"A6YGXRYV2JVLOTAB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"A6YGXRYV","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:2c8fe095a5794b1d9d0044420054888798ead5b2fe22085d61473cb7bd78fe88","target":"graph","created_at":"2026-05-18T01:04:04Z","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":"In this paper, we propose an intermittent communication framework for mobile robot networks. Specifically, we consider robots that move along the edges of a connected mobility graph and communicate only when they meet at the nodes of that graph giving rise to a dynamic communication network. Our proposed distributed controllers ensure intermittent connectivity of the network and path optimization, simultaneously. We show that the intermittent connectivity requirement can be encapsulated by a global Linear Temporal Logic (LTL) formula. Then we approximately decompose it into local LTL expressio","authors_text":"Michael M. Zavlanos, Yiannis Kantaros","cross_cats":["cs.RO","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-22T15:55:14Z","title":"Simultaneous Intermittent Communication Control and Path Optimization in Networks of Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07038","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:d1661a389d53c4db4744645d430d2bb331f6da8a9038ef24583036d504584179","target":"record","created_at":"2026-05-18T01:04:04Z","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":"60480d7d22fd62ef521fa539ee8c3af13898007e733a48c07e95bb192e31f69d","cross_cats_sorted":["cs.RO","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2016-09-22T15:55:14Z","title_canon_sha256":"6bbd9b2804feb3bccfac0f88b3eedfb4512565ac14e55a2b43749588f64476df"},"schema_version":"1.0","source":{"id":"1609.07038","kind":"arxiv","version":1}},"canonical_sha256":"07b06bc715d26ab74c017a742213bc7d3b9a412a141e852c58545e1d194cb9c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07b06bc715d26ab74c017a742213bc7d3b9a412a141e852c58545e1d194cb9c4","first_computed_at":"2026-05-18T01:04:04.578167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:04.578167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0AGNXb/B+0IFjyVJxkICRSCyAjQ+tpWtYszzPdV0DfI88tTeTd55eTnyV2IlI2Ssv12NRKv3a2hxDmcHk9MqAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:04.578619Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1661a389d53c4db4744645d430d2bb331f6da8a9038ef24583036d504584179","sha256:2c8fe095a5794b1d9d0044420054888798ead5b2fe22085d61473cb7bd78fe88"],"state_sha256":"71f56047be574051a619284c9def096073bf967614f8de1d287831156be56166"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWOPt3upuCE4Xp1DYP4ux4LRQfG2XMNE08X+jMBojs37+BNk4n9VzQ+UV+YuBMPeN6/FMYAZfANyyYk4wuASCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:11:32.629291Z","bundle_sha256":"2f392bb39222d95fedbab6fb97f3de827412664a941e20ba09f33c23492dfe62"}}