{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HWEPCO54DEBW6ZBRC5AGJMGH7B","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":"6e90f30b25700d44fdbad47734ed46ef41296b43268b5d373f7cf7fa838cd81b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-03T07:53:32Z","title_canon_sha256":"ddd5d4c043e222e84aa9d3fc8582ed13e62402df37051ecf6bc8638f6eaa6d5e"},"schema_version":"1.0","source":{"id":"1410.0770","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0770","created_at":"2026-05-18T02:32:53Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0770v2","created_at":"2026-05-18T02:32:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0770","created_at":"2026-05-18T02:32:53Z"},{"alias_kind":"pith_short_12","alias_value":"HWEPCO54DEBW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HWEPCO54DEBW6ZBR","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HWEPCO54","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a93513c196be4512ffc988b9ed7889f015ddaed113b5080f797b51b644cc7568","target":"graph","created_at":"2026-05-18T02:32:53Z","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":"An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient domination problem is the problem of finding an efficient dominating set of minimum weight in a given vertex-weighted graph; the maximum weight efficient domination problem is defined similarly. We develop a framework for solving the weighted efficient domination problems based on a reduction to the maximum weight independent set problem in the square of the input graph. Using this approach, we improve on several pre","authors_text":"Andreas Brandst\\\"adt, Arne Leitert, Martin Milani\\v{c}, Pavel Fi\\v{c}ur","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-03T07:53:32Z","title":"Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0770","kind":"arxiv","version":2},"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:7de325136fef722ca5c2c60ac104c39ca55c96c1c9996a39af212440b9eb049e","target":"record","created_at":"2026-05-18T02:32:53Z","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":"6e90f30b25700d44fdbad47734ed46ef41296b43268b5d373f7cf7fa838cd81b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-03T07:53:32Z","title_canon_sha256":"ddd5d4c043e222e84aa9d3fc8582ed13e62402df37051ecf6bc8638f6eaa6d5e"},"schema_version":"1.0","source":{"id":"1410.0770","kind":"arxiv","version":2}},"canonical_sha256":"3d88f13bbc19036f6431174064b0c7f84638017120f69a8baa3d76d55869ed04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d88f13bbc19036f6431174064b0c7f84638017120f69a8baa3d76d55869ed04","first_computed_at":"2026-05-18T02:32:53.001122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:53.001122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pAPrMjrnE+VROB3x/pk0gh4vhLTTGvbg2CpBAUc4BamrfypsXGjbEL0bJLn3RuAnRWyzNuIwJFGhnLeuMxEnAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:53.001768Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0770","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7de325136fef722ca5c2c60ac104c39ca55c96c1c9996a39af212440b9eb049e","sha256:a93513c196be4512ffc988b9ed7889f015ddaed113b5080f797b51b644cc7568"],"state_sha256":"c7bb7c91af20a4c56912cd08c01a5a8608be33578a49ee67f473cebcb07d8d99"}