{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SRYGTQ5TPOSV5OMGN6PRQQYUMJ","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":"55003f7483c1191e5f8bf1aa674d1465fbbdd4b68fb1a2262d95bcf124da411b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-02T12:35:55Z","title_canon_sha256":"ea95205115ccc8472f659cd00c74b14c13a7a424f523a4db357816f5b4123669"},"schema_version":"1.0","source":{"id":"1908.00978","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00978","created_at":"2026-07-05T00:52:06Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00978v3","created_at":"2026-07-05T00:52:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00978","created_at":"2026-07-05T00:52:06Z"},{"alias_kind":"pith_short_12","alias_value":"SRYGTQ5TPOSV","created_at":"2026-07-05T00:52:06Z"},{"alias_kind":"pith_short_16","alias_value":"SRYGTQ5TPOSV5OMG","created_at":"2026-07-05T00:52:06Z"},{"alias_kind":"pith_short_8","alias_value":"SRYGTQ5T","created_at":"2026-07-05T00:52:06Z"}],"graph_snapshots":[{"event_id":"sha256:c8b424d6c8e049960b1e49cfb209fe01baf46d219c81d4685f3dd3186d825242","target":"graph","created_at":"2026-07-05T00:52:06Z","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/1908.00978/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 subset $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$. The DIM problem is \\NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree 3 but was solved in linear time for $P_7$-free graphs and in polynomial time for $P_8$-free graphs. In this paper, we solve it in polynomial time for $P_9$-free graphs.","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-08-02T12:35:55Z","title":"Finding Dominating Induced Matchings in $P_9$-Free Graphs in Polynomial Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00978","kind":"arxiv","version":3},"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:8fc7c6082f8ffab2ebb3e7676331bb932df859acb97b7b7c701eb5ec1a3a8e13","target":"record","created_at":"2026-07-05T00:52:06Z","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":"55003f7483c1191e5f8bf1aa674d1465fbbdd4b68fb1a2262d95bcf124da411b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-08-02T12:35:55Z","title_canon_sha256":"ea95205115ccc8472f659cd00c74b14c13a7a424f523a4db357816f5b4123669"},"schema_version":"1.0","source":{"id":"1908.00978","kind":"arxiv","version":3}},"canonical_sha256":"947069c3b37ba55eb9866f9f184314626028d122e643ca6b62347099c7d3c678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"947069c3b37ba55eb9866f9f184314626028d122e643ca6b62347099c7d3c678","first_computed_at":"2026-07-05T00:52:06.204103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:52:06.204103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tXaIZfPJam+H39CatwjzpswdHXtEOkNMfIblpw5yvNVaMlFmGopa2iGDL/jySxLDRQQlXwbm7moJonhU4DOiAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:52:06.204532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00978","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fc7c6082f8ffab2ebb3e7676331bb932df859acb97b7b7c701eb5ec1a3a8e13","sha256:c8b424d6c8e049960b1e49cfb209fe01baf46d219c81d4685f3dd3186d825242"],"state_sha256":"8ff3348db5ac1a71aa7a2c33819c22caee7f91e46e2ac10b5e6fdc0966938cdd"}