{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4SAO5CEYUHYJKE4FCVTE3VX2HW","short_pith_number":"pith:4SAO5CEY","schema_version":"1.0","canonical_sha256":"e480ee8898a1f095138515664dd6fa3d9e0155fd8cae15b79f97bf6430eba3df","source":{"kind":"arxiv","id":"1508.04484","version":2},"attestation_state":"computed","paper":{"title":"On the Sprague-Grundy function of Exact $k$-Nim","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Kazuhisa Makino, Nhan Bao Ho, Peter Mursic, Vladimir Gurvich","submitted_at":"2015-08-18T23:28:28Z","abstract_excerpt":"Moore's generalization of the game of {\\sc Nim} is played as follows. Let $n$ and $k$ be two integers such that $1 \\leq k \\leq n$. Given $n$ piles of tokens, two players move alternately, removing tokens from at least one and at most $k$ of the piles. The player who makes the last move wins. The game was solved by Moore in 1910 and an explicit formula for its Sprague-Grundy function was given by Jenkyns and Mayberry in 1980, for the case $n = k+1$ only. We introduce another generalization of {\\sc Nim}, called {\\sc Exact $k$-Nim}, in which each move reduces exactly $k$ piles. We give an explici"},"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":"1508.04484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-18T23:28:28Z","cross_cats_sorted":[],"title_canon_sha256":"fb3f421db824b58ff897f0003c08cf396da5d5f0400f088ff4dc47c0492da8df","abstract_canon_sha256":"5d2733a9e8f7c0f316b3bc2ffde739bd23d885c3d86f3432418818941e0749b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:44.465341Z","signature_b64":"CpeuCFPHpwoNC+w3PIFBww5pdOMNzmIssXpZVG5oCLXWCmYOqoSwFhvF+psTUoE9wPQu6biKWL/7VAhWWHBRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e480ee8898a1f095138515664dd6fa3d9e0155fd8cae15b79f97bf6430eba3df","last_reissued_at":"2026-05-18T00:52:44.464929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:44.464929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sprague-Grundy function of Exact $k$-Nim","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Kazuhisa Makino, Nhan Bao Ho, Peter Mursic, Vladimir Gurvich","submitted_at":"2015-08-18T23:28:28Z","abstract_excerpt":"Moore's generalization of the game of {\\sc Nim} is played as follows. Let $n$ and $k$ be two integers such that $1 \\leq k \\leq n$. Given $n$ piles of tokens, two players move alternately, removing tokens from at least one and at most $k$ of the piles. The player who makes the last move wins. The game was solved by Moore in 1910 and an explicit formula for its Sprague-Grundy function was given by Jenkyns and Mayberry in 1980, for the case $n = k+1$ only. We introduce another generalization of {\\sc Nim}, called {\\sc Exact $k$-Nim}, in which each move reduces exactly $k$ piles. We give an explici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04484","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":"1508.04484","created_at":"2026-05-18T00:52:44.464993+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.04484v2","created_at":"2026-05-18T00:52:44.464993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04484","created_at":"2026-05-18T00:52:44.464993+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SAO5CEYUHYJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SAO5CEYUHYJKE4F","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SAO5CEY","created_at":"2026-05-18T12:29:05.191682+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/4SAO5CEYUHYJKE4FCVTE3VX2HW","json":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW.json","graph_json":"https://pith.science/api/pith-number/4SAO5CEYUHYJKE4FCVTE3VX2HW/graph.json","events_json":"https://pith.science/api/pith-number/4SAO5CEYUHYJKE4FCVTE3VX2HW/events.json","paper":"https://pith.science/paper/4SAO5CEY"},"agent_actions":{"view_html":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW","download_json":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW.json","view_paper":"https://pith.science/paper/4SAO5CEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.04484&json=true","fetch_graph":"https://pith.science/api/pith-number/4SAO5CEYUHYJKE4FCVTE3VX2HW/graph.json","fetch_events":"https://pith.science/api/pith-number/4SAO5CEYUHYJKE4FCVTE3VX2HW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW/action/storage_attestation","attest_author":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW/action/author_attestation","sign_citation":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW/action/citation_signature","submit_replication":"https://pith.science/pith/4SAO5CEYUHYJKE4FCVTE3VX2HW/action/replication_record"}},"created_at":"2026-05-18T00:52:44.464993+00:00","updated_at":"2026-05-18T00:52:44.464993+00:00"}