{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VZF2QG7KJWD3POZ6X6CSJTFW7N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"92c9895efcfa78c1f87ef6b3fce7c95f01c27ef0fc862cb20b1ffc21fc32ee49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-26T19:36:47Z","title_canon_sha256":"5db10614a4b4c78eeab3c74d2030ed7ddfc2aca405e24ddc2dc76b19a0280c0b"},"schema_version":"1.0","source":{"id":"1604.07811","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.07811","created_at":"2026-05-18T01:16:11Z"},{"alias_kind":"arxiv_version","alias_value":"1604.07811v1","created_at":"2026-05-18T01:16:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07811","created_at":"2026-05-18T01:16:11Z"},{"alias_kind":"pith_short_12","alias_value":"VZF2QG7KJWD3","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZF2QG7KJWD3POZ6","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZF2QG7K","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:90c298f50fff43742ab4ec94f6b651a64b5554081700db6da9b4545fcca5bfb5","target":"graph","created_at":"2026-05-18T01:16:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Nate Harman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-26T19:36:47Z","title":"Counting SET-free sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07811","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7e3c1541b7cbf1811edde18eb30309a2deb6e7d60a7f4cd48e09e7fcceaaef81","target":"record","created_at":"2026-05-18T01:16:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"92c9895efcfa78c1f87ef6b3fce7c95f01c27ef0fc862cb20b1ffc21fc32ee49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-04-26T19:36:47Z","title_canon_sha256":"5db10614a4b4c78eeab3c74d2030ed7ddfc2aca405e24ddc2dc76b19a0280c0b"},"schema_version":"1.0","source":{"id":"1604.07811","kind":"arxiv","version":1}},"canonical_sha256":"ae4ba81bea4d87b7bb3ebf8524ccb6fb7210d53fcb7e506834f28347648eb0f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae4ba81bea4d87b7bb3ebf8524ccb6fb7210d53fcb7e506834f28347648eb0f6","first_computed_at":"2026-05-18T01:16:11.934792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:11.934792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M/21P5Vhw2TRUBIrNtB4FVNePZ5f2jSyiyi02QWUmeVfmpMnhT07kECpTeQqbbCe8b8cfkMHwpxvB0H/buEVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:11.935466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.07811","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e3c1541b7cbf1811edde18eb30309a2deb6e7d60a7f4cd48e09e7fcceaaef81","sha256:90c298f50fff43742ab4ec94f6b651a64b5554081700db6da9b4545fcca5bfb5"],"state_sha256":"85eb59a4ee7abbaff7598b3a14b81813ff7b32b932150f394d92249c52a71d03"}