{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WXZRXCQQEX2CEZYR7722VCCAZA","short_pith_number":"pith:WXZRXCQQ","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"},"canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","source":{"kind":"arxiv","id":"1505.02558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02558","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02558v1","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02558","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"WXZRXCQQEX2C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXZRXCQQEX2CEZYR","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXZRXCQQ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WXZRXCQQEX2CEZYR7722VCCAZA","target":"record","payload":{"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"},"canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","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"},"source_kind":"arxiv","source_id":"1505.02558","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYlZrgGUFOgrJ4l6AEeUopEKzk7cNTxZ4U2hScBZihwZdlxAPO04Oz/g+NX+r+FVVhjaQWtMzCV+OHwPwBp4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:33:40.975632Z"},"content_sha256":"1696ab3553fc9ec85a2ad5ef1382e58725f3c8d87f498d12e1ab0e405c38d60f","schema_version":"1.0","event_id":"sha256:1696ab3553fc9ec85a2ad5ef1382e58725f3c8d87f498d12e1ab0e405c38d60f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WXZRXCQQEX2CEZYR7722VCCAZA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwx6LSZ69eeS4BnwcZQrkx6e0fPxmmByalaePwI0HHEk6vMuHVORiYQX7pXstmrHggQyEjdMA1qk3dYloHGfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:33:40.975977Z"},"content_sha256":"cb3cd0bb5b52bfb8fcef89d0b454760ab992480bfcf8321414b6e3609b25a1b3","schema_version":"1.0","event_id":"sha256:cb3cd0bb5b52bfb8fcef89d0b454760ab992480bfcf8321414b6e3609b25a1b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/bundle.json","state_url":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WXZRXCQQEX2CEZYR7722VCCAZA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T02:33:40Z","links":{"resolver":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA","bundle":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/bundle.json","state":"https://pith.science/pith/WXZRXCQQEX2CEZYR7722VCCAZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WXZRXCQQEX2CEZYR7722VCCAZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WXZRXCQQEX2CEZYR7722VCCAZA","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":"fde5935e55f73ee44f28ef0c0cb58bbfc69600a4d54d30efbbcff3b6bb6716c0","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-11T10:39:24Z","title_canon_sha256":"b421d4c98b07abe00451369af820dfece0bc037bec827ffb022c02a274289087"},"schema_version":"1.0","source":{"id":"1505.02558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02558","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02558v1","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02558","created_at":"2026-05-18T02:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"WXZRXCQQEX2C","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WXZRXCQQEX2CEZYR","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WXZRXCQQ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:cb3cd0bb5b52bfb8fcef89d0b454760ab992480bfcf8321414b6e3609b25a1b3","target":"graph","created_at":"2026-05-18T02:16:18Z","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":"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 ","authors_text":"Alain Hertz, Bernard Ries, Dominique de Werra, Vadim Lozin, Victor Zamaraev","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-11T10:39:24Z","title":"Dominating induced matchings in graphs containing no long claw"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02558","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:1696ab3553fc9ec85a2ad5ef1382e58725f3c8d87f498d12e1ab0e405c38d60f","target":"record","created_at":"2026-05-18T02:16:18Z","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":"fde5935e55f73ee44f28ef0c0cb58bbfc69600a4d54d30efbbcff3b6bb6716c0","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-05-11T10:39:24Z","title_canon_sha256":"b421d4c98b07abe00451369af820dfece0bc037bec827ffb022c02a274289087"},"schema_version":"1.0","source":{"id":"1505.02558","kind":"arxiv","version":1}},"canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5f31b8a1025f4226711fff5aa8840c81b4c8db685799f5e4b5e1a555804fda5","first_computed_at":"2026-05-18T02:16:18.462093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:18.462093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uzKWJOo2K8WIDopy7N/NVDy4XQ5BasidbDwMkQUl4RNqDDxmSGCHPRyFrvfqAtDadnNHTPOEZ3U6Dzb/BkeACA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:18.462842Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1696ab3553fc9ec85a2ad5ef1382e58725f3c8d87f498d12e1ab0e405c38d60f","sha256:cb3cd0bb5b52bfb8fcef89d0b454760ab992480bfcf8321414b6e3609b25a1b3"],"state_sha256":"b90883fbd4ce36808572e8e5c7d85c57933eff2ab61db014c8057379135b6753"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r4lu2f95cobJQ1eHo0Agfpb+4ZiTzteii86JGP3gEUlzheIHCPFpVL3BdOweqb+LfXZs1ZXAXKUlP0QimG6SCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:33:40.978018Z","bundle_sha256":"e0d8c490fe710dff63e5b1d55ac847d7d32836dd0bc6a8546ec586db27fe149c"}}