{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SAO6AIUTJAA622JTE3F6WUWKOD","short_pith_number":"pith:SAO6AIUT","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"},"canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","source":{"kind":"arxiv","id":"1903.01817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01817","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01817v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01817","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"SAO6AIUTJAA6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SAO6AIUTJAA622JT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SAO6AIUT","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SAO6AIUTJAA622JTE3F6WUWKOD","target":"record","payload":{"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"},"canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","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"},"source_kind":"arxiv","source_id":"1903.01817","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-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9m8U2b3khqhG0z0GPk6tJg3iGB9mGZZiO+l709CGKGqOxrFnQQevqM+0v6UdiuamldCAu/CuieX0cQLCIoJxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:11:09.116878Z"},"content_sha256":"de12fc9b4a0883cb0cbabea15df43b4cc67680fa49e32d3865ae92fd369eaaa8","schema_version":"1.0","event_id":"sha256:de12fc9b4a0883cb0cbabea15df43b4cc67680fa49e32d3865ae92fd369eaaa8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SAO6AIUTJAA622JTE3F6WUWKOD","target":"graph","payload":{"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"},"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-05-17T23:51:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJ3lwPio9/LPud6QwcWuBoQJoJ9RLS+KbaUHWTC6oINSLPFrwgAmRNnLw+7Oo+Bld9FpS4QKY2fCkD4zVMB7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:11:09.117211Z"},"content_sha256":"5725672693a77fa9cc113851e4e0eb4684d1c7f7dcbc3d0f8beeccd5e6491f47","schema_version":"1.0","event_id":"sha256:5725672693a77fa9cc113851e4e0eb4684d1c7f7dcbc3d0f8beeccd5e6491f47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/bundle.json","state_url":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAO6AIUTJAA622JTE3F6WUWKOD/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-08T23:11:09Z","links":{"resolver":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD","bundle":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/bundle.json","state":"https://pith.science/pith/SAO6AIUTJAA622JTE3F6WUWKOD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAO6AIUTJAA622JTE3F6WUWKOD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SAO6AIUTJAA622JTE3F6WUWKOD","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":"998e71237523377d35c92cb2ca797cb1e6d7d9beaa58a38c5a3ddf0d86e81e10","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T13:38:36Z","title_canon_sha256":"8bf5102a9f68ab3e13856af63b0dad0c8665c40429e05fdbc0dc37bd928c79dc"},"schema_version":"1.0","source":{"id":"1903.01817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01817","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01817v1","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01817","created_at":"2026-05-17T23:51:59Z"},{"alias_kind":"pith_short_12","alias_value":"SAO6AIUTJAA6","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SAO6AIUTJAA622JT","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SAO6AIUT","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5725672693a77fa9cc113851e4e0eb4684d1c7f7dcbc3d0f8beeccd5e6491f47","target":"graph","created_at":"2026-05-17T23:51:59Z","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"},"paper":{"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.","authors_text":"Alexander Nover, Markus Chimani, Martina Juhnke-Kubitzke, Tim R\\\"omer","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T13:38:36Z","title":"Cut Polytopes of Minor-free Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01817","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:de12fc9b4a0883cb0cbabea15df43b4cc67680fa49e32d3865ae92fd369eaaa8","target":"record","created_at":"2026-05-17T23:51:59Z","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":"998e71237523377d35c92cb2ca797cb1e6d7d9beaa58a38c5a3ddf0d86e81e10","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-05T13:38:36Z","title_canon_sha256":"8bf5102a9f68ab3e13856af63b0dad0c8665c40429e05fdbc0dc37bd928c79dc"},"schema_version":"1.0","source":{"id":"1903.01817","kind":"arxiv","version":1}},"canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"901de022934801ed693326cbeb52ca70f2456fdea65efd947f7a8064368af402","first_computed_at":"2026-05-17T23:51:59.679201Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:59.679201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5sGZGcYBeJKJpUXi0Wo251V27OuQFzfLgXcQNzHypEg0QA+t4oXyn7KzUmisH2UniLZKWBWHACytflsddXT+CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:59.679631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de12fc9b4a0883cb0cbabea15df43b4cc67680fa49e32d3865ae92fd369eaaa8","sha256:5725672693a77fa9cc113851e4e0eb4684d1c7f7dcbc3d0f8beeccd5e6491f47"],"state_sha256":"1a756797e0767fd34fe9befe65df64b7ca3a120fe754e679bf02ec548d2ab8a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WhoOJt+lghhs6MXTIT19NG1ZBDkRpbsN77t34Y4MpIMliilpKifYHF+XIEqTW3gmCrUpv9y3MTpfQsGn4nOlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:11:09.119014Z","bundle_sha256":"87ef0ac0f8e234c81f6bdfc08e253602c2c1a5aefa6b3219ea38eb50c6ab1e54"}}