{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B4DZJ5G2EVNRBKDEBXOU4JEUX5","short_pith_number":"pith:B4DZJ5G2","canonical_record":{"source":{"id":"2605.14321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T03:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"51162b8cfa560ebc9be84d3add6601169d47f85da43e3419ef31d1d51947f659","abstract_canon_sha256":"a2a42acba97399b2d184611aa46873dad439558909003856cb00ae9edd3444fc"},"schema_version":"1.0"},"canonical_sha256":"0f0794f4da255b10a8640ddd4e2494bf622327aae8afc2ec77e8c53aae6610b2","source":{"kind":"arxiv","id":"2605.14321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14321","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14321v1","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14321","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"B4DZJ5G2EVNR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"B4DZJ5G2EVNRBKDE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"B4DZJ5G2","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B4DZJ5G2EVNRBKDEBXOU4JEUX5","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14321","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T03:34:08Z","cross_cats_sorted":[],"title_canon_sha256":"51162b8cfa560ebc9be84d3add6601169d47f85da43e3419ef31d1d51947f659","abstract_canon_sha256":"a2a42acba97399b2d184611aa46873dad439558909003856cb00ae9edd3444fc"},"schema_version":"1.0"},"canonical_sha256":"0f0794f4da255b10a8640ddd4e2494bf622327aae8afc2ec77e8c53aae6610b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:09.834932Z","signature_b64":"5rLJqANdBnrv4FQdyqLNr8KaydjmeJUQKSjLionF5xL9csnNZyltctHZCV7lQJBjlXafMy3baMotwhCeCmNCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f0794f4da255b10a8640ddd4e2494bf622327aae8afc2ec77e8c53aae6610b2","last_reissued_at":"2026-05-17T23:39:09.832341Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:09.832341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14321","source_version":1,"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-17T23:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZypdSu/E/al6v/a6YI8eF6tfs8OC7vTvsAzw0vKEUZIxihjObbcHDo+Of7bDIcSgTx73QhM0MISLoMmYvBbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:13:58.140596Z"},"content_sha256":"a426db491ba802ce5ddcaf41182280fd11e19e544fa315e29bc33fb7fdea9352","schema_version":"1.0","event_id":"sha256:a426db491ba802ce5ddcaf41182280fd11e19e544fa315e29bc33fb7fdea9352"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B4DZJ5G2EVNRBKDEBXOU4JEUX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Subtraction Nim with a Pass","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged.","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hikaru Manabe, Ryohei Miyadera, Urban Larsson","submitted_at":"2026-05-14T03:34:08Z","abstract_excerpt":"We consider a subtraction Nim with subtraction set {s_1,s_2,s_3={2,4n,4n+2}, where n is a positive integer such that n >= 3. We do not treat the case that n=1 or n=2 in this article. We show that this game satisfies the reverse-mex property of Grundy numbers, i.e., G(x)=mex{G(x+s_1), G(x+s_2), G(x+s_3)}, where the mex is taken over successors rather than predecessors. We modify the rule of this subtraction Nim to allow a one-time pass, that is, a passing move usable at most once during the game, unavailable from terminal positions; once used by either player, it becomes unavailable. In classic"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that this game still satisfies the reverse-mex property of Grundy numbers when a pass move is available.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The subtraction set must be exactly {2, 4n, 4n+2} for integer n ≥ 3; the reverse-mex property is stated not to hold for n=1 or n=2, and the proofs rely on this specific arithmetic form.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Subtraction Nim with moves {2,4n,4n+2} (n≥3) and its one-time-pass variant both satisfy the reverse-mex property for Grundy numbers.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c87d51fd54818645248ef59be459902a7486bd9a550cf6a3e6f6990aae57f0da"},"source":{"id":"2605.14321","kind":"arxiv","version":1},"verdict":{"id":"38d70c46-cda5-4637-8360-82f6799553d9","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:38:54.294616Z","strongest_claim":"We prove that this game still satisfies the reverse-mex property of Grundy numbers when a pass move is available.","one_line_summary":"Subtraction Nim with moves {2,4n,4n+2} (n≥3) and its one-time-pass variant both satisfy the reverse-mex property for Grundy numbers.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The subtraction set must be exactly {2, 4n, 4n+2} for integer n ≥ 3; the reverse-mex property is stated not to hold for n=1 or n=2, and the proofs rely on this specific arithmetic form.","pith_extraction_headline":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged."},"references":{"count":13,"sample":[{"doi":"","year":2019,"title":"M. H. Albert, R. J. Nowakowski, and D. W olfe, Lessons In Play: An Introduction to Combi- natorial Game Theory , second edition, A K Peters/CRC Press, Boca Raton, FL, 2019","work_id":"cdaa7b1d-712f-4108-aa4f-86d4a0bced72","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Anjali Bhagat, Urban Larsson, Hikaru Manabe, Takahiro Y amashita, Additive sink subtrac- tion, Preprint arXiv:2601.18715 (2026)","work_id":"a2f53834-0dd7-413f-9efc-327901c20852","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"W. H. Chan, R. M. Low, S. C. Locke, and O.L. W ong, A map of the P-positions in ‘Nim With a Pass’ played on heap sizes of at most four, Discrete Applied Mathematics 244 (2018), 44-55","work_id":"c21bea2b-5a59-48a8-8c14-97fd04cbcb3f","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1966,"title":"S. W. Golomb, A mathematical investigation of games of “t ake-away”, J. Combinatorial Theory, 1(4) (1966), 443– 458","work_id":"3b23ee8d-cfce-4c44-af8a-0da0cfc0ce20","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2003,"title":"D. G. Horrocks and R. J. Nowakowski, Regularity in the G–S equences of Octal Games with a Pass, Integers 3 (2003), #G1","work_id":"f6e67158-94f9-460d-ac96-6ed44c7420ff","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":13,"snapshot_sha256":"b42cd6cee05376e835ae01ae111ecda5c444e8b5471c83ce607ba26a8d7ff20f","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":"38d70c46-cda5-4637-8360-82f6799553d9"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eEbkwedsu9cgymMD04tfwrjKfNzj7NhrLJrY3/MwvDpTHEDpRHVuNBgBmP+c7v9C1YqK6X0G80InFJhKfSrxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T10:13:58.141842Z"},"content_sha256":"e2f0d4f49852c37061b89898cdd4655e937d498b4234285ac5e015d8ce1f95b9","schema_version":"1.0","event_id":"sha256:e2f0d4f49852c37061b89898cdd4655e937d498b4234285ac5e015d8ce1f95b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/bundle.json","state_url":"https://pith.science/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/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-06-10T10:13:58Z","links":{"resolver":"https://pith.science/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5","bundle":"https://pith.science/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/bundle.json","state":"https://pith.science/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B4DZJ5G2EVNRBKDEBXOU4JEUX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B4DZJ5G2EVNRBKDEBXOU4JEUX5","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":"a2a42acba97399b2d184611aa46873dad439558909003856cb00ae9edd3444fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T03:34:08Z","title_canon_sha256":"51162b8cfa560ebc9be84d3add6601169d47f85da43e3419ef31d1d51947f659"},"schema_version":"1.0","source":{"id":"2605.14321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14321","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14321v1","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14321","created_at":"2026-05-17T23:39:09Z"},{"alias_kind":"pith_short_12","alias_value":"B4DZJ5G2EVNR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"B4DZJ5G2EVNRBKDE","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"B4DZJ5G2","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e2f0d4f49852c37061b89898cdd4655e937d498b4234285ac5e015d8ce1f95b9","target":"graph","created_at":"2026-05-17T23:39:09Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that this game still satisfies the reverse-mex property of Grundy numbers when a pass move is available."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The subtraction set must be exactly {2, 4n, 4n+2} for integer n ≥ 3; the reverse-mex property is stated not to hold for n=1 or n=2, and the proofs rely on this specific arithmetic form."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Subtraction Nim with moves {2,4n,4n+2} (n≥3) and its one-time-pass variant both satisfy the reverse-mex property for Grundy numbers."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged."}],"snapshot_sha256":"c87d51fd54818645248ef59be459902a7486bd9a550cf6a3e6f6990aae57f0da"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider a subtraction Nim with subtraction set {s_1,s_2,s_3={2,4n,4n+2}, where n is a positive integer such that n >= 3. We do not treat the case that n=1 or n=2 in this article. We show that this game satisfies the reverse-mex property of Grundy numbers, i.e., G(x)=mex{G(x+s_1), G(x+s_2), G(x+s_3)}, where the mex is taken over successors rather than predecessors. We modify the rule of this subtraction Nim to allow a one-time pass, that is, a passing move usable at most once during the game, unavailable from terminal positions; once used by either player, it becomes unavailable. In classic","authors_text":"Hikaru Manabe, Ryohei Miyadera, Urban Larsson","cross_cats":[],"headline":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T03:34:08Z","title":"A Subtraction Nim with a Pass"},"references":{"count":13,"internal_anchors":0,"resolved_work":13,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"M. H. Albert, R. J. Nowakowski, and D. W olfe, Lessons In Play: An Introduction to Combi- natorial Game Theory , second edition, A K Peters/CRC Press, Boca Raton, FL, 2019","work_id":"cdaa7b1d-712f-4108-aa4f-86d4a0bced72","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Anjali Bhagat, Urban Larsson, Hikaru Manabe, Takahiro Y amashita, Additive sink subtrac- tion, Preprint arXiv:2601.18715 (2026)","work_id":"a2f53834-0dd7-413f-9efc-327901c20852","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"W. H. Chan, R. M. Low, S. C. Locke, and O.L. W ong, A map of the P-positions in ‘Nim With a Pass’ played on heap sizes of at most four, Discrete Applied Mathematics 244 (2018), 44-55","work_id":"c21bea2b-5a59-48a8-8c14-97fd04cbcb3f","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"S. W. Golomb, A mathematical investigation of games of “t ake-away”, J. Combinatorial Theory, 1(4) (1966), 443– 458","work_id":"3b23ee8d-cfce-4c44-af8a-0da0cfc0ce20","year":1966},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"D. G. Horrocks and R. J. Nowakowski, Regularity in the G–S equences of Octal Games with a Pass, Integers 3 (2003), #G1","work_id":"f6e67158-94f9-460d-ac96-6ed44c7420ff","year":2003}],"snapshot_sha256":"b42cd6cee05376e835ae01ae111ecda5c444e8b5471c83ce607ba26a8d7ff20f"},"source":{"id":"2605.14321","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:38:54.294616Z","id":"38d70c46-cda5-4637-8360-82f6799553d9","model_set":{"reader":"grok-4.3"},"one_line_summary":"Subtraction Nim with moves {2,4n,4n+2} (n≥3) and its one-time-pass variant both satisfy the reverse-mex property for Grundy numbers.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Adding a one-time pass to this subtraction Nim leaves its reverse-mex Grundy property unchanged.","strongest_claim":"We prove that this game still satisfies the reverse-mex property of Grundy numbers when a pass move is available.","weakest_assumption":"The subtraction set must be exactly {2, 4n, 4n+2} for integer n ≥ 3; the reverse-mex property is stated not to hold for n=1 or n=2, and the proofs rely on this specific arithmetic form."}},"verdict_id":"38d70c46-cda5-4637-8360-82f6799553d9"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a426db491ba802ce5ddcaf41182280fd11e19e544fa315e29bc33fb7fdea9352","target":"record","created_at":"2026-05-17T23:39:09Z","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":"a2a42acba97399b2d184611aa46873dad439558909003856cb00ae9edd3444fc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-14T03:34:08Z","title_canon_sha256":"51162b8cfa560ebc9be84d3add6601169d47f85da43e3419ef31d1d51947f659"},"schema_version":"1.0","source":{"id":"2605.14321","kind":"arxiv","version":1}},"canonical_sha256":"0f0794f4da255b10a8640ddd4e2494bf622327aae8afc2ec77e8c53aae6610b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f0794f4da255b10a8640ddd4e2494bf622327aae8afc2ec77e8c53aae6610b2","first_computed_at":"2026-05-17T23:39:09.832341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:09.832341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5rLJqANdBnrv4FQdyqLNr8KaydjmeJUQKSjLionF5xL9csnNZyltctHZCV7lQJBjlXafMy3baMotwhCeCmNCCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:09.834932Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a426db491ba802ce5ddcaf41182280fd11e19e544fa315e29bc33fb7fdea9352","sha256:e2f0d4f49852c37061b89898cdd4655e937d498b4234285ac5e015d8ce1f95b9"],"state_sha256":"d7540236f8748c1c836d0afeb3efa2c204269148decf4826848b6b25c4a39c52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jsy+Z+zQx2ZOlBS293Sn6iByyqcrVf2cyPqCJhl9Q/xzJ8epuJcGEI4WYHfjGIHjUCzSeBPE7mgKNcmDIEHsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T10:13:58.147479Z","bundle_sha256":"24225ef1f9726da8d954a6ea99130214a2f56bc02adc4731645ed86736282b9f"}}