{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6Z46S2C4SPW4TUIG5577N6OJA3","short_pith_number":"pith:6Z46S2C4","schema_version":"1.0","canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","source":{"kind":"arxiv","id":"1407.4593","version":1},"attestation_state":"computed","paper":{"title":"Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Vassilis Giakoumakis","submitted_at":"2014-07-17T08:11:57Z","abstract_excerpt":"Let $G$ be a finite undirected graph. A vertex {\\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\\em efficient dominating set} (\\emph{e.d.}\\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \\emph{Efficient Domination} (ED) problem, which asks for the existence of an e.d.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for claw-free graphs, for chordal graphs and for $2P_3$-free graphs (and thus, for $P_7$-free graphs). We call a graph $F$ a {\\em linear forest} if $F$ is cycle- and claw-free, i"},"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":"1407.4593","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-07-17T08:11:57Z","cross_cats_sorted":[],"title_canon_sha256":"5ef8a8d03721dedee14682ae4e6594d0cf8aaebe9c6f952880e04b1637382620","abstract_canon_sha256":"520f3f11a9761446252b46bc846fa71a5262b9adc57cffbfd0d47b6c78441dd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.681372Z","signature_b64":"bsgA6VjMGwdz/kC8V1lYRArnYU8l7+RfN8QZMwwNmDk0/GmawG/6Zs/8NHFKFYfEo1mgkUhxHnS9Oh8VVX77Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f679e9685c93edc9d106ef7ff6f9c906e1ba412fb0e760e91b064c3d3288f136","last_reissued_at":"2026-05-18T02:47:23.680982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.680982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Vassilis Giakoumakis","submitted_at":"2014-07-17T08:11:57Z","abstract_excerpt":"Let $G$ be a finite undirected graph. A vertex {\\em dominates} itself and all its neighbors in $G$. A vertex set $D$ is an {\\em efficient dominating set} (\\emph{e.d.}\\ for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The \\emph{Efficient Domination} (ED) problem, which asks for the existence of an e.d.\\ in $G$, is known to be \\NP-complete even for very restricted graph classes such as for claw-free graphs, for chordal graphs and for $2P_3$-free graphs (and thus, for $P_7$-free graphs). We call a graph $F$ a {\\em linear forest} if $F$ is cycle- and claw-free, i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.4593","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":"1407.4593","created_at":"2026-05-18T02:47:23.681045+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.4593v1","created_at":"2026-05-18T02:47:23.681045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.4593","created_at":"2026-05-18T02:47:23.681045+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Z46S2C4SPW4","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Z46S2C4SPW4TUIG","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Z46S2C4","created_at":"2026-05-18T12:28:16.859392+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/6Z46S2C4SPW4TUIG5577N6OJA3","json":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3.json","graph_json":"https://pith.science/api/pith-number/6Z46S2C4SPW4TUIG5577N6OJA3/graph.json","events_json":"https://pith.science/api/pith-number/6Z46S2C4SPW4TUIG5577N6OJA3/events.json","paper":"https://pith.science/paper/6Z46S2C4"},"agent_actions":{"view_html":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3","download_json":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3.json","view_paper":"https://pith.science/paper/6Z46S2C4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.4593&json=true","fetch_graph":"https://pith.science/api/pith-number/6Z46S2C4SPW4TUIG5577N6OJA3/graph.json","fetch_events":"https://pith.science/api/pith-number/6Z46S2C4SPW4TUIG5577N6OJA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/action/storage_attestation","attest_author":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/action/author_attestation","sign_citation":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/action/citation_signature","submit_replication":"https://pith.science/pith/6Z46S2C4SPW4TUIG5577N6OJA3/action/replication_record"}},"created_at":"2026-05-18T02:47:23.681045+00:00","updated_at":"2026-05-18T02:47:23.681045+00:00"}