{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ELM6W7JPM4DUNATN2G5L5HYUU4","short_pith_number":"pith:ELM6W7JP","schema_version":"1.0","canonical_sha256":"22d9eb7d2f670746826dd1babe9f14a72d76d75fdf8ed58cc0a2a72e644dcf20","source":{"kind":"arxiv","id":"2512.23989","version":2},"attestation_state":"computed","paper":{"title":"Secure Domination in Bisplit graphs -- A Structural and algorithmic study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"N Sadagopan, Swathi D","submitted_at":"2025-12-30T05:11:18Z","abstract_excerpt":"A dominating set $S$ of a graph $G(V,E)$ is called a \\textit{secure dominating set} if each vertex $u \\in V(G) \\setminus S$ is adjacent to a vertex $v \\in S$ such that $(S \\setminus \\{v\\}) \\cup \\{u\\}$ is a dominating set of $G$. The \\textit{secure domination number} $\\gamma_s(G)$ of $G$ is the minimum cardinality of a secure dominating set of $G$. The \\textit{Minimum Secure Domination problem} is to find a secure dominating set of a graph $G$ of cardinality $\\gamma_s(G)$. In this paper, the computational complexity of the secure domination problem on several graph classes is investigated. The "},"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":"2512.23989","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-12-30T05:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"df93496eb93bab970e00d5c8a419f1ed6b8b3a1d91c24ff0bc54361523d8616a","abstract_canon_sha256":"c27464878e1cc22105fd0841fa76132685b9822c17e81f64ab07fd8bdeaca13e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:11.972182Z","signature_b64":"fytK1T/w8vNPFBQPM6d/xxkMONGjUxP7938Zh0+JiZ44FGllKTV2K/P6JNRLe+uJoEaQYMP+KeLsHwwjM27/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22d9eb7d2f670746826dd1babe9f14a72d76d75fdf8ed58cc0a2a72e644dcf20","last_reissued_at":"2026-05-25T02:02:11.971291Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:11.971291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Secure Domination in Bisplit graphs -- A Structural and algorithmic study","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"N Sadagopan, Swathi D","submitted_at":"2025-12-30T05:11:18Z","abstract_excerpt":"A dominating set $S$ of a graph $G(V,E)$ is called a \\textit{secure dominating set} if each vertex $u \\in V(G) \\setminus S$ is adjacent to a vertex $v \\in S$ such that $(S \\setminus \\{v\\}) \\cup \\{u\\}$ is a dominating set of $G$. The \\textit{secure domination number} $\\gamma_s(G)$ of $G$ is the minimum cardinality of a secure dominating set of $G$. The \\textit{Minimum Secure Domination problem} is to find a secure dominating set of a graph $G$ of cardinality $\\gamma_s(G)$. In this paper, the computational complexity of the secure domination problem on several graph classes is investigated. The "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.23989","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/2512.23989/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2512.23989","created_at":"2026-05-25T02:02:11.971430+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.23989v2","created_at":"2026-05-25T02:02:11.971430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.23989","created_at":"2026-05-25T02:02:11.971430+00:00"},{"alias_kind":"pith_short_12","alias_value":"ELM6W7JPM4DU","created_at":"2026-05-25T02:02:11.971430+00:00"},{"alias_kind":"pith_short_16","alias_value":"ELM6W7JPM4DUNATN","created_at":"2026-05-25T02:02:11.971430+00:00"},{"alias_kind":"pith_short_8","alias_value":"ELM6W7JP","created_at":"2026-05-25T02:02:11.971430+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/ELM6W7JPM4DUNATN2G5L5HYUU4","json":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4.json","graph_json":"https://pith.science/api/pith-number/ELM6W7JPM4DUNATN2G5L5HYUU4/graph.json","events_json":"https://pith.science/api/pith-number/ELM6W7JPM4DUNATN2G5L5HYUU4/events.json","paper":"https://pith.science/paper/ELM6W7JP"},"agent_actions":{"view_html":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4","download_json":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4.json","view_paper":"https://pith.science/paper/ELM6W7JP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.23989&json=true","fetch_graph":"https://pith.science/api/pith-number/ELM6W7JPM4DUNATN2G5L5HYUU4/graph.json","fetch_events":"https://pith.science/api/pith-number/ELM6W7JPM4DUNATN2G5L5HYUU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4/action/storage_attestation","attest_author":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4/action/author_attestation","sign_citation":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4/action/citation_signature","submit_replication":"https://pith.science/pith/ELM6W7JPM4DUNATN2G5L5HYUU4/action/replication_record"}},"created_at":"2026-05-25T02:02:11.971430+00:00","updated_at":"2026-05-25T02:02:11.971430+00:00"}