{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F2RNYOAPHYDR2DKHOI52JISYZI","short_pith_number":"pith:F2RNYOAP","schema_version":"1.0","canonical_sha256":"2ea2dc380f3e071d0d47723ba4a258ca19bdcfac9765c65f924f42baa534a2af","source":{"kind":"arxiv","id":"2407.08158","version":1},"attestation_state":"computed","paper":{"title":"Topology of Cut Complexes II","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, Sheila Sundaram","submitted_at":"2024-07-11T03:25:38Z","abstract_excerpt":"We continue the study of the $k$-cut complex $\\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\\'c Milutinovi\\'c, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2): 1630--1675 (2024)].\n  We give explicit formulas for the $f$- and $h$-polynomials of the cut complex $\\Delta_k(G_1+G_2) $ of the disjoint union of two graphs $G_1$ and $G_2$, and for the homology representation of $\\Delta_k(K_m+K_n)$.\n  We also study the cut complex of the squared path and the grid graph. Our techniques include tools from combinatorial topology, "},"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":"2407.08158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-07-11T03:25:38Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"3a52c08f80c985e98ef3a145232ff4e7e37e3dd18f2a17b1d1f92225d2166f02","abstract_canon_sha256":"0ab8e1f44ea86565d18c8bfc85e38ea10e5a04818bfed863b30834ad25059c31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:00.691973Z","signature_b64":"XCA/QBonos+Di1vqQnKQoN4SkAEtzKeASKpf57YLSgD7SYrXgSd4NJnkgiOsiTw0Q0WS0neHEGw16G8NiAKsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ea2dc380f3e071d0d47723ba4a258ca19bdcfac9765c65f924f42baa534a2af","last_reissued_at":"2026-07-05T12:06:00.691406Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:00.691406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topology of Cut Complexes II","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, Sheila Sundaram","submitted_at":"2024-07-11T03:25:38Z","abstract_excerpt":"We continue the study of the $k$-cut complex $\\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\\'c Milutinovi\\'c, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2): 1630--1675 (2024)].\n  We give explicit formulas for the $f$- and $h$-polynomials of the cut complex $\\Delta_k(G_1+G_2) $ of the disjoint union of two graphs $G_1$ and $G_2$, and for the homology representation of $\\Delta_k(K_m+K_n)$.\n  We also study the cut complex of the squared path and the grid graph. Our techniques include tools from combinatorial topology, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08158","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/2407.08158/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":"2407.08158","created_at":"2026-07-05T12:06:00.691475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08158v1","created_at":"2026-07-05T12:06:00.691475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08158","created_at":"2026-07-05T12:06:00.691475+00:00"},{"alias_kind":"pith_short_12","alias_value":"F2RNYOAPHYDR","created_at":"2026-07-05T12:06:00.691475+00:00"},{"alias_kind":"pith_short_16","alias_value":"F2RNYOAPHYDR2DKH","created_at":"2026-07-05T12:06:00.691475+00:00"},{"alias_kind":"pith_short_8","alias_value":"F2RNYOAP","created_at":"2026-07-05T12:06:00.691475+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/F2RNYOAPHYDR2DKHOI52JISYZI","json":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI.json","graph_json":"https://pith.science/api/pith-number/F2RNYOAPHYDR2DKHOI52JISYZI/graph.json","events_json":"https://pith.science/api/pith-number/F2RNYOAPHYDR2DKHOI52JISYZI/events.json","paper":"https://pith.science/paper/F2RNYOAP"},"agent_actions":{"view_html":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI","download_json":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI.json","view_paper":"https://pith.science/paper/F2RNYOAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08158&json=true","fetch_graph":"https://pith.science/api/pith-number/F2RNYOAPHYDR2DKHOI52JISYZI/graph.json","fetch_events":"https://pith.science/api/pith-number/F2RNYOAPHYDR2DKHOI52JISYZI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI/action/storage_attestation","attest_author":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI/action/author_attestation","sign_citation":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI/action/citation_signature","submit_replication":"https://pith.science/pith/F2RNYOAPHYDR2DKHOI52JISYZI/action/replication_record"}},"created_at":"2026-07-05T12:06:00.691475+00:00","updated_at":"2026-07-05T12:06:00.691475+00:00"}