{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LJVZS3LXB4L7ZH7FDY6MFK4FJU","short_pith_number":"pith:LJVZS3LX","canonical_record":{"source":{"id":"2606.19473","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T18:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"d847133e2029e4215a901748089a913455c8cde8967e0e1fcddd6aef0acb3612","abstract_canon_sha256":"429ebcfc7234b900aac3c2a38861b32321193d8d39237c4e6de4b44896b449ce"},"schema_version":"1.0"},"canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","source":{"kind":"arxiv","id":"2606.19473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19473","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19473v1","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19473","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"LJVZS3LXB4L7","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_16","alias_value":"LJVZS3LXB4L7ZH7F","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_8","alias_value":"LJVZS3LX","created_at":"2026-06-19T16:12:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LJVZS3LXB4L7ZH7FDY6MFK4FJU","target":"record","payload":{"canonical_record":{"source":{"id":"2606.19473","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T18:05:33Z","cross_cats_sorted":[],"title_canon_sha256":"d847133e2029e4215a901748089a913455c8cde8967e0e1fcddd6aef0acb3612","abstract_canon_sha256":"429ebcfc7234b900aac3c2a38861b32321193d8d39237c4e6de4b44896b449ce"},"schema_version":"1.0"},"canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:26.688793Z","signature_b64":"+WixJugg8lWRGVoEbZ88UluzKUEfiiPGClIf967QQJgiqK29f7Wv5yOqCRUN3uF5zpLbfJgb0Z7EmWee2WebBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","last_reissued_at":"2026-06-19T16:12:26.688385Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:26.688385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.19473","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-06-19T16:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HeQtcBzH8n+1/Xh8oMSo8luZzWIqo0byBE3iEpBewRLN2pQp18GKp0JuAkZOYZ+kTQJ+XYavp/FMqFS+TRDCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:44:17.126162Z"},"content_sha256":"e8eb5463189f60af78f6caa5d3997456e35cbbb47086d6f9ae8ebd1f7e71a5ee","schema_version":"1.0","event_id":"sha256:e8eb5463189f60af78f6caa5d3997456e35cbbb47086d6f9ae8ebd1f7e71a5ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LJVZS3LXB4L7ZH7FDY6MFK4FJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vertex cuts and median decompositions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bobby Miraftab, Joseph P. MacManus","submitted_at":"2026-06-17T18:05:33Z","abstract_excerpt":"Median decompositions were introduced by Stavropoulos in 2015 as a generalisation of tree decompositions. In this paper, we further develop and exposit this theory as a tool in structural graph theory to study systems of vertex separations.\n  Generalising the well-known fact that nested systems of vertex separations produce tree decompositions of a graph over the structure tree, we describe how a (not necessarily nested) system of separations produces a median decomposition. The median graph in this decomposition is the `dual median graph' constructed by Sageev. If the system of cuts is nested"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19473","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/2606.19473/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-06-19T16:12:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yh1u0nsK1uWPmAESivuSpUjvXScIlL4j7CytCgEzgTdDO3uNJDipnIT26B9GuUa8BdD9opcq+YP9krx1u411BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:44:17.126571Z"},"content_sha256":"6537b01f91787189a1187cf29806953859a041dfc1d5e4f5d0e46a7704f73212","schema_version":"1.0","event_id":"sha256:6537b01f91787189a1187cf29806953859a041dfc1d5e4f5d0e46a7704f73212"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/bundle.json","state_url":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/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-06-30T23:44:17Z","links":{"resolver":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU","bundle":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/bundle.json","state":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LJVZS3LXB4L7ZH7FDY6MFK4FJU","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":"429ebcfc7234b900aac3c2a38861b32321193d8d39237c4e6de4b44896b449ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T18:05:33Z","title_canon_sha256":"d847133e2029e4215a901748089a913455c8cde8967e0e1fcddd6aef0acb3612"},"schema_version":"1.0","source":{"id":"2606.19473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.19473","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"arxiv_version","alias_value":"2606.19473v1","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19473","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_12","alias_value":"LJVZS3LXB4L7","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_16","alias_value":"LJVZS3LXB4L7ZH7F","created_at":"2026-06-19T16:12:26Z"},{"alias_kind":"pith_short_8","alias_value":"LJVZS3LX","created_at":"2026-06-19T16:12:26Z"}],"graph_snapshots":[{"event_id":"sha256:6537b01f91787189a1187cf29806953859a041dfc1d5e4f5d0e46a7704f73212","target":"graph","created_at":"2026-06-19T16:12:26Z","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/2606.19473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Median decompositions were introduced by Stavropoulos in 2015 as a generalisation of tree decompositions. In this paper, we further develop and exposit this theory as a tool in structural graph theory to study systems of vertex separations.\n  Generalising the well-known fact that nested systems of vertex separations produce tree decompositions of a graph over the structure tree, we describe how a (not necessarily nested) system of separations produces a median decomposition. The median graph in this decomposition is the `dual median graph' constructed by Sageev. If the system of cuts is nested","authors_text":"Bobby Miraftab, Joseph P. MacManus","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T18:05:33Z","title":"Vertex cuts and median decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.19473","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:e8eb5463189f60af78f6caa5d3997456e35cbbb47086d6f9ae8ebd1f7e71a5ee","target":"record","created_at":"2026-06-19T16:12:26Z","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":"429ebcfc7234b900aac3c2a38861b32321193d8d39237c4e6de4b44896b449ce","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-17T18:05:33Z","title_canon_sha256":"d847133e2029e4215a901748089a913455c8cde8967e0e1fcddd6aef0acb3612"},"schema_version":"1.0","source":{"id":"2606.19473","kind":"arxiv","version":1}},"canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","first_computed_at":"2026-06-19T16:12:26.688385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:12:26.688385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+WixJugg8lWRGVoEbZ88UluzKUEfiiPGClIf967QQJgiqK29f7Wv5yOqCRUN3uF5zpLbfJgb0Z7EmWee2WebBw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:12:26.688793Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.19473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8eb5463189f60af78f6caa5d3997456e35cbbb47086d6f9ae8ebd1f7e71a5ee","sha256:6537b01f91787189a1187cf29806953859a041dfc1d5e4f5d0e46a7704f73212"],"state_sha256":"d0ccfcc0deed852b4201030f4b2ef768c7ab53d958bafc9698944aae422e15c6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPhOYKcNYzBQi9HrDjBZNxuQoNxWpBgLRTyFivaBG1mgWs2mbONx603jNTDF0wUyuKJrLDQGaMzK8Xi39B49AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:44:17.128546Z","bundle_sha256":"acd00e373e3d14f54fdff972d1fc0bf9e76a80970a37792e58f568cce920433e"}}