{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W6DUEXJNMJJ7CE3LNUMADU4RTO","short_pith_number":"pith:W6DUEXJN","schema_version":"1.0","canonical_sha256":"b787425d2d6253f1136b6d1801d3919ba29fed7e380175a0da968e1799e37f52","source":{"kind":"arxiv","id":"1503.06025","version":1},"attestation_state":"computed","paper":{"title":"Weighted Efficient Domination in Classes of $P_6$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, T. Karthick","submitted_at":"2015-03-20T09:40:45Z","abstract_excerpt":"In a graph $G$, an 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 Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarly. The Min-WED/Max-WED 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 Min-WE"},"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":"1503.06025","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-20T09:40:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"38e0d193b9af626c293768296b6f18f30c7450e2b68b64b3512f503b975b776d","abstract_canon_sha256":"a451b94d1cc330f6cef8ef4cac272adb72155cf10256bc93d585cfa834a28716"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:48.887065Z","signature_b64":"Eca3kWfFAkKr/5wCoGcpK9XAUgNr1uZI9og4CPJQBDlAg6khK9s9tVOboRcJC6UIwzUcAvMk59QjCFvQ861+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b787425d2d6253f1136b6d1801d3919ba29fed7e380175a0da968e1799e37f52","last_reissued_at":"2026-05-18T02:20:48.885913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:48.885913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Efficient Domination in Classes of $P_6$-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, T. Karthick","submitted_at":"2015-03-20T09:40:45Z","abstract_excerpt":"In a graph $G$, an 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 Minimum Weight Efficient Dominating Set (Min-WED) problem asks for an efficient dominating set of total minimum weight in a given vertex-weighted graph; the Maximum Weight Efficient Dominating Set (Max-WED) problem is defined similarly. The Min-WED/Max-WED 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 Min-WE"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06025","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":"1503.06025","created_at":"2026-05-18T02:20:48.886375+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06025v1","created_at":"2026-05-18T02:20:48.886375+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06025","created_at":"2026-05-18T02:20:48.886375+00:00"},{"alias_kind":"pith_short_12","alias_value":"W6DUEXJNMJJ7","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W6DUEXJNMJJ7CE3L","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W6DUEXJN","created_at":"2026-05-18T12:29:47.479230+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/W6DUEXJNMJJ7CE3LNUMADU4RTO","json":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO.json","graph_json":"https://pith.science/api/pith-number/W6DUEXJNMJJ7CE3LNUMADU4RTO/graph.json","events_json":"https://pith.science/api/pith-number/W6DUEXJNMJJ7CE3LNUMADU4RTO/events.json","paper":"https://pith.science/paper/W6DUEXJN"},"agent_actions":{"view_html":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO","download_json":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO.json","view_paper":"https://pith.science/paper/W6DUEXJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06025&json=true","fetch_graph":"https://pith.science/api/pith-number/W6DUEXJNMJJ7CE3LNUMADU4RTO/graph.json","fetch_events":"https://pith.science/api/pith-number/W6DUEXJNMJJ7CE3LNUMADU4RTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO/action/storage_attestation","attest_author":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO/action/author_attestation","sign_citation":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO/action/citation_signature","submit_replication":"https://pith.science/pith/W6DUEXJNMJJ7CE3LNUMADU4RTO/action/replication_record"}},"created_at":"2026-05-18T02:20:48.886375+00:00","updated_at":"2026-05-18T02:20:48.886375+00:00"}