{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7N533HNNTUZK5VT62ROPFJYVJL","short_pith_number":"pith:7N533HNN","canonical_record":{"source":{"id":"2603.14749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-16T02:36:02Z","cross_cats_sorted":[],"title_canon_sha256":"8ad2182cb22d4461d197124c076616eab57ae2b8f75d4de544e089b98119cea9","abstract_canon_sha256":"b4e409b50f429645e2c884648d85a8985eaa1ab55d9feb57b3c00387abd38b4f"},"schema_version":"1.0"},"canonical_sha256":"fb7bbd9dad9d32aed67ed45cf2a7154adf679165f690d7ed37a355458efb7adf","source":{"kind":"arxiv","id":"2603.14749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.14749","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"arxiv_version","alias_value":"2603.14749v2","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.14749","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_12","alias_value":"7N533HNNTUZK","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_16","alias_value":"7N533HNNTUZK5VT6","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_8","alias_value":"7N533HNN","created_at":"2026-05-20T01:05:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7N533HNNTUZK5VT62ROPFJYVJL","target":"record","payload":{"canonical_record":{"source":{"id":"2603.14749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-16T02:36:02Z","cross_cats_sorted":[],"title_canon_sha256":"8ad2182cb22d4461d197124c076616eab57ae2b8f75d4de544e089b98119cea9","abstract_canon_sha256":"b4e409b50f429645e2c884648d85a8985eaa1ab55d9feb57b3c00387abd38b4f"},"schema_version":"1.0"},"canonical_sha256":"fb7bbd9dad9d32aed67ed45cf2a7154adf679165f690d7ed37a355458efb7adf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:11.008270Z","signature_b64":"Wd4K4xtnwngdgXCNKS8KkP5fFDdFPf5TvOfiQV4ZD0TUKZ9RsDELWx3WhW5/aRxNgGB8X//eUvqOASFw4o9cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb7bbd9dad9d32aed67ed45cf2a7154adf679165f690d7ed37a355458efb7adf","last_reissued_at":"2026-05-20T01:05:11.007382Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:11.007382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.14749","source_version":2,"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-20T01:05:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R4pzwqoLkUzznBu66PHGKTdxWB/Qtci/MVC3cbIoWZKSjX+xRskL2qI3MPCpZKqg50Hr7a+xCHPun0ut8hf8Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:40:12.698475Z"},"content_sha256":"419349b2695504beb739a624d9c7739f1735154a96f756375ec572232ac844c7","schema_version":"1.0","event_id":"sha256:419349b2695504beb739a624d9c7739f1735154a96f756375ec572232ac844c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7N533HNNTUZK5VT62ROPFJYVJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Counting General Dominating Set Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Boning Meng, Jiayi Zheng","submitted_at":"2026-03-16T02:36:02Z","abstract_excerpt":"We introduce a new framework of counting problems called #GDS that encompasses #$(\\sigma, \\rho)$-Set, a class of domination-type problems that includes counting dominating sets and counting total dominating sets. We explore the intricate relation between #GDS and the well-known Holant. We adapt the technique of gadget construction of Holant to the #GDS framework; using this technique, we prove the #P-completeness of counting dominating sets for 3-regular planar bipartite simple graphs. Through a generalization of a Holant dichotomy, and a special reduction method via symmetric bipartite graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.14749","kind":"arxiv","version":2},"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/2603.14749/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-05-20T01:05:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"39r1EDe+jFkPgafLHcIVrHjAgsHiKus6/0N3aBaE1vodu5ygFGQFDbwtCp/NA7V6edsIt+3SFE/q1KsTXF1uBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:40:12.699190Z"},"content_sha256":"6ff6f849f87b6e16a3a9fbc620d6805bfb1facc0f7fccf2c6efb3ce54e38522a","schema_version":"1.0","event_id":"sha256:6ff6f849f87b6e16a3a9fbc620d6805bfb1facc0f7fccf2c6efb3ce54e38522a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7N533HNNTUZK5VT62ROPFJYVJL/bundle.json","state_url":"https://pith.science/pith/7N533HNNTUZK5VT62ROPFJYVJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7N533HNNTUZK5VT62ROPFJYVJL/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-06-11T00:40:12Z","links":{"resolver":"https://pith.science/pith/7N533HNNTUZK5VT62ROPFJYVJL","bundle":"https://pith.science/pith/7N533HNNTUZK5VT62ROPFJYVJL/bundle.json","state":"https://pith.science/pith/7N533HNNTUZK5VT62ROPFJYVJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7N533HNNTUZK5VT62ROPFJYVJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7N533HNNTUZK5VT62ROPFJYVJL","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":"b4e409b50f429645e2c884648d85a8985eaa1ab55d9feb57b3c00387abd38b4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-16T02:36:02Z","title_canon_sha256":"8ad2182cb22d4461d197124c076616eab57ae2b8f75d4de544e089b98119cea9"},"schema_version":"1.0","source":{"id":"2603.14749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.14749","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"arxiv_version","alias_value":"2603.14749v2","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.14749","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_12","alias_value":"7N533HNNTUZK","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_16","alias_value":"7N533HNNTUZK5VT6","created_at":"2026-05-20T01:05:11Z"},{"alias_kind":"pith_short_8","alias_value":"7N533HNN","created_at":"2026-05-20T01:05:11Z"}],"graph_snapshots":[{"event_id":"sha256:6ff6f849f87b6e16a3a9fbc620d6805bfb1facc0f7fccf2c6efb3ce54e38522a","target":"graph","created_at":"2026-05-20T01:05:11Z","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/2603.14749/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new framework of counting problems called #GDS that encompasses #$(\\sigma, \\rho)$-Set, a class of domination-type problems that includes counting dominating sets and counting total dominating sets. We explore the intricate relation between #GDS and the well-known Holant. We adapt the technique of gadget construction of Holant to the #GDS framework; using this technique, we prove the #P-completeness of counting dominating sets for 3-regular planar bipartite simple graphs. Through a generalization of a Holant dichotomy, and a special reduction method via symmetric bipartite graphs","authors_text":"Boning Meng, Jiayi Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-16T02:36:02Z","title":"The Counting General Dominating Set Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.14749","kind":"arxiv","version":2},"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:419349b2695504beb739a624d9c7739f1735154a96f756375ec572232ac844c7","target":"record","created_at":"2026-05-20T01:05:11Z","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":"b4e409b50f429645e2c884648d85a8985eaa1ab55d9feb57b3c00387abd38b4f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-03-16T02:36:02Z","title_canon_sha256":"8ad2182cb22d4461d197124c076616eab57ae2b8f75d4de544e089b98119cea9"},"schema_version":"1.0","source":{"id":"2603.14749","kind":"arxiv","version":2}},"canonical_sha256":"fb7bbd9dad9d32aed67ed45cf2a7154adf679165f690d7ed37a355458efb7adf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb7bbd9dad9d32aed67ed45cf2a7154adf679165f690d7ed37a355458efb7adf","first_computed_at":"2026-05-20T01:05:11.007382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:11.007382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wd4K4xtnwngdgXCNKS8KkP5fFDdFPf5TvOfiQV4ZD0TUKZ9RsDELWx3WhW5/aRxNgGB8X//eUvqOASFw4o9cAw==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:11.008270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.14749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419349b2695504beb739a624d9c7739f1735154a96f756375ec572232ac844c7","sha256:6ff6f849f87b6e16a3a9fbc620d6805bfb1facc0f7fccf2c6efb3ce54e38522a"],"state_sha256":"300c701729a72802b2b416364883542fc0833de2038eddc6c58d8c945a9b7d45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUNGt7O5RrKt6DSpiB+fNdh5RZO85UHYqD7YAWKk9zsFzQ92UjMyx568c9lCQX3mFMzePFZF2akhzKa5a/zaDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:40:12.703340Z","bundle_sha256":"7ec90470103401d37283d8e1c8f8134bb93b2562266420cd15a8570ebfb099c1"}}