{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:52TWNKM4BLSZTY4KLFS4Y323FQ","short_pith_number":"pith:52TWNKM4","canonical_record":{"source":{"id":"1702.02693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-09T03:51:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5d89a3d35bee54b07ae46748198656adfd17b60eeb7c11ddf8928bdbde1e89af","abstract_canon_sha256":"cc501c35feed85915b68290fd47896ce29a1f33a66a041fbcb1443c24555dda5"},"schema_version":"1.0"},"canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","source":{"kind":"arxiv","id":"1702.02693","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02693","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02693v1","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02693","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"52TWNKM4BLSZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52TWNKM4BLSZTY4K","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52TWNKM4","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:52TWNKM4BLSZTY4KLFS4Y323FQ","target":"record","payload":{"canonical_record":{"source":{"id":"1702.02693","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-09T03:51:01Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5d89a3d35bee54b07ae46748198656adfd17b60eeb7c11ddf8928bdbde1e89af","abstract_canon_sha256":"cc501c35feed85915b68290fd47896ce29a1f33a66a041fbcb1443c24555dda5"},"schema_version":"1.0"},"canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:02.698570Z","signature_b64":"IQfOY4MEuHSkiTD9e3boBY1prPBLfkHq/gbnN/iQbUBQhFZK2+q5RT1VQD0MXrzq5lZxuTGsouNV/WykqmsCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","last_reissued_at":"2026-05-18T00:51:02.698120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:02.698120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.02693","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-18T00:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zX5vZt8zvDrdnTG5KqfQBt4JyHEV4b0lvPnLJJRQkrY5BWAUgqrFJHKJOl/V2PSWb0xMwO0amuUSHyn8YLfKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:01:47.560751Z"},"content_sha256":"f27fd9e2f3c12837f41fffa8aed5682f8b3bd337b2f95e5e47163937d4a42e20","schema_version":"1.0","event_id":"sha256:f27fd9e2f3c12837f41fffa8aed5682f8b3bd337b2f95e5e47163937d4a42e20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:52TWNKM4BLSZTY4KLFS4Y323FQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dichotomy for Real Holant$^c$ Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jin-Yi Cai, Mingji Xia, Pinyan Lu","submitted_at":"2017-02-09T03:51:01Z","abstract_excerpt":"Holant problems capture a class of Sum-of-Product computations such as counting matchings. It is inspired by holographic algorithms and is equivalent to tensor networks, with counting CSP being a special case. A classification for Holant problems is more difficult to prove, not only because it implies a classification for counting CSP, but also due to the deeper reason that there exist more intricate polynomial time tractable problems in the broader framework.\n  We discover a new family of constraint functions $\\mathscr{L}$ which define polynomial time computable counting problems. These do no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02693","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-18T00:51:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RPSpFNI8tS/fBAe0YEGtPb7t3QykP5Mw/mJcZAxXQ0vTAsGFUKqi3jhsHshNXMvGnrKtQpOWUBNYKiRjUkBGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T19:01:47.561450Z"},"content_sha256":"d5d00ae788fa879122458b377f1702691f3788304a9a1d6bad429d4168a15876","schema_version":"1.0","event_id":"sha256:d5d00ae788fa879122458b377f1702691f3788304a9a1d6bad429d4168a15876"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/bundle.json","state_url":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/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-28T19:01:47Z","links":{"resolver":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ","bundle":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/bundle.json","state":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:52TWNKM4BLSZTY4KLFS4Y323FQ","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":"cc501c35feed85915b68290fd47896ce29a1f33a66a041fbcb1443c24555dda5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-09T03:51:01Z","title_canon_sha256":"5d89a3d35bee54b07ae46748198656adfd17b60eeb7c11ddf8928bdbde1e89af"},"schema_version":"1.0","source":{"id":"1702.02693","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.02693","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.02693v1","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02693","created_at":"2026-05-18T00:51:02Z"},{"alias_kind":"pith_short_12","alias_value":"52TWNKM4BLSZ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"52TWNKM4BLSZTY4K","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"52TWNKM4","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:d5d00ae788fa879122458b377f1702691f3788304a9a1d6bad429d4168a15876","target":"graph","created_at":"2026-05-18T00:51:02Z","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 capture a class of Sum-of-Product computations such as counting matchings. It is inspired by holographic algorithms and is equivalent to tensor networks, with counting CSP being a special case. A classification for Holant problems is more difficult to prove, not only because it implies a classification for counting CSP, but also due to the deeper reason that there exist more intricate polynomial time tractable problems in the broader framework.\n  We discover a new family of constraint functions $\\mathscr{L}$ which define polynomial time computable counting problems. These do no","authors_text":"Jin-Yi Cai, Mingji Xia, Pinyan Lu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-09T03:51:01Z","title":"Dichotomy for Real Holant$^c$ Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02693","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:f27fd9e2f3c12837f41fffa8aed5682f8b3bd337b2f95e5e47163937d4a42e20","target":"record","created_at":"2026-05-18T00:51:02Z","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":"cc501c35feed85915b68290fd47896ce29a1f33a66a041fbcb1443c24555dda5","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-02-09T03:51:01Z","title_canon_sha256":"5d89a3d35bee54b07ae46748198656adfd17b60eeb7c11ddf8928bdbde1e89af"},"schema_version":"1.0","source":{"id":"1702.02693","kind":"arxiv","version":1}},"canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","first_computed_at":"2026-05-18T00:51:02.698120Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:02.698120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IQfOY4MEuHSkiTD9e3boBY1prPBLfkHq/gbnN/iQbUBQhFZK2+q5RT1VQD0MXrzq5lZxuTGsouNV/WykqmsCCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:02.698570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.02693","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f27fd9e2f3c12837f41fffa8aed5682f8b3bd337b2f95e5e47163937d4a42e20","sha256:d5d00ae788fa879122458b377f1702691f3788304a9a1d6bad429d4168a15876"],"state_sha256":"74c3eb0d53cf4ea8cfdbd8cd31c9d9b6194cdc360f2a50c88951763761a8a785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t0Kd3msrP9v+BtBqoBu/gZdbBzFcLwQgzU8zIYunFa+3d8zwm5SfMz1ADoiXs3WgkmqzBDFHCb/yOtRVtg/DBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T19:01:47.564986Z","bundle_sha256":"17a00ba5dd2c6806193bbab93a25c2e24a2b8753039aaaadf02ae63fada8335c"}}