{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:OBWW5VNPXIIBLWBADSKB3CH6N3","short_pith_number":"pith:OBWW5VNP","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"},"canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","source":{"kind":"arxiv","id":"0905.1993","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.1993","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"0905.1993v1","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.1993","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"OBWW5VNPXIIB","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OBWW5VNPXIIBLWBA","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OBWW5VNP","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:OBWW5VNPXIIBLWBADSKB3CH6N3","target":"record","payload":{"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"},"canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","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"},"source_kind":"arxiv","source_id":"0905.1993","source_version":1,"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-18T02:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5iLzbyIMIdC4DMhb2gDYrBxItVHluzvs6sdym5hs95jEHv9NKQD7GbZOC2JzvV+KOyOrXuSeroRZrKfXZ1SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:12:54.736566Z"},"content_sha256":"ea54d758cc7e449ea91664d1b6618ac612daac377fe1e76d847b9f37d2e7f597","schema_version":"1.0","event_id":"sha256:ea54d758cc7e449ea91664d1b6618ac612daac377fe1e76d847b9f37d2e7f597"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:OBWW5VNPXIIBLWBADSKB3CH6N3","target":"graph","payload":{"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"},"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-18T02:13:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6FVHwIrrHP9WnsFrxxHHftfdVDRE3XhzYLcUe0F5dDjeux6yDN7918u8MSDIJBs21upL3sJr0m6vq026y5HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T17:12:54.737253Z"},"content_sha256":"1f688b2a897739a0cac79338209c4be356954fbf67765b1aa05036bee21a9723","schema_version":"1.0","event_id":"sha256:1f688b2a897739a0cac79338209c4be356954fbf67765b1aa05036bee21a9723"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/bundle.json","state_url":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/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-06-06T17:12:54Z","links":{"resolver":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3","bundle":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/bundle.json","state":"https://pith.science/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OBWW5VNPXIIBLWBADSKB3CH6N3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:OBWW5VNPXIIBLWBADSKB3CH6N3","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":"c39dffe8463e769e12ade3a73aa159411bb73e3766b6e662cea37add2e418f82","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-05-13T12:50:52Z","title_canon_sha256":"40d0ce46c12033ef36150689a5829c6f432a19ddc1cd71003fd84bfa88a1eb62"},"schema_version":"1.0","source":{"id":"0905.1993","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.1993","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"arxiv_version","alias_value":"0905.1993v1","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.1993","created_at":"2026-05-18T02:13:39Z"},{"alias_kind":"pith_short_12","alias_value":"OBWW5VNPXIIB","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"OBWW5VNPXIIBLWBA","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"OBWW5VNP","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:1f688b2a897739a0cac79338209c4be356954fbf67765b1aa05036bee21a9723","target":"graph","created_at":"2026-05-18T02:13:39Z","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":"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)).","authors_text":"Bruno Escoffier, Nicolas Bourgeois, Vangelis Th. Paschos","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-05-13T12:50:52Z","title":"Fast algorithms for min independent dominating set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.1993","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:ea54d758cc7e449ea91664d1b6618ac612daac377fe1e76d847b9f37d2e7f597","target":"record","created_at":"2026-05-18T02:13:39Z","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":"c39dffe8463e769e12ade3a73aa159411bb73e3766b6e662cea37add2e418f82","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-05-13T12:50:52Z","title_canon_sha256":"40d0ce46c12033ef36150689a5829c6f432a19ddc1cd71003fd84bfa88a1eb62"},"schema_version":"1.0","source":{"id":"0905.1993","kind":"arxiv","version":1}},"canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"706d6ed5afba1015d8201c941d88fe6efd2c28d3dc33302398fef6fdd0fd5153","first_computed_at":"2026-05-18T02:13:39.764201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:39.764201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkCDK0guVPMshwnVWjzfAWDBdEmCVXN+cmMwMfJm40Nlo0LGy5FwsTOR2oVcO2eC/VB1eurQOE9Z0I5bmGxfAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:39.764710Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.1993","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea54d758cc7e449ea91664d1b6618ac612daac377fe1e76d847b9f37d2e7f597","sha256:1f688b2a897739a0cac79338209c4be356954fbf67765b1aa05036bee21a9723"],"state_sha256":"72a9cdefd0f2c89769aa551d3c2abf888f86883e0c9364a142e152e585db5c10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WfQYKdtPzhUir32N2jAOr5DWTNAlxJz3RwxDcYRCesKojT/hGF2wnS5tQxG74XWR/k60EIITfcunMSm3sHyiBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T17:12:54.740776Z","bundle_sha256":"69e207139c0ad69e783913797d08f1e1fbbbc7250f529f1aedff120069211d4f"}}