{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HLK5RULQLBXLBIMK7U57FLBEUB","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":"1e8f458b1b6fb2abf02a6c8d7d6b91193bf6745da2318c643f87c2693444362c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-31T13:01:42Z","title_canon_sha256":"2c2f954db7d490d32e81b337e0dea3d14ccc1d2c1988c24afe4a9fda7603dbe5"},"schema_version":"1.0","source":{"id":"1301.7602","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7602","created_at":"2026-05-18T03:31:20Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7602v2","created_at":"2026-05-18T03:31:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7602","created_at":"2026-05-18T03:31:20Z"},{"alias_kind":"pith_short_12","alias_value":"HLK5RULQLBXL","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HLK5RULQLBXLBIMK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HLK5RULQ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ccf275c279f3b1239c00b7725b4bbf4b9209e425faf3b5084a9dd630e07bb385","target":"graph","created_at":"2026-05-18T03:31:20Z","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' of 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 is NP-complete. In this paper we consider the problem of finding a minimum weighted dominating induced matching, if any, of a graph with weighted edges. We describe two exact algor","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-31T13:01:42Z","title":"Exact algorithms for dominating induced matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7602","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:e92497f6b3fc243148c5bdd723d683b36af18a96f4d5cda24c3b92bb544f63eb","target":"record","created_at":"2026-05-18T03:31:20Z","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":"1e8f458b1b6fb2abf02a6c8d7d6b91193bf6745da2318c643f87c2693444362c","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-31T13:01:42Z","title_canon_sha256":"2c2f954db7d490d32e81b337e0dea3d14ccc1d2c1988c24afe4a9fda7603dbe5"},"schema_version":"1.0","source":{"id":"1301.7602","kind":"arxiv","version":2}},"canonical_sha256":"3ad5d8d170586eb0a18afd3bf2ac24a072f3ad2a6d1da670c790f054cabe49a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ad5d8d170586eb0a18afd3bf2ac24a072f3ad2a6d1da670c790f054cabe49a2","first_computed_at":"2026-05-18T03:31:20.345237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:20.345237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6K/jkJGy10273kTx3BRkKb1wpdsNgouZA36hzA0Vf4bsS2qcXo5c/CUovvy07vXqcTcQhwmYqcMIogBqE7+0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:20.345852Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7602","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92497f6b3fc243148c5bdd723d683b36af18a96f4d5cda24c3b92bb544f63eb","sha256:ccf275c279f3b1239c00b7725b4bbf4b9209e425faf3b5084a9dd630e07bb385"],"state_sha256":"8a56703fe1ae3542326d964811f4b4867151ec0910f5809cd0ab41b01c7b776f"}