{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:UNKIZLXOUC2A4BTVPNFLQQRIHD","short_pith_number":"pith:UNKIZLXO","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"},"canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","source":{"kind":"arxiv","id":"2102.13409","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.13409","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"2102.13409v2","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13409","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"UNKIZLXOUC2A","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_16","alias_value":"UNKIZLXOUC2A4BTV","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_8","alias_value":"UNKIZLXO","created_at":"2026-07-05T02:22:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:UNKIZLXOUC2A4BTVPNFLQQRIHD","target":"record","payload":{"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"},"canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","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"},"source_kind":"arxiv","source_id":"2102.13409","source_version":2,"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-07-05T02:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7P37VBpYswKgnxdyc798KLoyG8kmNAtM4+obZQrmnD3YmdkWQBxxD1IuzTJL9sXDvWJZRSH6pMKj1Nvu4ViXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:34:18.545227Z"},"content_sha256":"6adf06e97cf36432efa05946fe4b9af337bbcd284c96b29a36aa840f3f3d25a5","schema_version":"1.0","event_id":"sha256:6adf06e97cf36432efa05946fe4b9af337bbcd284c96b29a36aa840f3f3d25a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:UNKIZLXOUC2A4BTVPNFLQQRIHD","target":"graph","payload":{"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"},"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-07-05T02:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LoH+6vtDKG5oKGk+117WsgJdxDsmVYrjAG1qu+t7dTqwkNyftf+qJIRoqKAifT2yDZBZFlEq9a85JEwRIVUVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T06:34:18.546162Z"},"content_sha256":"278577f85530780e1dc7f09ee3f5621eb48f84cd94ef4cefd00a50d0a5a3189d","schema_version":"1.0","event_id":"sha256:278577f85530780e1dc7f09ee3f5621eb48f84cd94ef4cefd00a50d0a5a3189d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/bundle.json","state_url":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/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-08-14T06:34:18Z","links":{"resolver":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD","bundle":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/bundle.json","state":"https://pith.science/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UNKIZLXOUC2A4BTVPNFLQQRIHD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:UNKIZLXOUC2A4BTVPNFLQQRIHD","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":"47556dde01405151f45512da25a395568ca1be71bf6909a29d49e45e76c37297","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-02-26T11:38:16Z","title_canon_sha256":"0ffd05e0cd202d6032ef7605feb633ea0c9971530345c9e6819b1f7c754e5528"},"schema_version":"1.0","source":{"id":"2102.13409","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.13409","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"2102.13409v2","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.13409","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"UNKIZLXOUC2A","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_16","alias_value":"UNKIZLXOUC2A4BTV","created_at":"2026-07-05T02:22:07Z"},{"alias_kind":"pith_short_8","alias_value":"UNKIZLXO","created_at":"2026-07-05T02:22:07Z"}],"graph_snapshots":[{"event_id":"sha256:278577f85530780e1dc7f09ee3f5621eb48f84cd94ef4cefd00a50d0a5a3189d","target":"graph","created_at":"2026-07-05T02:22:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2102.13409/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-02-26T11:38:16Z","title":"Can Romeo and Juliet Meet? Or Rendezvous Games with Adversaries on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.13409","kind":"arxiv","version":2},"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:6adf06e97cf36432efa05946fe4b9af337bbcd284c96b29a36aa840f3f3d25a5","target":"record","created_at":"2026-07-05T02:22:07Z","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":"47556dde01405151f45512da25a395568ca1be71bf6909a29d49e45e76c37297","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2021-02-26T11:38:16Z","title_canon_sha256":"0ffd05e0cd202d6032ef7605feb633ea0c9971530345c9e6819b1f7c754e5528"},"schema_version":"1.0","source":{"id":"2102.13409","kind":"arxiv","version":2}},"canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3548caeeea0b40e06757b4ab8422838e252228f183495ce51f658a6b0cfea7b","first_computed_at":"2026-07-05T02:22:07.388329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:22:07.388329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZP88etHVq4qzDFjtLHLXbVi2tOrB/I7NLGLobFylyJIQyxf5Cc0P4H0cj9YNJwjRj+mM0IYPfXfg0gnkC5NZDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:22:07.388809Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.13409","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6adf06e97cf36432efa05946fe4b9af337bbcd284c96b29a36aa840f3f3d25a5","sha256:278577f85530780e1dc7f09ee3f5621eb48f84cd94ef4cefd00a50d0a5a3189d"],"state_sha256":"7cf5a663ccfac37ca98ab77b45e9a38bb7ee8bfcf65ea130a53adcf0004c40d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTIrnk0JYPyYpnc8YcSVCHdEDvRinpk7rSbNEfEvRIyRQxN3rsepNlDRzrwlsYydxegdaj+kRI1xdF2LYBWtCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T06:34:18.563999Z","bundle_sha256":"182c45a18f1cb4b0236b1f2f25df23ca8c327ba8b5e262bb211f99763bdb78c1"}}