{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GWCTMWB2YR47G5K7R4WJWCHISA","short_pith_number":"pith:GWCTMWB2","canonical_record":{"source":{"id":"1611.08209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T15:06:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e669883d239155afb780c31bf685d4a0bccfbf4042fb110484061923e9e19f33","abstract_canon_sha256":"7ebce96e9de0f8ea05c8848a8b12fa66c134ab972b9acfa4032856ce884933a5"},"schema_version":"1.0"},"canonical_sha256":"358536583ac479f3755f8f2c9b08e8903635ce6d387fe0933d8c99c12d1c46d2","source":{"kind":"arxiv","id":"1611.08209","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08209","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08209v1","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08209","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"GWCTMWB2YR47","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GWCTMWB2YR47G5K7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GWCTMWB2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GWCTMWB2YR47G5K7R4WJWCHISA","target":"record","payload":{"canonical_record":{"source":{"id":"1611.08209","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T15:06:52Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e669883d239155afb780c31bf685d4a0bccfbf4042fb110484061923e9e19f33","abstract_canon_sha256":"7ebce96e9de0f8ea05c8848a8b12fa66c134ab972b9acfa4032856ce884933a5"},"schema_version":"1.0"},"canonical_sha256":"358536583ac479f3755f8f2c9b08e8903635ce6d387fe0933d8c99c12d1c46d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:43.994576Z","signature_b64":"Xm2KlHOtfDXvVV79tpqZVMNQmtmWmQGsyOxLzJJJopAd70nWa788im0dvIp7DcBOHNK6hwekLh5G2sHbQ7n1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"358536583ac479f3755f8f2c9b08e8903635ce6d387fe0933d8c99c12d1c46d2","last_reissued_at":"2026-05-18T00:56:43.993827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:43.993827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.08209","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:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6dt+FKu1QbTAvnXrHjUD0O+l+q7lN/HVXH9MiQrnrLMcXbS6OEEdL6pTMnLyBuQmOce6+XhTRWAypfDbHTHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:02:04.928296Z"},"content_sha256":"655dd740da2973bebf634a164c7e871e54d52caff123bdaf859e40974da16169","schema_version":"1.0","event_id":"sha256:655dd740da2973bebf634a164c7e871e54d52caff123bdaf859e40974da16169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GWCTMWB2YR47G5K7R4WJWCHISA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Search on a Line by Byzantine Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Danny Krizanc, Evangelos Kranakis, Jaroslav Opatrny, Jurek Czyzowicz, Konstantinos Georgiou, Lata Narayanan, Sunil Shende","submitted_at":"2016-11-24T15:06:52Z","abstract_excerpt":"We consider the problem of fault-tolerant parallel search on an infinite line by $n$ robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed $1$ and can communicate in wireless mode among themselves. However, among the $n$ robots, there are $f$ robots that exhibit {\\em byzantine faults}. A faulty robot can fail to report the target even after reaching it, or it can make malicious claims about having found the target when in fact it has not. Given the presence of such faulty robots, the search for the target can o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08209","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:56:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuEs7JwUkUoi4Avd1PZ5lN4NzkeX3CA4dAE+Fv5bLP7gwVJE9rDbBucn9u5jF3XmlAtbnKevRcG7f+QguWrQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T21:02:04.928649Z"},"content_sha256":"90f1286311d058bfb386fcc7a3d4dc19d4504ac5c8b48082230a6394baac04d6","schema_version":"1.0","event_id":"sha256:90f1286311d058bfb386fcc7a3d4dc19d4504ac5c8b48082230a6394baac04d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GWCTMWB2YR47G5K7R4WJWCHISA/bundle.json","state_url":"https://pith.science/pith/GWCTMWB2YR47G5K7R4WJWCHISA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GWCTMWB2YR47G5K7R4WJWCHISA/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-20T21:02:04Z","links":{"resolver":"https://pith.science/pith/GWCTMWB2YR47G5K7R4WJWCHISA","bundle":"https://pith.science/pith/GWCTMWB2YR47G5K7R4WJWCHISA/bundle.json","state":"https://pith.science/pith/GWCTMWB2YR47G5K7R4WJWCHISA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GWCTMWB2YR47G5K7R4WJWCHISA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GWCTMWB2YR47G5K7R4WJWCHISA","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":"7ebce96e9de0f8ea05c8848a8b12fa66c134ab972b9acfa4032856ce884933a5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T15:06:52Z","title_canon_sha256":"e669883d239155afb780c31bf685d4a0bccfbf4042fb110484061923e9e19f33"},"schema_version":"1.0","source":{"id":"1611.08209","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.08209","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"arxiv_version","alias_value":"1611.08209v1","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08209","created_at":"2026-05-18T00:56:43Z"},{"alias_kind":"pith_short_12","alias_value":"GWCTMWB2YR47","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GWCTMWB2YR47G5K7","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GWCTMWB2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:90f1286311d058bfb386fcc7a3d4dc19d4504ac5c8b48082230a6394baac04d6","target":"graph","created_at":"2026-05-18T00:56:43Z","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":"We consider the problem of fault-tolerant parallel search on an infinite line by $n$ robots. Starting from the origin, the robots are required to find a target at an unknown location. The robots can move with maximum speed $1$ and can communicate in wireless mode among themselves. However, among the $n$ robots, there are $f$ robots that exhibit {\\em byzantine faults}. A faulty robot can fail to report the target even after reaching it, or it can make malicious claims about having found the target when in fact it has not. Given the presence of such faulty robots, the search for the target can o","authors_text":"Danny Krizanc, Evangelos Kranakis, Jaroslav Opatrny, Jurek Czyzowicz, Konstantinos Georgiou, Lata Narayanan, Sunil Shende","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T15:06:52Z","title":"Search on a Line by Byzantine Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08209","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:655dd740da2973bebf634a164c7e871e54d52caff123bdaf859e40974da16169","target":"record","created_at":"2026-05-18T00:56:43Z","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":"7ebce96e9de0f8ea05c8848a8b12fa66c134ab972b9acfa4032856ce884933a5","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T15:06:52Z","title_canon_sha256":"e669883d239155afb780c31bf685d4a0bccfbf4042fb110484061923e9e19f33"},"schema_version":"1.0","source":{"id":"1611.08209","kind":"arxiv","version":1}},"canonical_sha256":"358536583ac479f3755f8f2c9b08e8903635ce6d387fe0933d8c99c12d1c46d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"358536583ac479f3755f8f2c9b08e8903635ce6d387fe0933d8c99c12d1c46d2","first_computed_at":"2026-05-18T00:56:43.993827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:43.993827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xm2KlHOtfDXvVV79tpqZVMNQmtmWmQGsyOxLzJJJopAd70nWa788im0dvIp7DcBOHNK6hwekLh5G2sHbQ7n1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:43.994576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.08209","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:655dd740da2973bebf634a164c7e871e54d52caff123bdaf859e40974da16169","sha256:90f1286311d058bfb386fcc7a3d4dc19d4504ac5c8b48082230a6394baac04d6"],"state_sha256":"078762e34c1271c9a08a9fbed551bc1c00a79c60fcaa74d84a1dc2d81ff65792"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c41V3CD0G+UDPsejK5h3GkDlGKFpjtEccrVv6xDOWjyhhuSk+Nri1s28B4wfehPUGegt090rx79dXRBu4omDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T21:02:04.930522Z","bundle_sha256":"353dc9b068425058b2e856c66a4298fd3f8cdf9c633c2e0e39a04e7976b4dba4"}}