{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LI5IPMKL33OC7AB2CJ3KAGGIU7","short_pith_number":"pith:LI5IPMKL","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"},"canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","source":{"kind":"arxiv","id":"2503.05661","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05661","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05661v2","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05661","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"LI5IPMKL33OC","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"LI5IPMKL33OC7AB2","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"LI5IPMKL","created_at":"2026-07-05T10:42:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LI5IPMKL33OC7AB2CJ3KAGGIU7","target":"record","payload":{"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"},"canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","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"},"source_kind":"arxiv","source_id":"2503.05661","source_version":2,"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:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/TNahpyjcAiosMsbObNiG9dZIbM+5w8RSnq/7uM+nx24HgeGBBMW8zcDHZYXoA4+uFlZM5IaKVCvVPTKiRGVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:40:12.649436Z"},"content_sha256":"e39bff4d2c0420e23fdb57f36c30db2777430a6bc76e279322eeca97d8799c33","schema_version":"1.0","event_id":"sha256:e39bff4d2c0420e23fdb57f36c30db2777430a6bc76e279322eeca97d8799c33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LI5IPMKL33OC7AB2CJ3KAGGIU7","target":"graph","payload":{"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"},"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:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaUmfr2M8HplwxEQVXuRWSR+QyoFlZgudnfmfVRJC9bCsYpsS7FsT1dmVcRJStvUxxyCpc2zL+0Vk3E5el8DAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:40:12.650001Z"},"content_sha256":"9d1612111d9e7def3fd05c76adaefc48d08085ca23f463f849dd527e80d4e58e","schema_version":"1.0","event_id":"sha256:9d1612111d9e7def3fd05c76adaefc48d08085ca23f463f849dd527e80d4e58e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/bundle.json","state_url":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/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-05T17:40:12Z","links":{"resolver":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7","bundle":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/bundle.json","state":"https://pith.science/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LI5IPMKL33OC7AB2CJ3KAGGIU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LI5IPMKL33OC7AB2CJ3KAGGIU7","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":"da5ba5be84b30d4ba6ec1a361f45c8e46de7fbb037b5f43c9bfcb3354b9c6f28","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T18:23:40Z","title_canon_sha256":"07fc55ebe67acfc5651ef72e4b66b1cefe63742e3c92d9362c59e3eed118c60f"},"schema_version":"1.0","source":{"id":"2503.05661","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2503.05661","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"2503.05661v2","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.05661","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"LI5IPMKL33OC","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_16","alias_value":"LI5IPMKL33OC7AB2","created_at":"2026-07-05T10:42:15Z"},{"alias_kind":"pith_short_8","alias_value":"LI5IPMKL","created_at":"2026-07-05T10:42:15Z"}],"graph_snapshots":[{"event_id":"sha256:9d1612111d9e7def3fd05c76adaefc48d08085ca23f463f849dd527e80d4e58e","target":"graph","created_at":"2026-07-05T10:42:15Z","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/2503.05661/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 $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)$ ","authors_text":"Ekkehard K\\\"ohler, Feodor F. Dragan","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T18:23:40Z","title":"Graph parameters that are coarsely equivalent to path-length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.05661","kind":"arxiv","version":2},"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:e39bff4d2c0420e23fdb57f36c30db2777430a6bc76e279322eeca97d8799c33","target":"record","created_at":"2026-07-05T10:42:15Z","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":"da5ba5be84b30d4ba6ec1a361f45c8e46de7fbb037b5f43c9bfcb3354b9c6f28","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-03-07T18:23:40Z","title_canon_sha256":"07fc55ebe67acfc5651ef72e4b66b1cefe63742e3c92d9362c59e3eed118c60f"},"schema_version":"1.0","source":{"id":"2503.05661","kind":"arxiv","version":2}},"canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a3a87b14bdedc2f803a1276a018c8a7dbb0beb6dc2485c771e453312e5d244d","first_computed_at":"2026-07-05T10:42:15.482628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:42:15.482628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I5Of+XyWA3IcEakiRU0ne/ZR3IZ/5EoAeo7Y/kIuJFchT7/Gqur8FdKVB9Sr/DbuD74EEPdjcyGUYef+9KqsAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:42:15.483173Z","signed_message":"canonical_sha256_bytes"},"source_id":"2503.05661","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e39bff4d2c0420e23fdb57f36c30db2777430a6bc76e279322eeca97d8799c33","sha256:9d1612111d9e7def3fd05c76adaefc48d08085ca23f463f849dd527e80d4e58e"],"state_sha256":"7132e9c7cbd0d9a6338b21123e5ed32845c3a669ba234c11e7f667316f0ef331"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TaNiHSFqxS5UMhYNBbD7wlE1D5Oy83KvHVaezE0Yn6kIdNOX4oeMeswAYvolj1cAF7CZ6x3hTT9c56WqOoqrCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:40:12.654616Z","bundle_sha256":"36c80f58a0952bdaa4a3de84a1867832569f9862740ba28363d33823791de00e"}}