{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TADCLB7TRAHQK7GIWDSS7SIW6A","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":"7f0756a142b71ccf4b39458776484153561d42e9f1e33b1df7ba255d97f0273a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-28T22:16:51Z","title_canon_sha256":"0ebdcd9da20bc0ab52a657f9ed5254a3f1ce765a69a3308a6612ef66e1661628"},"schema_version":"1.0","source":{"id":"1303.0035","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0035","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0035v2","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0035","created_at":"2026-05-18T03:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"TADCLB7TRAHQ","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"TADCLB7TRAHQK7GI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"TADCLB7T","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:716c9991227b5175f49d9ac1df35571565c7c7604d967b4fae18f58bfe2c73f6","target":"graph","created_at":"2026-05-18T03:31:44Z","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":"Say that an edge of a graph $G$ dominates itself and every other edge adjacent to it. An edge dominating set of a graph $G=(V,E)$ is a subset of edges $E' \\subseteq E$ which dominates all edges of $G$. In particular, if every edge of $G$ is dominated by exactly one edge of $E'$ then $E'$ is a dominating induced matching. It is known that not every graph admits a dominating induced matching, while the problem to decide if it does admit it is NP-complete. In this paper we consider the problems of finding a minimum weighted dominating induced matching, if any, and counting the number of dominatin","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-28T22:16:51Z","title":"An $O^*(1.1939^n)$ time algorithm for minimum weighted dominating induced matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0035","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:9d7f092204cf4ee88091e01912974e912d9e6e0fb956ec5b38f4a13caf4a8464","target":"record","created_at":"2026-05-18T03:31:44Z","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":"7f0756a142b71ccf4b39458776484153561d42e9f1e33b1df7ba255d97f0273a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-28T22:16:51Z","title_canon_sha256":"0ebdcd9da20bc0ab52a657f9ed5254a3f1ce765a69a3308a6612ef66e1661628"},"schema_version":"1.0","source":{"id":"1303.0035","kind":"arxiv","version":2}},"canonical_sha256":"98062587f3880f057cc8b0e52fc916f01a340cdd5bc5f1ed3b83d3e47511462c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98062587f3880f057cc8b0e52fc916f01a340cdd5bc5f1ed3b83d3e47511462c","first_computed_at":"2026-05-18T03:31:44.255825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:44.255825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VBrX94Nf88B1a6bGOUMXRCqLi30M9wMw1h02Obwx2JAA+ZhbKOfMIhECdIRsfl8rl3r4ugGefy4djUKVJEPCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:44.256589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0035","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d7f092204cf4ee88091e01912974e912d9e6e0fb956ec5b38f4a13caf4a8464","sha256:716c9991227b5175f49d9ac1df35571565c7c7604d967b4fae18f58bfe2c73f6"],"state_sha256":"1998c29039065b00f0e1351c5d6a387f047806765525a578341dbf1e9e07dc17"}