{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WXZRXCQQEX2CEZYR7722VCCAZA","short_pith_number":"pith:WXZRXCQQ","schema_version":"1.0","canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","source":{"kind":"arxiv","id":"1505.02558","version":1},"attestation_state":"computed","paper":{"title":"Dominating induced matchings in graphs containing no long claw","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Alain Hertz, Bernard Ries, Dominique de Werra, Vadim Lozin, Victor Zamaraev","submitted_at":"2015-05-11T10:39:24Z","abstract_excerpt":"An induced matching $M$ in a graph $G$ is dominating if every edge not in $M$ shares exactly one vertex with an edge in $M$. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph $G$ contains a dominating induced matching. This problem is generally NP-complete, but polynomial-time solvable for graphs with some special properties. In particular, it is solvable in polynomial time for claw-free graphs. In the present paper, we study this problem for graphs containing no long claw, i.e. no induced subgraph obtained from the claw by subdividing each "},"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":"1505.02558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-11T10:39:24Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"b421d4c98b07abe00451369af820dfece0bc037bec827ffb022c02a274289087","abstract_canon_sha256":"fde5935e55f73ee44f28ef0c0cb58bbfc69600a4d54d30efbbcff3b6bb6716c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:18.462842Z","signature_b64":"uzKWJOo2K8WIDopy7N/NVDy4XQ5BasidbDwMkQUl4RNqDDxmSGCHPRyFrvfqAtDadnNHTPOEZ3U6Dzb/BkeACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","last_reissued_at":"2026-05-18T02:16:18.462093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:18.462093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating induced matchings in graphs containing no long claw","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Alain Hertz, Bernard Ries, Dominique de Werra, Vadim Lozin, Victor Zamaraev","submitted_at":"2015-05-11T10:39:24Z","abstract_excerpt":"An induced matching $M$ in a graph $G$ is dominating if every edge not in $M$ shares exactly one vertex with an edge in $M$. The dominating induced matching problem (also known as efficient edge domination) asks whether a graph $G$ contains a dominating induced matching. This problem is generally NP-complete, but polynomial-time solvable for graphs with some special properties. In particular, it is solvable in polynomial time for claw-free graphs. In the present paper, we study this problem for graphs containing no long claw, i.e. no induced subgraph obtained from the claw by subdividing each "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02558","kind":"arxiv","version":1},"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":"1505.02558","created_at":"2026-05-18T02:16:18.462230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.02558v1","created_at":"2026-05-18T02:16:18.462230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02558","created_at":"2026-05-18T02:16:18.462230+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXZRXCQQEX2C","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXZRXCQQEX2CEZYR","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXZRXCQQ","created_at":"2026-05-18T12:29:47.479230+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/WXZRXCQQEX2CEZYR7722VCCAZA","json":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA.json","graph_json":"https://pith.science/api/pith-number/WXZRXCQQEX2CEZYR7722VCCAZA/graph.json","events_json":"https://pith.science/api/pith-number/WXZRXCQQEX2CEZYR7722VCCAZA/events.json","paper":"https://pith.science/paper/WXZRXCQQ"},"agent_actions":{"view_html":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA","download_json":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA.json","view_paper":"https://pith.science/paper/WXZRXCQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.02558&json=true","fetch_graph":"https://pith.science/api/pith-number/WXZRXCQQEX2CEZYR7722VCCAZA/graph.json","fetch_events":"https://pith.science/api/pith-number/WXZRXCQQEX2CEZYR7722VCCAZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/action/storage_attestation","attest_author":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/action/author_attestation","sign_citation":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/action/citation_signature","submit_replication":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/action/replication_record"}},"created_at":"2026-05-18T02:16:18.462230+00:00","updated_at":"2026-05-18T02:16:18.462230+00:00"}