{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LI5IPMKL33OC7AB2CJ3KAGGIU7","short_pith_number":"pith:LI5IPMKL","schema_version":"1.0","canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","source":{"kind":"arxiv","id":"2503.05661","version":2},"attestation_state":"computed","paper":{"title":"Graph parameters that are coarsely equivalent to path-length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ekkehard K\\\"ohler, Feodor F. Dragan","submitted_at":"2025-03-07T18:23:40Z","abstract_excerpt":"Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length of a tree-decomposition ${\\cal T}(G)$ of a graph $G$ is the largest diameter of a bag in ${\\cal T}(G)$, and the tree-length $tl(G)$ of $G$ is the minimum of the length, over all tree-decompositions of $G$. Similarly, the length of a path-decomposition ${\\cal P}(G)$ of a graph $G$ is the largest diameter of a bag in ${\\cal P}(G)$, and the path-length $pl(G)$ "},"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":"2503.05661","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T18:23:40Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"07fc55ebe67acfc5651ef72e4b66b1cefe63742e3c92d9362c59e3eed118c60f","abstract_canon_sha256":"da5ba5be84b30d4ba6ec1a361f45c8e46de7fbb037b5f43c9bfcb3354b9c6f28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:42:15.483173Z","signature_b64":"I5Of+XyWA3IcEakiRU0ne/ZR3IZ/5EoAeo7Y/kIuJFchT7/Gqur8FdKVB9Sr/DbuD74EEPdjcyGUYef+9KqsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","last_reissued_at":"2026-07-05T10:42:15.482628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:42:15.482628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph parameters that are coarsely equivalent to path-length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Ekkehard K\\\"ohler, Feodor F. Dragan","submitted_at":"2025-03-07T18:23:40Z","abstract_excerpt":"Two graph parameters are said to be coarsely equivalent if they are within constant factors from each other for every graph $G$. Recently, several graph parameters were shown to be coarsely equivalent to tree-length. Recall that the length of a tree-decomposition ${\\cal T}(G)$ of a graph $G$ is the largest diameter of a bag in ${\\cal T}(G)$, and the tree-length $tl(G)$ of $G$ is the minimum of the length, over all tree-decompositions of $G$. Similarly, the length of a path-decomposition ${\\cal P}(G)$ of a graph $G$ is the largest diameter of a bag in ${\\cal P}(G)$, and the path-length $pl(G)$ "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05661","kind":"arxiv","version":2},"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/2503.05661/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":"2503.05661","created_at":"2026-07-05T10:42:15.482712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.05661v2","created_at":"2026-07-05T10:42:15.482712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05661","created_at":"2026-07-05T10:42:15.482712+00:00"},{"alias_kind":"pith_short_12","alias_value":"LI5IPMKL33OC","created_at":"2026-07-05T10:42:15.482712+00:00"},{"alias_kind":"pith_short_16","alias_value":"LI5IPMKL33OC7AB2","created_at":"2026-07-05T10:42:15.482712+00:00"},{"alias_kind":"pith_short_8","alias_value":"LI5IPMKL","created_at":"2026-07-05T10:42:15.482712+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/LI5IPMKL33OC7AB2CJ3KAGGIU7","json":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7.json","graph_json":"https://pith.science/api/pith-number/LI5IPMKL33OC7AB2CJ3KAGGIU7/graph.json","events_json":"https://pith.science/api/pith-number/LI5IPMKL33OC7AB2CJ3KAGGIU7/events.json","paper":"https://pith.science/paper/LI5IPMKL"},"agent_actions":{"view_html":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7","download_json":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7.json","view_paper":"https://pith.science/paper/LI5IPMKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.05661&json=true","fetch_graph":"https://pith.science/api/pith-number/LI5IPMKL33OC7AB2CJ3KAGGIU7/graph.json","fetch_events":"https://pith.science/api/pith-number/LI5IPMKL33OC7AB2CJ3KAGGIU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/action/storage_attestation","attest_author":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/action/author_attestation","sign_citation":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/action/citation_signature","submit_replication":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/action/replication_record"}},"created_at":"2026-07-05T10:42:15.482712+00:00","updated_at":"2026-07-05T10:42:15.482712+00:00"}