{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:A3KVEIKTEO7BOFSXRW2TCPG2FO","short_pith_number":"pith:A3KVEIKT","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"},"canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","source":{"kind":"arxiv","id":"0906.1953","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:A3KVEIKTEO7BOFSXRW2TCPG2FO","target":"record","payload":{"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"},"canonical_sha256":"06d552215323be1716578db5313cda2bac4099f3b7424cafa5be121e9a80f0da","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"},"source_kind":"arxiv","source_id":"0906.1953","source_version":3,"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-18T03:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3+orCqC3NrYlDMJpT8LiVSMQN5h/mVsnc0Nf5f2ZiOtr5E0CL4u5CNfPiQWhlqpyyT+DM9/rxarHNBpvcZCAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:26:29.799912Z"},"content_sha256":"fc95a7903a63e3bfc10ba5b6de22ec6a648e110ab6ebbcef49e4a46368b3a706","schema_version":"1.0","event_id":"sha256:fc95a7903a63e3bfc10ba5b6de22ec6a648e110ab6ebbcef49e4a46368b3a706"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:A3KVEIKTEO7BOFSXRW2TCPG2FO","target":"graph","payload":{"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"},"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-18T03:56:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eENzU1s33Z4x1EKPjofOLcsTJCxKT+RFayBHUwxc8eZARI3PxFRUZ3uoN6R83onwkuX8KfgPOuMjIzpH/vOPAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:26:29.800258Z"},"content_sha256":"70b645868f2e27dd4e36cd0450fb30fef21ed3378a82aa43dd45fa3ca5ceb8f0","schema_version":"1.0","event_id":"sha256:70b645868f2e27dd4e36cd0450fb30fef21ed3378a82aa43dd45fa3ca5ceb8f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/bundle.json","state_url":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/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-02T02:26:29Z","links":{"resolver":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO","bundle":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/bundle.json","state":"https://pith.science/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3KVEIKTEO7BOFSXRW2TCPG2FO/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IFmtVusb0lotRYXpGQwroKo5qzgCxlB7k614bDsHy8stU/bg+LuYf0w9/yMfpUyD6jnYf1rS98kbT9y2CAVXAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:26:29.802178Z","bundle_sha256":"b2770a323e8526b4bde85d06fbe31f79437f0bfb8670b6708a9b5dbcaf07c359"}}