{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VK6FGHXME4YKLQG7C7NAFHOJ3V","short_pith_number":"pith:VK6FGHXM","canonical_record":{"source":{"id":"1207.2354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-10T13:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"47044d0c2d7c0600186770709af1913c87935b7a8d1ae7f45377710b3d50a9ad","abstract_canon_sha256":"257b164e2ebd648d7629840804a50a96242be81cbc520acaf1319e254a9b46e8"},"schema_version":"1.0"},"canonical_sha256":"aabc531eec2730a5c0df17da029dc9dd4f245abe7f7ebf13037ee8254eae6477","source":{"kind":"arxiv","id":"1207.2354","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2354","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2354v1","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2354","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"VK6FGHXME4YK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VK6FGHXME4YKLQG7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VK6FGHXM","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VK6FGHXME4YKLQG7C7NAFHOJ3V","target":"record","payload":{"canonical_record":{"source":{"id":"1207.2354","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-10T13:52:15Z","cross_cats_sorted":[],"title_canon_sha256":"47044d0c2d7c0600186770709af1913c87935b7a8d1ae7f45377710b3d50a9ad","abstract_canon_sha256":"257b164e2ebd648d7629840804a50a96242be81cbc520acaf1319e254a9b46e8"},"schema_version":"1.0"},"canonical_sha256":"aabc531eec2730a5c0df17da029dc9dd4f245abe7f7ebf13037ee8254eae6477","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:24.314675Z","signature_b64":"yIJ+rM2ydyYxjG8a7xm2FwG0YAcMnDiqoNREGtEsIFivqt7qF71ZXnSLKwqvYJWKPU4VTbAdG2AvePlULxyGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aabc531eec2730a5c0df17da029dc9dd4f245abe7f7ebf13037ee8254eae6477","last_reissued_at":"2026-05-18T03:51:24.314127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:24.314127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.2354","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77bJeYuNtTvjn6Fty2+FV3NT4zOux9OYvCts41ucjoFcQmnNZIc2M3OE66zMAcSVo6VYMlYrI2iUbJuKgi6wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:44:36.552386Z"},"content_sha256":"e0ab305a279198e97451d0b0c91146f5a85ccaeb9e8c1ff1ad72c6401928a517","schema_version":"1.0","event_id":"sha256:e0ab305a279198e97451d0b0c91146f5a85ccaeb9e8c1ff1ad72c6401928a517"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VK6FGHXME4YKLQG7C7NAFHOJ3V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dichotomy for Holant* Problems with a Function on Domain Size 3","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Mingji Xia, Pinyan Lu","submitted_at":"2012-07-10T13:52:15Z","abstract_excerpt":"Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the Boolean domain. In this paper, we give the first dichotomy theorem for Holant problems for domain size $>2$. We discover unexpected tractable families of counting problems, by giving new polynomial time algorithms. This paper also initiates holographic reductions in domains of size $>2$. This is our main algorithmic technique, and is used for both tractable"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2354","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:51:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sHGtBbyyxnqXhWbwwtOtsQHJLZ6II19OfBMwZ/cjnBYWY9JWp0exq0NrIefKVBNjVcyIrJ+oKD7bVXfxJAbLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:44:36.553021Z"},"content_sha256":"723ab96c6b5d503696abf16a484a7fd1ab020405ef70588d9f786e2290e73164","schema_version":"1.0","event_id":"sha256:723ab96c6b5d503696abf16a484a7fd1ab020405ef70588d9f786e2290e73164"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/bundle.json","state_url":"https://pith.science/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/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-28T23:44:36Z","links":{"resolver":"https://pith.science/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V","bundle":"https://pith.science/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/bundle.json","state":"https://pith.science/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VK6FGHXME4YKLQG7C7NAFHOJ3V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VK6FGHXME4YKLQG7C7NAFHOJ3V","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":"257b164e2ebd648d7629840804a50a96242be81cbc520acaf1319e254a9b46e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-10T13:52:15Z","title_canon_sha256":"47044d0c2d7c0600186770709af1913c87935b7a8d1ae7f45377710b3d50a9ad"},"schema_version":"1.0","source":{"id":"1207.2354","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.2354","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"arxiv_version","alias_value":"1207.2354v1","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.2354","created_at":"2026-05-18T03:51:24Z"},{"alias_kind":"pith_short_12","alias_value":"VK6FGHXME4YK","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VK6FGHXME4YKLQG7","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VK6FGHXM","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:723ab96c6b5d503696abf16a484a7fd1ab020405ef70588d9f786e2290e73164","target":"graph","created_at":"2026-05-18T03:51:24Z","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":"Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the Boolean domain. In this paper, we give the first dichotomy theorem for Holant problems for domain size $>2$. We discover unexpected tractable families of counting problems, by giving new polynomial time algorithms. This paper also initiates holographic reductions in domains of size $>2$. This is our main algorithmic technique, and is used for both tractable","authors_text":"Jin-Yi Cai, Mingji Xia, Pinyan Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-10T13:52:15Z","title":"Dichotomy for Holant* Problems with a Function on Domain Size 3"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2354","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:e0ab305a279198e97451d0b0c91146f5a85ccaeb9e8c1ff1ad72c6401928a517","target":"record","created_at":"2026-05-18T03:51:24Z","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":"257b164e2ebd648d7629840804a50a96242be81cbc520acaf1319e254a9b46e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-07-10T13:52:15Z","title_canon_sha256":"47044d0c2d7c0600186770709af1913c87935b7a8d1ae7f45377710b3d50a9ad"},"schema_version":"1.0","source":{"id":"1207.2354","kind":"arxiv","version":1}},"canonical_sha256":"aabc531eec2730a5c0df17da029dc9dd4f245abe7f7ebf13037ee8254eae6477","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aabc531eec2730a5c0df17da029dc9dd4f245abe7f7ebf13037ee8254eae6477","first_computed_at":"2026-05-18T03:51:24.314127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:24.314127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yIJ+rM2ydyYxjG8a7xm2FwG0YAcMnDiqoNREGtEsIFivqt7qF71ZXnSLKwqvYJWKPU4VTbAdG2AvePlULxyGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:24.314675Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.2354","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0ab305a279198e97451d0b0c91146f5a85ccaeb9e8c1ff1ad72c6401928a517","sha256:723ab96c6b5d503696abf16a484a7fd1ab020405ef70588d9f786e2290e73164"],"state_sha256":"a508c4cb751b5ef646bfa8d39150bc8e184f32ad32254309e262165337b4736d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHgdf2qs0U+7IY668XVLZVNiTwW7+36yNK2Cd6X3aM43E0JpRXxGIMNGAWUsKheBViaoYWiA+ShfpNae1bI2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:44:36.556568Z","bundle_sha256":"0312b5dca389f2e264bf820d85e659f399129a102d799e7b2bc6e309b8705c9d"}}