{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:OBWW5VNPXIIBLWBADSKB3CH6N3","short_pith_number":"pith:OBWW5VNP","schema_version":"1.0","canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","source":{"kind":"arxiv","id":"0905.1993","version":1},"attestation_state":"computed","paper":{"title":"Fast algorithms for min independent dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Nicolas Bourgeois, Vangelis Th. Paschos","submitted_at":"2009-05-13T12:50:52Z","abstract_excerpt":"We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs, Proc. WG'06). We then show that, for every r>3, it is possible to compute an r-((r-1)/r)log_2(r)-approximate solution for min independent dominating set within time O*(2^(nlog_2(r)/r))."},"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":"0905.1993","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-05-13T12:50:52Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"40d0ce46c12033ef36150689a5829c6f432a19ddc1cd71003fd84bfa88a1eb62","abstract_canon_sha256":"c39dffe8463e769e12ade3a73aa159411bb73e3766b6e662cea37add2e418f82"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:39.764710Z","signature_b64":"ZkCDK0guVPMshwnVWjzfAWDBdEmCVXN+cmMwMfJm40Nlo0LGy5FwsTOR2oVcO2eC/VB1eurQOE9Z0I5bmGxfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","last_reissued_at":"2026-05-18T02:13:39.764201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:39.764201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast algorithms for min independent dominating set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Bruno Escoffier, Nicolas Bourgeois, Vangelis Th. Paschos","submitted_at":"2009-05-13T12:50:52Z","abstract_excerpt":"We first devise a branching algorithm that computes a minimum independent dominating set on any graph with running time O*(2^0.424n) and polynomial space. This improves the O*(2^0.441n) result by (S. Gaspers and M. Liedloff, A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs, Proc. WG'06). We then show that, for every r>3, it is possible to compute an r-((r-1)/r)log_2(r)-approximate solution for min independent dominating set within time O*(2^(nlog_2(r)/r))."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.1993","kind":"arxiv","version":1},"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":"0905.1993","created_at":"2026-05-18T02:13:39.764272+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.1993v1","created_at":"2026-05-18T02:13:39.764272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.1993","created_at":"2026-05-18T02:13:39.764272+00:00"},{"alias_kind":"pith_short_12","alias_value":"OBWW5VNPXIIB","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"OBWW5VNPXIIBLWBA","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"OBWW5VNP","created_at":"2026-05-18T12:26:01.383474+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/OBWW5VNPXIIBLWBADSKB3CH6N3","json":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3.json","graph_json":"https://pith.science/api/pith-number/OBWW5VNPXIIBLWBADSKB3CH6N3/graph.json","events_json":"https://pith.science/api/pith-number/OBWW5VNPXIIBLWBADSKB3CH6N3/events.json","paper":"https://pith.science/paper/OBWW5VNP"},"agent_actions":{"view_html":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3","download_json":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3.json","view_paper":"https://pith.science/paper/OBWW5VNP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.1993&json=true","fetch_graph":"https://pith.science/api/pith-number/OBWW5VNPXIIBLWBADSKB3CH6N3/graph.json","fetch_events":"https://pith.science/api/pith-number/OBWW5VNPXIIBLWBADSKB3CH6N3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/action/storage_attestation","attest_author":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/action/author_attestation","sign_citation":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/action/citation_signature","submit_replication":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/action/replication_record"}},"created_at":"2026-05-18T02:13:39.764272+00:00","updated_at":"2026-05-18T02:13:39.764272+00:00"}