{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4ENXBQPROOXN5WC5ADJLQKAKXK","short_pith_number":"pith:4ENXBQPR","canonical_record":{"source":{"id":"1708.07285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-24T05:58:28Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"b6c1a3e7f4fae69ef3cb98e3410e9f818e00657762cb22fb09f57d78c153034e","abstract_canon_sha256":"f3346ed411f8fbb7feb519a95dccc4d9551b9ea50cecd5fa282bfe2ee1de01a0"},"schema_version":"1.0"},"canonical_sha256":"e11b70c1f173aeded85d00d2b8280aba9380f8ef2f88a2d5a5a10fc5af51fe89","source":{"kind":"arxiv","id":"1708.07285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07285","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07285v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07285","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"4ENXBQPROOXN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ENXBQPROOXN5WC5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ENXBQPR","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4ENXBQPROOXN5WC5ADJLQKAKXK","target":"record","payload":{"canonical_record":{"source":{"id":"1708.07285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-24T05:58:28Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"b6c1a3e7f4fae69ef3cb98e3410e9f818e00657762cb22fb09f57d78c153034e","abstract_canon_sha256":"f3346ed411f8fbb7feb519a95dccc4d9551b9ea50cecd5fa282bfe2ee1de01a0"},"schema_version":"1.0"},"canonical_sha256":"e11b70c1f173aeded85d00d2b8280aba9380f8ef2f88a2d5a5a10fc5af51fe89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:46.688191Z","signature_b64":"/TZGtVln5kDGCDm+kEs90NnIyTlGi6K+QpIt3/Cq6vHpIL7eL9QNZHEWSXxhXVMCHOmWLCyhhArR2CDhTQRPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e11b70c1f173aeded85d00d2b8280aba9380f8ef2f88a2d5a5a10fc5af51fe89","last_reissued_at":"2026-05-18T00:36:46.687614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:46.687614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.07285","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EET+GoYmeJ7ClCgv+0k9UrL3DsjK3NnXxvEzjnrt/2O6cnKfElyRmPG7KGN/9x8jN6hFahS0b5aJ8GT1xgRzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:26:48.310396Z"},"content_sha256":"87e2772a871fddd104c761197d538cf6277ed72f68a4bfc499fe76b97b5215e4","schema_version":"1.0","event_id":"sha256:87e2772a871fddd104c761197d538cf6277ed72f68a4bfc499fe76b97b5215e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4ENXBQPROOXN5WC5ADJLQKAKXK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.AI","authors_text":"Marika Ivanov\\'a, Pavel Surynek","submitted_at":"2017-08-24T05:58:28Z","abstract_excerpt":"We address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most one agent can occupy a vertex; and they can move into adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim of one team - attackers - is to invade into given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers by occupying selected vertices. We study strategies for al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07285","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:36:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xcW3c23J27Vwkx+sRB1gJ9y+3DlXD1Sv+66s5ANvY1Av0Y8yDmSzKfY4zCQD0Qg7UVbrA8FojE9d5yDtThATCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:26:48.310851Z"},"content_sha256":"4d5a1c41b3e0f651183ef60a02736fbb92d63685befd4d5efc1add4076d95bd5","schema_version":"1.0","event_id":"sha256:4d5a1c41b3e0f651183ef60a02736fbb92d63685befd4d5efc1add4076d95bd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/bundle.json","state_url":"https://pith.science/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/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-05-27T23:26:48Z","links":{"resolver":"https://pith.science/pith/4ENXBQPROOXN5WC5ADJLQKAKXK","bundle":"https://pith.science/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/bundle.json","state":"https://pith.science/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ENXBQPROOXN5WC5ADJLQKAKXK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4ENXBQPROOXN5WC5ADJLQKAKXK","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":"f3346ed411f8fbb7feb519a95dccc4d9551b9ea50cecd5fa282bfe2ee1de01a0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-24T05:58:28Z","title_canon_sha256":"b6c1a3e7f4fae69ef3cb98e3410e9f818e00657762cb22fb09f57d78c153034e"},"schema_version":"1.0","source":{"id":"1708.07285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.07285","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"arxiv_version","alias_value":"1708.07285v1","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07285","created_at":"2026-05-18T00:36:46Z"},{"alias_kind":"pith_short_12","alias_value":"4ENXBQPROOXN","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4ENXBQPROOXN5WC5","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4ENXBQPR","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:4d5a1c41b3e0f651183ef60a02736fbb92d63685befd4d5efc1add4076d95bd5","target":"graph","created_at":"2026-05-18T00:36:46Z","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 address a problem of area protection in graph-based scenarios with multiple agents. The problem consists of two adversarial teams of agents that move in an undirected graph shared by both teams. Agents are placed in vertices of the graph; at most one agent can occupy a vertex; and they can move into adjacent vertices in a conflict free way. Teams have asymmetric goals: the aim of one team - attackers - is to invade into given area while the aim of the opponent team - defenders - is to protect the area from being entered by attackers by occupying selected vertices. We study strategies for al","authors_text":"Marika Ivanov\\'a, Pavel Surynek","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-24T05:58:28Z","title":"Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07285","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:87e2772a871fddd104c761197d538cf6277ed72f68a4bfc499fe76b97b5215e4","target":"record","created_at":"2026-05-18T00:36:46Z","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":"f3346ed411f8fbb7feb519a95dccc4d9551b9ea50cecd5fa282bfe2ee1de01a0","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-08-24T05:58:28Z","title_canon_sha256":"b6c1a3e7f4fae69ef3cb98e3410e9f818e00657762cb22fb09f57d78c153034e"},"schema_version":"1.0","source":{"id":"1708.07285","kind":"arxiv","version":1}},"canonical_sha256":"e11b70c1f173aeded85d00d2b8280aba9380f8ef2f88a2d5a5a10fc5af51fe89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e11b70c1f173aeded85d00d2b8280aba9380f8ef2f88a2d5a5a10fc5af51fe89","first_computed_at":"2026-05-18T00:36:46.687614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:46.687614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/TZGtVln5kDGCDm+kEs90NnIyTlGi6K+QpIt3/Cq6vHpIL7eL9QNZHEWSXxhXVMCHOmWLCyhhArR2CDhTQRPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:46.688191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.07285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87e2772a871fddd104c761197d538cf6277ed72f68a4bfc499fe76b97b5215e4","sha256:4d5a1c41b3e0f651183ef60a02736fbb92d63685befd4d5efc1add4076d95bd5"],"state_sha256":"1416281414a9e55292a60c40c21d9766457c706e1607f36a155fdba0776d4ef6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LM/wB0Au1d0Xj+/HC7AeS4LdxUcua9YfesP1L+FNVx+ZvSgWJc+xROdbhNgSrLN9qvcmsBpVGZDHfoPcRC4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:26:48.314173Z","bundle_sha256":"db2ab15b399e749a76aad8d2a447a5071b545202614f06afb165f05a43b78021"}}