{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FP7CVYHKFLIPV23MDLX6LJEYGV","short_pith_number":"pith:FP7CVYHK","schema_version":"1.0","canonical_sha256":"2bfe2ae0ea2ad0faeb6c1aefe5a4983569f55727d08b9384686018a2e74b47dc","source":{"kind":"arxiv","id":"1507.06541","version":2},"attestation_state":"computed","paper":{"title":"Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2015-07-23T15:47:53Z","abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \\subseteq E$ is a dominating induced matching (d.i.m.) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in $G$; this problem is also known as the Efficient Edge Domination problem.\n  The DIM problem is related to parallel resource allocation problems, encoding theory and network routing. It is NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree three and is solvable in linear time f"},"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":"1507.06541","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-07-23T15:47:53Z","cross_cats_sorted":[],"title_canon_sha256":"1d7fd0ad9e72621db42dcabfe4b87f19845844c1419bafdafcca4b2bd24ff560","abstract_canon_sha256":"1765fd359ec11e3611fb2acd541b7e07206482f652c1c3677d2a6e1c5cf8eb22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:58.884514Z","signature_b64":"Xj2h4KRkGpvH9Ke/Zn0Emlb7gmzj/7qEnkw5xZ/BK6xX5jIwiRhzOdcuYUilpBm6ElA3hCQdio1a5WVx7wv/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bfe2ae0ea2ad0faeb6c1aefe5a4983569f55727d08b9384686018a2e74b47dc","last_reissued_at":"2026-05-18T01:14:58.884089Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:58.884089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dominating Induced Matchings for $P_8$-free Graphs in Polynomial Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Andreas Brandstadt, Raffaele Mosca","submitted_at":"2015-07-23T15:47:53Z","abstract_excerpt":"Let $G=(V,E)$ be a finite undirected graph. An edge set $E' \\subseteq E$ is a dominating induced matching (d.i.m.) in $G$ if every edge in $E$ is intersected by exactly one edge of $E'$. The Dominating Induced Matching (DIM) problem asks for the existence of a d.i.m. in $G$; this problem is also known as the Efficient Edge Domination problem.\n  The DIM problem is related to parallel resource allocation problems, encoding theory and network routing. It is NP-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree three and is solvable in linear time f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06541","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":"1507.06541","created_at":"2026-05-18T01:14:58.884163+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06541v2","created_at":"2026-05-18T01:14:58.884163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06541","created_at":"2026-05-18T01:14:58.884163+00:00"},{"alias_kind":"pith_short_12","alias_value":"FP7CVYHKFLIP","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FP7CVYHKFLIPV23M","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FP7CVYHK","created_at":"2026-05-18T12:29:19.899920+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/FP7CVYHKFLIPV23MDLX6LJEYGV","json":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV.json","graph_json":"https://pith.science/api/pith-number/FP7CVYHKFLIPV23MDLX6LJEYGV/graph.json","events_json":"https://pith.science/api/pith-number/FP7CVYHKFLIPV23MDLX6LJEYGV/events.json","paper":"https://pith.science/paper/FP7CVYHK"},"agent_actions":{"view_html":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV","download_json":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV.json","view_paper":"https://pith.science/paper/FP7CVYHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06541&json=true","fetch_graph":"https://pith.science/api/pith-number/FP7CVYHKFLIPV23MDLX6LJEYGV/graph.json","fetch_events":"https://pith.science/api/pith-number/FP7CVYHKFLIPV23MDLX6LJEYGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV/action/storage_attestation","attest_author":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV/action/author_attestation","sign_citation":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV/action/citation_signature","submit_replication":"https://pith.science/pith/FP7CVYHKFLIPV23MDLX6LJEYGV/action/replication_record"}},"created_at":"2026-05-18T01:14:58.884163+00:00","updated_at":"2026-05-18T01:14:58.884163+00:00"}