{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IJFDZTX5Y4O5FXF6ICZ5PB64F6","short_pith_number":"pith:IJFDZTX5","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"},"canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","source":{"kind":"arxiv","id":"2502.00951","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00951","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00951v1","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00951","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_12","alias_value":"IJFDZTX5Y4O5","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_16","alias_value":"IJFDZTX5Y4O5FXF6","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_8","alias_value":"IJFDZTX5","created_at":"2026-07-05T10:08:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IJFDZTX5Y4O5FXF6ICZ5PB64F6","target":"record","payload":{"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"},"canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","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"},"source_kind":"arxiv","source_id":"2502.00951","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-07-05T10:08:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f5EY/5k6AD/deNb5FbBy8OgPrAarOgrh1BUod/BUy/MnnoEyloJ9ikHHw9Q5nb2A/uL4NMGjkQNRwVXQbZHzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:36:52.239524Z"},"content_sha256":"0d372072158abf1b883090f2f99afb16d60c6995b1bf091cc7a983d38d106c37","schema_version":"1.0","event_id":"sha256:0d372072158abf1b883090f2f99afb16d60c6995b1bf091cc7a983d38d106c37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IJFDZTX5Y4O5FXF6ICZ5PB64F6","target":"graph","payload":{"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"},"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-07-05T10:08:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFbFouMmn/b/VDyHy0rbFvqOc8MxO8Yb0R5ba9v/vU4nRIuZ3fcEIhzamUZEmlvtcvY2ccF54qmSdUKyeps7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T05:36:52.240221Z"},"content_sha256":"1c187a2ed935262989c3a640fb0467a495a9ed40ec5012e8cc11b13ae9501ffb","schema_version":"1.0","event_id":"sha256:1c187a2ed935262989c3a640fb0467a495a9ed40ec5012e8cc11b13ae9501ffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/bundle.json","state_url":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/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-08-21T05:36:52Z","links":{"resolver":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6","bundle":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/bundle.json","state":"https://pith.science/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IJFDZTX5Y4O5FXF6ICZ5PB64F6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IJFDZTX5Y4O5FXF6ICZ5PB64F6","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":"218161fd12dc726c2b0f23269dad0e1dee9867e6a62465685cdc00f53c857435","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T23:05:26Z","title_canon_sha256":"6802b05713eccdf122093b425264ca033e7a93fc18cebc3bb913b0da06878b3b"},"schema_version":"1.0","source":{"id":"2502.00951","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.00951","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"arxiv_version","alias_value":"2502.00951v1","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.00951","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_12","alias_value":"IJFDZTX5Y4O5","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_16","alias_value":"IJFDZTX5Y4O5FXF6","created_at":"2026-07-05T10:08:40Z"},{"alias_kind":"pith_short_8","alias_value":"IJFDZTX5","created_at":"2026-07-05T10:08:40Z"}],"graph_snapshots":[{"event_id":"sha256:1c187a2ed935262989c3a640fb0467a495a9ed40ec5012e8cc11b13ae9501ffb","target":"graph","created_at":"2026-07-05T10:08:40Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.00951/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Feodor F. Dragan","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T23:05:26Z","title":"Graph parameters that are coarsely equivalent to tree-length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.00951","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:0d372072158abf1b883090f2f99afb16d60c6995b1bf091cc7a983d38d106c37","target":"record","created_at":"2026-07-05T10:08:40Z","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":"218161fd12dc726c2b0f23269dad0e1dee9867e6a62465685cdc00f53c857435","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-02-02T23:05:26Z","title_canon_sha256":"6802b05713eccdf122093b425264ca033e7a93fc18cebc3bb913b0da06878b3b"},"schema_version":"1.0","source":{"id":"2502.00951","kind":"arxiv","version":1}},"canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"424a3ccefdc71dd2dcbe40b3d787dc2faeea9c41ab306dd5427c757583c6eea4","first_computed_at":"2026-07-05T10:08:40.628838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:08:40.628838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ky4BARLi+dW7dcs0+yAH2V0beFr+o2wdfm36tE8hzZ4gfdgwGgwSpsB4R5qpC7ZpGzyU+myLCKSsOSNc8jiRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:08:40.629366Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.00951","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d372072158abf1b883090f2f99afb16d60c6995b1bf091cc7a983d38d106c37","sha256:1c187a2ed935262989c3a640fb0467a495a9ed40ec5012e8cc11b13ae9501ffb"],"state_sha256":"9b14ec2a3a6685dea086190b05fd5f11a0be25744ae3bdb4bf95b069c98dfaee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"akcjCFoEOOvw+q9CWn6d+q6LOJnniZ9g9lG9H7+6bxBaYmyqemZxOeIFBrvsFxFvwS1jDg8EN9HpoXQlyaD/Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T05:36:52.245990Z","bundle_sha256":"e55befed3c91695316e392cbfc1668239db71a9691d7761e5a380494e491c76a"}}