{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LJVZS3LXB4L7ZH7FDY6MFK4FJU","short_pith_number":"pith:LJVZS3LX","schema_version":"1.0","canonical_sha256":"5a6b996d770f17fc9fe51e3cc2ab854d1318aecf55f9cfb215324bb280f4468c","source":{"kind":"arxiv","id":"2606.19473","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.19473","created_at":"2026-06-19T16:12:26.688453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.19473v1","created_at":"2026-06-19T16:12:26.688453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.19473","created_at":"2026-06-19T16:12:26.688453+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJVZS3LXB4L7","created_at":"2026-06-19T16:12:26.688453+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJVZS3LXB4L7ZH7F","created_at":"2026-06-19T16:12:26.688453+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJVZS3LX","created_at":"2026-06-19T16:12:26.688453+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/LJVZS3LXB4L7ZH7FDY6MFK4FJU","json":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU.json","graph_json":"https://pith.science/api/pith-number/LJVZS3LXB4L7ZH7FDY6MFK4FJU/graph.json","events_json":"https://pith.science/api/pith-number/LJVZS3LXB4L7ZH7FDY6MFK4FJU/events.json","paper":"https://pith.science/paper/LJVZS3LX"},"agent_actions":{"view_html":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU","download_json":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU.json","view_paper":"https://pith.science/paper/LJVZS3LX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.19473&json=true","fetch_graph":"https://pith.science/api/pith-number/LJVZS3LXB4L7ZH7FDY6MFK4FJU/graph.json","fetch_events":"https://pith.science/api/pith-number/LJVZS3LXB4L7ZH7FDY6MFK4FJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/action/storage_attestation","attest_author":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/action/author_attestation","sign_citation":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/action/citation_signature","submit_replication":"https://pith.science/pith/LJVZS3LXB4L7ZH7FDY6MFK4FJU/action/replication_record"}},"created_at":"2026-06-19T16:12:26.688453+00:00","updated_at":"2026-06-19T16:12:26.688453+00:00"}