{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:5Z7D6X7CFWGGSALTS2RGWOBWUR","short_pith_number":"pith:5Z7D6X7C","schema_version":"1.0","canonical_sha256":"ee7e3f5fe22d8c69017396a26b3836a479820bb8f178ba9d8b86d1c0632faa41","source":{"kind":"arxiv","id":"1709.01070","version":1},"attestation_state":"computed","paper":{"title":"Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Diep Thi Ngoc Nguyen, Marika Ivanov\\'a, Pavel Surynek","submitted_at":"2017-09-04T07:38:17Z","abstract_excerpt":"We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. 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 b"},"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":"1709.01070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-09-04T07:38:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"b696b3dc7b391416808618b1751d6195ae2c1a43f33fde592087afadfa7f89f0","abstract_canon_sha256":"d3452ec6ab577f80d60a36d3ec366947c5c45e799024947fcb28bb4706848a0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:00.953923Z","signature_b64":"6o/8YRBYT8VPWVWurZuDpt3zgBAlw0RS9k4JWy6tNKzPQARbjtqVXHjR4oz6SHkROhnaBSyPy6dpzJAMCjeyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee7e3f5fe22d8c69017396a26b3836a479820bb8f178ba9d8b86d1c0632faa41","last_reissued_at":"2026-05-18T00:36:00.953496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:00.953496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.MA","authors_text":"Diep Thi Ngoc Nguyen, Marika Ivanov\\'a, Pavel Surynek","submitted_at":"2017-09-04T07:38:17Z","abstract_excerpt":"We address a problem of area protection in graph-based scenarios with multiple mobile agents where connectivity is maintained among agents to ensure they can communicate. 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 b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01070","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":"1709.01070","created_at":"2026-05-18T00:36:00.953580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01070v1","created_at":"2026-05-18T00:36:00.953580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01070","created_at":"2026-05-18T00:36:00.953580+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z7D6X7CFWGG","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z7D6X7CFWGGSALT","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z7D6X7C","created_at":"2026-05-18T12:31:03.183658+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/5Z7D6X7CFWGGSALTS2RGWOBWUR","json":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR.json","graph_json":"https://pith.science/api/pith-number/5Z7D6X7CFWGGSALTS2RGWOBWUR/graph.json","events_json":"https://pith.science/api/pith-number/5Z7D6X7CFWGGSALTS2RGWOBWUR/events.json","paper":"https://pith.science/paper/5Z7D6X7C"},"agent_actions":{"view_html":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR","download_json":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR.json","view_paper":"https://pith.science/paper/5Z7D6X7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z7D6X7CFWGGSALTS2RGWOBWUR/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z7D6X7CFWGGSALTS2RGWOBWUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR/action/storage_attestation","attest_author":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR/action/author_attestation","sign_citation":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR/action/citation_signature","submit_replication":"https://pith.science/pith/5Z7D6X7CFWGGSALTS2RGWOBWUR/action/replication_record"}},"created_at":"2026-05-18T00:36:00.953580+00:00","updated_at":"2026-05-18T00:36:00.953580+00:00"}