{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:M5ZNULZVYHUUWCGWZ7FOKBE4Z2","short_pith_number":"pith:M5ZNULZV","schema_version":"1.0","canonical_sha256":"6772da2f35c1e94b08d6cfcae5049cce89570277f104d6eb55f78c68478ed848","source":{"kind":"arxiv","id":"2307.08497","version":3},"attestation_state":"computed","paper":{"title":"A structural duality for path-decompositions into parts of small radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ann-Kathrin Elm, Eva Fluck, Paul Knappe, Paul Wollan, Raphael W. Jacobs, Reinhard Diestel, Sandra Albrechtsen","submitted_at":"2023-07-17T14:00:29Z","abstract_excerpt":"It is an easy observation that if a graph~$G$ admits a path-decomposition whose parts have small radius, then $G$ contains no large subdivision of $K_{1,3}$ or $K^3$ as a (quasi-)geodesic subgraph. We show that these are in fact the only obstructions to such path-decompositions of small radial width, and we prove analogous results for decompositions modelled on cycles and subdivided stars instead of paths.\n  With our results we confirm in a strong form a conjecture of Georgakopoulos and Papasoglu on fat-minor-characterisations of graphs quasi-isometric to paths, cycles and paths, and subdivide"},"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":"2307.08497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-07-17T14:00:29Z","cross_cats_sorted":[],"title_canon_sha256":"85cdc7df773506fa5ec18bafa954d50e6bb7d611ebea7f049a4dd52d48b25938","abstract_canon_sha256":"da1c9f474aa9a0557ce608b537aba8698c25fe6c0aa22d8474daf323c513ca8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:44.664232Z","signature_b64":"miKvOb34mw13FCCO6E9aFu6Ha/N+sv3EnpQ111xGR5+e8I9Y+cB71bXnZw+b3qiD0Q0Zd9UQZgrNtPEBxpaHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6772da2f35c1e94b08d6cfcae5049cce89570277f104d6eb55f78c68478ed848","last_reissued_at":"2026-06-02T02:04:44.663782Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:44.663782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A structural duality for path-decompositions into parts of small radius","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ann-Kathrin Elm, Eva Fluck, Paul Knappe, Paul Wollan, Raphael W. Jacobs, Reinhard Diestel, Sandra Albrechtsen","submitted_at":"2023-07-17T14:00:29Z","abstract_excerpt":"It is an easy observation that if a graph~$G$ admits a path-decomposition whose parts have small radius, then $G$ contains no large subdivision of $K_{1,3}$ or $K^3$ as a (quasi-)geodesic subgraph. We show that these are in fact the only obstructions to such path-decompositions of small radial width, and we prove analogous results for decompositions modelled on cycles and subdivided stars instead of paths.\n  With our results we confirm in a strong form a conjecture of Georgakopoulos and Papasoglu on fat-minor-characterisations of graphs quasi-isometric to paths, cycles and paths, and subdivide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.08497","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.08497/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2307.08497","created_at":"2026-06-02T02:04:44.663847+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.08497v3","created_at":"2026-06-02T02:04:44.663847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.08497","created_at":"2026-06-02T02:04:44.663847+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5ZNULZVYHUU","created_at":"2026-06-02T02:04:44.663847+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5ZNULZVYHUUWCGW","created_at":"2026-06-02T02:04:44.663847+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5ZNULZV","created_at":"2026-06-02T02:04:44.663847+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2408.02299","citing_title":"Various Properties of Various Ultrafilters, Various Graph Width Parameters, and Various Connectivity Systems (with Survey)","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2","json":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2.json","graph_json":"https://pith.science/api/pith-number/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/graph.json","events_json":"https://pith.science/api/pith-number/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/events.json","paper":"https://pith.science/paper/M5ZNULZV"},"agent_actions":{"view_html":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2","download_json":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2.json","view_paper":"https://pith.science/paper/M5ZNULZV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.08497&json=true","fetch_graph":"https://pith.science/api/pith-number/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/graph.json","fetch_events":"https://pith.science/api/pith-number/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/action/storage_attestation","attest_author":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/action/author_attestation","sign_citation":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/action/citation_signature","submit_replication":"https://pith.science/pith/M5ZNULZVYHUUWCGWZ7FOKBE4Z2/action/replication_record"}},"created_at":"2026-06-02T02:04:44.663847+00:00","updated_at":"2026-06-02T02:04:44.663847+00:00"}