{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YTARWIZSJE4YMB2RTL6XNZXOBQ","short_pith_number":"pith:YTARWIZS","canonical_record":{"source":{"id":"1510.09156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-30T16:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"cbc88673bc2701fef6865b0139fd771b1d17297d2a1f91ff24ef88ba5fbfdbb0","abstract_canon_sha256":"5681b1490a991244119676876b803f282fa865ff6fcb02555c591c432ca684de"},"schema_version":"1.0"},"canonical_sha256":"c4c11b233249398607519afd76e6ee0c3980fd0c2777bb4e86fae49fe34dd414","source":{"kind":"arxiv","id":"1510.09156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09156","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09156v1","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09156","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"YTARWIZSJE4Y","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YTARWIZSJE4YMB2R","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YTARWIZS","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YTARWIZSJE4YMB2RTL6XNZXOBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-30T16:58:03Z","cross_cats_sorted":[],"title_canon_sha256":"cbc88673bc2701fef6865b0139fd771b1d17297d2a1f91ff24ef88ba5fbfdbb0","abstract_canon_sha256":"5681b1490a991244119676876b803f282fa865ff6fcb02555c591c432ca684de"},"schema_version":"1.0"},"canonical_sha256":"c4c11b233249398607519afd76e6ee0c3980fd0c2777bb4e86fae49fe34dd414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:22.592053Z","signature_b64":"jluGDd3Vlet5/Nn3KDXYD0D2AILUE88sfKbHeoC8/lJqKLhCef5Ngfz9HVm5NfcfYYWwebPw3JsUFSnuAWXGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4c11b233249398607519afd76e6ee0c3980fd0c2777bb4e86fae49fe34dd414","last_reissued_at":"2026-05-18T01:28:22.591389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:22.591389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09156","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-18T01:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRjxge2ZQZDWgHQbXOOALlUSlglBAh65TRu81IHsqV8spKmpK55z2IBAJI6LyiWrc4xRD37xBcF632SEUxV4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:03:39.024199Z"},"content_sha256":"ae74b2c7a54eb72ad68d553bdac3502d33a96d7b11134800eb6a0e0d88d32e48","schema_version":"1.0","event_id":"sha256:ae74b2c7a54eb72ad68d553bdac3502d33a96d7b11134800eb6a0e0d88d32e48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YTARWIZSJE4YMB2RTL6XNZXOBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multiple Search Operator Heuristic for the Max-k-cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Fuda Ma, Jin-Kao Hao","submitted_at":"2015-10-30T16:58:03Z","abstract_excerpt":"The max-k-cut problem is to partition the vertices of a weighted graph $G = (V,E)$ into $k\\geq2$ disjoint subsets such that the weight sum of the edges crossing the different subsets is maximized. The problem is referred as the max-cut problem when $k=2$. In this work, we present a multiple operator heuristic (MOH) for the general max-k-cut problem. MOH employs five distinct search operators organized into three search phases to effectively explore the search space. Experiments on two sets of 91 well-known benchmark instances show that the proposed algorithm is highly effective on the max-k-cu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09156","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-18T01:28:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPvJlzGlrx97jQiimatby3ubP302zYyuLpIUm9J/tCPfpupKqk4lJfIBEj8KtxVwlHq3e6gSgRTcDy0dy9R1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:03:39.024938Z"},"content_sha256":"74d72db1b65c0769b5502811ae4c6a6fa83bd9398787a3c0aae482e8d66b2e8a","schema_version":"1.0","event_id":"sha256:74d72db1b65c0769b5502811ae4c6a6fa83bd9398787a3c0aae482e8d66b2e8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/bundle.json","state_url":"https://pith.science/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/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-05-26T04:03:39Z","links":{"resolver":"https://pith.science/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ","bundle":"https://pith.science/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/bundle.json","state":"https://pith.science/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTARWIZSJE4YMB2RTL6XNZXOBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YTARWIZSJE4YMB2RTL6XNZXOBQ","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":"5681b1490a991244119676876b803f282fa865ff6fcb02555c591c432ca684de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-30T16:58:03Z","title_canon_sha256":"cbc88673bc2701fef6865b0139fd771b1d17297d2a1f91ff24ef88ba5fbfdbb0"},"schema_version":"1.0","source":{"id":"1510.09156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09156","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09156v1","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09156","created_at":"2026-05-18T01:28:22Z"},{"alias_kind":"pith_short_12","alias_value":"YTARWIZSJE4Y","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YTARWIZSJE4YMB2R","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YTARWIZS","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:74d72db1b65c0769b5502811ae4c6a6fa83bd9398787a3c0aae482e8d66b2e8a","target":"graph","created_at":"2026-05-18T01:28:22Z","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 max-k-cut problem is to partition the vertices of a weighted graph $G = (V,E)$ into $k\\geq2$ disjoint subsets such that the weight sum of the edges crossing the different subsets is maximized. The problem is referred as the max-cut problem when $k=2$. In this work, we present a multiple operator heuristic (MOH) for the general max-k-cut problem. MOH employs five distinct search operators organized into three search phases to effectively explore the search space. Experiments on two sets of 91 well-known benchmark instances show that the proposed algorithm is highly effective on the max-k-cu","authors_text":"Fuda Ma, Jin-Kao Hao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-30T16:58:03Z","title":"A Multiple Search Operator Heuristic for the Max-k-cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09156","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:ae74b2c7a54eb72ad68d553bdac3502d33a96d7b11134800eb6a0e0d88d32e48","target":"record","created_at":"2026-05-18T01:28:22Z","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":"5681b1490a991244119676876b803f282fa865ff6fcb02555c591c432ca684de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-30T16:58:03Z","title_canon_sha256":"cbc88673bc2701fef6865b0139fd771b1d17297d2a1f91ff24ef88ba5fbfdbb0"},"schema_version":"1.0","source":{"id":"1510.09156","kind":"arxiv","version":1}},"canonical_sha256":"c4c11b233249398607519afd76e6ee0c3980fd0c2777bb4e86fae49fe34dd414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4c11b233249398607519afd76e6ee0c3980fd0c2777bb4e86fae49fe34dd414","first_computed_at":"2026-05-18T01:28:22.591389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:22.591389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jluGDd3Vlet5/Nn3KDXYD0D2AILUE88sfKbHeoC8/lJqKLhCef5Ngfz9HVm5NfcfYYWwebPw3JsUFSnuAWXGBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:22.592053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae74b2c7a54eb72ad68d553bdac3502d33a96d7b11134800eb6a0e0d88d32e48","sha256:74d72db1b65c0769b5502811ae4c6a6fa83bd9398787a3c0aae482e8d66b2e8a"],"state_sha256":"c97a40c6cbb4ccb416be9d5e725954274574b8d78840fd431c5f7b59181818f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rFVN/1tCVc93aUcQcHCMn0wdPigrdeXOqwDfqZIHf6wxPRdP0zvxnOmacr07t1xv2UJ+5AUyRBO9J3LHf6cdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:03:39.028551Z","bundle_sha256":"0b85e9ecbbae3cacde0cc3e9f3a9061c847f2af62486af260e99ba2944c8997e"}}