{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PNIS6GBMECXLOKUR2XJMZR5OY4","short_pith_number":"pith:PNIS6GBM","schema_version":"1.0","canonical_sha256":"7b512f182c20aeb72a91d5d2ccc7aec72cfbfe31db88cb98cd324f337c3057a4","source":{"kind":"arxiv","id":"2108.09367","version":1},"attestation_state":"computed","paper":{"title":"On the Computational Complexities of Various Geography Variants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Carson Geissler, Nathan Fox","submitted_at":"2021-08-20T20:58:08Z","abstract_excerpt":"Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that the computational complexity of determining which player should win from a given position of Generalized Geography is PSPACE-complete. We introduce several rule variants to Generalized Geography, and we explore the computational complexity of determining the winner of positions of many resulting games. Among our results is a proof that determining the winner "},"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":"2108.09367","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-08-20T20:58:08Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2ff759e61660f3ea6f86f29b8d2d9eff12894773a987d24c0c7f505f4fda126f","abstract_canon_sha256":"c0949ba1d2c3a7ccc41a8538e5f170c5c146ac0d46d60f4c2957ff0f98b20707"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:07:53.744859Z","signature_b64":"YZCY7kdclHISKz3TT+TsLWzeZ37j3G4zKpaS4EbcRyQ1f9v6lKQ+b2uMLSnDvIAFtDgelGVgKiwrFRlRhdBpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b512f182c20aeb72a91d5d2ccc7aec72cfbfe31db88cb98cd324f337c3057a4","last_reissued_at":"2026-07-05T03:07:53.744482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:07:53.744482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computational Complexities of Various Geography Variants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Carson Geissler, Nathan Fox","submitted_at":"2021-08-20T20:58:08Z","abstract_excerpt":"Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that the computational complexity of determining which player should win from a given position of Generalized Geography is PSPACE-complete. We introduce several rule variants to Generalized Geography, and we explore the computational complexity of determining the winner of positions of many resulting games. Among our results is a proof that determining the winner "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.09367","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/2108.09367/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":"2108.09367","created_at":"2026-07-05T03:07:53.744536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.09367v1","created_at":"2026-07-05T03:07:53.744536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.09367","created_at":"2026-07-05T03:07:53.744536+00:00"},{"alias_kind":"pith_short_12","alias_value":"PNIS6GBMECXL","created_at":"2026-07-05T03:07:53.744536+00:00"},{"alias_kind":"pith_short_16","alias_value":"PNIS6GBMECXLOKUR","created_at":"2026-07-05T03:07:53.744536+00:00"},{"alias_kind":"pith_short_8","alias_value":"PNIS6GBM","created_at":"2026-07-05T03:07:53.744536+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/PNIS6GBMECXLOKUR2XJMZR5OY4","json":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4.json","graph_json":"https://pith.science/api/pith-number/PNIS6GBMECXLOKUR2XJMZR5OY4/graph.json","events_json":"https://pith.science/api/pith-number/PNIS6GBMECXLOKUR2XJMZR5OY4/events.json","paper":"https://pith.science/paper/PNIS6GBM"},"agent_actions":{"view_html":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4","download_json":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4.json","view_paper":"https://pith.science/paper/PNIS6GBM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.09367&json=true","fetch_graph":"https://pith.science/api/pith-number/PNIS6GBMECXLOKUR2XJMZR5OY4/graph.json","fetch_events":"https://pith.science/api/pith-number/PNIS6GBMECXLOKUR2XJMZR5OY4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4/action/storage_attestation","attest_author":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4/action/author_attestation","sign_citation":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4/action/citation_signature","submit_replication":"https://pith.science/pith/PNIS6GBMECXLOKUR2XJMZR5OY4/action/replication_record"}},"created_at":"2026-07-05T03:07:53.744536+00:00","updated_at":"2026-07-05T03:07:53.744536+00:00"}