{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:EMHNWGTFSJMZEYCZPWQHAWHUES","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":"80135c64324d7438d3cb27d31624b7d4b506d5b6629f0037ed46610426efa28b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T10:53:53Z","title_canon_sha256":"f8b4f1f7d3278470e457360f846841a4f186654a99346c547e57fb072eb457f1"},"schema_version":"1.0","source":{"id":"2308.07063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07063","created_at":"2026-07-05T06:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07063v1","created_at":"2026-07-05T06:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07063","created_at":"2026-07-05T06:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"EMHNWGTFSJMZ","created_at":"2026-07-05T06:40:55Z"},{"alias_kind":"pith_short_16","alias_value":"EMHNWGTFSJMZEYCZ","created_at":"2026-07-05T06:40:55Z"},{"alias_kind":"pith_short_8","alias_value":"EMHNWGTF","created_at":"2026-07-05T06:40:55Z"}],"graph_snapshots":[{"event_id":"sha256:119cdb0f6294557c1366e6951888548f50ee1edd7ba42b4e3f46019c311167b4","target":"graph","created_at":"2026-07-05T06:40:55Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2308.07063/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The minimum and maximum cuts of an undirected edge-weighted graph are classic problems in graph theory. While the Min-Cut Problem can be solved in P, the Max-Cut Problem is NP-Complete. Exact and heuristic methods have been developed for solving them. For both problems, we introduce a natural extension in which cutting an edge induces a cost. Our goal is to find a cut that minimizes the sum of the cut weights but, at the same time, restricts its total cut cost to a given budget. We prove that both restricted problems are NPComplete and we also study some of its properties. Finally, we develop ","authors_text":"Jos\\'e L. Sainz-Pardo, Justo Puerto","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T10:53:53Z","title":"Budget-constrained cut problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07063","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:a3805fc3a723c4c842d94cc699cd38fd8b51356a1b64289c4c470d083e4ddb75","target":"record","created_at":"2026-07-05T06:40:55Z","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":"80135c64324d7438d3cb27d31624b7d4b506d5b6629f0037ed46610426efa28b","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T10:53:53Z","title_canon_sha256":"f8b4f1f7d3278470e457360f846841a4f186654a99346c547e57fb072eb457f1"},"schema_version":"1.0","source":{"id":"2308.07063","kind":"arxiv","version":1}},"canonical_sha256":"230edb1a6592599260597da07058f4249e24c20679965a3c349e7edb715d7342","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"230edb1a6592599260597da07058f4249e24c20679965a3c349e7edb715d7342","first_computed_at":"2026-07-05T06:40:55.593261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:40:55.593261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gv8suvXjy4IbTvXhH5IScP5PiMj1Ry3tj58eLaLV1DIJNabWNwLM7dkKDDLVXsm85lugRAtmwOUsGeXtBNR6Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T06:40:55.593685Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3805fc3a723c4c842d94cc699cd38fd8b51356a1b64289c4c470d083e4ddb75","sha256:119cdb0f6294557c1366e6951888548f50ee1edd7ba42b4e3f46019c311167b4"],"state_sha256":"1bae49d7353926410748438b1f8dad181e2385f11ce59d5f515e32db30fcf327"}