{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6","short_pith_number":"pith:Y4YO7ZTU","schema_version":"1.0","canonical_sha256":"c730efe6749c8c7280f9655a756b3fc793f1b222a02bb947796469408d46ef14","source":{"kind":"arxiv","id":"1606.02645","version":2},"attestation_state":"computed","paper":{"title":"Simplified Boardgames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jakub Kowalski, Jakub Sutowicz, Marek Szyku{\\l}a","submitted_at":"2016-06-08T17:29:17Z","abstract_excerpt":"We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games. The language structure is based on the regular expressions, which makes the rules easily machine-processable while keeping the rules concise and fairly human-readable."},"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":"1606.02645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-06-08T17:29:17Z","cross_cats_sorted":[],"title_canon_sha256":"0ef018cb4d8ab4a6f4536c06d538d80af237ae2f5764b5b36503ac7f1c3e6288","abstract_canon_sha256":"c69042fcb7128ec37f26c1be461a85e8ed1c9ce9c63ac8356d3082e37c435127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:01.777760Z","signature_b64":"iti/jgVO41uCyKPuqbkQBHZnhuNXbivPZ0etUs8RSH7mDwbGlC+Z/5E7bRW6dJyBGrOryMQQEOIdv9qnv8jwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c730efe6749c8c7280f9655a756b3fc793f1b222a02bb947796469408d46ef14","last_reissued_at":"2026-05-18T01:11:01.777220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:01.777220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplified Boardgames","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Jakub Kowalski, Jakub Sutowicz, Marek Szyku{\\l}a","submitted_at":"2016-06-08T17:29:17Z","abstract_excerpt":"We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games. The language structure is based on the regular expressions, which makes the rules easily machine-processable while keeping the rules concise and fairly human-readable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02645","kind":"arxiv","version":2},"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":"1606.02645","created_at":"2026-05-18T01:11:01.777329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02645v2","created_at":"2026-05-18T01:11:01.777329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02645","created_at":"2026-05-18T01:11:01.777329+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y4YO7ZTUTSGH","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y4YO7ZTUTSGHFAHZ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y4YO7ZTU","created_at":"2026-05-18T12:30:53.716459+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/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6","json":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6.json","graph_json":"https://pith.science/api/pith-number/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/graph.json","events_json":"https://pith.science/api/pith-number/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/events.json","paper":"https://pith.science/paper/Y4YO7ZTU"},"agent_actions":{"view_html":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6","download_json":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6.json","view_paper":"https://pith.science/paper/Y4YO7ZTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02645&json=true","fetch_graph":"https://pith.science/api/pith-number/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/graph.json","fetch_events":"https://pith.science/api/pith-number/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/action/storage_attestation","attest_author":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/action/author_attestation","sign_citation":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/action/citation_signature","submit_replication":"https://pith.science/pith/Y4YO7ZTUTSGHFAHZMVNHK2Z7Y6/action/replication_record"}},"created_at":"2026-05-18T01:11:01.777329+00:00","updated_at":"2026-05-18T01:11:01.777329+00:00"}