{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IJFDZTX5Y4O5FXF6ICZ5PB64F6","short_pith_number":"pith:IJFDZTX5","schema_version":"1.0","canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","source":{"kind":"arxiv","id":"2502.00951","version":1},"attestation_state":"computed","paper":{"title":"Graph parameters that are coarsely equivalent to tree-length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Feodor F. Dragan","submitted_at":"2025-02-02T23:05:26Z","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 of $G$ is the minimum of the length, over all tree-decompositions of $G$. We present simpler and sometimes with better bounds proofs for those known in literature results and further extend this list of graph parameters coarsely equival"},"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":"2502.00951","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T23:05:26Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6802b05713eccdf122093b425264ca033e7a93fc18cebc3bb913b0da06878b3b","abstract_canon_sha256":"218161fd12dc726c2b0f23269dad0e1dee9867e6a62465685cdc00f53c857435"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:08:40.629366Z","signature_b64":"ky4BARLi+dW7dcs0+yAH2V0beFr+o2wdfm36tE8hzZ4gfdgwGgwSpsB4R5qpC7ZpGzyU+myLCKSsOSNc8jiRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","last_reissued_at":"2026-07-05T10:08:40.628838Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:08:40.628838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph parameters that are coarsely equivalent to tree-length","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Feodor F. Dragan","submitted_at":"2025-02-02T23:05:26Z","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 of $G$ is the minimum of the length, over all tree-decompositions of $G$. We present simpler and sometimes with better bounds proofs for those known in literature results and further extend this list of graph parameters coarsely equival"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00951","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.00951/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":"2502.00951","created_at":"2026-07-05T10:08:40.628894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.00951v1","created_at":"2026-07-05T10:08:40.628894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00951","created_at":"2026-07-05T10:08:40.628894+00:00"},{"alias_kind":"pith_short_12","alias_value":"IJFDZTX5Y4O5","created_at":"2026-07-05T10:08:40.628894+00:00"},{"alias_kind":"pith_short_16","alias_value":"IJFDZTX5Y4O5FXF6","created_at":"2026-07-05T10:08:40.628894+00:00"},{"alias_kind":"pith_short_8","alias_value":"IJFDZTX5","created_at":"2026-07-05T10:08:40.628894+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/IJFDZTX5Y4O5FXF6ICZ5PB64F6","json":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6.json","graph_json":"https://pith.science/api/pith-number/IJFDZTX5Y4O5FXF6ICZ5PB64F6/graph.json","events_json":"https://pith.science/api/pith-number/IJFDZTX5Y4O5FXF6ICZ5PB64F6/events.json","paper":"https://pith.science/paper/IJFDZTX5"},"agent_actions":{"view_html":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6","download_json":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6.json","view_paper":"https://pith.science/paper/IJFDZTX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.00951&json=true","fetch_graph":"https://pith.science/api/pith-number/IJFDZTX5Y4O5FXF6ICZ5PB64F6/graph.json","fetch_events":"https://pith.science/api/pith-number/IJFDZTX5Y4O5FXF6ICZ5PB64F6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/action/storage_attestation","attest_author":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/action/author_attestation","sign_citation":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/action/citation_signature","submit_replication":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/action/replication_record"}},"created_at":"2026-07-05T10:08:40.628894+00:00","updated_at":"2026-07-05T10:08:40.628894+00:00"}