{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:V6B4NXAHVN7F4JPFQEN7HFDQVT","short_pith_number":"pith:V6B4NXAH","schema_version":"1.0","canonical_sha256":"af83c6dc07ab7e5e25e5811bf39470acf3c26c2cbf679654c15f1de039fd1525","source":{"kind":"arxiv","id":"1101.4420","version":1},"attestation_state":"computed","paper":{"title":"A finite goal set in the plane which is not a Winner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Wesley Pegden","submitted_at":"2011-01-24T00:43:53Z","abstract_excerpt":"J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal set G (it has 5 points) which Player 1 cannot construct before Player 2 in this achievement game played in the plane."},"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":"1101.4420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-24T00:43:53Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"b083c936bb5df905bd11cb9f50b257aab682e14496bbaf4880232bd1fa2198af","abstract_canon_sha256":"e1cfd5ec23807bf18fc33b6824c8312655afcf1e62fcdeff3a8ce799e86a2e94"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:11.070867Z","signature_b64":"GtZGEb/Spal7LG4ISIUlXyShhWtSXE80kqzU+v7dgxG66OgBZC2mMaDqM53IwqgYgKEliUEXGsUNgb3A1TNXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af83c6dc07ab7e5e25e5811bf39470acf3c26c2cbf679654c15f1de039fd1525","last_reissued_at":"2026-05-18T04:31:11.070306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:11.070306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A finite goal set in the plane which is not a Winner","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Wesley Pegden","submitted_at":"2011-01-24T00:43:53Z","abstract_excerpt":"J. Beck has shown that if two players alternately select previously unchosen points from the plane, Player 1 can always build a congruent copy of any given finite goal set G, in spite of Player 2's efforts to stop him. We give a finite goal set G (it has 5 points) which Player 1 cannot construct before Player 2 in this achievement game played in the plane."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4420","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":"1101.4420","created_at":"2026-05-18T04:31:11.070401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4420v1","created_at":"2026-05-18T04:31:11.070401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4420","created_at":"2026-05-18T04:31:11.070401+00:00"},{"alias_kind":"pith_short_12","alias_value":"V6B4NXAHVN7F","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"V6B4NXAHVN7F4JPF","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"V6B4NXAH","created_at":"2026-05-18T12:26:42.757692+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/V6B4NXAHVN7F4JPFQEN7HFDQVT","json":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT.json","graph_json":"https://pith.science/api/pith-number/V6B4NXAHVN7F4JPFQEN7HFDQVT/graph.json","events_json":"https://pith.science/api/pith-number/V6B4NXAHVN7F4JPFQEN7HFDQVT/events.json","paper":"https://pith.science/paper/V6B4NXAH"},"agent_actions":{"view_html":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT","download_json":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT.json","view_paper":"https://pith.science/paper/V6B4NXAH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4420&json=true","fetch_graph":"https://pith.science/api/pith-number/V6B4NXAHVN7F4JPFQEN7HFDQVT/graph.json","fetch_events":"https://pith.science/api/pith-number/V6B4NXAHVN7F4JPFQEN7HFDQVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT/action/storage_attestation","attest_author":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT/action/author_attestation","sign_citation":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT/action/citation_signature","submit_replication":"https://pith.science/pith/V6B4NXAHVN7F4JPFQEN7HFDQVT/action/replication_record"}},"created_at":"2026-05-18T04:31:11.070401+00:00","updated_at":"2026-05-18T04:31:11.070401+00:00"}