{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BNEEFP6WTG4J74P3FWZJJSOG4I","short_pith_number":"pith:BNEEFP6W","schema_version":"1.0","canonical_sha256":"0b4842bfd699b89ff1fb2db294c9c6e21e1030346d2f14539366edc1d1258424","source":{"kind":"arxiv","id":"1707.07083","version":1},"attestation_state":"computed","paper":{"title":"Computing the $k$-resilience of a Synchronized Multi-Robot System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez, Luis-Evaristo Caraballo, Mario A. Lopez, Sergey Bereg","submitted_at":"2017-07-22T01:40:38Z","abstract_excerpt":"We study an optimization problem that arises in the design of covering strategies for multi-robot systems. Consider a team of $n$ cooperating robots traveling along predetermined closed and disjoint trajectories. Each robot needs to periodically communicate information to nearby robots. At places where two trajectories are within range of each other, a communication link is established, allowing two robots to exchange information, provided they are \"synchronized\", i.e., they visit the link at the same time. In this setting a communication graph is defined and a system of robots is called \\emph"},"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":"1707.07083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-07-22T01:40:38Z","cross_cats_sorted":[],"title_canon_sha256":"79ee58190c699e62e04e0a516df69d15cfc5ae29439d77c0217342a42a72a333","abstract_canon_sha256":"13d55621c20cde4853addce22762bad5497c5ac1e6ebaa08da0dce892df0fe8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:45.402313Z","signature_b64":"c1rWckhiXosRuEfV6U70nd5B7fR0oywdcQWimzuITxwL6+tGjFP203/NwpBqWZD+sU0e5JNpSVe9NpBjAd+gAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b4842bfd699b89ff1fb2db294c9c6e21e1030346d2f14539366edc1d1258424","last_reissued_at":"2026-05-18T00:39:45.401732Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:45.401732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the $k$-resilience of a Synchronized Multi-Robot System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez, Luis-Evaristo Caraballo, Mario A. Lopez, Sergey Bereg","submitted_at":"2017-07-22T01:40:38Z","abstract_excerpt":"We study an optimization problem that arises in the design of covering strategies for multi-robot systems. Consider a team of $n$ cooperating robots traveling along predetermined closed and disjoint trajectories. Each robot needs to periodically communicate information to nearby robots. At places where two trajectories are within range of each other, a communication link is established, allowing two robots to exchange information, provided they are \"synchronized\", i.e., they visit the link at the same time. In this setting a communication graph is defined and a system of robots is called \\emph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07083","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":"1707.07083","created_at":"2026-05-18T00:39:45.401819+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.07083v1","created_at":"2026-05-18T00:39:45.401819+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07083","created_at":"2026-05-18T00:39:45.401819+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNEEFP6WTG4J","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNEEFP6WTG4J74P3","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNEEFP6W","created_at":"2026-05-18T12:31:08.081275+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/BNEEFP6WTG4J74P3FWZJJSOG4I","json":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I.json","graph_json":"https://pith.science/api/pith-number/BNEEFP6WTG4J74P3FWZJJSOG4I/graph.json","events_json":"https://pith.science/api/pith-number/BNEEFP6WTG4J74P3FWZJJSOG4I/events.json","paper":"https://pith.science/paper/BNEEFP6W"},"agent_actions":{"view_html":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I","download_json":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I.json","view_paper":"https://pith.science/paper/BNEEFP6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.07083&json=true","fetch_graph":"https://pith.science/api/pith-number/BNEEFP6WTG4J74P3FWZJJSOG4I/graph.json","fetch_events":"https://pith.science/api/pith-number/BNEEFP6WTG4J74P3FWZJJSOG4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I/action/storage_attestation","attest_author":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I/action/author_attestation","sign_citation":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I/action/citation_signature","submit_replication":"https://pith.science/pith/BNEEFP6WTG4J74P3FWZJJSOG4I/action/replication_record"}},"created_at":"2026-05-18T00:39:45.401819+00:00","updated_at":"2026-05-18T00:39:45.401819+00:00"}