{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HSXTPTSBOAVJ74ZIGEMDTEH4BN","short_pith_number":"pith:HSXTPTSB","schema_version":"1.0","canonical_sha256":"3caf37ce41702a9ff32831183990fc0b6de81d863d73fec6684a8cb504704218","source":{"kind":"arxiv","id":"1507.06765","version":1},"attestation_state":"computed","paper":{"title":"Weighted Efficient Domination for $P_5$-Free Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt","submitted_at":"2015-07-24T07:33:17Z","abstract_excerpt":"In a finite undirected graph $G=(V,E)$, a vertex $v \\in V$ {\\em dominates} itself and its neighbors. A vertex set $D \\subseteq V$ in $G$ is an {\\em efficient dominating set} ({\\em e.d.} for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The {\\em Efficient Domination} (ED) problem, which asks for the existence of an e.d. in $G$, is known to be NP-complete for $P_7$-free graphs but solvable in polynomial time for $P_5$-free graphs. Very recently, it has been shown by Lokshtanov et al. and independently by Mosca that ED is solvable in polynomial time for $P_6$-fre"},"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":"1507.06765","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-24T07:33:17Z","cross_cats_sorted":[],"title_canon_sha256":"26df500b5b35bcaade8875121fa20cfaca98d1f5131ff29629124d1d354b2f3c","abstract_canon_sha256":"ebc84b57df2899ae24aeb3dbbb1755bd51fcdd800d7a279cd43f091e657eadcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:22.447906Z","signature_b64":"hekVtR96J/EOxBpu0cbHpVvWnDXIEyd7b4uYC8ebg9oLH3ODLoayl15y//E5wAnzqGDRRyCmfJLkce6Y/d/gAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3caf37ce41702a9ff32831183990fc0b6de81d863d73fec6684a8cb504704218","last_reissued_at":"2026-05-18T01:36:22.447347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:22.447347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted Efficient Domination for $P_5$-Free Graphs in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt","submitted_at":"2015-07-24T07:33:17Z","abstract_excerpt":"In a finite undirected graph $G=(V,E)$, a vertex $v \\in V$ {\\em dominates} itself and its neighbors. A vertex set $D \\subseteq V$ in $G$ is an {\\em efficient dominating set} ({\\em e.d.} for short) of $G$ if every vertex of $G$ is dominated by exactly one vertex of $D$. The {\\em Efficient Domination} (ED) problem, which asks for the existence of an e.d. in $G$, is known to be NP-complete for $P_7$-free graphs but solvable in polynomial time for $P_5$-free graphs. Very recently, it has been shown by Lokshtanov et al. and independently by Mosca that ED is solvable in polynomial time for $P_6$-fre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06765","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":"1507.06765","created_at":"2026-05-18T01:36:22.447431+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06765v1","created_at":"2026-05-18T01:36:22.447431+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06765","created_at":"2026-05-18T01:36:22.447431+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSXTPTSBOAVJ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSXTPTSBOAVJ74ZI","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSXTPTSB","created_at":"2026-05-18T12:29:25.134429+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/HSXTPTSBOAVJ74ZIGEMDTEH4BN","json":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN.json","graph_json":"https://pith.science/api/pith-number/HSXTPTSBOAVJ74ZIGEMDTEH4BN/graph.json","events_json":"https://pith.science/api/pith-number/HSXTPTSBOAVJ74ZIGEMDTEH4BN/events.json","paper":"https://pith.science/paper/HSXTPTSB"},"agent_actions":{"view_html":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN","download_json":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN.json","view_paper":"https://pith.science/paper/HSXTPTSB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06765&json=true","fetch_graph":"https://pith.science/api/pith-number/HSXTPTSBOAVJ74ZIGEMDTEH4BN/graph.json","fetch_events":"https://pith.science/api/pith-number/HSXTPTSBOAVJ74ZIGEMDTEH4BN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN/action/storage_attestation","attest_author":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN/action/author_attestation","sign_citation":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN/action/citation_signature","submit_replication":"https://pith.science/pith/HSXTPTSBOAVJ74ZIGEMDTEH4BN/action/replication_record"}},"created_at":"2026-05-18T01:36:22.447431+00:00","updated_at":"2026-05-18T01:36:22.447431+00:00"}