{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H7JMK6JWP2TCLKVYWKW7SLEE7K","short_pith_number":"pith:H7JMK6JW","schema_version":"1.0","canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","source":{"kind":"arxiv","id":"1409.8389","version":1},"attestation_state":"computed","paper":{"title":"Line-distortion, Bandwidth and Path-length of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arne Leitert, Ekkehard K\\\"ohler, Feodor F. Dragan","submitted_at":"2014-09-30T05:31:24Z","abstract_excerpt":"We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition. The length of a path-decomposition of a graph is the largest diameter of a bag in the decomposition. The path-length of a graph is the minimum length over all its path-decompositions. In particular, we show:\n  - if a graph $G$ can be embedded into the line with distortion $k$, then $G$ admits a Robertson-Seymour's path-decomposition with bags of diameter at most $k$ in $G$;\n  - for every class of graphs with "},"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":"1409.8389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T05:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"0882c7cef12229a4e3c23a3acba127c55173f31c3be07aa927b70a44fb6f1896","abstract_canon_sha256":"317e499ca361f0ca8d35773da1e7364b23485873d3cad6177e4264b80cf6e74a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:25.435461Z","signature_b64":"jBcb/MJdO+Nhqfu6o+YvytuJuU7SXauq1nuoy1yrIz3pAcg0vficJOZVyqP2v5991s0Jld0wbB8N3SZ38c1CCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","last_reissued_at":"2026-05-18T02:41:25.435037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:25.435037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Line-distortion, Bandwidth and Path-length of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Arne Leitert, Ekkehard K\\\"ohler, Feodor F. Dragan","submitted_at":"2014-09-30T05:31:24Z","abstract_excerpt":"We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decomposition. The length of a path-decomposition of a graph is the largest diameter of a bag in the decomposition. The path-length of a graph is the minimum length over all its path-decompositions. In particular, we show:\n  - if a graph $G$ can be embedded into the line with distortion $k$, then $G$ admits a Robertson-Seymour's path-decomposition with bags of diameter at most $k$ in $G$;\n  - for every class of graphs with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8389","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.8389","created_at":"2026-05-18T02:41:25.435092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8389v1","created_at":"2026-05-18T02:41:25.435092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8389","created_at":"2026-05-18T02:41:25.435092+00:00"},{"alias_kind":"pith_short_12","alias_value":"H7JMK6JWP2TC","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H7JMK6JWP2TCLKVY","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H7JMK6JW","created_at":"2026-05-18T12:28:30.664211+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/H7JMK6JWP2TCLKVYWKW7SLEE7K","json":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K.json","graph_json":"https://pith.science/api/pith-number/H7JMK6JWP2TCLKVYWKW7SLEE7K/graph.json","events_json":"https://pith.science/api/pith-number/H7JMK6JWP2TCLKVYWKW7SLEE7K/events.json","paper":"https://pith.science/paper/H7JMK6JW"},"agent_actions":{"view_html":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K","download_json":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K.json","view_paper":"https://pith.science/paper/H7JMK6JW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8389&json=true","fetch_graph":"https://pith.science/api/pith-number/H7JMK6JWP2TCLKVYWKW7SLEE7K/graph.json","fetch_events":"https://pith.science/api/pith-number/H7JMK6JWP2TCLKVYWKW7SLEE7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/action/storage_attestation","attest_author":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/action/author_attestation","sign_citation":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/action/citation_signature","submit_replication":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/action/replication_record"}},"created_at":"2026-05-18T02:41:25.435092+00:00","updated_at":"2026-05-18T02:41:25.435092+00:00"}