{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:BHNT765JLVLXTJNM3MP4FU2ML3","short_pith_number":"pith:BHNT765J","canonical_record":{"source":{"id":"1401.0400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-02T09:43:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"70d32269d5529bb63e5028f67416a2ab1c12d7edda7b3b8d670159a9e409344e","abstract_canon_sha256":"4fab3951ade1ef8d3fe7cdce3eb6cfde75e75a2e3cf6313b775c494e94a7a387"},"schema_version":"1.0"},"canonical_sha256":"09db3ffba95d5779a5acdb1fc2d34c5efee6029167883c2e115fd1bb422af4f1","source":{"kind":"arxiv","id":"1401.0400","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0400","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0400v2","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0400","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"BHNT765JLVLX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHNT765JLVLXTJNM","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHNT765J","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:BHNT765JLVLXTJNM3MP4FU2ML3","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0400","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-02T09:43:40Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"70d32269d5529bb63e5028f67416a2ab1c12d7edda7b3b8d670159a9e409344e","abstract_canon_sha256":"4fab3951ade1ef8d3fe7cdce3eb6cfde75e75a2e3cf6313b775c494e94a7a387"},"schema_version":"1.0"},"canonical_sha256":"09db3ffba95d5779a5acdb1fc2d34c5efee6029167883c2e115fd1bb422af4f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:12.416469Z","signature_b64":"r55/qhkwqPAZHgwMknTihyiOu4ra+RO5p1ZuxgZwNk2ZhMpgci3Vgw/ZAW/58zhhHKdjFJGLZxb6XXE0Hh5MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09db3ffba95d5779a5acdb1fc2d34c5efee6029167883c2e115fd1bb422af4f1","last_reissued_at":"2026-05-18T02:17:12.415728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:12.415728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0400","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-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/L4I8DXwI3rnqTrtnBA9SugbDNR0ECcp/r24y5rTjNGvmNPtNO6f2P4SI0O7VX1iiDsNCE/bjefYX7TMKQeDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:32:58.344068Z"},"content_sha256":"3fd470d48d6abdef39897b1a319183867dcb8e8cc58f260fe7b5c5b0e2ee17f9","schema_version":"1.0","event_id":"sha256:3fd470d48d6abdef39897b1a319183867dcb8e8cc58f260fe7b5c5b0e2ee17f9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:BHNT765JLVLXTJNM3MP4FU2ML3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Mis\\`ere Version of Three Games Played on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Gabriel Renault, Simon Schmidt","submitted_at":"2014-01-02T09:43:40Z","abstract_excerpt":"We investigate the complexity of finding a winning strategy for the mis\\`ere version of three games played on graphs : two variants of the game $\\text{NimG}$, introduced by Stockmann in 2004 and the game $\\text{Vertex Geography}$ on both directed and undirected graphs. We show that on general graphs those three games are $\\text{PSPACE}$-Hard or Complete. For one $\\text{PSPACE}$-Hard variant of $\\text{NimG}$, we find an algorithm to compute an effective winning strategy in time $\\mathcal{O}(\\sqrt{|V(G)|}.|E(G)|)$ when $G$ is a bipartite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0400","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-18T02:17:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0/SbfDWMhsR+Dpy7nYIcCZCg39D6b0e9jnf2dhRxnZ/JryloTOh0rUg2BD0lBcyG9suKCzGqoMCXmWYFYI4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:32:58.344709Z"},"content_sha256":"badf999f92137c138dccd0f0341fd93f3d40542c5948c0aec43d7ab1d3109047","schema_version":"1.0","event_id":"sha256:badf999f92137c138dccd0f0341fd93f3d40542c5948c0aec43d7ab1d3109047"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BHNT765JLVLXTJNM3MP4FU2ML3/bundle.json","state_url":"https://pith.science/pith/BHNT765JLVLXTJNM3MP4FU2ML3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BHNT765JLVLXTJNM3MP4FU2ML3/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-26T13:32:58Z","links":{"resolver":"https://pith.science/pith/BHNT765JLVLXTJNM3MP4FU2ML3","bundle":"https://pith.science/pith/BHNT765JLVLXTJNM3MP4FU2ML3/bundle.json","state":"https://pith.science/pith/BHNT765JLVLXTJNM3MP4FU2ML3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BHNT765JLVLXTJNM3MP4FU2ML3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BHNT765JLVLXTJNM3MP4FU2ML3","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":"4fab3951ade1ef8d3fe7cdce3eb6cfde75e75a2e3cf6313b775c494e94a7a387","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-02T09:43:40Z","title_canon_sha256":"70d32269d5529bb63e5028f67416a2ab1c12d7edda7b3b8d670159a9e409344e"},"schema_version":"1.0","source":{"id":"1401.0400","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0400","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0400v2","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0400","created_at":"2026-05-18T02:17:12Z"},{"alias_kind":"pith_short_12","alias_value":"BHNT765JLVLX","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BHNT765JLVLXTJNM","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BHNT765J","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:badf999f92137c138dccd0f0341fd93f3d40542c5948c0aec43d7ab1d3109047","target":"graph","created_at":"2026-05-18T02:17:12Z","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 investigate the complexity of finding a winning strategy for the mis\\`ere version of three games played on graphs : two variants of the game $\\text{NimG}$, introduced by Stockmann in 2004 and the game $\\text{Vertex Geography}$ on both directed and undirected graphs. We show that on general graphs those three games are $\\text{PSPACE}$-Hard or Complete. For one $\\text{PSPACE}$-Hard variant of $\\text{NimG}$, we find an algorithm to compute an effective winning strategy in time $\\mathcal{O}(\\sqrt{|V(G)|}.|E(G)|)$ when $G$ is a bipartite graph.","authors_text":"Gabriel Renault, Simon Schmidt","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-02T09:43:40Z","title":"On the Complexity of the Mis\\`ere Version of Three Games Played on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0400","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:3fd470d48d6abdef39897b1a319183867dcb8e8cc58f260fe7b5c5b0e2ee17f9","target":"record","created_at":"2026-05-18T02:17:12Z","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":"4fab3951ade1ef8d3fe7cdce3eb6cfde75e75a2e3cf6313b775c494e94a7a387","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-01-02T09:43:40Z","title_canon_sha256":"70d32269d5529bb63e5028f67416a2ab1c12d7edda7b3b8d670159a9e409344e"},"schema_version":"1.0","source":{"id":"1401.0400","kind":"arxiv","version":2}},"canonical_sha256":"09db3ffba95d5779a5acdb1fc2d34c5efee6029167883c2e115fd1bb422af4f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09db3ffba95d5779a5acdb1fc2d34c5efee6029167883c2e115fd1bb422af4f1","first_computed_at":"2026-05-18T02:17:12.415728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:12.415728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r55/qhkwqPAZHgwMknTihyiOu4ra+RO5p1ZuxgZwNk2ZhMpgci3Vgw/ZAW/58zhhHKdjFJGLZxb6XXE0Hh5MAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:12.416469Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0400","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fd470d48d6abdef39897b1a319183867dcb8e8cc58f260fe7b5c5b0e2ee17f9","sha256:badf999f92137c138dccd0f0341fd93f3d40542c5948c0aec43d7ab1d3109047"],"state_sha256":"dc88c7fb67b193a6557f5224e1939b556b6ae31f2a2c1449eaa4d9d0c2536da1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iktwChDbnnmnxjglkriN30Zmb2WntBDBJysgPJsmozdX55T7AYm+LDtz2ZsI3ekDKudkdVoZiOKxhZnO/IWxCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:32:58.348437Z","bundle_sha256":"d394c7536599ed4995c2c111d9e5798cba804bde3f4a9504d71211f6e8f63da5"}}