{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FNL2FJZ7AVQWG6ONHVVHTHHXH2","short_pith_number":"pith:FNL2FJZ7","schema_version":"1.0","canonical_sha256":"2b57a2a73f05616379cd3d6a799cf73e8282cd6b6c76b761a6f768dddc6b5f25","source":{"kind":"arxiv","id":"1507.05673","version":4},"attestation_state":"computed","paper":{"title":"Combinatorial Analysis of a Subtraction Game on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jamie Peabody, Janae Dixon, Jennifer Elder, Karen Willis, Oscar Vega, Richard Adams","submitted_at":"2015-07-20T22:58:42Z","abstract_excerpt":"We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then it would also be deleted. A player wins the game when the other player has no moves available.\n  We study this game under various viewpoints: by finding specific strategies for certain families of graphs, through using properties of a graph's automorphism group, by writing a program to look at Sprague-Grundy numbers, and by studying the game when played on ra"},"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":"1507.05673","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-20T22:58:42Z","cross_cats_sorted":[],"title_canon_sha256":"1b841b66a302174636005e98847b17e662606830af1279bb874d8328a71a7971","abstract_canon_sha256":"d2b74f99ee79d9f1899a0aed000b9a57190d372efd015dfe93c5d62148a4f746"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:11.514190Z","signature_b64":"0WA7qgchMvNUcUUB8b7gfCiW0+q537CpEMiWRtWZyn4Hz+qy5fLPCMAsOJpidgcHiA/T0VJPl+E224m0kAY6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b57a2a73f05616379cd3d6a799cf73e8282cd6b6c76b761a6f768dddc6b5f25","last_reissued_at":"2026-05-18T01:10:11.513765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:11.513765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial Analysis of a Subtraction Game on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jamie Peabody, Janae Dixon, Jennifer Elder, Karen Willis, Oscar Vega, Richard Adams","submitted_at":"2015-07-20T22:58:42Z","abstract_excerpt":"We define a two-player combinatorial game in which players take alternate turns; each turn consists on deleting a vertex of a graph, together with all the edges containing such vertex. If any vertex became isolated by a player's move then it would also be deleted. A player wins the game when the other player has no moves available.\n  We study this game under various viewpoints: by finding specific strategies for certain families of graphs, through using properties of a graph's automorphism group, by writing a program to look at Sprague-Grundy numbers, and by studying the game when played on ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.05673","kind":"arxiv","version":4},"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":"1507.05673","created_at":"2026-05-18T01:10:11.513835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.05673v4","created_at":"2026-05-18T01:10:11.513835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.05673","created_at":"2026-05-18T01:10:11.513835+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNL2FJZ7AVQW","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNL2FJZ7AVQWG6ON","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNL2FJZ7","created_at":"2026-05-18T12:29:19.899920+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/FNL2FJZ7AVQWG6ONHVVHTHHXH2","json":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2.json","graph_json":"https://pith.science/api/pith-number/FNL2FJZ7AVQWG6ONHVVHTHHXH2/graph.json","events_json":"https://pith.science/api/pith-number/FNL2FJZ7AVQWG6ONHVVHTHHXH2/events.json","paper":"https://pith.science/paper/FNL2FJZ7"},"agent_actions":{"view_html":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2","download_json":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2.json","view_paper":"https://pith.science/paper/FNL2FJZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.05673&json=true","fetch_graph":"https://pith.science/api/pith-number/FNL2FJZ7AVQWG6ONHVVHTHHXH2/graph.json","fetch_events":"https://pith.science/api/pith-number/FNL2FJZ7AVQWG6ONHVVHTHHXH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2/action/storage_attestation","attest_author":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2/action/author_attestation","sign_citation":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2/action/citation_signature","submit_replication":"https://pith.science/pith/FNL2FJZ7AVQWG6ONHVVHTHHXH2/action/replication_record"}},"created_at":"2026-05-18T01:10:11.513835+00:00","updated_at":"2026-05-18T01:10:11.513835+00:00"}