{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AGXBOTUPFPP2TUNGJTRTACC5Y3","short_pith_number":"pith:AGXBOTUP","canonical_record":{"source":{"id":"1505.06379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-23T20:57:58Z","cross_cats_sorted":["cs.GT","cs.MA","cs.RO","math.OC"],"title_canon_sha256":"77edf9aa2dbaa07ba65b104197685e89ea5ca2dd28d681afb0c12f0024b6e6f6","abstract_canon_sha256":"586ebb96168a366d8fefdd1c9716891a3cf01037427c947eab38747d6f45ae1a"},"schema_version":"1.0"},"canonical_sha256":"01ae174e8f2bdfa9d1a64ce330085dc6dcff95648ca03ac07af3e50e3cfd9dc7","source":{"kind":"arxiv","id":"1505.06379","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06379","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06379v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06379","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"AGXBOTUPFPP2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGXBOTUPFPP2TUNG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGXBOTUP","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AGXBOTUPFPP2TUNGJTRTACC5Y3","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06379","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-23T20:57:58Z","cross_cats_sorted":["cs.GT","cs.MA","cs.RO","math.OC"],"title_canon_sha256":"77edf9aa2dbaa07ba65b104197685e89ea5ca2dd28d681afb0c12f0024b6e6f6","abstract_canon_sha256":"586ebb96168a366d8fefdd1c9716891a3cf01037427c947eab38747d6f45ae1a"},"schema_version":"1.0"},"canonical_sha256":"01ae174e8f2bdfa9d1a64ce330085dc6dcff95648ca03ac07af3e50e3cfd9dc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:41.794209Z","signature_b64":"A9Rn1lQGcReFjMOFvvpWPDG+22cLJnUX/wOsevyCB3OII+rMS2h+SkyKQwYHjBw1YAjBCMYC5EsVorsWUbuOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01ae174e8f2bdfa9d1a64ce330085dc6dcff95648ca03ac07af3e50e3cfd9dc7","last_reissued_at":"2026-05-18T01:21:41.793790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:41.793790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06379","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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iT+9XDdFQ79IzHOl+KNLsdmZ9kpoauTSuO6k6FaW/vaJvXv/nZrsg6BIDCkYKvNVHYmWRcMskawzXac+A4USAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:42:07.668824Z"},"content_sha256":"9d64ee340e5bcf6b454edd703e7e3a731540250e9f870d19f6710534f43cdb02","schema_version":"1.0","event_id":"sha256:9d64ee340e5bcf6b454edd703e7e3a731540250e9f870d19f6710534f43cdb02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AGXBOTUPFPP2TUNGJTRTACC5Y3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Communication-Free Distributed Coverage for Networked Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.MA","cs.RO","math.OC"],"primary_cat":"cs.SY","authors_text":"A. Yasin Yazicioglu, Jeff S. Shamma, Magnus Egerstedt","submitted_at":"2015-05-23T20:57:58Z","abstract_excerpt":"In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game theoretic setting and propose a communic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06379","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:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"heu8GGwn/e1dlUfCeW8y47MAQZ4cxoNuF0VueeE+tCqwM86qUEe1f/RgHc4nLXZhj9eClsAsFAOl5DeLEGM0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:42:07.669178Z"},"content_sha256":"05522a6c629c9c30478ee89b8a8bde60e4e2da96b9d72c8f5597bfd11c0fdc15","schema_version":"1.0","event_id":"sha256:05522a6c629c9c30478ee89b8a8bde60e4e2da96b9d72c8f5597bfd11c0fdc15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/bundle.json","state_url":"https://pith.science/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/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-05T10:42:07Z","links":{"resolver":"https://pith.science/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3","bundle":"https://pith.science/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/bundle.json","state":"https://pith.science/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGXBOTUPFPP2TUNGJTRTACC5Y3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AGXBOTUPFPP2TUNGJTRTACC5Y3","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":"586ebb96168a366d8fefdd1c9716891a3cf01037427c947eab38747d6f45ae1a","cross_cats_sorted":["cs.GT","cs.MA","cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-23T20:57:58Z","title_canon_sha256":"77edf9aa2dbaa07ba65b104197685e89ea5ca2dd28d681afb0c12f0024b6e6f6"},"schema_version":"1.0","source":{"id":"1505.06379","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06379","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06379v1","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06379","created_at":"2026-05-18T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"AGXBOTUPFPP2","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGXBOTUPFPP2TUNG","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGXBOTUP","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:05522a6c629c9c30478ee89b8a8bde60e4e2da96b9d72c8f5597bfd11c0fdc15","target":"graph","created_at":"2026-05-18T01:21: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":"In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game theoretic setting and propose a communic","authors_text":"A. Yasin Yazicioglu, Jeff S. Shamma, Magnus Egerstedt","cross_cats":["cs.GT","cs.MA","cs.RO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-23T20:57:58Z","title":"Communication-Free Distributed Coverage for Networked Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06379","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:9d64ee340e5bcf6b454edd703e7e3a731540250e9f870d19f6710534f43cdb02","target":"record","created_at":"2026-05-18T01:21: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":"586ebb96168a366d8fefdd1c9716891a3cf01037427c947eab38747d6f45ae1a","cross_cats_sorted":["cs.GT","cs.MA","cs.RO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-05-23T20:57:58Z","title_canon_sha256":"77edf9aa2dbaa07ba65b104197685e89ea5ca2dd28d681afb0c12f0024b6e6f6"},"schema_version":"1.0","source":{"id":"1505.06379","kind":"arxiv","version":1}},"canonical_sha256":"01ae174e8f2bdfa9d1a64ce330085dc6dcff95648ca03ac07af3e50e3cfd9dc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01ae174e8f2bdfa9d1a64ce330085dc6dcff95648ca03ac07af3e50e3cfd9dc7","first_computed_at":"2026-05-18T01:21:41.793790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:41.793790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A9Rn1lQGcReFjMOFvvpWPDG+22cLJnUX/wOsevyCB3OII+rMS2h+SkyKQwYHjBw1YAjBCMYC5EsVorsWUbuOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:41.794209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06379","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d64ee340e5bcf6b454edd703e7e3a731540250e9f870d19f6710534f43cdb02","sha256:05522a6c629c9c30478ee89b8a8bde60e4e2da96b9d72c8f5597bfd11c0fdc15"],"state_sha256":"74381dd5cf62db5757dd932d8974e3d6c5e65532d99fc5379c3d9dd016ef6d4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuG5C3nuaamsB8NWAd0zb5p/+ryKXc9zOLHa2zwlG06yfik9em126gI4yLW5nuUVLr3SzYb3RdvlsFf9wzyKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:42:07.671175Z","bundle_sha256":"d2e79c635a19765230127a189c7fec1aeabec487286a6b1124c32ec3c3647c65"}}