{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EMHNWGTFSJMZEYCZPWQHAWHUES","short_pith_number":"pith:EMHNWGTF","schema_version":"1.0","canonical_sha256":"230edb1a6592599260597da07058f4249e24c20679965a3c349e7edb715d7342","source":{"kind":"arxiv","id":"2308.07063","version":1},"attestation_state":"computed","paper":{"title":"Budget-constrained cut problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Jos\\'e L. Sainz-Pardo, Justo Puerto","submitted_at":"2023-08-14T10:53:53Z","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 "},"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":"2308.07063","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2023-08-14T10:53:53Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f8b4f1f7d3278470e457360f846841a4f186654a99346c547e57fb072eb457f1","abstract_canon_sha256":"80135c64324d7438d3cb27d31624b7d4b506d5b6629f0037ed46610426efa28b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:55.593685Z","signature_b64":"gv8suvXjy4IbTvXhH5IScP5PiMj1Ry3tj58eLaLV1DIJNabWNwLM7dkKDDLVXsm85lugRAtmwOUsGeXtBNR6Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"230edb1a6592599260597da07058f4249e24c20679965a3c349e7edb715d7342","last_reissued_at":"2026-07-05T06:40:55.593261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:55.593261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Budget-constrained cut problems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Jos\\'e L. Sainz-Pardo, Justo Puerto","submitted_at":"2023-08-14T10:53:53Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07063","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07063/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2308.07063","created_at":"2026-07-05T06:40:55.593329+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07063v1","created_at":"2026-07-05T06:40:55.593329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07063","created_at":"2026-07-05T06:40:55.593329+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMHNWGTFSJMZ","created_at":"2026-07-05T06:40:55.593329+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMHNWGTFSJMZEYCZ","created_at":"2026-07-05T06:40:55.593329+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMHNWGTF","created_at":"2026-07-05T06:40:55.593329+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/EMHNWGTFSJMZEYCZPWQHAWHUES","json":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES.json","graph_json":"https://pith.science/api/pith-number/EMHNWGTFSJMZEYCZPWQHAWHUES/graph.json","events_json":"https://pith.science/api/pith-number/EMHNWGTFSJMZEYCZPWQHAWHUES/events.json","paper":"https://pith.science/paper/EMHNWGTF"},"agent_actions":{"view_html":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES","download_json":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES.json","view_paper":"https://pith.science/paper/EMHNWGTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07063&json=true","fetch_graph":"https://pith.science/api/pith-number/EMHNWGTFSJMZEYCZPWQHAWHUES/graph.json","fetch_events":"https://pith.science/api/pith-number/EMHNWGTFSJMZEYCZPWQHAWHUES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES/action/storage_attestation","attest_author":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES/action/author_attestation","sign_citation":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES/action/citation_signature","submit_replication":"https://pith.science/pith/EMHNWGTFSJMZEYCZPWQHAWHUES/action/replication_record"}},"created_at":"2026-07-05T06:40:55.593329+00:00","updated_at":"2026-07-05T06:40:55.593329+00:00"}