{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7ONC2UJ5OB5FEGQ7R46WNST4PC","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":"38b19a859be89e66834e309344eb1b5689a1a8381d098c415211ce947660b18b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T01:15:29Z","title_canon_sha256":"fb7e88e235f82169002e9f806860d983a8aed4cc50a701cec17ecaf802847f4d"},"schema_version":"1.0","source":{"id":"1906.10801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10801","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10801v1","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10801","created_at":"2026-05-17T23:42:14Z"},{"alias_kind":"pith_short_12","alias_value":"7ONC2UJ5OB5F","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7ONC2UJ5OB5FEGQ7","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7ONC2UJ5","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:79b11cd67f3cd33ee723100ea2535d03263bb6e8113e1fdccac4a8b47cf63988","target":"graph","created_at":"2026-05-17T23:42:14Z","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":"A mixed dominating set of a graph $G = (V, E)$ is a mixed set $D$ of vertices and edges, such that for every edge or vertex, if it is not in $D$, then it is adjacent or incident to at least one vertex or edge in $D$. The mixed domination problem is to find a mixed dominating set with a minimum cardinality. It has applications in system control and some other scenarios and it is $NP$-hard to compute an optimal solution. This paper studies approximation algorithms and hardness of the weighted mixed dominating set problem. The weighted version is a generalization of the unweighted version, where ","authors_text":"Mingyu Xiao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T01:15:29Z","title":"Upper and Lower Bounds on Approximating Weighted Mixed Domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10801","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:9e6dcf129d4f9ca41a93bc47e85ca457108b7b9692716ffa3d12d30953bca74b","target":"record","created_at":"2026-05-17T23:42:14Z","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":"38b19a859be89e66834e309344eb1b5689a1a8381d098c415211ce947660b18b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-26T01:15:29Z","title_canon_sha256":"fb7e88e235f82169002e9f806860d983a8aed4cc50a701cec17ecaf802847f4d"},"schema_version":"1.0","source":{"id":"1906.10801","kind":"arxiv","version":1}},"canonical_sha256":"fb9a2d513d707a521a1f8f3d66ca7c7886ce10b8801915fe9124d9962a52b92b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb9a2d513d707a521a1f8f3d66ca7c7886ce10b8801915fe9124d9962a52b92b","first_computed_at":"2026-05-17T23:42:14.734412Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:14.734412Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bVti7yrBNbJ/ElpjE4ql22xtgAAk+CNWzAe/50YcOIwCteHcY73ftfx4nDZxGxQqoMm3RZ5+TUeCtjMrK0fTBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:14.735064Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e6dcf129d4f9ca41a93bc47e85ca457108b7b9692716ffa3d12d30953bca74b","sha256:79b11cd67f3cd33ee723100ea2535d03263bb6e8113e1fdccac4a8b47cf63988"],"state_sha256":"bb17488c3a8c15de44160cc4c520607aaa8f6e4e2ec9f44ad87368f59cebd6e0"}