{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:726VKMJIFUQ7IIY3VTNDAFRFCU","short_pith_number":"pith:726VKMJI","canonical_record":{"source":{"id":"2304.13675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-26T16:43:39Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"e71ebd095ce6959f6778b28483043b3c345d3d8c0ab084d42d8b3a84e13116e3","abstract_canon_sha256":"f4181a51ffc5d3c508520864719c6ed6027473f58ae9cd714d93c820de3fed90"},"schema_version":"1.0"},"canonical_sha256":"febd5531282d21f4231bacda3016251511625e54e2d346e1b74f562951f5a455","source":{"kind":"arxiv","id":"2304.13675","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.13675","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2304.13675v2","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13675","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"726VKMJIFUQ7","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"726VKMJIFUQ7IIY3","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"726VKMJI","created_at":"2026-07-05T12:05:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:726VKMJIFUQ7IIY3VTNDAFRFCU","target":"record","payload":{"canonical_record":{"source":{"id":"2304.13675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-26T16:43:39Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"e71ebd095ce6959f6778b28483043b3c345d3d8c0ab084d42d8b3a84e13116e3","abstract_canon_sha256":"f4181a51ffc5d3c508520864719c6ed6027473f58ae9cd714d93c820de3fed90"},"schema_version":"1.0"},"canonical_sha256":"febd5531282d21f4231bacda3016251511625e54e2d346e1b74f562951f5a455","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:05:57.219591Z","signature_b64":"/x8hPPrRB3VMa5EXjVkoMu21EkfkxcxwrLagqK6GyX54gN25m0A6TMqG5452YdtWdDpiGwkZr8u4MF+o3oaXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"febd5531282d21f4231bacda3016251511625e54e2d346e1b74f562951f5a455","last_reissued_at":"2026-07-05T12:05:57.219161Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:05:57.219161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2304.13675","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-05T12:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRXvBtf2DzXlVQcFtEi9UFWgmHVE+ea46Bs4eGLAeymLo+xfPUjuCRQeABMv3Bp5Eyb69zRt7MQn5x3GXe1uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T21:39:37.585082Z"},"content_sha256":"99588dbf2f51c088231f6fe9c350de4915c964a0f654e45f1d25ac9a5625f869","schema_version":"1.0","event_id":"sha256:99588dbf2f51c088231f6fe9c350de4915c964a0f654e45f1d25ac9a5625f869"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:726VKMJIFUQ7IIY3VTNDAFRFCU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Topology of Cut Complexes of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"math.CO","authors_text":"Lei Xue, Margaret Bayer, Marija Jeli\\'c Milutinovi\\'c, Mark Denker, Rowan Rowlands, Sheila Sundaram","submitted_at":"2023-04-26T16:43:39Z","abstract_excerpt":"We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a graph complex studied by Fr\\\"oberg (1990), and Eagon and Reiner (1998). We describe the effect of various graph operations on the cut complex, and study its shellability, homotopy type and homology for various families of graphs, including trees, cycles, complete multipartite graphs, and the prism $K_n \\times K_2$, using techniques from algebraic topology, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13675","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/2304.13675/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-05T12:05:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KTd7g24R0IuHHvdqB/uV/TvxQFA8DPEP3aHh6cyvfJos1q7H3bkB3Sq7MYiYfRbsdT8tT5n+pAQm8s6DXchqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-15T21:39:37.585494Z"},"content_sha256":"db178ec93bfa64eae3598e8725333267fe6cea48cb22393578d3cdfc678bdb64","schema_version":"1.0","event_id":"sha256:db178ec93bfa64eae3598e8725333267fe6cea48cb22393578d3cdfc678bdb64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/bundle.json","state_url":"https://pith.science/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/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-07-15T21:39:37Z","links":{"resolver":"https://pith.science/pith/726VKMJIFUQ7IIY3VTNDAFRFCU","bundle":"https://pith.science/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/bundle.json","state":"https://pith.science/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/726VKMJIFUQ7IIY3VTNDAFRFCU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:726VKMJIFUQ7IIY3VTNDAFRFCU","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":"f4181a51ffc5d3c508520864719c6ed6027473f58ae9cd714d93c820de3fed90","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-26T16:43:39Z","title_canon_sha256":"e71ebd095ce6959f6778b28483043b3c345d3d8c0ab084d42d8b3a84e13116e3"},"schema_version":"1.0","source":{"id":"2304.13675","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.13675","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"arxiv_version","alias_value":"2304.13675v2","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.13675","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_12","alias_value":"726VKMJIFUQ7","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_16","alias_value":"726VKMJIFUQ7IIY3","created_at":"2026-07-05T12:05:57Z"},{"alias_kind":"pith_short_8","alias_value":"726VKMJI","created_at":"2026-07-05T12:05:57Z"}],"graph_snapshots":[{"event_id":"sha256:db178ec93bfa64eae3598e8725333267fe6cea48cb22393578d3cdfc678bdb64","target":"graph","created_at":"2026-07-05T12:05:57Z","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/2304.13675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a graph complex studied by Fr\\\"oberg (1990), and Eagon and Reiner (1998). We describe the effect of various graph operations on the cut complex, and study its shellability, homotopy type and homology for various families of graphs, including trees, cycles, complete multipartite graphs, and the prism $K_n \\times K_2$, using techniques from algebraic topology, ","authors_text":"Lei Xue, Margaret Bayer, Marija Jeli\\'c Milutinovi\\'c, Mark Denker, Rowan Rowlands, Sheila Sundaram","cross_cats":["math.AT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-26T16:43:39Z","title":"Topology of Cut Complexes of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.13675","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:99588dbf2f51c088231f6fe9c350de4915c964a0f654e45f1d25ac9a5625f869","target":"record","created_at":"2026-07-05T12:05:57Z","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":"f4181a51ffc5d3c508520864719c6ed6027473f58ae9cd714d93c820de3fed90","cross_cats_sorted":["math.AT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-26T16:43:39Z","title_canon_sha256":"e71ebd095ce6959f6778b28483043b3c345d3d8c0ab084d42d8b3a84e13116e3"},"schema_version":"1.0","source":{"id":"2304.13675","kind":"arxiv","version":2}},"canonical_sha256":"febd5531282d21f4231bacda3016251511625e54e2d346e1b74f562951f5a455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"febd5531282d21f4231bacda3016251511625e54e2d346e1b74f562951f5a455","first_computed_at":"2026-07-05T12:05:57.219161Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:05:57.219161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/x8hPPrRB3VMa5EXjVkoMu21EkfkxcxwrLagqK6GyX54gN25m0A6TMqG5452YdtWdDpiGwkZr8u4MF+o3oaXAg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:05:57.219591Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.13675","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99588dbf2f51c088231f6fe9c350de4915c964a0f654e45f1d25ac9a5625f869","sha256:db178ec93bfa64eae3598e8725333267fe6cea48cb22393578d3cdfc678bdb64"],"state_sha256":"6b1a34d28a573b0637c773af511c724f2ccd0cdb99f01203c4994c8cac658c33"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YR3XQTeiGYO+xQR2qRgDjQkAobRRuQZWKEFoDVnOBr4bOImAyWeC3cmIouXmTzfH9iR6ygSLGvLpfp65FGglBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-15T21:39:37.587635Z","bundle_sha256":"865b4543c86edb2fc591c6ac6ce3ccefa793af35be6ce77d646be538012221f5"}}