{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:J6MWUTDB7I5KYJIQ5FRP2COWKF","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":"aab451bfd2b9a4c63ab153c14245ae6fae3ae4161cd93dac16eaf0601b804c96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-07T19:57:23Z","title_canon_sha256":"d06fc1a86c6d133122aa48bd59dbf0c778dea719b2b2e29a4e77a4bdd15c0c59"},"schema_version":"1.0","source":{"id":"1009.1381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.1381","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"1009.1381v1","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.1381","created_at":"2026-05-18T04:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"J6MWUTDB7I5K","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"J6MWUTDB7I5KYJIQ","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"J6MWUTDB","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:6c4a9f8a14137b68ef06d0c3777720d20c4cd6d441a7cbe4a08aa0c6021b4e2d","target":"graph","created_at":"2026-05-18T04:41:15Z","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":"An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \\ D has at least one neighbor in D and D is an independent set, i.e. no two vertices of D are adjacent in G. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it is hard to cope with this problem using parameterized and approximation algorithms, there is a simple exact O(1.4423^n)-time algorithm solving the problem by enumerating all maximal independent sets. In this paper we improve the latter result, providing the first non trivial algorithm computing ","authors_text":"Mathieu Liedloff, Serge Gaspers","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-07T19:57:23Z","title":"A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.1381","kind":"arxiv","version":1},"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:a92079cb4fdbed05c8607331e2d28186269501513f7af9983c254c9809b5551a","target":"record","created_at":"2026-05-18T04:41:15Z","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":"aab451bfd2b9a4c63ab153c14245ae6fae3ae4161cd93dac16eaf0601b804c96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-07T19:57:23Z","title_canon_sha256":"d06fc1a86c6d133122aa48bd59dbf0c778dea719b2b2e29a4e77a4bdd15c0c59"},"schema_version":"1.0","source":{"id":"1009.1381","kind":"arxiv","version":1}},"canonical_sha256":"4f996a4c61fa3aac2510e962fd09d651678edd2317f38e7cba86a6d5442f83d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f996a4c61fa3aac2510e962fd09d651678edd2317f38e7cba86a6d5442f83d4","first_computed_at":"2026-05-18T04:41:15.611862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:15.611862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eClnPet88N5NSN5L2l10saX3hS7gy/bo1MwZW48Nn4NoHy4JMbJQW1u5DaYctW/R3/eBxH2gXkX09WouadPZDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:15.612606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.1381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a92079cb4fdbed05c8607331e2d28186269501513f7af9983c254c9809b5551a","sha256:6c4a9f8a14137b68ef06d0c3777720d20c4cd6d441a7cbe4a08aa0c6021b4e2d"],"state_sha256":"7344a7e99ebacd97cdfa4cfb1e3db3d34f0862005fda96d32c873afbdf965ecc"}