{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H7JMK6JWP2TCLKVYWKW7SLEE7K","short_pith_number":"pith:H7JMK6JW","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"},"canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","source":{"kind":"arxiv","id":"1409.8389","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8389","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8389v1","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8389","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"H7JMK6JWP2TC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H7JMK6JWP2TCLKVY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H7JMK6JW","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H7JMK6JWP2TCLKVYWKW7SLEE7K","target":"record","payload":{"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"},"canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","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"},"source_kind":"arxiv","source_id":"1409.8389","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:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uavIaG6BLeLlc3sUa5+ylzXM8QcDhjkKU5QaOy0uQEJcmAU1Fyd42Y4eUGT6zJy/+w0qjz1CAIox8D/fUI/pDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:25:41.191161Z"},"content_sha256":"89d12dc025e8d2bd7eb809b32b827b84549dfd45557cd2b58372c839f0eb01aa","schema_version":"1.0","event_id":"sha256:89d12dc025e8d2bd7eb809b32b827b84549dfd45557cd2b58372c839f0eb01aa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H7JMK6JWP2TCLKVYWKW7SLEE7K","target":"graph","payload":{"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"},"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:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2JkxwFQzUkYt3oJ2WQuayyzrKnfeShTi13o1qj/JwhZ3GETzxVRoOWqfQs/7WO9vTvp58H6QbRC24bUaZ/2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:25:41.191860Z"},"content_sha256":"a1972c09f27c14ff54abd30cf9d87f7b186053afa2901a903de3e446a1eeeb9f","schema_version":"1.0","event_id":"sha256:a1972c09f27c14ff54abd30cf9d87f7b186053afa2901a903de3e446a1eeeb9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/bundle.json","state_url":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/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-04T22:25:41Z","links":{"resolver":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K","bundle":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/bundle.json","state":"https://pith.science/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H7JMK6JWP2TCLKVYWKW7SLEE7K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H7JMK6JWP2TCLKVYWKW7SLEE7K","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":"317e499ca361f0ca8d35773da1e7364b23485873d3cad6177e4264b80cf6e74a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T05:31:24Z","title_canon_sha256":"0882c7cef12229a4e3c23a3acba127c55173f31c3be07aa927b70a44fb6f1896"},"schema_version":"1.0","source":{"id":"1409.8389","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8389","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8389v1","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8389","created_at":"2026-05-18T02:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"H7JMK6JWP2TC","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H7JMK6JWP2TCLKVY","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H7JMK6JW","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:a1972c09f27c14ff54abd30cf9d87f7b186053afa2901a903de3e446a1eeeb9f","target":"graph","created_at":"2026-05-18T02:41:25Z","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":"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 ","authors_text":"Arne Leitert, Ekkehard K\\\"ohler, Feodor F. Dragan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T05:31:24Z","title":"Line-distortion, Bandwidth and Path-length of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8389","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:89d12dc025e8d2bd7eb809b32b827b84549dfd45557cd2b58372c839f0eb01aa","target":"record","created_at":"2026-05-18T02:41:25Z","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":"317e499ca361f0ca8d35773da1e7364b23485873d3cad6177e4264b80cf6e74a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-30T05:31:24Z","title_canon_sha256":"0882c7cef12229a4e3c23a3acba127c55173f31c3be07aa927b70a44fb6f1896"},"schema_version":"1.0","source":{"id":"1409.8389","kind":"arxiv","version":1}},"canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fd2c579367ea625aab8b2adf92c84fab7e6803f0d975ae9ff4a7e3e7b95235e","first_computed_at":"2026-05-18T02:41:25.435037Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:25.435037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBcb/MJdO+Nhqfu6o+YvytuJuU7SXauq1nuoy1yrIz3pAcg0vficJOZVyqP2v5991s0Jld0wbB8N3SZ38c1CCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:25.435461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8389","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89d12dc025e8d2bd7eb809b32b827b84549dfd45557cd2b58372c839f0eb01aa","sha256:a1972c09f27c14ff54abd30cf9d87f7b186053afa2901a903de3e446a1eeeb9f"],"state_sha256":"244a329e6f401caa0e1f7694cc38db11607175f411399ceeff0a0a528876d075"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83IKkYxJ3lPMm5psciWqNdKRe/tUtGJHrnAW4M+VZAb50N6NdNB6qHkzjBXjHM7xcP7vaGQmFAMVMoijdWjwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:25:41.195726Z","bundle_sha256":"f4ae88336d116f0938f0ec0f5e6be45e425161a28440bb05d5dc336a8ceba5c8"}}