{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:52TWNKM4BLSZTY4KLFS4Y323FQ","short_pith_number":"pith:52TWNKM4","schema_version":"1.0","canonical_sha256":"eea766a99c0ae599e38a5965cc6f5b2c29a97848f9f72bfcb7aca6669667f940","source":{"kind":"arxiv","id":"1702.02693","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.02693","created_at":"2026-05-18T00:51:02.698186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02693v1","created_at":"2026-05-18T00:51:02.698186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02693","created_at":"2026-05-18T00:51:02.698186+00:00"},{"alias_kind":"pith_short_12","alias_value":"52TWNKM4BLSZ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"52TWNKM4BLSZTY4K","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"52TWNKM4","created_at":"2026-05-18T12:31:00.734936+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/52TWNKM4BLSZTY4KLFS4Y323FQ","json":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ.json","graph_json":"https://pith.science/api/pith-number/52TWNKM4BLSZTY4KLFS4Y323FQ/graph.json","events_json":"https://pith.science/api/pith-number/52TWNKM4BLSZTY4KLFS4Y323FQ/events.json","paper":"https://pith.science/paper/52TWNKM4"},"agent_actions":{"view_html":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ","download_json":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ.json","view_paper":"https://pith.science/paper/52TWNKM4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02693&json=true","fetch_graph":"https://pith.science/api/pith-number/52TWNKM4BLSZTY4KLFS4Y323FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/52TWNKM4BLSZTY4KLFS4Y323FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/action/storage_attestation","attest_author":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/action/author_attestation","sign_citation":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/action/citation_signature","submit_replication":"https://pith.science/pith/52TWNKM4BLSZTY4KLFS4Y323FQ/action/replication_record"}},"created_at":"2026-05-18T00:51:02.698186+00:00","updated_at":"2026-05-18T00:51:02.698186+00:00"}