{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ECF6NHBWEYF2N2JAQBT7TNH4C4","short_pith_number":"pith:ECF6NHBW","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"},"canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","source":{"kind":"arxiv","id":"1805.00858","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00858","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00858v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00858","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"ECF6NHBWEYF2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECF6NHBWEYF2N2JA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECF6NHBW","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ECF6NHBWEYF2N2JAQBT7TNH4C4","target":"record","payload":{"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"},"canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","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"},"source_kind":"arxiv","source_id":"1805.00858","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-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cI9KWLumP/VmJNdLR70GD4JvU1ytPrPxcrufLcr/wH2SB1cWdw2gxcEFTBmVgIOwOLJ4+eSf7qg309Hu3AT9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:15.520474Z"},"content_sha256":"0b447df0c58b055601b14ee232c114c1b48dec12d25a4981a11534b4082f914c","schema_version":"1.0","event_id":"sha256:0b447df0c58b055601b14ee232c114c1b48dec12d25a4981a11534b4082f914c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ECF6NHBWEYF2N2JAQBT7TNH4C4","target":"graph","payload":{"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"},"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-18T00:16:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3XjWMTX0gEDljaP0vu4DN160TRBfYdS2fLqktPIBpAAdnPiYk9wgl+o4OwIKO9vB/Jc4cKHeTNGEw3P+h5YDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:15.520824Z"},"content_sha256":"26de7a7621ee767e8bd89651a95e97b77fba5e0795609bc7ed17a48288e4be45","schema_version":"1.0","event_id":"sha256:26de7a7621ee767e8bd89651a95e97b77fba5e0795609bc7ed17a48288e4be45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/bundle.json","state_url":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/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-06-02T05:04:15Z","links":{"resolver":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4","bundle":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/bundle.json","state":"https://pith.science/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECF6NHBWEYF2N2JAQBT7TNH4C4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ECF6NHBWEYF2N2JAQBT7TNH4C4","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":"472353351812b8c3c96d5767cdc0c767871969c81c76de9d6a0993973b793d11","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-02T15:08:53Z","title_canon_sha256":"97f09c8d66535cfca1e0b1a28ce0de64ca44b54d44d3fbf13b085af87e4674f1"},"schema_version":"1.0","source":{"id":"1805.00858","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.00858","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"arxiv_version","alias_value":"1805.00858v1","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00858","created_at":"2026-05-18T00:16:57Z"},{"alias_kind":"pith_short_12","alias_value":"ECF6NHBWEYF2","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ECF6NHBWEYF2N2JA","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ECF6NHBW","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:26de7a7621ee767e8bd89651a95e97b77fba5e0795609bc7ed17a48288e4be45","target":"graph","created_at":"2026-05-18T00:16:57Z","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 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","authors_text":"Ignasi Sau, Luerbio Faria, Rubens Sucupira, Sulamita Klein, U\\'everton S. Souza","cross_cats":["cs.CG","cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-02T15:08:53Z","title":"Maximum cuts in edge-colored graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00858","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:0b447df0c58b055601b14ee232c114c1b48dec12d25a4981a11534b4082f914c","target":"record","created_at":"2026-05-18T00:16:57Z","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":"472353351812b8c3c96d5767cdc0c767871969c81c76de9d6a0993973b793d11","cross_cats_sorted":["cs.CG","cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-02T15:08:53Z","title_canon_sha256":"97f09c8d66535cfca1e0b1a28ce0de64ca44b54d44d3fbf13b085af87e4674f1"},"schema_version":"1.0","source":{"id":"1805.00858","kind":"arxiv","version":1}},"canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"208be69c36260ba6e9208067f9b4fc173d01ff0b40b7a7e079586fc0302598bb","first_computed_at":"2026-05-18T00:16:57.462850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:57.462850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zGYzrWEvJqRNPhZVibj1KDQ/Ueh41GaPjLeI/msBT3lucnuX/Z2U/Ir2NeEovb6Ul3b6doTruwmuoMuGkS3wAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:57.463582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.00858","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b447df0c58b055601b14ee232c114c1b48dec12d25a4981a11534b4082f914c","sha256:26de7a7621ee767e8bd89651a95e97b77fba5e0795609bc7ed17a48288e4be45"],"state_sha256":"d4bcf36f2500bdc6d87eab792bef466bc2084deecfb81cfce35dcce0fd6fc6fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oy0oTukXFnw8eBPGAofj4W8dhxNMi6lo+CgII53VUQP25MBxbIlrBZpNRVaqQQkRUtgLuMj4oyLPUU3QTnFUDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:04:15.522887Z","bundle_sha256":"3277c45091861a3183ea777ac644f81edfe54bf407d22a57b74922f2a5cd971c"}}