{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7GKX5WJUNJFA4JSZGJSBZQ4SYM","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":"e1d1b3b2937c6250be307a5a319a13846a25cbf2e6430dc18ac1c33400e7b1c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-04-17T14:19:12Z","title_canon_sha256":"f30cb1c83c86c4b92cdc5b95f3a1a30af501cfd801c08270969898cfa85a96c0"},"schema_version":"1.0","source":{"id":"0904.2712","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.2712","created_at":"2026-07-04T15:41:23Z"},{"alias_kind":"arxiv_version","alias_value":"0904.2712v1","created_at":"2026-07-04T15:41:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.2712","created_at":"2026-07-04T15:41:23Z"},{"alias_kind":"pith_short_12","alias_value":"7GKX5WJUNJFA","created_at":"2026-07-04T15:41:23Z"},{"alias_kind":"pith_short_16","alias_value":"7GKX5WJUNJFA4JSZ","created_at":"2026-07-04T15:41:23Z"},{"alias_kind":"pith_short_8","alias_value":"7GKX5WJU","created_at":"2026-07-04T15:41:23Z"}],"graph_snapshots":[{"event_id":"sha256:f1b550fb5ff5e1bed9b6d13eb7e18ea0e3a5481c93266cb21dfae4ab49e16b75","target":"graph","created_at":"2026-07-04T15:41:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0904.2712/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an $O^*(1.0919^n)$-time algorithm for finding a maximum independent set in an $n$-vertex graph with degree bounded by 3, which improves the previously known algorithm of running time $O^*(1.0977^n)$ by Bourgeois, Escoffier and Paschos [IWPEC 2008]. We also present an $O^*(1.1923^k)$-time algorithm to decide if a graph with degree bounded by 3 has a vertex cover of size $k$, which improves the previously known algorithm of running time $O^*(1.1939^k)$ by Chen, Kanj and Xia [ISAAC 2003].\n  Two new branching techniques, \\emph{branching on a bottle} and \\emph{branching on a 4-cycle}, ar","authors_text":"Mingyu Xiao","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-04-17T14:19:12Z","title":"New Branching Rules: Improvements on Independent Set and Vertex Cover in Sparse Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.2712","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:4794c49b1f21ac29a5555ec01efcf1eb9454bf14d990c224e3452054bfe8d3ce","target":"record","created_at":"2026-07-04T15:41:23Z","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":"e1d1b3b2937c6250be307a5a319a13846a25cbf2e6430dc18ac1c33400e7b1c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-04-17T14:19:12Z","title_canon_sha256":"f30cb1c83c86c4b92cdc5b95f3a1a30af501cfd801c08270969898cfa85a96c0"},"schema_version":"1.0","source":{"id":"0904.2712","kind":"arxiv","version":1}},"canonical_sha256":"f9957ed9346a4a0e265932641cc392c33c1ed3fedd1091a55b0d15ec53df5f81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9957ed9346a4a0e265932641cc392c33c1ed3fedd1091a55b0d15ec53df5f81","first_computed_at":"2026-07-04T15:41:23.960918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:41:23.960918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OpGdcaLgP3Go2TYcCqOaiTNAy1iUQI9lYkSrU239zDWoFDCaY0aGRJrlq3fKGAhJc0dHDuh/TzyaaLzRpd1fDg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:41:23.961362Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.2712","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4794c49b1f21ac29a5555ec01efcf1eb9454bf14d990c224e3452054bfe8d3ce","sha256:f1b550fb5ff5e1bed9b6d13eb7e18ea0e3a5481c93266cb21dfae4ab49e16b75"],"state_sha256":"fd815227d2b97548cc20268486ebb82234f199c508fd1e7bafb73134f93660e0"}