{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FEMJBURYJIOX2IHMPQWRYLIIN4","short_pith_number":"pith:FEMJBURY","canonical_record":{"source":{"id":"1511.07847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-24T19:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"f1cd554ceb3fd3b19d9f739eabe0a760e0b1aeb3b0c6c771471aff778023070e","abstract_canon_sha256":"759da5f1ea1a016d142b42a5d4a40bd33fa7579e6a2f6b67383641e79160458a"},"schema_version":"1.0"},"canonical_sha256":"291890d2384a1d7d20ec7c2d1c2d086f2e4be7f04a7b9c515ba0fd8e239b4309","source":{"kind":"arxiv","id":"1511.07847","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07847","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07847v2","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07847","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"FEMJBURYJIOX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FEMJBURYJIOX2IHM","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FEMJBURY","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FEMJBURYJIOX2IHMPQWRYLIIN4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07847","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-24T19:55:50Z","cross_cats_sorted":[],"title_canon_sha256":"f1cd554ceb3fd3b19d9f739eabe0a760e0b1aeb3b0c6c771471aff778023070e","abstract_canon_sha256":"759da5f1ea1a016d142b42a5d4a40bd33fa7579e6a2f6b67383641e79160458a"},"schema_version":"1.0"},"canonical_sha256":"291890d2384a1d7d20ec7c2d1c2d086f2e4be7f04a7b9c515ba0fd8e239b4309","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:02.327239Z","signature_b64":"HKFlqez5mHMLZv3saoRWNlziSnOMQK+nP3MIivnQAi3WiIt0oVy1Vw4zcEmVymKEQLemwr0zpPOn3KdGQCK2CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"291890d2384a1d7d20ec7c2d1c2d086f2e4be7f04a7b9c515ba0fd8e239b4309","last_reissued_at":"2026-05-18T01:26:02.326767Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:02.326767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07847","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-05-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fo3bhSJVUuf7TpDjJNAF45lL1DcKBP/sKpcPRXiUAOJUxxsJwYYWN0V85fCyZ0OECybw5mZhOr5ICMy3d6DgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:24.914440Z"},"content_sha256":"6ed10c727174118f518d6666c08fb07e5538977f5b3b2afdb4c1afe4902108ff","schema_version":"1.0","event_id":"sha256:6ed10c727174118f518d6666c08fb07e5538977f5b3b2afdb4c1afe4902108ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FEMJBURYJIOX2IHMPQWRYLIIN4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Shortest Connection Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Andreas Darmann, Joachim Schauer, Ulrich Pferschy","submitted_at":"2015-11-24T19:55:50Z","abstract_excerpt":"We introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in choosing edges emanating from the vertex they are currently located at. In this way, each of the players forms a path that origins from its respective starting vertex. The game ends as soon as the two paths meet, i.e., a connection between the players is established. Each player has to carry the cost of its chosen edges and thus aims at minimizing its own total cost.\n  In this work we analyze the computational complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07847","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":""},"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-18T01:26:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu/RiNgCCOJof3xosLNMVNFDIvrU6K/v5Dk8DVwGoaDCjMGsk1dPrh0Otftb9Wre83lQQZkyjBPZDW0HhKokBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:24.915215Z"},"content_sha256":"62cae0dcc5b85906034a41267201d9108f9f56ae89fee3bcf5c4271da8369489","schema_version":"1.0","event_id":"sha256:62cae0dcc5b85906034a41267201d9108f9f56ae89fee3bcf5c4271da8369489"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/bundle.json","state_url":"https://pith.science/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/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-31T12:52:24Z","links":{"resolver":"https://pith.science/pith/FEMJBURYJIOX2IHMPQWRYLIIN4","bundle":"https://pith.science/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/bundle.json","state":"https://pith.science/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEMJBURYJIOX2IHMPQWRYLIIN4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FEMJBURYJIOX2IHMPQWRYLIIN4","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":"759da5f1ea1a016d142b42a5d4a40bd33fa7579e6a2f6b67383641e79160458a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-24T19:55:50Z","title_canon_sha256":"f1cd554ceb3fd3b19d9f739eabe0a760e0b1aeb3b0c6c771471aff778023070e"},"schema_version":"1.0","source":{"id":"1511.07847","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07847","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07847v2","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07847","created_at":"2026-05-18T01:26:02Z"},{"alias_kind":"pith_short_12","alias_value":"FEMJBURYJIOX","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FEMJBURYJIOX2IHM","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FEMJBURY","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:62cae0dcc5b85906034a41267201d9108f9f56ae89fee3bcf5c4271da8369489","target":"graph","created_at":"2026-05-18T01:26:02Z","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 introduce Shortest Connection Game, a two-player game played on a directed graph with edge costs. Given two designated vertices in which they start, the players take turns in choosing edges emanating from the vertex they are currently located at. In this way, each of the players forms a path that origins from its respective starting vertex. The game ends as soon as the two paths meet, i.e., a connection between the players is established. Each player has to carry the cost of its chosen edges and thus aims at minimizing its own total cost.\n  In this work we analyze the computational complexi","authors_text":"Andreas Darmann, Joachim Schauer, Ulrich Pferschy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-24T19:55:50Z","title":"The Shortest Connection Game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07847","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:6ed10c727174118f518d6666c08fb07e5538977f5b3b2afdb4c1afe4902108ff","target":"record","created_at":"2026-05-18T01:26:02Z","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":"759da5f1ea1a016d142b42a5d4a40bd33fa7579e6a2f6b67383641e79160458a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-24T19:55:50Z","title_canon_sha256":"f1cd554ceb3fd3b19d9f739eabe0a760e0b1aeb3b0c6c771471aff778023070e"},"schema_version":"1.0","source":{"id":"1511.07847","kind":"arxiv","version":2}},"canonical_sha256":"291890d2384a1d7d20ec7c2d1c2d086f2e4be7f04a7b9c515ba0fd8e239b4309","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"291890d2384a1d7d20ec7c2d1c2d086f2e4be7f04a7b9c515ba0fd8e239b4309","first_computed_at":"2026-05-18T01:26:02.326767Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:02.326767Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HKFlqez5mHMLZv3saoRWNlziSnOMQK+nP3MIivnQAi3WiIt0oVy1Vw4zcEmVymKEQLemwr0zpPOn3KdGQCK2CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:02.327239Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07847","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ed10c727174118f518d6666c08fb07e5538977f5b3b2afdb4c1afe4902108ff","sha256:62cae0dcc5b85906034a41267201d9108f9f56ae89fee3bcf5c4271da8369489"],"state_sha256":"6bd1a43d4445bfd34eed0d11496748d3d1a1bd0e692e8975eff03adf6cafdacf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0bgLtVOMwRSrnPL9aCR6GfWjbuDfTW56TLYvgY9zNRfbhSCmStnyUzfxL57So3nPRyNOsWTNq8w5mdxfgB/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:52:24.919790Z","bundle_sha256":"917bc9faaa7c177eeedc950250c53676c306cf737e9fbf2cfd52dca88cfe5414"}}