{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7BIL6ZFN4AAGVRZZ434EMZ3E4C","short_pith_number":"pith:7BIL6ZFN","schema_version":"1.0","canonical_sha256":"f850bf64ade0006ac739e6f8466764e09afea28975d666a50e0771e4866f2e99","source":{"kind":"arxiv","id":"1903.08138","version":1},"attestation_state":"computed","paper":{"title":"On the Sprague-Grundy function of compound games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Kazuhisa Makino, Levi Kitrossky, Vladimir Gurvich","submitted_at":"2019-03-19T17:48:39Z","abstract_excerpt":"The classical game of {\\sc Nim} can be naturally extended and played on an arbitrary hypergraph $\\cH \\subseteq 2^V \\setminus \\{\\emptyset\\}$ whose vertices $V = \\{1, \\ldots, n\\}$ correspond to piles of stones. By one move a player chooses an edge $H$ of $\\cH$ and reduces arbitrarily all piles $i \\in H$. In 1901 Bouton solved the classical {\\sc Nim} for which $\\cH = \\{\\{1\\}, \\ldots, \\{n\\}\\}$. In 1910 Moore introduced and solved a more general game $k$-{\\sc Nim}, for which $\\cH = \\{H \\subseteq V \\mid |H| \\leq k\\}$, where $1 \\leq k < n$. In 1980 Jenkyns and Mayberry obtained an explicit formula fo"},"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":"1903.08138","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-19T17:48:39Z","cross_cats_sorted":[],"title_canon_sha256":"3194b2106293a7768666c6da45e1bed5f50f31fc158641a8daa1dfdc47a5e4fe","abstract_canon_sha256":"db37c55bfbe496af0f44a156b855fde770bc2613e9d63973a8d851c00bbd3e00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:52.840158Z","signature_b64":"16WNaHnGoRrMDOCpsSWYZhn4F5yGJQkWOrKHg5sseIUOZkvx/MjFzykzB9ZJ5/XZ2I5f7Ic22zZ7ABJ79LbVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f850bf64ade0006ac739e6f8466764e09afea28975d666a50e0771e4866f2e99","last_reissued_at":"2026-05-17T23:50:52.839486Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:52.839486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Sprague-Grundy function of compound games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Kazuhisa Makino, Levi Kitrossky, Vladimir Gurvich","submitted_at":"2019-03-19T17:48:39Z","abstract_excerpt":"The classical game of {\\sc Nim} can be naturally extended and played on an arbitrary hypergraph $\\cH \\subseteq 2^V \\setminus \\{\\emptyset\\}$ whose vertices $V = \\{1, \\ldots, n\\}$ correspond to piles of stones. By one move a player chooses an edge $H$ of $\\cH$ and reduces arbitrarily all piles $i \\in H$. In 1901 Bouton solved the classical {\\sc Nim} for which $\\cH = \\{\\{1\\}, \\ldots, \\{n\\}\\}$. In 1910 Moore introduced and solved a more general game $k$-{\\sc Nim}, for which $\\cH = \\{H \\subseteq V \\mid |H| \\leq k\\}$, where $1 \\leq k < n$. In 1980 Jenkyns and Mayberry obtained an explicit formula fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08138","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":""},"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":"1903.08138","created_at":"2026-05-17T23:50:52.839582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.08138v1","created_at":"2026-05-17T23:50:52.839582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08138","created_at":"2026-05-17T23:50:52.839582+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BIL6ZFN4AAG","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BIL6ZFN4AAGVRZZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BIL6ZFN","created_at":"2026-05-18T12:33:12.712433+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/7BIL6ZFN4AAGVRZZ434EMZ3E4C","json":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C.json","graph_json":"https://pith.science/api/pith-number/7BIL6ZFN4AAGVRZZ434EMZ3E4C/graph.json","events_json":"https://pith.science/api/pith-number/7BIL6ZFN4AAGVRZZ434EMZ3E4C/events.json","paper":"https://pith.science/paper/7BIL6ZFN"},"agent_actions":{"view_html":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C","download_json":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C.json","view_paper":"https://pith.science/paper/7BIL6ZFN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.08138&json=true","fetch_graph":"https://pith.science/api/pith-number/7BIL6ZFN4AAGVRZZ434EMZ3E4C/graph.json","fetch_events":"https://pith.science/api/pith-number/7BIL6ZFN4AAGVRZZ434EMZ3E4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C/action/storage_attestation","attest_author":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C/action/author_attestation","sign_citation":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C/action/citation_signature","submit_replication":"https://pith.science/pith/7BIL6ZFN4AAGVRZZ434EMZ3E4C/action/replication_record"}},"created_at":"2026-05-17T23:50:52.839582+00:00","updated_at":"2026-05-17T23:50:52.839582+00:00"}