{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EGOIVHHOMNNVI3JKTJP2RXIQZW","short_pith_number":"pith:EGOIVHHO","schema_version":"1.0","canonical_sha256":"219c8a9cee635b546d2a9a5fa8dd10cd8b63f3210b270090cce20c1eb11e0765","source":{"kind":"arxiv","id":"1709.01354","version":2},"attestation_state":"computed","paper":{"title":"A vertex and edge deletion game on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cormac O'Sullivan","submitted_at":"2017-09-05T12:40:10Z","abstract_excerpt":"Starting with a graph, two players take turns in either deleting an edge or deleting a vertex and all incident edges. The player removing the last vertex wins. We review the known results for this game and extend the computation of nim-values to new families of graphs. A conjecture of Khandhawit and Ye on the nim-values of graphs with one odd cycle is proved. We also see that, for wheels and their subgraphs, this game exhibits a surprising amount of unexplained regularity."},"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":"1709.01354","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T12:40:10Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"4d74d0306db7dcf9004d6d42b22ee2b53cb11e2737ab3b87672495c4ed3e5be4","abstract_canon_sha256":"e98a62571ddf1476438a11789d85abe298197428dc27526a1474d623f5322cb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.616266Z","signature_b64":"4TCAeGUseYsB5UaSBL3IAW6NeAKthSJJOP9lxIhCTOQUuMohj5braJijMWjGwGy3J1fT/kU6NT+WxEWnqJCACg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"219c8a9cee635b546d2a9a5fa8dd10cd8b63f3210b270090cce20c1eb11e0765","last_reissued_at":"2026-05-18T00:02:45.615788Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.615788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A vertex and edge deletion game on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Cormac O'Sullivan","submitted_at":"2017-09-05T12:40:10Z","abstract_excerpt":"Starting with a graph, two players take turns in either deleting an edge or deleting a vertex and all incident edges. The player removing the last vertex wins. We review the known results for this game and extend the computation of nim-values to new families of graphs. A conjecture of Khandhawit and Ye on the nim-values of graphs with one odd cycle is proved. We also see that, for wheels and their subgraphs, this game exhibits a surprising amount of unexplained regularity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01354","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.01354","created_at":"2026-05-18T00:02:45.615863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01354v2","created_at":"2026-05-18T00:02:45.615863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01354","created_at":"2026-05-18T00:02:45.615863+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGOIVHHOMNNV","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGOIVHHOMNNVI3JK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGOIVHHO","created_at":"2026-05-18T12:31:12.930513+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/EGOIVHHOMNNVI3JKTJP2RXIQZW","json":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW.json","graph_json":"https://pith.science/api/pith-number/EGOIVHHOMNNVI3JKTJP2RXIQZW/graph.json","events_json":"https://pith.science/api/pith-number/EGOIVHHOMNNVI3JKTJP2RXIQZW/events.json","paper":"https://pith.science/paper/EGOIVHHO"},"agent_actions":{"view_html":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW","download_json":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW.json","view_paper":"https://pith.science/paper/EGOIVHHO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01354&json=true","fetch_graph":"https://pith.science/api/pith-number/EGOIVHHOMNNVI3JKTJP2RXIQZW/graph.json","fetch_events":"https://pith.science/api/pith-number/EGOIVHHOMNNVI3JKTJP2RXIQZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW/action/storage_attestation","attest_author":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW/action/author_attestation","sign_citation":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW/action/citation_signature","submit_replication":"https://pith.science/pith/EGOIVHHOMNNVI3JKTJP2RXIQZW/action/replication_record"}},"created_at":"2026-05-18T00:02:45.615863+00:00","updated_at":"2026-05-18T00:02:45.615863+00:00"}