{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VZF2QG7KJWD3POZ6X6CSJTFW7N","short_pith_number":"pith:VZF2QG7K","schema_version":"1.0","canonical_sha256":"ae4ba81bea4d87b7bb3ebf8524ccb6fb7210d53fcb7e506834f28347648eb0f6","source":{"kind":"arxiv","id":"1604.07811","version":1},"attestation_state":"computed","paper":{"title":"Counting SET-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nate Harman","submitted_at":"2016-04-26T19:36:47Z","abstract_excerpt":"We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to this question satisfies two polynomiality conditions."},"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":"1604.07811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-26T19:36:47Z","cross_cats_sorted":[],"title_canon_sha256":"5db10614a4b4c78eeab3c74d2030ed7ddfc2aca405e24ddc2dc76b19a0280c0b","abstract_canon_sha256":"92c9895efcfa78c1f87ef6b3fce7c95f01c27ef0fc862cb20b1ffc21fc32ee49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:11.935466Z","signature_b64":"M/21P5Vhw2TRUBIrNtB4FVNePZ5f2jSyiyi02QWUmeVfmpMnhT07kECpTeQqbbCe8b8cfkMHwpxvB0H/buEVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4ba81bea4d87b7bb3ebf8524ccb6fb7210d53fcb7e506834f28347648eb0f6","last_reissued_at":"2026-05-18T01:16:11.934792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:11.934792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting SET-free sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nate Harman","submitted_at":"2016-04-26T19:36:47Z","abstract_excerpt":"We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to this question satisfies two polynomiality conditions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07811","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":"1604.07811","created_at":"2026-05-18T01:16:11.934900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07811v1","created_at":"2026-05-18T01:16:11.934900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07811","created_at":"2026-05-18T01:16:11.934900+00:00"},{"alias_kind":"pith_short_12","alias_value":"VZF2QG7KJWD3","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VZF2QG7KJWD3POZ6","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VZF2QG7K","created_at":"2026-05-18T12:30:48.956258+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/VZF2QG7KJWD3POZ6X6CSJTFW7N","json":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N.json","graph_json":"https://pith.science/api/pith-number/VZF2QG7KJWD3POZ6X6CSJTFW7N/graph.json","events_json":"https://pith.science/api/pith-number/VZF2QG7KJWD3POZ6X6CSJTFW7N/events.json","paper":"https://pith.science/paper/VZF2QG7K"},"agent_actions":{"view_html":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N","download_json":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N.json","view_paper":"https://pith.science/paper/VZF2QG7K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07811&json=true","fetch_graph":"https://pith.science/api/pith-number/VZF2QG7KJWD3POZ6X6CSJTFW7N/graph.json","fetch_events":"https://pith.science/api/pith-number/VZF2QG7KJWD3POZ6X6CSJTFW7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N/action/storage_attestation","attest_author":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N/action/author_attestation","sign_citation":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N/action/citation_signature","submit_replication":"https://pith.science/pith/VZF2QG7KJWD3POZ6X6CSJTFW7N/action/replication_record"}},"created_at":"2026-05-18T01:16:11.934900+00:00","updated_at":"2026-05-18T01:16:11.934900+00:00"}