{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:POBNTGABSA7Q3Y2BJCPWSWL3O3","short_pith_number":"pith:POBNTGAB","schema_version":"1.0","canonical_sha256":"7b82d99801903f0de341489f69597b76ce16122e0b38b75cd65a3af388ee6828","source":{"kind":"arxiv","id":"1510.02875","version":1},"attestation_state":"computed","paper":{"title":"Exploring mod2 n-queens games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abrahim Ladha, Tricia Muldoon Brown","submitted_at":"2015-10-10T04:19:37Z","abstract_excerpt":"We introduce a two player game on an n x n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the number of queens already on the board which can attack that square modulo two. The game is explored along with some variations and its complexity."},"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":"1510.02875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-10T04:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"e7af0605efc3a556ae719419940e26e67724449f2bd4c0d05847463c32939654","abstract_canon_sha256":"8a5fbbce2869455d48188c7e566b755702307538f3a714b30811bfb7fd627404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:33.502211Z","signature_b64":"TtW2OJ74kBWB0pbZucqoEjBvRbQrwxhuF7Z/KhMNjvcEkIYXGrqRPx/l6p5Czj32rooQrD3QGwDVybDO1UJ7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b82d99801903f0de341489f69597b76ce16122e0b38b75cd65a3af388ee6828","last_reissued_at":"2026-05-18T01:30:33.501628Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:33.501628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring mod2 n-queens games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abrahim Ladha, Tricia Muldoon Brown","submitted_at":"2015-10-10T04:19:37Z","abstract_excerpt":"We introduce a two player game on an n x n chessboard where queens are placed by alternating turns on a chessboard square whose availability is determined by the number of queens already on the board which can attack that square modulo two. The game is explored along with some variations and its complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02875","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":"1510.02875","created_at":"2026-05-18T01:30:33.501714+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.02875v1","created_at":"2026-05-18T01:30:33.501714+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02875","created_at":"2026-05-18T01:30:33.501714+00:00"},{"alias_kind":"pith_short_12","alias_value":"POBNTGABSA7Q","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"POBNTGABSA7Q3Y2B","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"POBNTGAB","created_at":"2026-05-18T12:29:37.295048+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/POBNTGABSA7Q3Y2BJCPWSWL3O3","json":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3.json","graph_json":"https://pith.science/api/pith-number/POBNTGABSA7Q3Y2BJCPWSWL3O3/graph.json","events_json":"https://pith.science/api/pith-number/POBNTGABSA7Q3Y2BJCPWSWL3O3/events.json","paper":"https://pith.science/paper/POBNTGAB"},"agent_actions":{"view_html":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3","download_json":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3.json","view_paper":"https://pith.science/paper/POBNTGAB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.02875&json=true","fetch_graph":"https://pith.science/api/pith-number/POBNTGABSA7Q3Y2BJCPWSWL3O3/graph.json","fetch_events":"https://pith.science/api/pith-number/POBNTGABSA7Q3Y2BJCPWSWL3O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3/action/storage_attestation","attest_author":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3/action/author_attestation","sign_citation":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3/action/citation_signature","submit_replication":"https://pith.science/pith/POBNTGABSA7Q3Y2BJCPWSWL3O3/action/replication_record"}},"created_at":"2026-05-18T01:30:33.501714+00:00","updated_at":"2026-05-18T01:30:33.501714+00:00"}