{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VUVPASNXSRHHCZCHZDU3UXF5NE","short_pith_number":"pith:VUVPASNX","schema_version":"1.0","canonical_sha256":"ad2af049b7944e716447c8e9ba5cbd69146da3c350ea5c6e3588796955394e9e","source":{"kind":"arxiv","id":"1211.0091","version":1},"attestation_state":"computed","paper":{"title":"Circular Nim Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Dufour, Silvia Heubach","submitted_at":"2012-11-01T04:35:57Z","abstract_excerpt":"A circular Nim game is a two player impartial combinatorial game consisting of n stacks of tokens placed in a circle. A move consists of choosing k consecutive stacks, and taking at least one token from one or more of the k stacks. The last player able to make a move wins. We prove results on the structure of the losing positions for small n and k and pose some open questions for further investigations."},"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":"1211.0091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-01T04:35:57Z","cross_cats_sorted":[],"title_canon_sha256":"7a076049df799d32e9af7160671ca98b69e7a0fcf2213948148e0da756f453e0","abstract_canon_sha256":"a0587932173b21bf1fbb68debbcaf5fa5a8a1282989b322b9d7fcf036319a5fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:43.165486Z","signature_b64":"tlaNGYLFxW2HB3x86PgXEbdUxzZG8ZZj4QfRgxPbdPkfiNgBMIE5u5sbACEU2Di9pe5f5SPtW3fcF8mb44QsBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2af049b7944e716447c8e9ba5cbd69146da3c350ea5c6e3588796955394e9e","last_reissued_at":"2026-05-18T03:41:43.164696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:43.164696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circular Nim Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Matthieu Dufour, Silvia Heubach","submitted_at":"2012-11-01T04:35:57Z","abstract_excerpt":"A circular Nim game is a two player impartial combinatorial game consisting of n stacks of tokens placed in a circle. A move consists of choosing k consecutive stacks, and taking at least one token from one or more of the k stacks. The last player able to make a move wins. We prove results on the structure of the losing positions for small n and k and pose some open questions for further investigations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0091","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":"1211.0091","created_at":"2026-05-18T03:41:43.164834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.0091v1","created_at":"2026-05-18T03:41:43.164834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0091","created_at":"2026-05-18T03:41:43.164834+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUVPASNXSRHH","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUVPASNXSRHHCZCH","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUVPASNX","created_at":"2026-05-18T12:27:25.539911+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/VUVPASNXSRHHCZCHZDU3UXF5NE","json":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE.json","graph_json":"https://pith.science/api/pith-number/VUVPASNXSRHHCZCHZDU3UXF5NE/graph.json","events_json":"https://pith.science/api/pith-number/VUVPASNXSRHHCZCHZDU3UXF5NE/events.json","paper":"https://pith.science/paper/VUVPASNX"},"agent_actions":{"view_html":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE","download_json":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE.json","view_paper":"https://pith.science/paper/VUVPASNX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.0091&json=true","fetch_graph":"https://pith.science/api/pith-number/VUVPASNXSRHHCZCHZDU3UXF5NE/graph.json","fetch_events":"https://pith.science/api/pith-number/VUVPASNXSRHHCZCHZDU3UXF5NE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE/action/storage_attestation","attest_author":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE/action/author_attestation","sign_citation":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE/action/citation_signature","submit_replication":"https://pith.science/pith/VUVPASNXSRHHCZCHZDU3UXF5NE/action/replication_record"}},"created_at":"2026-05-18T03:41:43.164834+00:00","updated_at":"2026-05-18T03:41:43.164834+00:00"}