{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YRX2T6KMXCX77OX5WZFJTVJY2Z","short_pith_number":"pith:YRX2T6KM","schema_version":"1.0","canonical_sha256":"c46fa9f94cb8afffbafdb64a99d538d66ef6b6b739c9ce070824211abbcb8667","source":{"kind":"arxiv","id":"1201.5298","version":1},"attestation_state":"computed","paper":{"title":"Scrabble is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karolina So{\\l}tys, Michael Lampis, Valia Mitsou","submitted_at":"2012-01-25T15:27:31Z","abstract_excerpt":"In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACE-completeness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn."},"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":"1201.5298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-01-25T15:27:31Z","cross_cats_sorted":[],"title_canon_sha256":"15a04be489c8827a0a9fa08a8d8ef022e9e3f072be2bb91353f462554323396d","abstract_canon_sha256":"93def993468b3996316ec7161255c50b8de9bdffa7a66727688a8c190a4d0c1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:55.092561Z","signature_b64":"NLWy225afh3kusPQKQ0ZlPwT/0M06CGmGET1Trtu7RAP4rkMLtp2OrhvhOxGtpY/NpKyENXF4vU2n0P/yH9yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c46fa9f94cb8afffbafdb64a99d538d66ef6b6b739c9ce070824211abbcb8667","last_reissued_at":"2026-05-18T04:03:55.092017Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:55.092017Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scrabble is PSPACE-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Karolina So{\\l}tys, Michael Lampis, Valia Mitsou","submitted_at":"2012-01-25T15:27:31Z","abstract_excerpt":"In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACE-completeness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5298","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":"1201.5298","created_at":"2026-05-18T04:03:55.092100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5298v1","created_at":"2026-05-18T04:03:55.092100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5298","created_at":"2026-05-18T04:03:55.092100+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRX2T6KMXCX7","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRX2T6KMXCX77OX5","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRX2T6KM","created_at":"2026-05-18T12:27:30.460161+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/YRX2T6KMXCX77OX5WZFJTVJY2Z","json":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z.json","graph_json":"https://pith.science/api/pith-number/YRX2T6KMXCX77OX5WZFJTVJY2Z/graph.json","events_json":"https://pith.science/api/pith-number/YRX2T6KMXCX77OX5WZFJTVJY2Z/events.json","paper":"https://pith.science/paper/YRX2T6KM"},"agent_actions":{"view_html":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z","download_json":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z.json","view_paper":"https://pith.science/paper/YRX2T6KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5298&json=true","fetch_graph":"https://pith.science/api/pith-number/YRX2T6KMXCX77OX5WZFJTVJY2Z/graph.json","fetch_events":"https://pith.science/api/pith-number/YRX2T6KMXCX77OX5WZFJTVJY2Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z/action/storage_attestation","attest_author":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z/action/author_attestation","sign_citation":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z/action/citation_signature","submit_replication":"https://pith.science/pith/YRX2T6KMXCX77OX5WZFJTVJY2Z/action/replication_record"}},"created_at":"2026-05-18T04:03:55.092100+00:00","updated_at":"2026-05-18T04:03:55.092100+00:00"}