{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:2B4352HM2FVWFJWHFGSGAFV7BR","short_pith_number":"pith:2B4352HM","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"},"canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","source":{"kind":"arxiv","id":"2110.01173","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.01173","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"2110.01173v1","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01173","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"2B4352HM2FVW","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B4352HM2FVWFJWH","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B4352HM","created_at":"2026-07-05T03:19:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:2B4352HM2FVWFJWHFGSGAFV7BR","target":"record","payload":{"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"},"canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","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"},"source_kind":"arxiv","source_id":"2110.01173","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-07-05T03:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lg+dzjJUg4Ddpq234qx0VmC/ocou6M5COcJOzlPViM9lQSYzarD0ajomzMtIZ1XrTn3y9w4kYACstwFe6F7fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:50:46.450556Z"},"content_sha256":"f32cc3ede2d08f1860a07a418b212207db38ffcc3715454aa78b19e21b2d0565","schema_version":"1.0","event_id":"sha256:f32cc3ede2d08f1860a07a418b212207db38ffcc3715454aa78b19e21b2d0565"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:2B4352HM2FVWFJWHFGSGAFV7BR","target":"graph","payload":{"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"},"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-07-05T03:19:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"26+UeHZu4EIwLsFG0i3rzNisyBpBOx6xcBeHRNZITZXTwaBL+8aeYg+ZGCEUJNV1lBKgo9vC9dss1ekb0LtmAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T06:50:46.450931Z"},"content_sha256":"03c1e6991518f4f484a7a830bacd691bbd6811acc6ee638ec4fda816f1ee42ac","schema_version":"1.0","event_id":"sha256:03c1e6991518f4f484a7a830bacd691bbd6811acc6ee638ec4fda816f1ee42ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/bundle.json","state_url":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2B4352HM2FVWFJWHFGSGAFV7BR/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-07-05T06:50:46Z","links":{"resolver":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR","bundle":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/bundle.json","state":"https://pith.science/pith/2B4352HM2FVWFJWHFGSGAFV7BR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2B4352HM2FVWFJWHFGSGAFV7BR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:2B4352HM2FVWFJWHFGSGAFV7BR","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":"bb8290b917979968970e8876612cf58dc406d9654e8e4b5678365bb8ee1526f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-10-04T03:50:52Z","title_canon_sha256":"94aa3d9813c0b54e1c4d42d6f9324e69b7dae0f7471566050afa9a538ca1a550"},"schema_version":"1.0","source":{"id":"2110.01173","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.01173","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"arxiv_version","alias_value":"2110.01173v1","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.01173","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_12","alias_value":"2B4352HM2FVW","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_16","alias_value":"2B4352HM2FVWFJWH","created_at":"2026-07-05T03:19:52Z"},{"alias_kind":"pith_short_8","alias_value":"2B4352HM","created_at":"2026-07-05T03:19:52Z"}],"graph_snapshots":[{"event_id":"sha256:03c1e6991518f4f484a7a830bacd691bbd6811acc6ee638ec4fda816f1ee42ac","target":"graph","created_at":"2026-07-05T03:19:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.01173/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Austen Z. Fan, Jin-Yi Cai, Yin Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-10-04T03:50:52Z","title":"Bipartite 3-Regular Counting Problems with Mixed Signs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.01173","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:f32cc3ede2d08f1860a07a418b212207db38ffcc3715454aa78b19e21b2d0565","target":"record","created_at":"2026-07-05T03:19:52Z","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":"bb8290b917979968970e8876612cf58dc406d9654e8e4b5678365bb8ee1526f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2021-10-04T03:50:52Z","title_canon_sha256":"94aa3d9813c0b54e1c4d42d6f9324e69b7dae0f7471566050afa9a538ca1a550"},"schema_version":"1.0","source":{"id":"2110.01173","kind":"arxiv","version":1}},"canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d079bee8ecd16b62a6c729a46016bf0c6acf57c45c356f0b256b87e7d4a3fe00","first_computed_at":"2026-07-05T03:19:52.634616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:19:52.634616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHtyXVrT/jRTW38GhuTb0WYI7Xeep0cx36+p/DvVVEjqxNUlZ2hgDS+oZCXMlbBnfLEXOx2EPtc+/HmwT4L6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:19:52.635173Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.01173","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f32cc3ede2d08f1860a07a418b212207db38ffcc3715454aa78b19e21b2d0565","sha256:03c1e6991518f4f484a7a830bacd691bbd6811acc6ee638ec4fda816f1ee42ac"],"state_sha256":"fe2b529d9212bc755fb58a058a4582eb4aa1c188bd1d89626f95cc23aa226738"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U092tU8ofK2m8INIPxpn1A/o/9sOw8z/gNJiy5gqWWINrs6pRjFVVlydeg45eAP+7IfPzKJdvyCNTOasc1HXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T06:50:46.453610Z","bundle_sha256":"fad357b2e32ae67f3cba6d7c1868231acfe638094cb2369357e3de2aa106b6c6"}}