{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KYNYT7BNSLQX4DELOSNWMPAA23","short_pith_number":"pith:KYNYT7BN","canonical_record":{"source":{"id":"1412.8138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T09:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"b6dc0bdbb3c842fc7126f3ec53af55b21487b163e29aee0917ce13332bad76fa","abstract_canon_sha256":"2fa2524e0e288dd71e2936af4e00fa9359abdd80ca0cfe235fe25013edcec797"},"schema_version":"1.0"},"canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","source":{"kind":"arxiv","id":"1412.8138","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8138","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8138v2","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8138","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYNYT7BNSLQX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KYNYT7BNSLQX4DEL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KYNYT7BN","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KYNYT7BNSLQX4DELOSNWMPAA23","target":"record","payload":{"canonical_record":{"source":{"id":"1412.8138","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T09:36:51Z","cross_cats_sorted":[],"title_canon_sha256":"b6dc0bdbb3c842fc7126f3ec53af55b21487b163e29aee0917ce13332bad76fa","abstract_canon_sha256":"2fa2524e0e288dd71e2936af4e00fa9359abdd80ca0cfe235fe25013edcec797"},"schema_version":"1.0"},"canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:36.996371Z","signature_b64":"cDjtbrfgaud/0wKh0UPzi5LhqzzV2vllidvTN8L9qcbrKPv6kNRlCxeYn9Sxnl1jQMAhJhQebKYsozrlsKdCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","last_reissued_at":"2026-05-18T00:49:36.995650Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:36.995650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.8138","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-18T00:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EgSOvoDqD2tmxfNvQ37i9XcsutNZDZwkVpK/w+/PyOn8WxHuR4KfJf44vAlFRPDgsX6CT6l6nRuMcA/vZ1bbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:10:23.015186Z"},"content_sha256":"a4b248e3f4738ed6f74d596317771655bdcdf012db2e210618655a704ec42a93","schema_version":"1.0","event_id":"sha256:a4b248e3f4738ed6f74d596317771655bdcdf012db2e210618655a704ec42a93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KYNYT7BNSLQX4DELOSNWMPAA23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting the number of weakly connected dominating sets of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mohammad Mehryar, Saeid Alikhani, Somayeh Jahari","submitted_at":"2014-12-28T09:36:51Z","abstract_excerpt":"Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\\setminus S$ is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8138","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":""},"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:49:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GEcdkmp0d4OjqYFLF8ENGBI5lIVv2EI+oDQmlag4arAmuS6S1SCLm+AxwQDgmXly3ch2sJk/kYZX7qzFiYzMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T08:10:23.015699Z"},"content_sha256":"c0116b817f09afdea0c5860ccf1cd9b624b5ba5afb295f2e681a149a4cadd22a","schema_version":"1.0","event_id":"sha256:c0116b817f09afdea0c5860ccf1cd9b624b5ba5afb295f2e681a149a4cadd22a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/bundle.json","state_url":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KYNYT7BNSLQX4DELOSNWMPAA23/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-24T08:10:23Z","links":{"resolver":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23","bundle":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/bundle.json","state":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KYNYT7BNSLQX4DELOSNWMPAA23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KYNYT7BNSLQX4DELOSNWMPAA23","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":"2fa2524e0e288dd71e2936af4e00fa9359abdd80ca0cfe235fe25013edcec797","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T09:36:51Z","title_canon_sha256":"b6dc0bdbb3c842fc7126f3ec53af55b21487b163e29aee0917ce13332bad76fa"},"schema_version":"1.0","source":{"id":"1412.8138","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.8138","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"arxiv_version","alias_value":"1412.8138v2","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8138","created_at":"2026-05-18T00:49:36Z"},{"alias_kind":"pith_short_12","alias_value":"KYNYT7BNSLQX","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KYNYT7BNSLQX4DEL","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KYNYT7BN","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:c0116b817f09afdea0c5860ccf1cd9b624b5ba5afb295f2e681a149a4cadd22a","target":"graph","created_at":"2026-05-18T00:49:36Z","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":"Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\\setminus S$ is connected. In this paper, we consider some graphs and study the number of their weakly connected dominating sets.","authors_text":"Mohammad Mehryar, Saeid Alikhani, Somayeh Jahari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T09:36:51Z","title":"Counting the number of weakly connected dominating sets of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.8138","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:a4b248e3f4738ed6f74d596317771655bdcdf012db2e210618655a704ec42a93","target":"record","created_at":"2026-05-18T00:49:36Z","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":"2fa2524e0e288dd71e2936af4e00fa9359abdd80ca0cfe235fe25013edcec797","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-12-28T09:36:51Z","title_canon_sha256":"b6dc0bdbb3c842fc7126f3ec53af55b21487b163e29aee0917ce13332bad76fa"},"schema_version":"1.0","source":{"id":"1412.8138","kind":"arxiv","version":2}},"canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","first_computed_at":"2026-05-18T00:49:36.995650Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:36.995650Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cDjtbrfgaud/0wKh0UPzi5LhqzzV2vllidvTN8L9qcbrKPv6kNRlCxeYn9Sxnl1jQMAhJhQebKYsozrlsKdCDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:36.996371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.8138","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4b248e3f4738ed6f74d596317771655bdcdf012db2e210618655a704ec42a93","sha256:c0116b817f09afdea0c5860ccf1cd9b624b5ba5afb295f2e681a149a4cadd22a"],"state_sha256":"82c612d6b2d3cd9926d7dd02969f0632a6074d94eea0bb61a52d44ecbaa22c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CoXL2peCz6qwEoJrzagsSxQrYnGQRPih0LK1ZWAQxVwaabrqpKgqOBk17YGfQSVgdvTnm8sVcKHo8IrWmg5QDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T08:10:23.018372Z","bundle_sha256":"5c5940e31f64578c889ae7554feb440a03e84afb61c43918b4b20d0da1fd18b9"}}