{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:AV6YEX4N5A36HK4ZIKO4MLBPDP","short_pith_number":"pith:AV6YEX4N","schema_version":"1.0","canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","source":{"kind":"arxiv","id":"1107.1878","version":1},"attestation_state":"computed","paper":{"title":"Biased Weak Polyform Achievement Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Ian Norris, Nandor Sieben","submitted_at":"2011-07-10T18:14:30Z","abstract_excerpt":"In a biased weak $(a,b)$ polyform achievement game, the maker and the breaker alternately mark $a,b$ previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the $(a,b)$ game can be built from winning strategies for games involving fewer marks for the maker and the breaker. A new type of breaker strategy called the priority strategy is introduced. The winners are determined for all $(a,b)$ pairs for polyiamonds and polyominoes up"},"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":"1107.1878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T18:14:30Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2604decde0d849034e31958789d6695ec2dc72a21aace9d9c93e0132b8d9b2b7","abstract_canon_sha256":"6351056be75f622a571a0a18f2f6f5efba0e84ff512da0d3979804336b4412bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:33.980572Z","signature_b64":"mK9L3tFGei2w4kc9nQ5BFlEzUr8oGlCTlM2tH1Gn72sYAvkMuJI9Ym2WHBs/2Y6RXs2Z3XXT+nB/oV9gBygADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","last_reissued_at":"2026-05-18T04:18:33.979845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:33.979845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Biased Weak Polyform Achievement Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Ian Norris, Nandor Sieben","submitted_at":"2011-07-10T18:14:30Z","abstract_excerpt":"In a biased weak $(a,b)$ polyform achievement game, the maker and the breaker alternately mark $a,b$ previously unmarked cells on an infinite board, respectively. The maker's goal is to mark a set of cells congruent to a polyform. The breaker tries to prevent the maker from achieving this goal. A winning maker strategy for the $(a,b)$ game can be built from winning strategies for games involving fewer marks for the maker and the breaker. A new type of breaker strategy called the priority strategy is introduced. The winners are determined for all $(a,b)$ pairs for polyiamonds and polyominoes up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1878","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":"1107.1878","created_at":"2026-05-18T04:18:33.979949+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1878v1","created_at":"2026-05-18T04:18:33.979949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1878","created_at":"2026-05-18T04:18:33.979949+00:00"},{"alias_kind":"pith_short_12","alias_value":"AV6YEX4N5A36","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"AV6YEX4N5A36HK4Z","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"AV6YEX4N","created_at":"2026-05-18T12:26:24.575870+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/AV6YEX4N5A36HK4ZIKO4MLBPDP","json":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP.json","graph_json":"https://pith.science/api/pith-number/AV6YEX4N5A36HK4ZIKO4MLBPDP/graph.json","events_json":"https://pith.science/api/pith-number/AV6YEX4N5A36HK4ZIKO4MLBPDP/events.json","paper":"https://pith.science/paper/AV6YEX4N"},"agent_actions":{"view_html":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP","download_json":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP.json","view_paper":"https://pith.science/paper/AV6YEX4N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1878&json=true","fetch_graph":"https://pith.science/api/pith-number/AV6YEX4N5A36HK4ZIKO4MLBPDP/graph.json","fetch_events":"https://pith.science/api/pith-number/AV6YEX4N5A36HK4ZIKO4MLBPDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/action/storage_attestation","attest_author":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/action/author_attestation","sign_citation":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/action/citation_signature","submit_replication":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/action/replication_record"}},"created_at":"2026-05-18T04:18:33.979949+00:00","updated_at":"2026-05-18T04:18:33.979949+00:00"}