{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:HW5KL4D2NTDBKYUZHY4IND3FIU","short_pith_number":"pith:HW5KL4D2","canonical_record":{"source":{"id":"1404.7810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T17:44:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"560845be0e0eb09701260007116edb50ce1dbb0b10f0c3997f06f3b017c7aa09","abstract_canon_sha256":"8251b1eb8b764926f1883c38204cdfeb8e9b7377757ef5c24fe336e73f64e426"},"schema_version":"1.0"},"canonical_sha256":"3dbaa5f07a6cc61562993e38868f654533ee4f21aa81a43b427f4f347d67bedf","source":{"kind":"arxiv","id":"1404.7810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7810","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7810v1","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7810","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"HW5KL4D2NTDB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HW5KL4D2NTDBKYUZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HW5KL4D2","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:HW5KL4D2NTDBKYUZHY4IND3FIU","target":"record","payload":{"canonical_record":{"source":{"id":"1404.7810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T17:44:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"560845be0e0eb09701260007116edb50ce1dbb0b10f0c3997f06f3b017c7aa09","abstract_canon_sha256":"8251b1eb8b764926f1883c38204cdfeb8e9b7377757ef5c24fe336e73f64e426"},"schema_version":"1.0"},"canonical_sha256":"3dbaa5f07a6cc61562993e38868f654533ee4f21aa81a43b427f4f347d67bedf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:49.882232Z","signature_b64":"mX2dL6xiPKRW88AmYVQu93s/qJ9GHvnUirAhmvoyVQQqHd6fceMtKpE9GPOXU1R7uEHWQBRQ72094/sR1yN3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dbaa5f07a6cc61562993e38868f654533ee4f21aa81a43b427f4f347d67bedf","last_reissued_at":"2026-05-18T02:52:49.881735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:49.881735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.7810","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:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZh8fTUHtYghQKty5v5OKo3hiDbxxHH0SJWAeL+O36X+BMyMCWWZHNPITLI0NuTdE5NT8kM/kua9ZLBPHZrlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:28:26.875305Z"},"content_sha256":"61fb4c81cf122b25591a28a2e1f31c6fc68cf4b7624dd91013d015db302e1a3c","schema_version":"1.0","event_id":"sha256:61fb4c81cf122b25591a28a2e1f31c6fc68cf4b7624dd91013d015db302e1a3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:HW5KL4D2NTDBKYUZHY4IND3FIU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Bandwidth on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Markus Sortland Dregi","submitted_at":"2014-04-30T17:44:03Z","abstract_excerpt":"The bandwidth of a $n$-vertex graph $G$ is the smallest integer $b$ such that there exists a bijective function $f : V(G) \\rightarrow \\{1,...,n\\}$, called a layout of $G$, such that for every edge $uv \\in E(G)$, $|f(u) - f(v)| \\leq b$. In the {\\sc Bandwidth} problem we are given as input a graph $G$ and integer $b$, and asked whether the bandwidth of $G$ is at most $b$. We present two results concerning the parameterized complexity of the {\\sc Bandwidth} problem on trees.\n  First we show that an algorithm for {\\sc Bandwidth} with running time $f(b)n^{o(b)}$ would violate the Exponential Time H"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7810","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:52:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/g5pNKwhO1ar4HVwIOJ9OuVc3EXVAx6MwoaQqh4uSbG072dh3rXUTq+h65r+1FdyJIAK6tOYuMHcSd/wQHCRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:28:26.876072Z"},"content_sha256":"6f62902bfe951c123387fda3b602a1896762b21b085fc096583f3f4c03ff2b56","schema_version":"1.0","event_id":"sha256:6f62902bfe951c123387fda3b602a1896762b21b085fc096583f3f4c03ff2b56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/bundle.json","state_url":"https://pith.science/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/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-10T08:28:26Z","links":{"resolver":"https://pith.science/pith/HW5KL4D2NTDBKYUZHY4IND3FIU","bundle":"https://pith.science/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/bundle.json","state":"https://pith.science/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HW5KL4D2NTDBKYUZHY4IND3FIU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:HW5KL4D2NTDBKYUZHY4IND3FIU","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":"8251b1eb8b764926f1883c38204cdfeb8e9b7377757ef5c24fe336e73f64e426","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T17:44:03Z","title_canon_sha256":"560845be0e0eb09701260007116edb50ce1dbb0b10f0c3997f06f3b017c7aa09"},"schema_version":"1.0","source":{"id":"1404.7810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.7810","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"arxiv_version","alias_value":"1404.7810v1","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.7810","created_at":"2026-05-18T02:52:49Z"},{"alias_kind":"pith_short_12","alias_value":"HW5KL4D2NTDB","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"HW5KL4D2NTDBKYUZ","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"HW5KL4D2","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:6f62902bfe951c123387fda3b602a1896762b21b085fc096583f3f4c03ff2b56","target":"graph","created_at":"2026-05-18T02:52:49Z","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 $n$-vertex graph $G$ is the smallest integer $b$ such that there exists a bijective function $f : V(G) \\rightarrow \\{1,...,n\\}$, called a layout of $G$, such that for every edge $uv \\in E(G)$, $|f(u) - f(v)| \\leq b$. In the {\\sc Bandwidth} problem we are given as input a graph $G$ and integer $b$, and asked whether the bandwidth of $G$ is at most $b$. We present two results concerning the parameterized complexity of the {\\sc Bandwidth} problem on trees.\n  First we show that an algorithm for {\\sc Bandwidth} with running time $f(b)n^{o(b)}$ would violate the Exponential Time H","authors_text":"Daniel Lokshtanov, Markus Sortland Dregi","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T17:44:03Z","title":"Parameterized Complexity of Bandwidth on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.7810","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:61fb4c81cf122b25591a28a2e1f31c6fc68cf4b7624dd91013d015db302e1a3c","target":"record","created_at":"2026-05-18T02:52:49Z","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":"8251b1eb8b764926f1883c38204cdfeb8e9b7377757ef5c24fe336e73f64e426","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-30T17:44:03Z","title_canon_sha256":"560845be0e0eb09701260007116edb50ce1dbb0b10f0c3997f06f3b017c7aa09"},"schema_version":"1.0","source":{"id":"1404.7810","kind":"arxiv","version":1}},"canonical_sha256":"3dbaa5f07a6cc61562993e38868f654533ee4f21aa81a43b427f4f347d67bedf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dbaa5f07a6cc61562993e38868f654533ee4f21aa81a43b427f4f347d67bedf","first_computed_at":"2026-05-18T02:52:49.881735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:49.881735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mX2dL6xiPKRW88AmYVQu93s/qJ9GHvnUirAhmvoyVQQqHd6fceMtKpE9GPOXU1R7uEHWQBRQ72094/sR1yN3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:49.882232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.7810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61fb4c81cf122b25591a28a2e1f31c6fc68cf4b7624dd91013d015db302e1a3c","sha256:6f62902bfe951c123387fda3b602a1896762b21b085fc096583f3f4c03ff2b56"],"state_sha256":"12c2611c7f993b2f6e9d27ef6240e68819e62058f49c50d8b0787bfa3dc1f226"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2OScD0a7Y8eRd0Nrvw+ns0ZgSKZdeREdBZ0nIx1EMLGhWx6DUhBdnR8yf8D3rksT4Mmtsol2kaJKYIYPn7XDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:28:26.880457Z","bundle_sha256":"b4defea51d594b1b883723bfeeb6a88b89ee5f72ee356e2f11c798685adba75f"}}