{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YE5WBDI3Z4AP4GX4DJ3Y37RLQS","short_pith_number":"pith:YE5WBDI3","canonical_record":{"source":{"id":"1809.04032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-11T17:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"c57d13527c23a42081ebf5e4d7aceb3a93cadf72780a9a0e5de1a4e8ace379ea","abstract_canon_sha256":"e75aace5e522def7a2f9f8ef42400e94ecad59359856fe23759f48ff3ff1e260"},"schema_version":"1.0"},"canonical_sha256":"c13b608d1bcf00fe1afc1a778dfe2b84812c0384c21eca7fecb59af525924bc7","source":{"kind":"arxiv","id":"1809.04032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04032","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04032v1","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04032","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"YE5WBDI3Z4AP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YE5WBDI3Z4AP4GX4","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YE5WBDI3","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YE5WBDI3Z4AP4GX4DJ3Y37RLQS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-11T17:00:02Z","cross_cats_sorted":[],"title_canon_sha256":"c57d13527c23a42081ebf5e4d7aceb3a93cadf72780a9a0e5de1a4e8ace379ea","abstract_canon_sha256":"e75aace5e522def7a2f9f8ef42400e94ecad59359856fe23759f48ff3ff1e260"},"schema_version":"1.0"},"canonical_sha256":"c13b608d1bcf00fe1afc1a778dfe2b84812c0384c21eca7fecb59af525924bc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:57.477430Z","signature_b64":"ILN6mHnJMtogO2hbGaUgkEZFckf9x5poRMcHzzKWsUp4YqYAZXvVqcdpxq2aNYTLpU0f2iwlkr7H4/n9MZMqBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c13b608d1bcf00fe1afc1a778dfe2b84812c0384c21eca7fecb59af525924bc7","last_reissued_at":"2026-05-18T00:05:57.476918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:57.476918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04032","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:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jMDQ670lFOyppd9bemlcxZ1tXSlIgKeDkk67jZSI04ONXniMjrPqcGid2qnMJ3W8O9l5n5pNxmbOgSYJGEn+CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:54:35.859492Z"},"content_sha256":"b0870ff3347a23a69793a1f560cf2914953679faf2014c112173f7bcfa7e8530","schema_version":"1.0","event_id":"sha256:b0870ff3347a23a69793a1f560cf2914953679faf2014c112173f7bcfa7e8530"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YE5WBDI3Z4AP4GX4DJ3Y37RLQS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resilient Active Target Tracking with Multiple Robots","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"George J. Pappas, Lifeng Zhou, Pratap Tokekar, Vasileios Tzoumas","submitted_at":"2018-09-11T17:00:02Z","abstract_excerpt":"The problem of target tracking with multiple robots consists of actively planning the motion of the robots to track the targets. A major challenge for practical deployments is to make the robots resilient to failures. In particular, robots may be attacked in adversarial scenarios, or their sensors may fail or get occluded. In this paper, we introduce planning algorithms for multi-target tracking that are resilient to such failures. In general, resilient target tracking is computationally hard. Contrary to the case where there are no failures, no scalable approximation algorithms are known for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04032","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:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ua/BwUmelWciTIn06K/62FXjciUVwcCO4/wfA03JKEoRJC7tg4l1qPCeZmM9MP1CC6pEQH5ti3W5GGWhzcPJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:54:35.859838Z"},"content_sha256":"f48ab273c6f177502566fe436a3c229518e9a04b436e87e8fd68b52da53c63f5","schema_version":"1.0","event_id":"sha256:f48ab273c6f177502566fe436a3c229518e9a04b436e87e8fd68b52da53c63f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/bundle.json","state_url":"https://pith.science/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/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-01T13:54:35Z","links":{"resolver":"https://pith.science/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS","bundle":"https://pith.science/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/bundle.json","state":"https://pith.science/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YE5WBDI3Z4AP4GX4DJ3Y37RLQS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YE5WBDI3Z4AP4GX4DJ3Y37RLQS","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":"e75aace5e522def7a2f9f8ef42400e94ecad59359856fe23759f48ff3ff1e260","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-11T17:00:02Z","title_canon_sha256":"c57d13527c23a42081ebf5e4d7aceb3a93cadf72780a9a0e5de1a4e8ace379ea"},"schema_version":"1.0","source":{"id":"1809.04032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04032","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04032v1","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04032","created_at":"2026-05-18T00:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"YE5WBDI3Z4AP","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YE5WBDI3Z4AP4GX4","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YE5WBDI3","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:f48ab273c6f177502566fe436a3c229518e9a04b436e87e8fd68b52da53c63f5","target":"graph","created_at":"2026-05-18T00:05:57Z","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":"The problem of target tracking with multiple robots consists of actively planning the motion of the robots to track the targets. A major challenge for practical deployments is to make the robots resilient to failures. In particular, robots may be attacked in adversarial scenarios, or their sensors may fail or get occluded. In this paper, we introduce planning algorithms for multi-target tracking that are resilient to such failures. In general, resilient target tracking is computationally hard. Contrary to the case where there are no failures, no scalable approximation algorithms are known for ","authors_text":"George J. Pappas, Lifeng Zhou, Pratap Tokekar, Vasileios Tzoumas","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-11T17:00:02Z","title":"Resilient Active Target Tracking with Multiple Robots"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04032","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:b0870ff3347a23a69793a1f560cf2914953679faf2014c112173f7bcfa7e8530","target":"record","created_at":"2026-05-18T00:05:57Z","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":"e75aace5e522def7a2f9f8ef42400e94ecad59359856fe23759f48ff3ff1e260","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-09-11T17:00:02Z","title_canon_sha256":"c57d13527c23a42081ebf5e4d7aceb3a93cadf72780a9a0e5de1a4e8ace379ea"},"schema_version":"1.0","source":{"id":"1809.04032","kind":"arxiv","version":1}},"canonical_sha256":"c13b608d1bcf00fe1afc1a778dfe2b84812c0384c21eca7fecb59af525924bc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c13b608d1bcf00fe1afc1a778dfe2b84812c0384c21eca7fecb59af525924bc7","first_computed_at":"2026-05-18T00:05:57.476918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:57.476918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILN6mHnJMtogO2hbGaUgkEZFckf9x5poRMcHzzKWsUp4YqYAZXvVqcdpxq2aNYTLpU0f2iwlkr7H4/n9MZMqBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:57.477430Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0870ff3347a23a69793a1f560cf2914953679faf2014c112173f7bcfa7e8530","sha256:f48ab273c6f177502566fe436a3c229518e9a04b436e87e8fd68b52da53c63f5"],"state_sha256":"1fcf872d2fbae995d3a7e69ddd4398f5514eea148c7e73577e9dddc189b86c5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"64qZQk7wjF9nDEgvWGOxh+Khkw3+KvOxrrKiAUkpq7d57FTq7gfzOQf9k/I55s7ESG/m2OW5kBQ1iIQ06HXBDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:54:35.862427Z","bundle_sha256":"f0003243510ad109d7f8030f7aefb83d8b36e96a7814da48b2df042c8512fefc"}}