{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4J5O4FC6E2JWROI56PLLKTSPPW","short_pith_number":"pith:4J5O4FC6","schema_version":"1.0","canonical_sha256":"e27aee145e269368b91df3d6b54e4f7daa731150202f0c51ec1f418521b447b7","source":{"kind":"arxiv","id":"1809.06041","version":1},"attestation_state":"computed","paper":{"title":"Equivalence between pathbreadth and strong pathbreadth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arne Leitert, Guillaume Ducoffe","submitted_at":"2018-09-17T06:40:31Z","abstract_excerpt":"We say that a given graph $G = (V, E)$ has \\emph{pathbreadth} at most $\\rho$, denoted $\\pb(G) \\leq \\rho$, if there exists a Roberston and Seymour's path decomposition where every bag is contained in the $\\rho$-neighbourhood of some vertex. Similarly, we say that $G$ has \\emph{strong pathbreadth} at most $\\rho$, denoted $\\spb(G) \\leq \\rho$, if there exists a Roberston and Seymour's path decomposition where every bag is the complete $\\rho$-neighbourhood of some vertex. It is straightforward that $\\pb(G) \\leq \\spb(G)$ for any graph $G$. Inspired from a close conjecture in [Leitert and Dragan, COC"},"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":"1809.06041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-09-17T06:40:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"cc081d92a93ae1c33b8870d3836d168358c3248ef1b42aee7cb9d8dc70997c7d","abstract_canon_sha256":"78647d6c3a3bb5d7522d0a6d05f8e2d6666c4b75df3bd2b58275d46ccfbb603a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:35.802170Z","signature_b64":"lx0QkxNziJiMNdLscrn/V+4ZWgmhEPc83nCr9FZU67coNqGugW2Db0J7LnNYAvOAaGS6VwesFfJVVNGAlO7aAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27aee145e269368b91df3d6b54e4f7daa731150202f0c51ec1f418521b447b7","last_reissued_at":"2026-05-18T00:05:35.801656Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:35.801656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence between pathbreadth and strong pathbreadth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arne Leitert, Guillaume Ducoffe","submitted_at":"2018-09-17T06:40:31Z","abstract_excerpt":"We say that a given graph $G = (V, E)$ has \\emph{pathbreadth} at most $\\rho$, denoted $\\pb(G) \\leq \\rho$, if there exists a Roberston and Seymour's path decomposition where every bag is contained in the $\\rho$-neighbourhood of some vertex. Similarly, we say that $G$ has \\emph{strong pathbreadth} at most $\\rho$, denoted $\\spb(G) \\leq \\rho$, if there exists a Roberston and Seymour's path decomposition where every bag is the complete $\\rho$-neighbourhood of some vertex. It is straightforward that $\\pb(G) \\leq \\spb(G)$ for any graph $G$. Inspired from a close conjecture in [Leitert and Dragan, COC"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06041","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":"1809.06041","created_at":"2026-05-18T00:05:35.801732+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.06041v1","created_at":"2026-05-18T00:05:35.801732+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06041","created_at":"2026-05-18T00:05:35.801732+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J5O4FC6E2JW","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J5O4FC6E2JWROI5","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J5O4FC6","created_at":"2026-05-18T12:32:05.422762+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/4J5O4FC6E2JWROI56PLLKTSPPW","json":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW.json","graph_json":"https://pith.science/api/pith-number/4J5O4FC6E2JWROI56PLLKTSPPW/graph.json","events_json":"https://pith.science/api/pith-number/4J5O4FC6E2JWROI56PLLKTSPPW/events.json","paper":"https://pith.science/paper/4J5O4FC6"},"agent_actions":{"view_html":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW","download_json":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW.json","view_paper":"https://pith.science/paper/4J5O4FC6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.06041&json=true","fetch_graph":"https://pith.science/api/pith-number/4J5O4FC6E2JWROI56PLLKTSPPW/graph.json","fetch_events":"https://pith.science/api/pith-number/4J5O4FC6E2JWROI56PLLKTSPPW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW/action/storage_attestation","attest_author":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW/action/author_attestation","sign_citation":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW/action/citation_signature","submit_replication":"https://pith.science/pith/4J5O4FC6E2JWROI56PLLKTSPPW/action/replication_record"}},"created_at":"2026-05-18T00:05:35.801732+00:00","updated_at":"2026-05-18T00:05:35.801732+00:00"}