{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GOLIGRVHNWHFFH42ULHXVKX34Z","short_pith_number":"pith:GOLIGRVH","canonical_record":{"source":{"id":"1502.07714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T20:23:35Z","cross_cats_sorted":[],"title_canon_sha256":"c8498b2dc913ae4d8a1a2c12db7b651b3f15410f7741ac0d4130404e3363f9a2","abstract_canon_sha256":"7c0d4dd4a8528f29917253fa089a7a2bf654718111baad0cbf8873fd68922efb"},"schema_version":"1.0"},"canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","source":{"kind":"arxiv","id":"1502.07714","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07714","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07714v1","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07714","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"GOLIGRVHNWHF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOLIGRVHNWHFFH42","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOLIGRVH","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GOLIGRVHNWHFFH42ULHXVKX34Z","target":"record","payload":{"canonical_record":{"source":{"id":"1502.07714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T20:23:35Z","cross_cats_sorted":[],"title_canon_sha256":"c8498b2dc913ae4d8a1a2c12db7b651b3f15410f7741ac0d4130404e3363f9a2","abstract_canon_sha256":"7c0d4dd4a8528f29917253fa089a7a2bf654718111baad0cbf8873fd68922efb"},"schema_version":"1.0"},"canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:03.075776Z","signature_b64":"Js0gq4JBi6wAVqqYnRIk8QPAtsO3ALgkSLb7hs3xONsKMBkjDOVoQaMm/i3o9enRh0sKvP1pgWwFduyT/KT0Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","last_reissued_at":"2026-05-18T02:26:03.075228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:03.075228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.07714","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-18T02:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTTi567c0KfQJKgxlP2oXrYWaxwxYeqeUFE3IAJqv6ybAcZrH2sA7ylhRiCVVP/FFnXgqgSX2IOi/QydbPxECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:22:33.443540Z"},"content_sha256":"e7fdaa8ed6202c9b40b38c68b2d6d9e1f4db63f8c68602ccb711f0984a3afa11","schema_version":"1.0","event_id":"sha256:e7fdaa8ed6202c9b40b38c68b2d6d9e1f4db63f8c68602ccb711f0984a3afa11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GOLIGRVHNWHFFH42ULHXVKX34Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cut dominants and forbidden minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kanstantsin Pashkovich, Michele Conforti, Samuel Fiorini","submitted_at":"2015-02-26T20:23:35Z","abstract_excerpt":"The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function over the cut dominant is equivalent to finding a minimum weight cut in the graph. We give a forbidden-minor characterization of the graphs whose cut dominant can be defined by inequalities with integer coefficients and right-hand side at most 2. Our result is related to the forbidden-minor characterization of TSP-perfect graphs by Fonlupt and Naddef (Math. Prog., 1992). We prove that our result implies theirs, with a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07714","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-18T02:26:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LpcqFxk6JFCZtk3XnV4Rk0yBUtyL+DAOLMO6+snbDnrUAOzJeLhhsrPuPaEM9YZ7KvyNv7etIYgrwyDV+PvsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T17:22:33.444212Z"},"content_sha256":"c2d16dfd7cfd1780cd8661f2725520dc0c7134b0751cda60c1825b05d2f124d4","schema_version":"1.0","event_id":"sha256:c2d16dfd7cfd1780cd8661f2725520dc0c7134b0751cda60c1825b05d2f124d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/bundle.json","state_url":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/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-05-24T17:22:33Z","links":{"resolver":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z","bundle":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/bundle.json","state":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GOLIGRVHNWHFFH42ULHXVKX34Z","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":"7c0d4dd4a8528f29917253fa089a7a2bf654718111baad0cbf8873fd68922efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T20:23:35Z","title_canon_sha256":"c8498b2dc913ae4d8a1a2c12db7b651b3f15410f7741ac0d4130404e3363f9a2"},"schema_version":"1.0","source":{"id":"1502.07714","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.07714","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"arxiv_version","alias_value":"1502.07714v1","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07714","created_at":"2026-05-18T02:26:03Z"},{"alias_kind":"pith_short_12","alias_value":"GOLIGRVHNWHF","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GOLIGRVHNWHFFH42","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GOLIGRVH","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:c2d16dfd7cfd1780cd8661f2725520dc0c7134b0751cda60c1825b05d2f124d4","target":"graph","created_at":"2026-05-18T02:26:03Z","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 dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function over the cut dominant is equivalent to finding a minimum weight cut in the graph. We give a forbidden-minor characterization of the graphs whose cut dominant can be defined by inequalities with integer coefficients and right-hand side at most 2. Our result is related to the forbidden-minor characterization of TSP-perfect graphs by Fonlupt and Naddef (Math. Prog., 1992). We prove that our result implies theirs, with a s","authors_text":"Kanstantsin Pashkovich, Michele Conforti, Samuel Fiorini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T20:23:35Z","title":"Cut dominants and forbidden minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.07714","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:e7fdaa8ed6202c9b40b38c68b2d6d9e1f4db63f8c68602ccb711f0984a3afa11","target":"record","created_at":"2026-05-18T02:26:03Z","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":"7c0d4dd4a8528f29917253fa089a7a2bf654718111baad0cbf8873fd68922efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-26T20:23:35Z","title_canon_sha256":"c8498b2dc913ae4d8a1a2c12db7b651b3f15410f7741ac0d4130404e3363f9a2"},"schema_version":"1.0","source":{"id":"1502.07714","kind":"arxiv","version":1}},"canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","first_computed_at":"2026-05-18T02:26:03.075228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:03.075228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Js0gq4JBi6wAVqqYnRIk8QPAtsO3ALgkSLb7hs3xONsKMBkjDOVoQaMm/i3o9enRh0sKvP1pgWwFduyT/KT0Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:03.075776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.07714","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7fdaa8ed6202c9b40b38c68b2d6d9e1f4db63f8c68602ccb711f0984a3afa11","sha256:c2d16dfd7cfd1780cd8661f2725520dc0c7134b0751cda60c1825b05d2f124d4"],"state_sha256":"5324da3c022460df8c38d5cf32508779135dbacb2698f7ff276a160119e0ad15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zzS0UQwtap2zeA5rf/N+4Wc/DNZViQ3C7qT5Sm6Pw0UxsdJtUr7EJ9xr6aWCKtxnXj6Dn3j2XyrTeUp7f398Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T17:22:33.447863Z","bundle_sha256":"393a19aec06bda59bbb378573eff8f77d8e2027e9e08d0f592460418cb9e399b"}}