{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:A3KVEIKTEO7BOFSXRW2TCPG2FO","short_pith_number":"pith:A3KVEIKT","schema_version":"1.0","canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","source":{"kind":"arxiv","id":"0906.1953","version":3},"attestation_state":"computed","paper":{"title":"An Exponential Time 2-Approximation Algorithm for Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Martin F\\\"urer, Serge Gaspers, Shiva Prasad Kasiviswanathan","submitted_at":"2009-06-10T15:22:57Z","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"},"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":"0906.1953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-06-10T15:22:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"f3bd2367bda3fc426ee764a4926de7ca2c331797c381563c4e3246ba4694921b","abstract_canon_sha256":"d1bbebcf0a708fe1628282dd9b580836c93a3117a47746bf0ab09177cea53870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:45.400738Z","signature_b64":"6/ZeZA8QpsaE77hLHHR18D1kejqk+ZtOGF8IblU9+UpWpBb1cC1C1Ostk0KCYIMfGLuMpWuFYCGC/mpWw2hPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","last_reissued_at":"2026-05-18T03:56:45.400099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:45.400099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Exponential Time 2-Approximation Algorithm for Bandwidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Martin F\\\"urer, Serge Gaspers, Shiva Prasad Kasiviswanathan","submitted_at":"2009-06-10T15:22:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1953","kind":"arxiv","version":3},"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":"0906.1953","created_at":"2026-05-18T03:56:45.400196+00:00"},{"alias_kind":"arxiv_version","alias_value":"0906.1953v3","created_at":"2026-05-18T03:56:45.400196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1953","created_at":"2026-05-18T03:56:45.400196+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3KVEIKTEO7B","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3KVEIKTEO7BOFSX","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3KVEIKT","created_at":"2026-05-18T12:25:58.837520+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/A3KVEIKTEO7BOFSXRW2TCPG2FO","json":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO.json","graph_json":"https://pith.science/api/pith-number/A3KVEIKTEO7BOFSXRW2TCPG2FO/graph.json","events_json":"https://pith.science/api/pith-number/A3KVEIKTEO7BOFSXRW2TCPG2FO/events.json","paper":"https://pith.science/paper/A3KVEIKT"},"agent_actions":{"view_html":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO","download_json":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO.json","view_paper":"https://pith.science/paper/A3KVEIKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0906.1953&json=true","fetch_graph":"https://pith.science/api/pith-number/A3KVEIKTEO7BOFSXRW2TCPG2FO/graph.json","fetch_events":"https://pith.science/api/pith-number/A3KVEIKTEO7BOFSXRW2TCPG2FO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/action/storage_attestation","attest_author":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/action/author_attestation","sign_citation":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/action/citation_signature","submit_replication":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/action/replication_record"}},"created_at":"2026-05-18T03:56:45.400196+00:00","updated_at":"2026-05-18T03:56:45.400196+00:00"}