{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UNKIZLXOUC2A4BTVPNFLQQRIHD","short_pith_number":"pith:UNKIZLXO","schema_version":"1.0","canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","source":{"kind":"arxiv","id":"2102.13409","version":2},"attestation_state":"computed","paper":{"title":"Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2021-02-26T11:38:16Z","abstract_excerpt":"We introduce the rendezvous game with adversaries. In this game, two players, {\\sl Facilitator} and {\\sl Disruptor}, play against each other on a graph. Facilitator has two agents, and Disruptor has a team of $k$ agents located in some vertices of the graph. They take turns in moving their agents to adjacent vertices (or staying). Facilitator wins if his agents meet in some vertex of the graph. The goal of Disruptor is to prevent the rendezvous of Facilitator's agents. Our interest is to decide whether Facilitator can win. It appears that, in general, the problem is PSPACE-hard and, when param"},"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":"2102.13409","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-02-26T11:38:16Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"0ffd05e0cd202d6032ef7605feb633ea0c9971530345c9e6819b1f7c754e5528","abstract_canon_sha256":"47556dde01405151f45512da25a395568ca1be71bf6909a29d49e45e76c37297"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:22:07.388809Z","signature_b64":"ZP88etHVq4qzDFjtLHLXbVi2tOrB/I7NLGLobFylyJIQyxf5Cc0P4H0cj9YNJwjRj+mM0IYPfXfg0gnkC5NZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","last_reissued_at":"2026-07-05T02:22:07.388329Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:22:07.388329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.DM","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2021-02-26T11:38:16Z","abstract_excerpt":"We introduce the rendezvous game with adversaries. In this game, two players, {\\sl Facilitator} and {\\sl Disruptor}, play against each other on a graph. Facilitator has two agents, and Disruptor has a team of $k$ agents located in some vertices of the graph. They take turns in moving their agents to adjacent vertices (or staying). Facilitator wins if his agents meet in some vertex of the graph. The goal of Disruptor is to prevent the rendezvous of Facilitator's agents. Our interest is to decide whether Facilitator can win. It appears that, in general, the problem is PSPACE-hard and, when param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.13409","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.13409/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2102.13409","created_at":"2026-07-05T02:22:07.388383+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.13409v2","created_at":"2026-07-05T02:22:07.388383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13409","created_at":"2026-07-05T02:22:07.388383+00:00"},{"alias_kind":"pith_short_12","alias_value":"UNKIZLXOUC2A","created_at":"2026-07-05T02:22:07.388383+00:00"},{"alias_kind":"pith_short_16","alias_value":"UNKIZLXOUC2A4BTV","created_at":"2026-07-05T02:22:07.388383+00:00"},{"alias_kind":"pith_short_8","alias_value":"UNKIZLXO","created_at":"2026-07-05T02:22:07.388383+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/UNKIZLXOUC2A4BTVPNFLQQRIHD","json":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD.json","graph_json":"https://pith.science/api/pith-number/UNKIZLXOUC2A4BTVPNFLQQRIHD/graph.json","events_json":"https://pith.science/api/pith-number/UNKIZLXOUC2A4BTVPNFLQQRIHD/events.json","paper":"https://pith.science/paper/UNKIZLXO"},"agent_actions":{"view_html":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD","download_json":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD.json","view_paper":"https://pith.science/paper/UNKIZLXO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.13409&json=true","fetch_graph":"https://pith.science/api/pith-number/UNKIZLXOUC2A4BTVPNFLQQRIHD/graph.json","fetch_events":"https://pith.science/api/pith-number/UNKIZLXOUC2A4BTVPNFLQQRIHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/action/storage_attestation","attest_author":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/action/author_attestation","sign_citation":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/action/citation_signature","submit_replication":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/action/replication_record"}},"created_at":"2026-07-05T02:22:07.388383+00:00","updated_at":"2026-07-05T02:22:07.388383+00:00"}