{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SAO6AIUTJAA622JTE3F6WUWKOD","short_pith_number":"pith:SAO6AIUT","schema_version":"1.0","canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","source":{"kind":"arxiv","id":"1903.01817","version":1},"attestation_state":"computed","paper":{"title":"Cut Polytopes of Minor-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Nover, Markus Chimani, Martina Juhnke-Kubitzke, Tim R\\\"omer","submitted_at":"2019-03-05T13:38:36Z","abstract_excerpt":"The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an algorithm solving MaxCut on those graphs, which only requires the running time of planar MaxCut. Moreover, starting a systematic geometric study of cut polytopes, we classify graphs admitting a simple or simplicial cut polytope."},"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":"1903.01817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T13:38:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8bf5102a9f68ab3e13856af63b0dad0c8665c40429e05fdbc0dc37bd928c79dc","abstract_canon_sha256":"998e71237523377d35c92cb2ca797cb1e6d7d9beaa58a38c5a3ddf0d86e81e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:59.679631Z","signature_b64":"5sGZGcYBeJKJpUXi0Wo251V27OuQFzfLgXcQNzHypEg0QA+t4oXyn7KzUmisH2UniLZKWBWHACytflsddXT+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","last_reissued_at":"2026-05-17T23:51:59.679201Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:59.679201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cut Polytopes of Minor-free Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Alexander Nover, Markus Chimani, Martina Juhnke-Kubitzke, Tim R\\\"omer","submitted_at":"2019-03-05T13:38:36Z","abstract_excerpt":"The cut polytope of a graph $G$ is the convex hull of the indicator vectors of all cuts in $G$ and is closely related to the MaxCut problem. We give the facet-description of cut polytopes of $K_{3,3}$-minor-free graphs and introduce an algorithm solving MaxCut on those graphs, which only requires the running time of planar MaxCut. Moreover, starting a systematic geometric study of cut polytopes, we classify graphs admitting a simple or simplicial cut polytope."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01817","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":""},"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":"1903.01817","created_at":"2026-05-17T23:51:59.679270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.01817v1","created_at":"2026-05-17T23:51:59.679270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01817","created_at":"2026-05-17T23:51:59.679270+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAO6AIUTJAA6","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAO6AIUTJAA622JT","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAO6AIUT","created_at":"2026-05-18T12:33:27.125529+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/SAO6AIUTJAA622JTE3F6WUWKOD","json":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD.json","graph_json":"https://pith.science/api/pith-number/SAO6AIUTJAA622JTE3F6WUWKOD/graph.json","events_json":"https://pith.science/api/pith-number/SAO6AIUTJAA622JTE3F6WUWKOD/events.json","paper":"https://pith.science/paper/SAO6AIUT"},"agent_actions":{"view_html":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD","download_json":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD.json","view_paper":"https://pith.science/paper/SAO6AIUT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.01817&json=true","fetch_graph":"https://pith.science/api/pith-number/SAO6AIUTJAA622JTE3F6WUWKOD/graph.json","fetch_events":"https://pith.science/api/pith-number/SAO6AIUTJAA622JTE3F6WUWKOD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/action/storage_attestation","attest_author":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/action/author_attestation","sign_citation":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/action/citation_signature","submit_replication":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/action/replication_record"}},"created_at":"2026-05-17T23:51:59.679270+00:00","updated_at":"2026-05-17T23:51:59.679270+00:00"}