{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Z45VBI2YRJAWBJRS47PEJFUHDS","short_pith_number":"pith:Z45VBI2Y","canonical_record":{"source":{"id":"1601.01958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-08T17:57:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f83f947706f818acbde1b7b21338c20dd4881254649df3edcda6c7a609cc8fc","abstract_canon_sha256":"2065dc20a8078e1cfd5b3dd32f917e872d1cc7e15f8bb23c35e5f54e4e9b914c"},"schema_version":"1.0"},"canonical_sha256":"cf3b50a3588a4160a632e7de4496871ca9fa582c5f6180e2e2a9f9a3755fa71c","source":{"kind":"arxiv","id":"1601.01958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01958","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01958v1","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01958","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z45VBI2YRJAW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z45VBI2YRJAWBJRS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z45VBI2Y","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Z45VBI2YRJAWBJRS47PEJFUHDS","target":"record","payload":{"canonical_record":{"source":{"id":"1601.01958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-08T17:57:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"2f83f947706f818acbde1b7b21338c20dd4881254649df3edcda6c7a609cc8fc","abstract_canon_sha256":"2065dc20a8078e1cfd5b3dd32f917e872d1cc7e15f8bb23c35e5f54e4e9b914c"},"schema_version":"1.0"},"canonical_sha256":"cf3b50a3588a4160a632e7de4496871ca9fa582c5f6180e2e2a9f9a3755fa71c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:10.970019Z","signature_b64":"D4Oi1/se8Fs5uRseGwf675iQ6AqJbgqV3EyasEy1/55sUgiTZ06M2LIg/soTu8Q2GVoe+n2fT++BgNZeTPQUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf3b50a3588a4160a632e7de4496871ca9fa582c5f6180e2e2a9f9a3755fa71c","last_reissued_at":"2026-05-18T01:23:10.969502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:10.969502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.01958","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-18T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2bndsSg3eS9fVnMxqW31eZMVQpuvj3PsnT9TceKwbq6qqzh1zvDAg/9l7gw89a6fMG9aWjTuD1wx58UuabrRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:27:10.441354Z"},"content_sha256":"e15b11d630b8a9d3885e09bc1721ea523909f4fc9c32c44c83ebe96a34294dc7","schema_version":"1.0","event_id":"sha256:e15b11d630b8a9d3885e09bc1721ea523909f4fc9c32c44c83ebe96a34294dc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Z45VBI2YRJAWBJRS47PEJFUHDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On computing tree and path decompositions with metric constraints on the bags","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Guillaume Ducoffe, Nicolas Nisse, Sylvain Legay","submitted_at":"2016-01-08T17:57:40Z","abstract_excerpt":"We here investigate on the complexity of computing the \\emph{tree-length} and the \\emph{tree-breadth} of any graph $G$, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition of $G$. \\emph{Path-length} and \\emph{path-breadth} are similarly defined and studied for path decompositions. \nSo far, it was already known that tree-length is NP-hard to compute. We here prove it is also the case for tree-breadth, path-length and path-breadth. Furthermore, we provide a more detailed analysis on the complexity of computing the tree-breadth. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01958","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-18T01:23:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97W5Tg2axiWDthaOKQKv75ZbE1WT+rxPNhgclC0XQK7aLlmwa1AXWTkNmvdh0Zm++TLoySDxWWzxsVpnTzOwAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:27:10.441786Z"},"content_sha256":"9bf37c21c4bca39363e91c924f099fe5de551154d10af8852e6b0cd678bc41fd","schema_version":"1.0","event_id":"sha256:9bf37c21c4bca39363e91c924f099fe5de551154d10af8852e6b0cd678bc41fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/bundle.json","state_url":"https://pith.science/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/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-05-26T20:27:10Z","links":{"resolver":"https://pith.science/pith/Z45VBI2YRJAWBJRS47PEJFUHDS","bundle":"https://pith.science/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/bundle.json","state":"https://pith.science/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z45VBI2YRJAWBJRS47PEJFUHDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z45VBI2YRJAWBJRS47PEJFUHDS","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":"2065dc20a8078e1cfd5b3dd32f917e872d1cc7e15f8bb23c35e5f54e4e9b914c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-08T17:57:40Z","title_canon_sha256":"2f83f947706f818acbde1b7b21338c20dd4881254649df3edcda6c7a609cc8fc"},"schema_version":"1.0","source":{"id":"1601.01958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01958","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01958v1","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01958","created_at":"2026-05-18T01:23:10Z"},{"alias_kind":"pith_short_12","alias_value":"Z45VBI2YRJAW","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z45VBI2YRJAWBJRS","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z45VBI2Y","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9bf37c21c4bca39363e91c924f099fe5de551154d10af8852e6b0cd678bc41fd","target":"graph","created_at":"2026-05-18T01:23:10Z","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 here investigate on the complexity of computing the \\emph{tree-length} and the \\emph{tree-breadth} of any graph $G$, that are respectively the best possible upper-bounds on the diameter and the radius of the bags in a tree decomposition of $G$. \\emph{Path-length} and \\emph{path-breadth} are similarly defined and studied for path decompositions. \nSo far, it was already known that tree-length is NP-hard to compute. We here prove it is also the case for tree-breadth, path-length and path-breadth. Furthermore, we provide a more detailed analysis on the complexity of computing the tree-breadth. ","authors_text":"Guillaume Ducoffe, Nicolas Nisse, Sylvain Legay","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-08T17:57:40Z","title":"On computing tree and path decompositions with metric constraints on the bags"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01958","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:e15b11d630b8a9d3885e09bc1721ea523909f4fc9c32c44c83ebe96a34294dc7","target":"record","created_at":"2026-05-18T01:23:10Z","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":"2065dc20a8078e1cfd5b3dd32f917e872d1cc7e15f8bb23c35e5f54e4e9b914c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-01-08T17:57:40Z","title_canon_sha256":"2f83f947706f818acbde1b7b21338c20dd4881254649df3edcda6c7a609cc8fc"},"schema_version":"1.0","source":{"id":"1601.01958","kind":"arxiv","version":1}},"canonical_sha256":"cf3b50a3588a4160a632e7de4496871ca9fa582c5f6180e2e2a9f9a3755fa71c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf3b50a3588a4160a632e7de4496871ca9fa582c5f6180e2e2a9f9a3755fa71c","first_computed_at":"2026-05-18T01:23:10.969502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:10.969502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D4Oi1/se8Fs5uRseGwf675iQ6AqJbgqV3EyasEy1/55sUgiTZ06M2LIg/soTu8Q2GVoe+n2fT++BgNZeTPQUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:10.970019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e15b11d630b8a9d3885e09bc1721ea523909f4fc9c32c44c83ebe96a34294dc7","sha256:9bf37c21c4bca39363e91c924f099fe5de551154d10af8852e6b0cd678bc41fd"],"state_sha256":"9f46e3abc82903cb3f13bcf96c81450f03720e7226054debf65dead8ecdefee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcVfRTfjOxISSDqd0ieD5Zi9g0vBBE5FvXJSmfqcBOJEEcJ8tZvDy44tN2YlTDcbsA+LY2OWrbPmMPHmEnl/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:27:10.444250Z","bundle_sha256":"f845a7282755a306813f1404ea4cb8ae7372d678e0cb52e84ad0a02c0d3bd951"}}