{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KYNYT7BNSLQX4DELOSNWMPAA23","short_pith_number":"pith:KYNYT7BN","schema_version":"1.0","canonical_sha256":"561b89fc2d92e17e0c8b749b663c00d6f1560e0566a6a7d0ce016627c21116c2","source":{"kind":"arxiv","id":"1412.8138","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.8138","created_at":"2026-05-18T00:49:36.995735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.8138v2","created_at":"2026-05-18T00:49:36.995735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.8138","created_at":"2026-05-18T00:49:36.995735+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYNYT7BNSLQX","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYNYT7BNSLQX4DEL","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYNYT7BN","created_at":"2026-05-18T12:28:35.611951+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/KYNYT7BNSLQX4DELOSNWMPAA23","json":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23.json","graph_json":"https://pith.science/api/pith-number/KYNYT7BNSLQX4DELOSNWMPAA23/graph.json","events_json":"https://pith.science/api/pith-number/KYNYT7BNSLQX4DELOSNWMPAA23/events.json","paper":"https://pith.science/paper/KYNYT7BN"},"agent_actions":{"view_html":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23","download_json":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23.json","view_paper":"https://pith.science/paper/KYNYT7BN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.8138&json=true","fetch_graph":"https://pith.science/api/pith-number/KYNYT7BNSLQX4DELOSNWMPAA23/graph.json","fetch_events":"https://pith.science/api/pith-number/KYNYT7BNSLQX4DELOSNWMPAA23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/action/storage_attestation","attest_author":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/action/author_attestation","sign_citation":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/action/citation_signature","submit_replication":"https://pith.science/pith/KYNYT7BNSLQX4DELOSNWMPAA23/action/replication_record"}},"created_at":"2026-05-18T00:49:36.995735+00:00","updated_at":"2026-05-18T00:49:36.995735+00:00"}