{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ","short_pith_number":"pith:SM3HZ4JZ","canonical_record":{"source":{"id":"1710.00775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-02T16:49:24Z","cross_cats_sorted":[],"title_canon_sha256":"c3909d2c803d0607ccb788b88125e352870fe1295e66c5fb3148a62e0390c49a","abstract_canon_sha256":"3c594b21d462f735013ff1885f8d93e7551f0abe90c43f2e66687cf921901b22"},"schema_version":"1.0"},"canonical_sha256":"93367cf139e59f347f353c8e13f209c2681486ba0708e25388ce110dfd80fd7e","source":{"kind":"arxiv","id":"1710.00775","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00775","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00775v1","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00775","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"pith_short_12","alias_value":"SM3HZ4JZ4WPT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SM3HZ4JZ4WPTI7ZV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SM3HZ4JZ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.00775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-02T16:49:24Z","cross_cats_sorted":[],"title_canon_sha256":"c3909d2c803d0607ccb788b88125e352870fe1295e66c5fb3148a62e0390c49a","abstract_canon_sha256":"3c594b21d462f735013ff1885f8d93e7551f0abe90c43f2e66687cf921901b22"},"schema_version":"1.0"},"canonical_sha256":"93367cf139e59f347f353c8e13f209c2681486ba0708e25388ce110dfd80fd7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.826995Z","signature_b64":"lKQsPKTOoWrqkkAxRjrlNbcODz/eIL30MC7p9GjTlqGPb/FeV7oTc8MyhObvJFOu2gSA/P0MlPqQlyc/EqcBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93367cf139e59f347f353c8e13f209c2681486ba0708e25388ce110dfd80fd7e","last_reissued_at":"2026-05-18T00:33:53.826465Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.826465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.00775","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:33:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MeLIM4M4gXlrjxS6LmbZnI88CWaL5Bd0wF0SPyX6UYg2DmKYmt7PH7NTj0+TxuVRIov741X0dMSyQu3cccCCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:57:45.484952Z"},"content_sha256":"1ef06391b4acda555bdf4bbfe2e11d9d0ebfd0b26f74d3e4bed43d7ad357c3ca","schema_version":"1.0","event_id":"sha256:1ef06391b4acda555bdf4bbfe2e11d9d0ebfd0b26f74d3e4bed43d7ad357c3ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arnaud Labourel, Euripides Markou, Evangelos Kranakis, Jurek Czyzowicz, Maxime Godon","submitted_at":"2017-10-02T16:49:24Z","abstract_excerpt":"A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is successful if each node of the graph is visited before its deadline by a reliable robot. The edge weight corresponds to the time needed by a robot to traverse the edge. Given the number of robots which may crash, is it possible to design an algorithm, which will always guarantee the exploration, independently of the choice of the subset of unreliable robots by the adversary? We "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00775","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:33:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"va3zDSQa/cBRON7nWDXsVXWkSw4TsP2CgOazK0PfgazJODKRoCSWYhoBuHk5BAHiTBdhEidQsye3rVym5vS0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:57:45.485289Z"},"content_sha256":"18a9f280f0b74634a7b790e351e08d0a1b168b6cdc1ad326a925db34d8b4e0b6","schema_version":"1.0","event_id":"sha256:18a9f280f0b74634a7b790e351e08d0a1b168b6cdc1ad326a925db34d8b4e0b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/bundle.json","state_url":"https://pith.science/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/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-01T15:57:45Z","links":{"resolver":"https://pith.science/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ","bundle":"https://pith.science/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/bundle.json","state":"https://pith.science/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SM3HZ4JZ4WPTI7ZVHSHBH4QJYJ","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":"3c594b21d462f735013ff1885f8d93e7551f0abe90c43f2e66687cf921901b22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-02T16:49:24Z","title_canon_sha256":"c3909d2c803d0607ccb788b88125e352870fe1295e66c5fb3148a62e0390c49a"},"schema_version":"1.0","source":{"id":"1710.00775","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.00775","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"arxiv_version","alias_value":"1710.00775v1","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00775","created_at":"2026-05-18T00:33:53Z"},{"alias_kind":"pith_short_12","alias_value":"SM3HZ4JZ4WPT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SM3HZ4JZ4WPTI7ZV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SM3HZ4JZ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:18a9f280f0b74634a7b790e351e08d0a1b168b6cdc1ad326a925db34d8b4e0b6","target":"graph","created_at":"2026-05-18T00:33:53Z","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":"A graph environment must be explored by a collection of mobile robots. Some of the robots, a priori unknown, may turn out to be unreliable. The graph is weighted and each node is assigned a deadline. The exploration is successful if each node of the graph is visited before its deadline by a reliable robot. The edge weight corresponds to the time needed by a robot to traverse the edge. Given the number of robots which may crash, is it possible to design an algorithm, which will always guarantee the exploration, independently of the choice of the subset of unreliable robots by the adversary? We ","authors_text":"Arnaud Labourel, Euripides Markou, Evangelos Kranakis, Jurek Czyzowicz, Maxime Godon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-02T16:49:24Z","title":"Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00775","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:1ef06391b4acda555bdf4bbfe2e11d9d0ebfd0b26f74d3e4bed43d7ad357c3ca","target":"record","created_at":"2026-05-18T00:33:53Z","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":"3c594b21d462f735013ff1885f8d93e7551f0abe90c43f2e66687cf921901b22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-02T16:49:24Z","title_canon_sha256":"c3909d2c803d0607ccb788b88125e352870fe1295e66c5fb3148a62e0390c49a"},"schema_version":"1.0","source":{"id":"1710.00775","kind":"arxiv","version":1}},"canonical_sha256":"93367cf139e59f347f353c8e13f209c2681486ba0708e25388ce110dfd80fd7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93367cf139e59f347f353c8e13f209c2681486ba0708e25388ce110dfd80fd7e","first_computed_at":"2026-05-18T00:33:53.826465Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:33:53.826465Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lKQsPKTOoWrqkkAxRjrlNbcODz/eIL30MC7p9GjTlqGPb/FeV7oTc8MyhObvJFOu2gSA/P0MlPqQlyc/EqcBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:33:53.826995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.00775","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ef06391b4acda555bdf4bbfe2e11d9d0ebfd0b26f74d3e4bed43d7ad357c3ca","sha256:18a9f280f0b74634a7b790e351e08d0a1b168b6cdc1ad326a925db34d8b4e0b6"],"state_sha256":"09e5bb42743a3ade60816115c6d959ba27287e31a0f3475ec1dd87cc7a730ca0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HjR18EXk34v/192qf/C5V6kCNLqh5UT9Iz/Vq5CWdHiqz9OdcTXhTsCh/T6QYRut7dvQshndcrsKEZ3vPeLSBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:57:45.487135Z","bundle_sha256":"e2537b29db73cbded49da5f72791882c6b91edddaaf7b3e782a4ffe1dec3052e"}}