{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XH2V6HDBE4CWBVGDVJ2UK5L3I5","short_pith_number":"pith:XH2V6HDB","canonical_record":{"source":{"id":"1309.6504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-25T13:47:43Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"9b2e87b2753f71c919c38a5d2294a34bb8ae66f712fbd321ef776539a4cb5721","abstract_canon_sha256":"7b1db630c4ca2575afc015def76a101f9a401e5deb57238a9dfbf315e4b69fd3"},"schema_version":"1.0"},"canonical_sha256":"b9f55f1c61270560d4c3aa7545757b475979951d393589b08c79dd28d7d97bf9","source":{"kind":"arxiv","id":"1309.6504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6504","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6504v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6504","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"XH2V6HDBE4CW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XH2V6HDBE4CWBVGD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XH2V6HDB","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XH2V6HDBE4CWBVGDVJ2UK5L3I5","target":"record","payload":{"canonical_record":{"source":{"id":"1309.6504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-25T13:47:43Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"9b2e87b2753f71c919c38a5d2294a34bb8ae66f712fbd321ef776539a4cb5721","abstract_canon_sha256":"7b1db630c4ca2575afc015def76a101f9a401e5deb57238a9dfbf315e4b69fd3"},"schema_version":"1.0"},"canonical_sha256":"b9f55f1c61270560d4c3aa7545757b475979951d393589b08c79dd28d7d97bf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:20.842222Z","signature_b64":"HczABYRN3SbPtWRF9z+PjnrVAACJIOaIFAqSViUfvbCcAPTJR/I19hifi5h2adVdDHt2Q/Ln6fzGkrPOAVQ5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9f55f1c61270560d4c3aa7545757b475979951d393589b08c79dd28d7d97bf9","last_reissued_at":"2026-05-18T03:12:20.841449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:20.841449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.6504","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhtZ04n1mAV5YgFzj+4q4yJKzn/tDDqDlFHepzDkxQzWcK4hKyYEMVYFLD1zX/oqwvwA/AxZV0a1J7RBE9cfCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:39:59.687522Z"},"content_sha256":"d1bc4d82bec0818bc6bdd6885cb4c3240aa4ab5298cdb25824ae455273c65ddd","schema_version":"1.0","event_id":"sha256:d1bc4d82bec0818bc6bdd6885cb4c3240aa4ab5298cdb25824ae455273c65ddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XH2V6HDBE4CWBVGDVJ2UK5L3I5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Computational Complexity of the Game of Set and its Theoretical Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Michael Lampis, Valia Mitsou","submitted_at":"2013-09-25T13:47:43Z","abstract_excerpt":"The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and establish interesting connections with other classical computational problems. Specifically, we first show that a natural generalization of the problem of finding a single Set, parameterized by the size of the sought Set is W-hard; our reduction applies also to a natural parameterization of Perfect Multi-Dimensional Matching, a result which may be of independent i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6504","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:12:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZmmlGFMrbs0mu9OlkNBmYl0b4APmJT5RZXlrD2AvAAm+42Nk4v/dcSrroYLcPs/CR3eGvsVUunduwWxrsO4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:39:59.688187Z"},"content_sha256":"f4b57e1dd74798d0ab73ce639a017ce92c26b303386f6bd3fa36e432c6257c08","schema_version":"1.0","event_id":"sha256:f4b57e1dd74798d0ab73ce639a017ce92c26b303386f6bd3fa36e432c6257c08"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/bundle.json","state_url":"https://pith.science/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-24T00:39:59Z","links":{"resolver":"https://pith.science/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5","bundle":"https://pith.science/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/bundle.json","state":"https://pith.science/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XH2V6HDBE4CWBVGDVJ2UK5L3I5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XH2V6HDBE4CWBVGDVJ2UK5L3I5","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":"7b1db630c4ca2575afc015def76a101f9a401e5deb57238a9dfbf315e4b69fd3","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-25T13:47:43Z","title_canon_sha256":"9b2e87b2753f71c919c38a5d2294a34bb8ae66f712fbd321ef776539a4cb5721"},"schema_version":"1.0","source":{"id":"1309.6504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.6504","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"arxiv_version","alias_value":"1309.6504v1","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6504","created_at":"2026-05-18T03:12:20Z"},{"alias_kind":"pith_short_12","alias_value":"XH2V6HDBE4CW","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XH2V6HDBE4CWBVGD","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XH2V6HDB","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:f4b57e1dd74798d0ab73ce639a017ce92c26b303386f6bd3fa36e432c6257c08","target":"graph","created_at":"2026-05-18T03:12:20Z","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":"The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and establish interesting connections with other classical computational problems. Specifically, we first show that a natural generalization of the problem of finding a single Set, parameterized by the size of the sought Set is W-hard; our reduction applies also to a natural parameterization of Perfect Multi-Dimensional Matching, a result which may be of independent i","authors_text":"Michael Lampis, Valia Mitsou","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-25T13:47:43Z","title":"The Computational Complexity of the Game of Set and its Theoretical Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6504","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:d1bc4d82bec0818bc6bdd6885cb4c3240aa4ab5298cdb25824ae455273c65ddd","target":"record","created_at":"2026-05-18T03:12:20Z","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":"7b1db630c4ca2575afc015def76a101f9a401e5deb57238a9dfbf315e4b69fd3","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-25T13:47:43Z","title_canon_sha256":"9b2e87b2753f71c919c38a5d2294a34bb8ae66f712fbd321ef776539a4cb5721"},"schema_version":"1.0","source":{"id":"1309.6504","kind":"arxiv","version":1}},"canonical_sha256":"b9f55f1c61270560d4c3aa7545757b475979951d393589b08c79dd28d7d97bf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9f55f1c61270560d4c3aa7545757b475979951d393589b08c79dd28d7d97bf9","first_computed_at":"2026-05-18T03:12:20.841449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:20.841449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HczABYRN3SbPtWRF9z+PjnrVAACJIOaIFAqSViUfvbCcAPTJR/I19hifi5h2adVdDHt2Q/Ln6fzGkrPOAVQ5Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:20.842222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.6504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1bc4d82bec0818bc6bdd6885cb4c3240aa4ab5298cdb25824ae455273c65ddd","sha256:f4b57e1dd74798d0ab73ce639a017ce92c26b303386f6bd3fa36e432c6257c08"],"state_sha256":"a5833428b089d4accf72107cd94ecaf170d7e9d8eb381342c6e9a9b3e2c7fd4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5qzgrVknshFZx89sur3sKan+g683VRhbAkfXYCnQHU/xoyrX/LFkeV+A+ug857hkbeAk6x3Ff8QO7UDPt6pBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:39:59.694630Z","bundle_sha256":"fef6d13c0ea7857163541029c11b1f16beec3eea0dd669395ae3cdf796c3f102"}}