{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:BNP4UOSNE5TGZPIH3ILAHHZIQH","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":"4cbb06bbaa712f5b75552fd1f4785ce520ae2ac908b9ef81e4d65925f11784f1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-05T07:06:59Z","title_canon_sha256":"0b093f9543d93710d5acf3924fe722cf58c27426411e7c6b08438cdf294e0705"},"schema_version":"1.0","source":{"id":"1409.1676","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1676","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1676v1","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1676","created_at":"2026-05-18T02:43:25Z"},{"alias_kind":"pith_short_12","alias_value":"BNP4UOSNE5TG","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"BNP4UOSNE5TGZPIH","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"BNP4UOSN","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d48900f00d0bc8e734d727d896f2990e5e8222c644befb8f2069d88c642255c6","target":"graph","created_at":"2026-05-18T02:43:25Z","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":"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 ","authors_text":"T. Karthick","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-05T07:06:59Z","title":"New polynomial case for efficient domination in $P_6$-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1676","kind":"arxiv","version":1},"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:04437b7b29104d87d451c203660eb8330746a2db1b4a5df85ea71c2cd8c68550","target":"record","created_at":"2026-05-18T02:43:25Z","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":"4cbb06bbaa712f5b75552fd1f4785ce520ae2ac908b9ef81e4d65925f11784f1","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-05T07:06:59Z","title_canon_sha256":"0b093f9543d93710d5acf3924fe722cf58c27426411e7c6b08438cdf294e0705"},"schema_version":"1.0","source":{"id":"1409.1676","kind":"arxiv","version":1}},"canonical_sha256":"0b5fca3a4d27666cbd07da16039f2881d2e744382cffaa4d07fd2028ed09663a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b5fca3a4d27666cbd07da16039f2881d2e744382cffaa4d07fd2028ed09663a","first_computed_at":"2026-05-18T02:43:25.550777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:25.550777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RMI2o2lN/j3g8ScAnOa1q0Sy6btcd3gneUve2W5ooM7/azghZifwW490x3B2tTI3VJmzEROLn3NqAAf7qZWyCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:25.551229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1676","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04437b7b29104d87d451c203660eb8330746a2db1b4a5df85ea71c2cd8c68550","sha256:d48900f00d0bc8e734d727d896f2990e5e8222c644befb8f2069d88c642255c6"],"state_sha256":"006afca4b7a7d41326d7006aa83e8376acbfe62b8c9bd6aa6f1fb8d20e14b53f"}