{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EHAJEFG2LKN5LFQJEIGCWE4DDF","short_pith_number":"pith:EHAJEFG2","canonical_record":{"source":{"id":"1905.05033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T13:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"ad53643150990b805466efc83d61442636e257b4685ef95a96716704c7f10443","abstract_canon_sha256":"b3e3e175d01e3e7bd5ca930ec268fe2152dc893641418bf6b88576e691020d07"},"schema_version":"1.0"},"canonical_sha256":"21c09214da5a9bd59609220c2b138319504712a3d15933854d23abce4bac8e1e","source":{"kind":"arxiv","id":"1905.05033","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05033","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05033v2","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05033","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"pith_short_12","alias_value":"EHAJEFG2LKN5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EHAJEFG2LKN5LFQJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EHAJEFG2","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EHAJEFG2LKN5LFQJEIGCWE4DDF","target":"record","payload":{"canonical_record":{"source":{"id":"1905.05033","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T13:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"ad53643150990b805466efc83d61442636e257b4685ef95a96716704c7f10443","abstract_canon_sha256":"b3e3e175d01e3e7bd5ca930ec268fe2152dc893641418bf6b88576e691020d07"},"schema_version":"1.0"},"canonical_sha256":"21c09214da5a9bd59609220c2b138319504712a3d15933854d23abce4bac8e1e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:51.518101Z","signature_b64":"K7KNTmOCP6FuuIIuhspN9FeuZsw2ydElqeNsZCXJN7VwYFgl0rdgjyydP0jXWwht2x7F4LnXnCbB8d9afU1VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"21c09214da5a9bd59609220c2b138319504712a3d15933854d23abce4bac8e1e","last_reissued_at":"2026-05-17T23:45:51.517637Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:51.517637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.05033","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-17T23:45:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bEsIuBqi4dv/rW9KOauUltE30I4IsayCONzqq1gW1Q8eS2oJug9ZZmDPXL8qvVXm4H4G1Cx8IYXloSve7tJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:20:58.497091Z"},"content_sha256":"8fdb974ec8b04c82217b29e0738bccc5fbb445813deb52668b958723d16405b8","schema_version":"1.0","event_id":"sha256:8fdb974ec8b04c82217b29e0738bccc5fbb445813deb52668b958723d16405b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EHAJEFG2LKN5LFQJEIGCWE4DDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric dimension of combinatorial game graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Craig Tennenhouse","submitted_at":"2019-05-13T13:46:16Z","abstract_excerpt":"The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few efforts towards analyzing game graphs using graph theoretic metrics and techniques. A set $S$ of vertices in a graph $G$ resolves $G$ if every vertex in $G$ is uniquely determined by the vector of its distances from the vertices in $S$. A metric basis of $G$ is a smallest resolving set and the metric dimension is the cardinality of a metric basis. In this articl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05033","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-17T23:45:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hyjaP5g3ILWzpY222RT6FGQrRpKhUNm5fB1tpxVEvdMxmHp5YefjioT/yTjGkUZKQTyZvjIaKYIaKK6/PkzYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:20:58.497452Z"},"content_sha256":"4e251e414bd831eb676f434198941a623bfcf0e4d712b20f855d5238664a49c5","schema_version":"1.0","event_id":"sha256:4e251e414bd831eb676f434198941a623bfcf0e4d712b20f855d5238664a49c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/bundle.json","state_url":"https://pith.science/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/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-03T14:20:58Z","links":{"resolver":"https://pith.science/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF","bundle":"https://pith.science/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/bundle.json","state":"https://pith.science/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EHAJEFG2LKN5LFQJEIGCWE4DDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EHAJEFG2LKN5LFQJEIGCWE4DDF","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":"b3e3e175d01e3e7bd5ca930ec268fe2152dc893641418bf6b88576e691020d07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T13:46:16Z","title_canon_sha256":"ad53643150990b805466efc83d61442636e257b4685ef95a96716704c7f10443"},"schema_version":"1.0","source":{"id":"1905.05033","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05033","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05033v2","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05033","created_at":"2026-05-17T23:45:51Z"},{"alias_kind":"pith_short_12","alias_value":"EHAJEFG2LKN5","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EHAJEFG2LKN5LFQJ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EHAJEFG2","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4e251e414bd831eb676f434198941a623bfcf0e4d712b20f855d5238664a49c5","target":"graph","created_at":"2026-05-17T23:45:51Z","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":"The study of combinatorial games is intimately tied to the study of graphs, as any game can be realized as a directed graph in which players take turns traversing the edges until reaching a sink. However, there have heretofore been few efforts towards analyzing game graphs using graph theoretic metrics and techniques. A set $S$ of vertices in a graph $G$ resolves $G$ if every vertex in $G$ is uniquely determined by the vector of its distances from the vertices in $S$. A metric basis of $G$ is a smallest resolving set and the metric dimension is the cardinality of a metric basis. In this articl","authors_text":"Craig Tennenhouse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T13:46:16Z","title":"Metric dimension of combinatorial game graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05033","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:8fdb974ec8b04c82217b29e0738bccc5fbb445813deb52668b958723d16405b8","target":"record","created_at":"2026-05-17T23:45:51Z","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":"b3e3e175d01e3e7bd5ca930ec268fe2152dc893641418bf6b88576e691020d07","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-13T13:46:16Z","title_canon_sha256":"ad53643150990b805466efc83d61442636e257b4685ef95a96716704c7f10443"},"schema_version":"1.0","source":{"id":"1905.05033","kind":"arxiv","version":2}},"canonical_sha256":"21c09214da5a9bd59609220c2b138319504712a3d15933854d23abce4bac8e1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21c09214da5a9bd59609220c2b138319504712a3d15933854d23abce4bac8e1e","first_computed_at":"2026-05-17T23:45:51.517637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:51.517637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7KNTmOCP6FuuIIuhspN9FeuZsw2ydElqeNsZCXJN7VwYFgl0rdgjyydP0jXWwht2x7F4LnXnCbB8d9afU1VCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:51.518101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05033","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fdb974ec8b04c82217b29e0738bccc5fbb445813deb52668b958723d16405b8","sha256:4e251e414bd831eb676f434198941a623bfcf0e4d712b20f855d5238664a49c5"],"state_sha256":"5a1e5ebfa6db137437f8223f530e8f5fd54acd62be143a46ba64c985265e0f12"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnYSE52shHo9uZu22U0XixvF/gtlQfZjFXuJWSBrYXNfx0o8kHOT06ReL9K/nHY8TFDRMQk8Ecqlt4CRboK5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:20:58.499397Z","bundle_sha256":"51f29706354468f4d6c8f5ab8f345b5c622879b260d8b3dddb463122cfc05710"}}