{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WLZXQL5BXOHBB3JETJDXN3T65I","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":"3841a8896c92795dbdf1104376f837eeaaf0aba113f0e94be1741e16694eaa93","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-14T13:17:00Z","title_canon_sha256":"abc9e9b4acf723bebe3b16c75a918213633f97afc98c0e8145aa8f39effe6d36"},"schema_version":"1.0","source":{"id":"1905.05582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05582","created_at":"2026-07-05T00:49:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05582v2","created_at":"2026-07-05T00:49:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05582","created_at":"2026-07-05T00:49:07Z"},{"alias_kind":"pith_short_12","alias_value":"WLZXQL5BXOHB","created_at":"2026-07-05T00:49:07Z"},{"alias_kind":"pith_short_16","alias_value":"WLZXQL5BXOHBB3JE","created_at":"2026-07-05T00:49:07Z"},{"alias_kind":"pith_short_8","alias_value":"WLZXQL5B","created_at":"2026-07-05T00:49:07Z"}],"graph_snapshots":[{"event_id":"sha256:24f00e12813425cffe8d244c07f0f6ea9d418af52057478b88f0c80e09b193eb","target":"graph","created_at":"2026-07-05T00:49:07Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.05582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \\subseteq E$ is a {\\em dominating induced matching} ({\\em d.i.m.}) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The \\emph{Dominating Induced Matching} (\\emph{DIM}) problem asks for the existence of a d.i.m.\\ in $G$; this problem is also known as the \\emph{Efficient Edge Domination} problem; it is the Efficient Domination problem for line graphs.\n  The DIM problem is \\NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 but is solvable in linear time for $P_","authors_text":"Andreas Brandst\\\"adt, Raffaele Mosca","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-14T13:17:00Z","title":"Finding Dominating Induced Matchings in $S_{1,1,5}$-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05582","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:7a61ca6f45fd5eff2191517fb6afec9970fa58c7577610e47cd8a847ab2785ae","target":"record","created_at":"2026-07-05T00:49:07Z","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":"3841a8896c92795dbdf1104376f837eeaaf0aba113f0e94be1741e16694eaa93","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-05-14T13:17:00Z","title_canon_sha256":"abc9e9b4acf723bebe3b16c75a918213633f97afc98c0e8145aa8f39effe6d36"},"schema_version":"1.0","source":{"id":"1905.05582","kind":"arxiv","version":2}},"canonical_sha256":"b2f3782fa1bb8e10ed249a4776ee7eea21181181fe8b129a7440a3bad61b91e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2f3782fa1bb8e10ed249a4776ee7eea21181181fe8b129a7440a3bad61b91e8","first_computed_at":"2026-07-05T00:49:07.577147Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:49:07.577147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OQNyQrnqXRNtpczE/Rm7vKnuNA6DZFaHuD5/YL14p8PpqHP1N2+YtSI07y6Jd6b7euBgnGHX2+atPYxR38Y+Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:49:07.577546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a61ca6f45fd5eff2191517fb6afec9970fa58c7577610e47cd8a847ab2785ae","sha256:24f00e12813425cffe8d244c07f0f6ea9d418af52057478b88f0c80e09b193eb"],"state_sha256":"a5ce937942e38a65ac5e3b5943825bc5c8bb16628972c3cfa70db4f8b9cb3f95"}