{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HLK5RULQLBXLBIMK7U57FLBEUB","short_pith_number":"pith:HLK5RULQ","schema_version":"1.0","canonical_sha256":"3ad5d8d170586eb0a18afd3bf2ac24a072f3ad2a6d1da670c790f054cabe49a2","source":{"kind":"arxiv","id":"1301.7602","version":2},"attestation_state":"computed","paper":{"title":"Exact algorithms for dominating induced matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","submitted_at":"2013-01-31T13:01:42Z","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"},"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":"1301.7602","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-01-31T13:01:42Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2c2f954db7d490d32e81b337e0dea3d14ccc1d2c1988c24afe4a9fda7603dbe5","abstract_canon_sha256":"1e8f458b1b6fb2abf02a6c8d7d6b91193bf6745da2318c643f87c2693444362c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:20.345852Z","signature_b64":"6K/jkJGy10273kTx3BRkKb1wpdsNgouZA36hzA0Vf4bsS2qcXo5c/CUovvy07vXqcTcQhwmYqcMIogBqE7+0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ad5d8d170586eb0a18afd3bf2ac24a072f3ad2a6d1da670c790f054cabe49a2","last_reissued_at":"2026-05-18T03:31:20.345237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:20.345237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact algorithms for dominating induced matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jayme L. Szwarcfiter, Michel J. Mizrahi, Min Chih Lin","submitted_at":"2013-01-31T13:01:42Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7602","kind":"arxiv","version":2},"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":"1301.7602","created_at":"2026-05-18T03:31:20.345349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.7602v2","created_at":"2026-05-18T03:31:20.345349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7602","created_at":"2026-05-18T03:31:20.345349+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLK5RULQLBXL","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLK5RULQLBXLBIMK","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLK5RULQ","created_at":"2026-05-18T12:27:46.883200+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/HLK5RULQLBXLBIMK7U57FLBEUB","json":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB.json","graph_json":"https://pith.science/api/pith-number/HLK5RULQLBXLBIMK7U57FLBEUB/graph.json","events_json":"https://pith.science/api/pith-number/HLK5RULQLBXLBIMK7U57FLBEUB/events.json","paper":"https://pith.science/paper/HLK5RULQ"},"agent_actions":{"view_html":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB","download_json":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB.json","view_paper":"https://pith.science/paper/HLK5RULQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.7602&json=true","fetch_graph":"https://pith.science/api/pith-number/HLK5RULQLBXLBIMK7U57FLBEUB/graph.json","fetch_events":"https://pith.science/api/pith-number/HLK5RULQLBXLBIMK7U57FLBEUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB/action/storage_attestation","attest_author":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB/action/author_attestation","sign_citation":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB/action/citation_signature","submit_replication":"https://pith.science/pith/HLK5RULQLBXLBIMK7U57FLBEUB/action/replication_record"}},"created_at":"2026-05-18T03:31:20.345349+00:00","updated_at":"2026-05-18T03:31:20.345349+00:00"}