{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AV6YEX4N5A36HK4ZIKO4MLBPDP","short_pith_number":"pith:AV6YEX4N","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"},"canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","source":{"kind":"arxiv","id":"1107.1878","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1878","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1878v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1878","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"AV6YEX4N5A36","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AV6YEX4N5A36HK4Z","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AV6YEX4N","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AV6YEX4N5A36HK4ZIKO4MLBPDP","target":"record","payload":{"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"},"canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","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"},"source_kind":"arxiv","source_id":"1107.1878","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-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w4kYMSMnTWF4oyVhxAhemtmvHHx9HM9+YbzdK71hwHRI5fWnyOT8QfC9OGhEUgcCaBTyNEYTsb2jyamXfWMfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:02.246273Z"},"content_sha256":"23bee5bfc6103ed31f9f05168eb22856c651659e4d2719a9d10a79cef1240019","schema_version":"1.0","event_id":"sha256:23bee5bfc6103ed31f9f05168eb22856c651659e4d2719a9d10a79cef1240019"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AV6YEX4N5A36HK4ZIKO4MLBPDP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:18:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5/0zMZK+R9W5ww/StmuUPBilEZjh803L9g8g6EuDErWpqSrjBVNIV5iTvV24BT7HEV50WkJAVd3IXuHoQ+KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:02.254868Z"},"content_sha256":"e52da2cfaa754d0e6d9a6afcf234ff112b40670f66091640c95eb83da6e4d4f7","schema_version":"1.0","event_id":"sha256:e52da2cfaa754d0e6d9a6afcf234ff112b40670f66091640c95eb83da6e4d4f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/bundle.json","state_url":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/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-08T15:57:02Z","links":{"resolver":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP","bundle":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/bundle.json","state":"https://pith.science/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AV6YEX4N5A36HK4ZIKO4MLBPDP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AV6YEX4N5A36HK4ZIKO4MLBPDP","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":"6351056be75f622a571a0a18f2f6f5efba0e84ff512da0d3979804336b4412bc","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T18:14:30Z","title_canon_sha256":"2604decde0d849034e31958789d6695ec2dc72a21aace9d9c93e0132b8d9b2b7"},"schema_version":"1.0","source":{"id":"1107.1878","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.1878","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.1878v1","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1878","created_at":"2026-05-18T04:18:33Z"},{"alias_kind":"pith_short_12","alias_value":"AV6YEX4N5A36","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AV6YEX4N5A36HK4Z","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AV6YEX4N","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:e52da2cfaa754d0e6d9a6afcf234ff112b40670f66091640c95eb83da6e4d4f7","target":"graph","created_at":"2026-05-18T04:18:33Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ian Norris, Nandor Sieben","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T18:14:30Z","title":"Biased Weak Polyform Achievement Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1878","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:23bee5bfc6103ed31f9f05168eb22856c651659e4d2719a9d10a79cef1240019","target":"record","created_at":"2026-05-18T04:18:33Z","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":"6351056be75f622a571a0a18f2f6f5efba0e84ff512da0d3979804336b4412bc","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-10T18:14:30Z","title_canon_sha256":"2604decde0d849034e31958789d6695ec2dc72a21aace9d9c93e0132b8d9b2b7"},"schema_version":"1.0","source":{"id":"1107.1878","kind":"arxiv","version":1}},"canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"057d825f8de837e3ab99429dc62c2f1be519f55973d8c7a57ee5b06d3c13f98d","first_computed_at":"2026-05-18T04:18:33.979845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:33.979845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mK9L3tFGei2w4kc9nQ5BFlEzUr8oGlCTlM2tH1Gn72sYAvkMuJI9Ym2WHBs/2Y6RXs2Z3XXT+nB/oV9gBygADw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:33.980572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.1878","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23bee5bfc6103ed31f9f05168eb22856c651659e4d2719a9d10a79cef1240019","sha256:e52da2cfaa754d0e6d9a6afcf234ff112b40670f66091640c95eb83da6e4d4f7"],"state_sha256":"cd17310a5c99cc6b24a10f911e5005e923a0c8ff5e78724eeff15383e223e4fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+310jfsp0meKSMiiCEdE8ihFQj0d4mVo086p8/9qyTdBBJ6/L7BJ31nKyjJwhDx4+9cqbHUZj2FT1vyogaUHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:57:02.270350Z","bundle_sha256":"4396c9b4f16fbae1855a7ee0ac4069a4bec006abe3fcca4a0bdefb9e4a33d21d"}}