{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GOLIGRVHNWHFFH42ULHXVKX34Z","short_pith_number":"pith:GOLIGRVH","schema_version":"1.0","canonical_sha256":"33968346a76d8e529f9aa2cf7aaafbe67ac566a6db69f32a2a9976487c99494d","source":{"kind":"arxiv","id":"1502.07714","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.07714","created_at":"2026-05-18T02:26:03.075324+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.07714v1","created_at":"2026-05-18T02:26:03.075324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.07714","created_at":"2026-05-18T02:26:03.075324+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOLIGRVHNWHF","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOLIGRVHNWHFFH42","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOLIGRVH","created_at":"2026-05-18T12:29:22.688609+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/GOLIGRVHNWHFFH42ULHXVKX34Z","json":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z.json","graph_json":"https://pith.science/api/pith-number/GOLIGRVHNWHFFH42ULHXVKX34Z/graph.json","events_json":"https://pith.science/api/pith-number/GOLIGRVHNWHFFH42ULHXVKX34Z/events.json","paper":"https://pith.science/paper/GOLIGRVH"},"agent_actions":{"view_html":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z","download_json":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z.json","view_paper":"https://pith.science/paper/GOLIGRVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.07714&json=true","fetch_graph":"https://pith.science/api/pith-number/GOLIGRVHNWHFFH42ULHXVKX34Z/graph.json","fetch_events":"https://pith.science/api/pith-number/GOLIGRVHNWHFFH42ULHXVKX34Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/action/storage_attestation","attest_author":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/action/author_attestation","sign_citation":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/action/citation_signature","submit_replication":"https://pith.science/pith/GOLIGRVHNWHFFH42ULHXVKX34Z/action/replication_record"}},"created_at":"2026-05-18T02:26:03.075324+00:00","updated_at":"2026-05-18T02:26:03.075324+00:00"}