{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2B4352HM2FVWFJWHFGSGAFV7BR","short_pith_number":"pith:2B4352HM","schema_version":"1.0","canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","source":{"kind":"arxiv","id":"2110.01173","version":1},"attestation_state":"computed","paper":{"title":"Bipartite 3-Regular Counting Problems with Mixed Signs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Austen Z. Fan, Jin-Yi Cai, Yin Liu","submitted_at":"2021-10-04T03:50:52Z","abstract_excerpt":"We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\\operatorname{Holant}\\left(f\\mid =_3 \\right)$, where $f$ is any integer-valued ternary symmetric constraint function on Boolean variables, we prove that it is either P-time computable or #P-hard, depending on an explicit criterion of $f$. The constraint function can take both positive and negative values, allowing for cancellations. The dichotomy extends easily to rational valued functions of the same type. In addition, we discover a new phenomenon"},"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":"2110.01173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-10-04T03:50:52Z","cross_cats_sorted":[],"title_canon_sha256":"94aa3d9813c0b54e1c4d42d6f9324e69b7dae0f7471566050afa9a538ca1a550","abstract_canon_sha256":"bb8290b917979968970e8876612cf58dc406d9654e8e4b5678365bb8ee1526f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:19:52.635173Z","signature_b64":"aHtyXVrT/jRTW38GhuTb0WYI7Xeep0cx36+p/DvVVEjqxNUlZ2hgDS+oZCXMlbBnfLEXOx2EPtc+/HmwT4L6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","last_reissued_at":"2026-07-05T03:19:52.634616Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:19:52.634616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bipartite 3-Regular Counting Problems with Mixed Signs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Austen Z. Fan, Jin-Yi Cai, Yin Liu","submitted_at":"2021-10-04T03:50:52Z","abstract_excerpt":"We prove a complexity dichotomy for a class of counting problems expressible as bipartite 3-regular Holant problems. For every problem of the form $\\operatorname{Holant}\\left(f\\mid =_3 \\right)$, where $f$ is any integer-valued ternary symmetric constraint function on Boolean variables, we prove that it is either P-time computable or #P-hard, depending on an explicit criterion of $f$. The constraint function can take both positive and negative values, allowing for cancellations. The dichotomy extends easily to rational valued functions of the same type. In addition, we discover a new phenomenon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.01173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.01173","created_at":"2026-07-05T03:19:52.634694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.01173v1","created_at":"2026-07-05T03:19:52.634694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01173","created_at":"2026-07-05T03:19:52.634694+00:00"},{"alias_kind":"pith_short_12","alias_value":"2B4352HM2FVW","created_at":"2026-07-05T03:19:52.634694+00:00"},{"alias_kind":"pith_short_16","alias_value":"2B4352HM2FVWFJWH","created_at":"2026-07-05T03:19:52.634694+00:00"},{"alias_kind":"pith_short_8","alias_value":"2B4352HM","created_at":"2026-07-05T03:19:52.634694+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/2B4352HM2FVWFJWHFGSGAFV7BR","json":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR.json","graph_json":"https://pith.science/api/pith-number/2B4352HM2FVWFJWHFGSGAFV7BR/graph.json","events_json":"https://pith.science/api/pith-number/2B4352HM2FVWFJWHFGSGAFV7BR/events.json","paper":"https://pith.science/paper/2B4352HM"},"agent_actions":{"view_html":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR","download_json":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR.json","view_paper":"https://pith.science/paper/2B4352HM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.01173&json=true","fetch_graph":"https://pith.science/api/pith-number/2B4352HM2FVWFJWHFGSGAFV7BR/graph.json","fetch_events":"https://pith.science/api/pith-number/2B4352HM2FVWFJWHFGSGAFV7BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/action/storage_attestation","attest_author":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/action/author_attestation","sign_citation":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/action/citation_signature","submit_replication":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/action/replication_record"}},"created_at":"2026-07-05T03:19:52.634694+00:00","updated_at":"2026-07-05T03:19:52.634694+00:00"}