{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BNP4UOSNE5TGZPIH3ILAHHZIQH","short_pith_number":"pith:BNP4UOSN","schema_version":"1.0","canonical_sha256":"0b5fca3a4d27666cbd07da16039f2881d2e744382cffaa4d07fd2028ed09663a","source":{"kind":"arxiv","id":"1409.1676","version":1},"attestation_state":"computed","paper":{"title":"New polynomial case for efficient domination in $P_6$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"T. Karthick","submitted_at":"2014-09-05T07:06:59Z","abstract_excerpt":"In a graph $G$, an {\\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {\\textsc{Efficient Dominating Set}} problem (EDS) asks for the existence of an efficient dominating set in a given graph $G$. The EDS is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the EDS problem is unknown for $P_6$-free graphs. In this paper, we show that the EDS problem can be solved in polynomial time "},"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":"1409.1676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-05T07:06:59Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0b093f9543d93710d5acf3924fe722cf58c27426411e7c6b08438cdf294e0705","abstract_canon_sha256":"4cbb06bbaa712f5b75552fd1f4785ce520ae2ac908b9ef81e4d65925f11784f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:25.551229Z","signature_b64":"RMI2o2lN/j3g8ScAnOa1q0Sy6btcd3gneUve2W5ooM7/azghZifwW490x3B2tTI3VJmzEROLn3NqAAf7qZWyCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b5fca3a4d27666cbd07da16039f2881d2e744382cffaa4d07fd2028ed09663a","last_reissued_at":"2026-05-18T02:43:25.550777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:25.550777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New polynomial case for efficient domination in $P_6$-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"T. Karthick","submitted_at":"2014-09-05T07:06:59Z","abstract_excerpt":"In a graph $G$, an {\\it efficient dominating set} is a subset $D$ of vertices such that $D$ is an independent set and each vertex outside $D$ has exactly one neighbor in $D$. The {\\textsc{Efficient Dominating Set}} problem (EDS) asks for the existence of an efficient dominating set in a given graph $G$. The EDS is known to be $NP$-complete for $P_7$-free graphs, and is known to be polynomial time solvable for $P_5$-free graphs. However, the computational complexity of the EDS problem is unknown for $P_6$-free graphs. In this paper, we show that the EDS problem can be solved in polynomial time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1676","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":"1409.1676","created_at":"2026-05-18T02:43:25.550848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1676v1","created_at":"2026-05-18T02:43:25.550848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1676","created_at":"2026-05-18T02:43:25.550848+00:00"},{"alias_kind":"pith_short_12","alias_value":"BNP4UOSNE5TG","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BNP4UOSNE5TGZPIH","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BNP4UOSN","created_at":"2026-05-18T12:28:22.404517+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/BNP4UOSNE5TGZPIH3ILAHHZIQH","json":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH.json","graph_json":"https://pith.science/api/pith-number/BNP4UOSNE5TGZPIH3ILAHHZIQH/graph.json","events_json":"https://pith.science/api/pith-number/BNP4UOSNE5TGZPIH3ILAHHZIQH/events.json","paper":"https://pith.science/paper/BNP4UOSN"},"agent_actions":{"view_html":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH","download_json":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH.json","view_paper":"https://pith.science/paper/BNP4UOSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1676&json=true","fetch_graph":"https://pith.science/api/pith-number/BNP4UOSNE5TGZPIH3ILAHHZIQH/graph.json","fetch_events":"https://pith.science/api/pith-number/BNP4UOSNE5TGZPIH3ILAHHZIQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH/action/storage_attestation","attest_author":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH/action/author_attestation","sign_citation":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH/action/citation_signature","submit_replication":"https://pith.science/pith/BNP4UOSNE5TGZPIH3ILAHHZIQH/action/replication_record"}},"created_at":"2026-05-18T02:43:25.550848+00:00","updated_at":"2026-05-18T02:43:25.550848+00:00"}