{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IEYKP7MSCCRZVFRIBSXVZ2XWAO","short_pith_number":"pith:IEYKP7MS","schema_version":"1.0","canonical_sha256":"4130a7fd9210a39a96280caf5ceaf603bc20469a666f13e6717e40ba2024c414","source":{"kind":"arxiv","id":"1310.1281","version":2},"attestation_state":"computed","paper":{"title":"Games and Complexes I: Transformation via Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard J. Nowakowski, Sara Faridi, Svenja Huntemann","submitted_at":"2013-10-04T14:13:20Z","abstract_excerpt":"Placement games are a subclass of combinatorial games which are played on graphs. We will demonstrate that one can construct simplicial complexes corresponding to a placement game, and this game could be considered as a game played on these simplicial complexes. These complexes are constructed using square-free monomials."},"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":"1310.1281","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T14:13:20Z","cross_cats_sorted":[],"title_canon_sha256":"03e003187c30a2a59b6373e3846e51e0b401f3df624e24f597b86dedeb1a96bd","abstract_canon_sha256":"9c789af8d8f8f55dd4508f56caed7aae6ad864de4abebe161cac3de1f266a8e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:58.809115Z","signature_b64":"TVqFMfxTJimn9TKLKfjM+mzh/Bxu/WIkowmJti4kvWNV5oZAznb+UUkxkrzx9dwpA1VoFNzR7nFQHgLKZ7aLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4130a7fd9210a39a96280caf5ceaf603bc20469a666f13e6717e40ba2024c414","last_reissued_at":"2026-05-18T01:33:58.808586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:58.808586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Games and Complexes I: Transformation via Ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard J. Nowakowski, Sara Faridi, Svenja Huntemann","submitted_at":"2013-10-04T14:13:20Z","abstract_excerpt":"Placement games are a subclass of combinatorial games which are played on graphs. We will demonstrate that one can construct simplicial complexes corresponding to a placement game, and this game could be considered as a game played on these simplicial complexes. These complexes are constructed using square-free monomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1281","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":"1310.1281","created_at":"2026-05-18T01:33:58.808671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1281v2","created_at":"2026-05-18T01:33:58.808671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1281","created_at":"2026-05-18T01:33:58.808671+00:00"},{"alias_kind":"pith_short_12","alias_value":"IEYKP7MSCCRZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"IEYKP7MSCCRZVFRI","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"IEYKP7MS","created_at":"2026-05-18T12:27:46.883200+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/IEYKP7MSCCRZVFRIBSXVZ2XWAO","json":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO.json","graph_json":"https://pith.science/api/pith-number/IEYKP7MSCCRZVFRIBSXVZ2XWAO/graph.json","events_json":"https://pith.science/api/pith-number/IEYKP7MSCCRZVFRIBSXVZ2XWAO/events.json","paper":"https://pith.science/paper/IEYKP7MS"},"agent_actions":{"view_html":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO","download_json":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO.json","view_paper":"https://pith.science/paper/IEYKP7MS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1281&json=true","fetch_graph":"https://pith.science/api/pith-number/IEYKP7MSCCRZVFRIBSXVZ2XWAO/graph.json","fetch_events":"https://pith.science/api/pith-number/IEYKP7MSCCRZVFRIBSXVZ2XWAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO/action/storage_attestation","attest_author":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO/action/author_attestation","sign_citation":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO/action/citation_signature","submit_replication":"https://pith.science/pith/IEYKP7MSCCRZVFRIBSXVZ2XWAO/action/replication_record"}},"created_at":"2026-05-18T01:33:58.808671+00:00","updated_at":"2026-05-18T01:33:58.808671+00:00"}