{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:APHZ3SCNBR2QHCZIZEODHYFFQK","short_pith_number":"pith:APHZ3SCN","schema_version":"1.0","canonical_sha256":"03cf9dc84d0c75038b28c91c33e0a58285e6e0e3f141d1fdc28628cc06720ea7","source":{"kind":"arxiv","id":"1310.1327","version":2},"attestation_state":"computed","paper":{"title":"Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds","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-04T15:57:20Z","abstract_excerpt":"A strong placement game $G$ played on a board $B$ is equivalent to a simplicial complex $\\Delta_{G,B}$. We look at weight games, a subclass of strong placement games, and introduce upper bounds on the number of positions with $i$ pieces in $G$, or equivalently the number of faces with $i$ vertices in $\\Delta_{G,B}$, which are reminiscent of the Kruskal-Katona bounds."},"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.1327","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-04T15:57:20Z","cross_cats_sorted":[],"title_canon_sha256":"ec0f2aef07371a15520bbc3475d5e6b373f0b12c4fad61f7dadd453ab4a1cd52","abstract_canon_sha256":"d7a4997df1b1ca58cb89edba83c84bf5d22438e1dc88a9787cf1fb180b28a93f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:58.802444Z","signature_b64":"j3VBm3NyjVrq0XnCmyb6nEWcb1IH3paDXyNvHQo9spTPY1gISF5rqMFlJv0sFnHMTfXmhM5Jn6ECLZ2sME1zDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03cf9dc84d0c75038b28c91c33e0a58285e6e0e3f141d1fdc28628cc06720ea7","last_reissued_at":"2026-05-18T01:33:58.801975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:58.801975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Games and Complexes II: Weight Games and Kruskal-Katona Type Bounds","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-04T15:57:20Z","abstract_excerpt":"A strong placement game $G$ played on a board $B$ is equivalent to a simplicial complex $\\Delta_{G,B}$. We look at weight games, a subclass of strong placement games, and introduce upper bounds on the number of positions with $i$ pieces in $G$, or equivalently the number of faces with $i$ vertices in $\\Delta_{G,B}$, which are reminiscent of the Kruskal-Katona bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1327","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.1327","created_at":"2026-05-18T01:33:58.802041+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1327v2","created_at":"2026-05-18T01:33:58.802041+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1327","created_at":"2026-05-18T01:33:58.802041+00:00"},{"alias_kind":"pith_short_12","alias_value":"APHZ3SCNBR2Q","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"APHZ3SCNBR2QHCZI","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"APHZ3SCN","created_at":"2026-05-18T12:27:38.830355+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/APHZ3SCNBR2QHCZIZEODHYFFQK","json":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK.json","graph_json":"https://pith.science/api/pith-number/APHZ3SCNBR2QHCZIZEODHYFFQK/graph.json","events_json":"https://pith.science/api/pith-number/APHZ3SCNBR2QHCZIZEODHYFFQK/events.json","paper":"https://pith.science/paper/APHZ3SCN"},"agent_actions":{"view_html":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK","download_json":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK.json","view_paper":"https://pith.science/paper/APHZ3SCN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1327&json=true","fetch_graph":"https://pith.science/api/pith-number/APHZ3SCNBR2QHCZIZEODHYFFQK/graph.json","fetch_events":"https://pith.science/api/pith-number/APHZ3SCNBR2QHCZIZEODHYFFQK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK/action/storage_attestation","attest_author":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK/action/author_attestation","sign_citation":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK/action/citation_signature","submit_replication":"https://pith.science/pith/APHZ3SCNBR2QHCZIZEODHYFFQK/action/replication_record"}},"created_at":"2026-05-18T01:33:58.802041+00:00","updated_at":"2026-05-18T01:33:58.802041+00:00"}