{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XRGH6AJIQ5W44WFOXVHLNZLHJY","short_pith_number":"pith:XRGH6AJI","canonical_record":{"source":{"id":"2502.11674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-17T11:07:14Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"2185870934a01ee73b1bf513432ce71751b36527976518b538015be25b1ec236","abstract_canon_sha256":"9d019a5d75c11f1ac4a1d44257325483573da9876fcf07d70f71123c97f95588"},"schema_version":"1.0"},"canonical_sha256":"bc4c7f0128876dce58aebd4eb6e5674e15ae87d2e584db431a0e4c7a0f4d2e1b","source":{"kind":"arxiv","id":"2502.11674","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11674","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11674v1","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11674","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"XRGH6AJIQ5W4","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_16","alias_value":"XRGH6AJIQ5W44WFO","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_8","alias_value":"XRGH6AJI","created_at":"2026-07-05T10:15:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XRGH6AJIQ5W44WFOXVHLNZLHJY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.11674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-17T11:07:14Z","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"title_canon_sha256":"2185870934a01ee73b1bf513432ce71751b36527976518b538015be25b1ec236","abstract_canon_sha256":"9d019a5d75c11f1ac4a1d44257325483573da9876fcf07d70f71123c97f95588"},"schema_version":"1.0"},"canonical_sha256":"bc4c7f0128876dce58aebd4eb6e5674e15ae87d2e584db431a0e4c7a0f4d2e1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:32.307394Z","signature_b64":"2pS/CreUgw/eopQ0MUVjtE+IJL7+FH/stFBa6P59xVNV3fa7Ws9Tek/tzi1xbduJVYdhgX3vol4vjXUauhVzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc4c7f0128876dce58aebd4eb6e5674e15ae87d2e584db431a0e4c7a0f4d2e1b","last_reissued_at":"2026-07-05T10:15:32.306825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:32.306825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.11674","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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QimjjogKE6HVBmupLNRMD+9D/9KgxwZwGfbpQzAPlr5sgREwOh23oUJgFj1kaiy5UMfxAsXrTx6zkblwthevDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:30:45.954900Z"},"content_sha256":"3142271542bcf597d4f7cb895560743e61b7d35a51f7d0aa876b56311e2e8a95","schema_version":"1.0","event_id":"sha256:3142271542bcf597d4f7cb895560743e61b7d35a51f7d0aa876b56311e2e8a95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XRGH6AJIQ5W44WFOXVHLNZLHJY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a tree-based variant of bandwidth and forbidding simple topological minors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DS","math.CO"],"primary_cat":"cs.DM","authors_text":"Christophe Paul, Hugo Jacob, William Lochet","submitted_at":"2025-02-17T11:07:14Z","abstract_excerpt":"We obtain structure theorems for graphs excluding a fan (a path with a universal vertex) or a dipole ($K_{2,k}$) as a topological minor. The corresponding decompositions can be computed in FPT linear time. This is motivated by the study of a graph parameter we call treebandwidth which extends the graph parameter bandwidth by replacing the linear layout by a rooted tree such that neighbours in the graph are in ancestor-descendant relation in the tree.\n  We deduce an approximation algorithm for treebandwidth running in FPT linear time from our structure theorems. We complement this result with a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11674","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.11674/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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSeTeHD/LeMnyK8G3OrS39fIRS4zqG5yEy7NHLoa8RVVLPDd7v9VKBTFEXEtVh77dZU3fnlmtYPw4HCXMX7qDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T22:30:45.955445Z"},"content_sha256":"55307a36cdb18ac69c4c1fbb5ded4e37a3f8e57a5a895b6751dfaa3dd119621a","schema_version":"1.0","event_id":"sha256:55307a36cdb18ac69c4c1fbb5ded4e37a3f8e57a5a895b6751dfaa3dd119621a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/bundle.json","state_url":"https://pith.science/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/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-20T22:30:45Z","links":{"resolver":"https://pith.science/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY","bundle":"https://pith.science/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/bundle.json","state":"https://pith.science/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRGH6AJIQ5W44WFOXVHLNZLHJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XRGH6AJIQ5W44WFOXVHLNZLHJY","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":"9d019a5d75c11f1ac4a1d44257325483573da9876fcf07d70f71123c97f95588","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-17T11:07:14Z","title_canon_sha256":"2185870934a01ee73b1bf513432ce71751b36527976518b538015be25b1ec236"},"schema_version":"1.0","source":{"id":"2502.11674","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.11674","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"2502.11674v1","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.11674","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"XRGH6AJIQ5W4","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_16","alias_value":"XRGH6AJIQ5W44WFO","created_at":"2026-07-05T10:15:32Z"},{"alias_kind":"pith_short_8","alias_value":"XRGH6AJI","created_at":"2026-07-05T10:15:32Z"}],"graph_snapshots":[{"event_id":"sha256:55307a36cdb18ac69c4c1fbb5ded4e37a3f8e57a5a895b6751dfaa3dd119621a","target":"graph","created_at":"2026-07-05T10:15:32Z","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.11674/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We obtain structure theorems for graphs excluding a fan (a path with a universal vertex) or a dipole ($K_{2,k}$) as a topological minor. The corresponding decompositions can be computed in FPT linear time. This is motivated by the study of a graph parameter we call treebandwidth which extends the graph parameter bandwidth by replacing the linear layout by a rooted tree such that neighbours in the graph are in ancestor-descendant relation in the tree.\n  We deduce an approximation algorithm for treebandwidth running in FPT linear time from our structure theorems. We complement this result with a","authors_text":"Christophe Paul, Hugo Jacob, William Lochet","cross_cats":["cs.CC","cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-17T11:07:14Z","title":"On a tree-based variant of bandwidth and forbidding simple topological minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.11674","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:3142271542bcf597d4f7cb895560743e61b7d35a51f7d0aa876b56311e2e8a95","target":"record","created_at":"2026-07-05T10:15:32Z","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":"9d019a5d75c11f1ac4a1d44257325483573da9876fcf07d70f71123c97f95588","cross_cats_sorted":["cs.CC","cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-02-17T11:07:14Z","title_canon_sha256":"2185870934a01ee73b1bf513432ce71751b36527976518b538015be25b1ec236"},"schema_version":"1.0","source":{"id":"2502.11674","kind":"arxiv","version":1}},"canonical_sha256":"bc4c7f0128876dce58aebd4eb6e5674e15ae87d2e584db431a0e4c7a0f4d2e1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc4c7f0128876dce58aebd4eb6e5674e15ae87d2e584db431a0e4c7a0f4d2e1b","first_computed_at":"2026-07-05T10:15:32.306825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:15:32.306825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2pS/CreUgw/eopQ0MUVjtE+IJL7+FH/stFBa6P59xVNV3fa7Ws9Tek/tzi1xbduJVYdhgX3vol4vjXUauhVzCg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:15:32.307394Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.11674","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3142271542bcf597d4f7cb895560743e61b7d35a51f7d0aa876b56311e2e8a95","sha256:55307a36cdb18ac69c4c1fbb5ded4e37a3f8e57a5a895b6751dfaa3dd119621a"],"state_sha256":"6c2d842a93f0e461aab440c57297c2eb2130b2fd663040d96c653b176d0e37fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XUeNIu40oDpiDwMcR8j5Uf/QpqBlvyzO+oLYtn0+qTvNXeSGpSB1oaWXYCjkF0qEcNODVw4hxKlVM7pERuyqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T22:30:45.960513Z","bundle_sha256":"59ce1a7f6f10f452ef8f200f7b9ad71283e57764d99295f34bddf276a45b6b14"}}