{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V2RDAL7URV4GZAGCOLFXRBVHJL","short_pith_number":"pith:V2RDAL7U","schema_version":"1.0","canonical_sha256":"aea2302ff48d786c80c272cb7886a74ac6bf2c677a5bc8471241456c16e53c1b","source":{"kind":"arxiv","id":"1708.00188","version":1},"attestation_state":"computed","paper":{"title":"On outer-connected domination for graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. Hashemipour, M. R. Hooshmandasl","submitted_at":"2017-08-01T07:26:18Z","abstract_excerpt":"An outer-connected dominating set for an arbitrary graph $G$ is a set $\\tilde{D} \\subseteq V$ such that $\\tilde{D}$ is a dominating set and the induced subgraph $G [V \\setminus \\tilde{D}]$ be connected. In this paper, we focus on the outer-connected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds for outer-connected domination number in lexicographic and Cartesian product of graphs. Also, we establish an equivalent form of the Vizing's conjecture f"},"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":"1708.00188","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-01T07:26:18Z","cross_cats_sorted":[],"title_canon_sha256":"39f961d3ad66be0b7fa8ef515330f4dc533da7a55a41752311ef3f494d51a09c","abstract_canon_sha256":"370345a9c52ac98c1b182a2bbc0dc2ff73c84208b7fa5ab0eb8afc697a5643c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:05.850895Z","signature_b64":"MJFBpiEgc3CjaacZiM8pUbkL7z2Y4z1Gc2zcvDsfgTBS2oy2wjUOM7YhviP9q2QlrSjLCNASi0ADpm4ZGv0PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aea2302ff48d786c80c272cb7886a74ac6bf2c677a5bc8471241456c16e53c1b","last_reissued_at":"2026-05-18T00:39:05.850387Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:05.850387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On outer-connected domination for graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. Shakiba, M. Hashemipour, M. R. Hooshmandasl","submitted_at":"2017-08-01T07:26:18Z","abstract_excerpt":"An outer-connected dominating set for an arbitrary graph $G$ is a set $\\tilde{D} \\subseteq V$ such that $\\tilde{D}$ is a dominating set and the induced subgraph $G [V \\setminus \\tilde{D}]$ be connected. In this paper, we focus on the outer-connected domination number of the product of graphs. We investigate the existence of outer-connected dominating set in lexicographic product and Corona of two arbitrary graphs, and we present upper bounds for outer-connected domination number in lexicographic and Cartesian product of graphs. Also, we establish an equivalent form of the Vizing's conjecture f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00188","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":""},"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":"1708.00188","created_at":"2026-05-18T00:39:05.850471+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00188v1","created_at":"2026-05-18T00:39:05.850471+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00188","created_at":"2026-05-18T00:39:05.850471+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2RDAL7URV4G","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2RDAL7URV4GZAGC","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2RDAL7U","created_at":"2026-05-18T12:31:49.984773+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/V2RDAL7URV4GZAGCOLFXRBVHJL","json":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL.json","graph_json":"https://pith.science/api/pith-number/V2RDAL7URV4GZAGCOLFXRBVHJL/graph.json","events_json":"https://pith.science/api/pith-number/V2RDAL7URV4GZAGCOLFXRBVHJL/events.json","paper":"https://pith.science/paper/V2RDAL7U"},"agent_actions":{"view_html":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL","download_json":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL.json","view_paper":"https://pith.science/paper/V2RDAL7U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00188&json=true","fetch_graph":"https://pith.science/api/pith-number/V2RDAL7URV4GZAGCOLFXRBVHJL/graph.json","fetch_events":"https://pith.science/api/pith-number/V2RDAL7URV4GZAGCOLFXRBVHJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL/action/storage_attestation","attest_author":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL/action/author_attestation","sign_citation":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL/action/citation_signature","submit_replication":"https://pith.science/pith/V2RDAL7URV4GZAGCOLFXRBVHJL/action/replication_record"}},"created_at":"2026-05-18T00:39:05.850471+00:00","updated_at":"2026-05-18T00:39:05.850471+00:00"}