{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MNNT3NP5MAQQHBQK2XN4KJIBNL","short_pith_number":"pith:MNNT3NP5","canonical_record":{"source":{"id":"2606.05483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T22:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"f6c69e3dac7c063a77c686c4e92295c75a02a32542c087dfecfe254bf10e098d","abstract_canon_sha256":"7ae175612e2fd1e7b6543367fe9f125a5be985ea7138357c7a227dfe7147159c"},"schema_version":"1.0"},"canonical_sha256":"635b3db5fd602103860ad5dbc525016af855e1a2a3aefecb4004715f7a2c72c1","source":{"kind":"arxiv","id":"2606.05483","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05483","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05483v1","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05483","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"MNNT3NP5MAQQ","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_16","alias_value":"MNNT3NP5MAQQHBQK","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_8","alias_value":"MNNT3NP5","created_at":"2026-06-05T01:14:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MNNT3NP5MAQQHBQK2XN4KJIBNL","target":"record","payload":{"canonical_record":{"source":{"id":"2606.05483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T22:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"f6c69e3dac7c063a77c686c4e92295c75a02a32542c087dfecfe254bf10e098d","abstract_canon_sha256":"7ae175612e2fd1e7b6543367fe9f125a5be985ea7138357c7a227dfe7147159c"},"schema_version":"1.0"},"canonical_sha256":"635b3db5fd602103860ad5dbc525016af855e1a2a3aefecb4004715f7a2c72c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-05T01:14:52.594020Z","signature_b64":"G8D6tmoLZbANC43e3YlkiOBbbb3JQ6+ZCL3dBKtYldolNxmmCbm9qSmYpyA4Ibk3DgDQpV3IujDS4Aa2OTuRDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"635b3db5fd602103860ad5dbc525016af855e1a2a3aefecb4004715f7a2c72c1","last_reissued_at":"2026-06-05T01:14:52.593606Z","signature_status":"signed_v1","first_computed_at":"2026-06-05T01:14:52.593606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.05483","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-06-05T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfxSiN/dPVTETWdmIb0SibiQMGVE53qrt8ynsHKYV0boBlfMpJBJWkgKG/W8Xgi5THEXUrRLTcbt8DiovLxICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:00:43.597935Z"},"content_sha256":"cbb0743991df010e9eaccd52754116029aad98b4173bada15d63dbd131d6c5ee","schema_version":"1.0","event_id":"sha256:cbb0743991df010e9eaccd52754116029aad98b4173bada15d63dbd131d6c5ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MNNT3NP5MAQQHBQK2XN4KJIBNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Impartial geodetic removing games on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bret J. Benesh, Dana C. Ernst, Marie Meyer, Nandor Sieben, Sarah K. Salmon","submitted_at":"2026-06-03T22:06:09Z","abstract_excerpt":"A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the subset. The convex hull of a set of vertices is the smallest convex set containing the set. We study two games in which two players take turns selecting vertices of a graph until the convex hull of the jointly unselected vertices is too small. The last player to move is the winner. The achievement game ends when the convex hull of the jointly unselected vertices is not the vertex set. In the avoidance game, the convex hull of the jointly unselected vertices "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05483","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.05483/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-06-05T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"juHPErtReJDKcLoea0hamEOFdllhYJBNfLvjEARRVImQ7l5lBapunncLWB0wb6bjzo08IyKlI8LGdYRgECz8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:00:43.598299Z"},"content_sha256":"f5779f12df69355695722e74a843cf91bb00d945f9f6bef668f6ad57f0df733d","schema_version":"1.0","event_id":"sha256:f5779f12df69355695722e74a843cf91bb00d945f9f6bef668f6ad57f0df733d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/bundle.json","state_url":"https://pith.science/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/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-06-08T12:00:43Z","links":{"resolver":"https://pith.science/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL","bundle":"https://pith.science/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/bundle.json","state":"https://pith.science/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MNNT3NP5MAQQHBQK2XN4KJIBNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MNNT3NP5MAQQHBQK2XN4KJIBNL","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":"7ae175612e2fd1e7b6543367fe9f125a5be985ea7138357c7a227dfe7147159c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T22:06:09Z","title_canon_sha256":"f6c69e3dac7c063a77c686c4e92295c75a02a32542c087dfecfe254bf10e098d"},"schema_version":"1.0","source":{"id":"2606.05483","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.05483","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.05483v1","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.05483","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"MNNT3NP5MAQQ","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_16","alias_value":"MNNT3NP5MAQQHBQK","created_at":"2026-06-05T01:14:52Z"},{"alias_kind":"pith_short_8","alias_value":"MNNT3NP5","created_at":"2026-06-05T01:14:52Z"}],"graph_snapshots":[{"event_id":"sha256:f5779f12df69355695722e74a843cf91bb00d945f9f6bef668f6ad57f0df733d","target":"graph","created_at":"2026-06-05T01:14:52Z","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/2606.05483/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A subset of the vertex set of a graph is geodetically convex if it contains every vertex on any shortest path between two elements of the subset. The convex hull of a set of vertices is the smallest convex set containing the set. We study two games in which two players take turns selecting vertices of a graph until the convex hull of the jointly unselected vertices is too small. The last player to move is the winner. The achievement game ends when the convex hull of the jointly unselected vertices is not the vertex set. In the avoidance game, the convex hull of the jointly unselected vertices ","authors_text":"Bret J. Benesh, Dana C. Ernst, Marie Meyer, Nandor Sieben, Sarah K. Salmon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T22:06:09Z","title":"Impartial geodetic removing games on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.05483","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:cbb0743991df010e9eaccd52754116029aad98b4173bada15d63dbd131d6c5ee","target":"record","created_at":"2026-06-05T01:14:52Z","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":"7ae175612e2fd1e7b6543367fe9f125a5be985ea7138357c7a227dfe7147159c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-03T22:06:09Z","title_canon_sha256":"f6c69e3dac7c063a77c686c4e92295c75a02a32542c087dfecfe254bf10e098d"},"schema_version":"1.0","source":{"id":"2606.05483","kind":"arxiv","version":1}},"canonical_sha256":"635b3db5fd602103860ad5dbc525016af855e1a2a3aefecb4004715f7a2c72c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"635b3db5fd602103860ad5dbc525016af855e1a2a3aefecb4004715f7a2c72c1","first_computed_at":"2026-06-05T01:14:52.593606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-05T01:14:52.593606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8D6tmoLZbANC43e3YlkiOBbbb3JQ6+ZCL3dBKtYldolNxmmCbm9qSmYpyA4Ibk3DgDQpV3IujDS4Aa2OTuRDw==","signature_status":"signed_v1","signed_at":"2026-06-05T01:14:52.594020Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.05483","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cbb0743991df010e9eaccd52754116029aad98b4173bada15d63dbd131d6c5ee","sha256:f5779f12df69355695722e74a843cf91bb00d945f9f6bef668f6ad57f0df733d"],"state_sha256":"20320c786b0297766122759e08a9857675b69168febeaea626e12e9db882b10c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvtrP/Z+mr0eTHUFV9j7xhsHhP0rrbOB0i7MaBmDfOo4R3y56u7FAjqRh1ny7otSjxcM1P79VKzasoz+raRjDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:00:43.601239Z","bundle_sha256":"e85ec5b991f29cd49af8876c65bb95f271c8e2da205c0335ca88f253196540db"}}