{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JVYQWF4RUFCDF2QBST2PLZ473K","short_pith_number":"pith:JVYQWF4R","schema_version":"1.0","canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","source":{"kind":"arxiv","id":"1509.03753","version":2},"attestation_state":"computed","paper":{"title":"Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Mamadou Moustapha Kant\\'e, Petr A. Golovach, Pinar Heggernes, Sigve H. S{\\ae}ther, Yngve Villanger","submitted_at":"2015-09-12T15:00:20Z","abstract_excerpt":"The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width. In particular, we show that all 1-minimal and all 1-maximal (\\sigma,\\rho)-dominating sets, and hence all minimal dominating sets, of graphs of bounded LMIM-width can be enumerated with polynomial (linear) delay using polynomial space. Furthermore, we show that all minimal dominating sets of a un"},"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":"1509.03753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-12T15:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"881ee176a809303441e41de6f8f3065883ea8fa771526fa8c8e87b4f5e2207ac","abstract_canon_sha256":"c1ad9bd52f1383ee630a105be0c29565fa25cdd32a534896d927c9a333f85d10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:58.994821Z","signature_b64":"bgDvFyDT5GyNAmCKo+b7dqyz8PQnFQUst5Y06crf5TaSX0gm2xhrGJOShYLPKcR705UMaNgsFnN9NcmCPLAYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","last_reissued_at":"2026-05-18T01:32:58.994198Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:58.994198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Mamadou Moustapha Kant\\'e, Petr A. Golovach, Pinar Heggernes, Sigve H. S{\\ae}ther, Yngve Villanger","submitted_at":"2015-09-12T15:00:20Z","abstract_excerpt":"The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on graphs of bounded LMIM-width and graphs of bounded local LMIM-width. In particular, we show that all 1-minimal and all 1-maximal (\\sigma,\\rho)-dominating sets, and hence all minimal dominating sets, of graphs of bounded LMIM-width can be enumerated with polynomial (linear) delay using polynomial space. Furthermore, we show that all minimal dominating sets of a un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03753","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":"1509.03753","created_at":"2026-05-18T01:32:58.994291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03753v2","created_at":"2026-05-18T01:32:58.994291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03753","created_at":"2026-05-18T01:32:58.994291+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVYQWF4RUFCD","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVYQWF4RUFCDF2QB","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVYQWF4R","created_at":"2026-05-18T12:29:27.538025+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/JVYQWF4RUFCDF2QBST2PLZ473K","json":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K.json","graph_json":"https://pith.science/api/pith-number/JVYQWF4RUFCDF2QBST2PLZ473K/graph.json","events_json":"https://pith.science/api/pith-number/JVYQWF4RUFCDF2QBST2PLZ473K/events.json","paper":"https://pith.science/paper/JVYQWF4R"},"agent_actions":{"view_html":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K","download_json":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K.json","view_paper":"https://pith.science/paper/JVYQWF4R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03753&json=true","fetch_graph":"https://pith.science/api/pith-number/JVYQWF4RUFCDF2QBST2PLZ473K/graph.json","fetch_events":"https://pith.science/api/pith-number/JVYQWF4RUFCDF2QBST2PLZ473K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/action/storage_attestation","attest_author":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/action/author_attestation","sign_citation":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/action/citation_signature","submit_replication":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/action/replication_record"}},"created_at":"2026-05-18T01:32:58.994291+00:00","updated_at":"2026-05-18T01:32:58.994291+00:00"}