{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ECF6NHBWEYF2N2JAQBT7TNH4C4","short_pith_number":"pith:ECF6NHBW","schema_version":"1.0","canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","source":{"kind":"arxiv","id":"1805.00858","version":1},"attestation_state":"computed","paper":{"title":"Maximum cuts in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Luerbio Faria, Rubens Sucupira, Sulamita Klein, U\\'everton S. Souza","submitted_at":"2018-05-02T15:08:53Z","abstract_excerpt":"The input of the Maximum Colored Cut problem consists of a graph $G=(V,E)$ with an edge-coloring $c:E\\to \\{1,2,3,\\ldots , p\\}$ and a positive integer $k$, and the question is whether $G$ has a nontrivial edge cut using at least $k$ colors. The Colorful Cut problem has the same input but asks for a nontrivial edge cut using all $p$ colors. Unlike what happens for the classical Maximum Cut problem, we prove that both problems are NP-complete even on complete, planar, or bounded treewidth graphs. Furthermore, we prove that Colorful Cut is NP-complete even when each color class induces a clique of"},"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":"1805.00858","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-02T15:08:53Z","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"title_canon_sha256":"97f09c8d66535cfca1e0b1a28ce0de64ca44b54d44d3fbf13b085af87e4674f1","abstract_canon_sha256":"472353351812b8c3c96d5767cdc0c767871969c81c76de9d6a0993973b793d11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:57.463582Z","signature_b64":"zGYzrWEvJqRNPhZVibj1KDQ/Ueh41GaPjLeI/msBT3lucnuX/Z2U/Ir2NeEovb6Ul3b6doTruwmuoMuGkS3wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","last_reissued_at":"2026-05-18T00:16:57.462850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:57.462850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum cuts in edge-colored graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignasi Sau, Luerbio Faria, Rubens Sucupira, Sulamita Klein, U\\'everton S. Souza","submitted_at":"2018-05-02T15:08:53Z","abstract_excerpt":"The input of the Maximum Colored Cut problem consists of a graph $G=(V,E)$ with an edge-coloring $c:E\\to \\{1,2,3,\\ldots , p\\}$ and a positive integer $k$, and the question is whether $G$ has a nontrivial edge cut using at least $k$ colors. The Colorful Cut problem has the same input but asks for a nontrivial edge cut using all $p$ colors. Unlike what happens for the classical Maximum Cut problem, we prove that both problems are NP-complete even on complete, planar, or bounded treewidth graphs. Furthermore, we prove that Colorful Cut is NP-complete even when each color class induces a clique of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00858","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":"1805.00858","created_at":"2026-05-18T00:16:57.462959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00858v1","created_at":"2026-05-18T00:16:57.462959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00858","created_at":"2026-05-18T00:16:57.462959+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECF6NHBWEYF2","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECF6NHBWEYF2N2JA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECF6NHBW","created_at":"2026-05-18T12:32:22.470017+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/ECF6NHBWEYF2N2JAQBT7TNH4C4","json":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4.json","graph_json":"https://pith.science/api/pith-number/ECF6NHBWEYF2N2JAQBT7TNH4C4/graph.json","events_json":"https://pith.science/api/pith-number/ECF6NHBWEYF2N2JAQBT7TNH4C4/events.json","paper":"https://pith.science/paper/ECF6NHBW"},"agent_actions":{"view_html":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4","download_json":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4.json","view_paper":"https://pith.science/paper/ECF6NHBW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00858&json=true","fetch_graph":"https://pith.science/api/pith-number/ECF6NHBWEYF2N2JAQBT7TNH4C4/graph.json","fetch_events":"https://pith.science/api/pith-number/ECF6NHBWEYF2N2JAQBT7TNH4C4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/action/storage_attestation","attest_author":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/action/author_attestation","sign_citation":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/action/citation_signature","submit_replication":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/action/replication_record"}},"created_at":"2026-05-18T00:16:57.462959+00:00","updated_at":"2026-05-18T00:16:57.462959+00:00"}