{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:A3KVEIKTEO7BOFSXRW2TCPG2FO","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":"d1bbebcf0a708fe1628282dd9b580836c93a3117a47746bf0ab09177cea53870","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-10T15:22:57Z","title_canon_sha256":"f3bd2367bda3fc426ee764a4926de7ca2c331797c381563c4e3246ba4694921b"},"schema_version":"1.0","source":{"id":"0906.1953","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.1953","created_at":"2026-05-18T03:56:45Z"},{"alias_kind":"arxiv_version","alias_value":"0906.1953v3","created_at":"2026-05-18T03:56:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1953","created_at":"2026-05-18T03:56:45Z"},{"alias_kind":"pith_short_12","alias_value":"A3KVEIKTEO7B","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"A3KVEIKTEO7BOFSX","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"A3KVEIKT","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:70b645868f2e27dd4e36cd0450fb30fef21ed3378a82aa43dd45fa3ca5ceb8f0","target":"graph","created_at":"2026-05-18T03:56:45Z","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 bandwidth of a graph G on n vertices is the minimum b such that the vertices of G can be labeled from 1 to n such that the labels of every pair of adjacent vertices differ by at most b.\n  In this paper, we present a 2-approximation algorithm for the bandwidth problem that takes worst-case O(1.9797^n) time and uses polynomial space. This improves both the previous best 2- and 3-approximation algorithms of Cygan et al. which have an O(3^n) and O(2^n) worst-case time bounds, respectively. Our algorithm is based on constructing bucket decompositions of the input graph. A bucket decomposition p","authors_text":"Martin F\\\"urer, Serge Gaspers, Shiva Prasad Kasiviswanathan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-10T15:22:57Z","title":"An Exponential Time 2-Approximation Algorithm for Bandwidth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1953","kind":"arxiv","version":3},"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:fc95a7903a63e3bfc10ba5b6de22ec6a648e110ab6ebbcef49e4a46368b3a706","target":"record","created_at":"2026-05-18T03:56:45Z","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":"d1bbebcf0a708fe1628282dd9b580836c93a3117a47746bf0ab09177cea53870","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-10T15:22:57Z","title_canon_sha256":"f3bd2367bda3fc426ee764a4926de7ca2c331797c381563c4e3246ba4694921b"},"schema_version":"1.0","source":{"id":"0906.1953","kind":"arxiv","version":3}},"canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","first_computed_at":"2026-05-18T03:56:45.400099Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:45.400099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6/ZeZA8QpsaE77hLHHR18D1kejqk+ZtOGF8IblU9+UpWpBb1cC1C1Ostk0KCYIMfGLuMpWuFYCGC/mpWw2hPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:45.400738Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.1953","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc95a7903a63e3bfc10ba5b6de22ec6a648e110ab6ebbcef49e4a46368b3a706","sha256:70b645868f2e27dd4e36cd0450fb30fef21ed3378a82aa43dd45fa3ca5ceb8f0"],"state_sha256":"47ddf07bbb0beadc750324ee71095f1a62b0646f01dfedddb7139f01b63323c8"}