{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JVYQWF4RUFCDF2QBST2PLZ473K","short_pith_number":"pith:JVYQWF4R","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"},"canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","source":{"kind":"arxiv","id":"1509.03753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03753","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03753v2","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03753","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"JVYQWF4RUFCD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JVYQWF4RUFCDF2QB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JVYQWF4R","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JVYQWF4RUFCDF2QBST2PLZ473K","target":"record","payload":{"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"},"canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","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"},"source_kind":"arxiv","source_id":"1509.03753","source_version":2,"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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZTmqO8t7se/1TurT3VW1vkPOKHUrnE6FUQgQm5Pdq2dTcRYuE7yTp8Mk2QSizogsSH20Jt6wKWFpKPfS3yncAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:40:51.224852Z"},"content_sha256":"bad1c646d6af9af9ffe87e76ef79fde3f02e4a10429503c5269dbae6ecbecffb","schema_version":"1.0","event_id":"sha256:bad1c646d6af9af9ffe87e76ef79fde3f02e4a10429503c5269dbae6ecbecffb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JVYQWF4RUFCDF2QBST2PLZ473K","target":"graph","payload":{"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"},"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-18T01:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2gQVb5+S4DS1MVy6cU0uiKQ2uzVIazK3274HbRGLfwlYD4MCSerz4wFUOGCFOoTYNgB6HuAYfBaG++/qj1UdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:40:51.225604Z"},"content_sha256":"f39a64987d77fd4594d47a844aea4dadaef916efad92dae1268fda7972b7a9d8","schema_version":"1.0","event_id":"sha256:f39a64987d77fd4594d47a844aea4dadaef916efad92dae1268fda7972b7a9d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/bundle.json","state_url":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVYQWF4RUFCDF2QBST2PLZ473K/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-25T10:40:51Z","links":{"resolver":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K","bundle":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/bundle.json","state":"https://pith.science/pith/JVYQWF4RUFCDF2QBST2PLZ473K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVYQWF4RUFCDF2QBST2PLZ473K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JVYQWF4RUFCDF2QBST2PLZ473K","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":"c1ad9bd52f1383ee630a105be0c29565fa25cdd32a534896d927c9a333f85d10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-12T15:00:20Z","title_canon_sha256":"881ee176a809303441e41de6f8f3065883ea8fa771526fa8c8e87b4f5e2207ac"},"schema_version":"1.0","source":{"id":"1509.03753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03753","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03753v2","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03753","created_at":"2026-05-18T01:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"JVYQWF4RUFCD","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JVYQWF4RUFCDF2QB","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JVYQWF4R","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:f39a64987d77fd4594d47a844aea4dadaef916efad92dae1268fda7972b7a9d8","target":"graph","created_at":"2026-05-18T01:32:58Z","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":"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","authors_text":"Dieter Kratsch, Mamadou Moustapha Kant\\'e, Petr A. Golovach, Pinar Heggernes, Sigve H. S{\\ae}ther, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-12T15:00:20Z","title":"Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear MIM-Width"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03753","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:bad1c646d6af9af9ffe87e76ef79fde3f02e4a10429503c5269dbae6ecbecffb","target":"record","created_at":"2026-05-18T01:32:58Z","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":"c1ad9bd52f1383ee630a105be0c29565fa25cdd32a534896d927c9a333f85d10","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-12T15:00:20Z","title_canon_sha256":"881ee176a809303441e41de6f8f3065883ea8fa771526fa8c8e87b4f5e2207ac"},"schema_version":"1.0","source":{"id":"1509.03753","kind":"arxiv","version":2}},"canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d710b1791a14432ea0194f4f5e79fda92feebc8aa10523ca68258ec6157e06e","first_computed_at":"2026-05-18T01:32:58.994198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:58.994198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bgDvFyDT5GyNAmCKo+b7dqyz8PQnFQUst5Y06crf5TaSX0gm2xhrGJOShYLPKcR705UMaNgsFnN9NcmCPLAYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:58.994821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bad1c646d6af9af9ffe87e76ef79fde3f02e4a10429503c5269dbae6ecbecffb","sha256:f39a64987d77fd4594d47a844aea4dadaef916efad92dae1268fda7972b7a9d8"],"state_sha256":"a60d9bbdabc3dc6b3e879847ec83867468c7c21ff82a71ef59c991a98dd0e6de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bF5UB0FkXFrulz9uzRn+E1IK2Rojsjf3gVDRUdmT2waa8Usm+eMv82qFfNbALaTPpKicbmgRU60O/rN/6JaCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:40:51.229041Z","bundle_sha256":"97a290d021361cd99fbe47773cde27c5682bd7e534ea6d604ac59d534fddc7ad"}}