{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S3RDUOJVOZPMFQE7Y4FEKBX6XT","short_pith_number":"pith:S3RDUOJV","canonical_record":{"source":{"id":"1703.09258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T18:36:17Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"2531dd541f92bb3ab973b95d8c50b3f4afa84ec07f1be097d7b13be132ae5781","abstract_canon_sha256":"188fe4aea7fc20a30ff8c203503fe91973d0ea8388d2a4fafdcf3273d52e3cb9"},"schema_version":"1.0"},"canonical_sha256":"96e23a3935765ec2c09fc70a4506febcc0b6ff8cbba0bd8ba0c6844ce7126d6e","source":{"kind":"arxiv","id":"1703.09258","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09258","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09258v2","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09258","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"pith_short_12","alias_value":"S3RDUOJVOZPM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3RDUOJVOZPMFQE7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3RDUOJV","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S3RDUOJVOZPMFQE7Y4FEKBX6XT","target":"record","payload":{"canonical_record":{"source":{"id":"1703.09258","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T18:36:17Z","cross_cats_sorted":["cs.DM","math.OC"],"title_canon_sha256":"2531dd541f92bb3ab973b95d8c50b3f4afa84ec07f1be097d7b13be132ae5781","abstract_canon_sha256":"188fe4aea7fc20a30ff8c203503fe91973d0ea8388d2a4fafdcf3273d52e3cb9"},"schema_version":"1.0"},"canonical_sha256":"96e23a3935765ec2c09fc70a4506febcc0b6ff8cbba0bd8ba0c6844ce7126d6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:53.936075Z","signature_b64":"7B1Zb+ehI7qvY+IpyIBtpMKq0VeqNNF9KNqbXKfrwOdW5MUnaoSia1iHR5zWD0bmtW4M1iurvqnjTLva/7GmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96e23a3935765ec2c09fc70a4506febcc0b6ff8cbba0bd8ba0c6844ce7126d6e","last_reissued_at":"2026-05-18T00:46:53.935515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:53.935515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.09258","source_version":2,"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:46:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9cD6pYeePVYrVeHsPGHP1m92LEE4N5jn9Pesht9/56Dj3Hto3g45nir9OggFbsdtP87N6FbzT3SW6Dj5xHKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:04:58.374311Z"},"content_sha256":"10c01e5680b44cbae49c35c2d1f38ed2b0d78cfb1cb0c693cdb9e9c5d0e6aac9","schema_version":"1.0","event_id":"sha256:10c01e5680b44cbae49c35c2d1f38ed2b0d78cfb1cb0c693cdb9e9c5d0e6aac9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S3RDUOJVOZPMFQE7Y4FEKBX6XT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New algorithms for the Minimum Coloring Cut Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.OC"],"primary_cat":"cs.DS","authors_text":"Augusto Bordini, F\\'abio Protti","submitted_at":"2017-03-27T18:36:17Z","abstract_excerpt":"The Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E' is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve this problem. Our algorithms are able to find all the optimum solutions described in the literature."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09258","kind":"arxiv","version":2},"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:46:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/bCuew19lvvgYc8fQaScvvdy90Qaev2AdLgoZ53D0KK9+QpkJEcJdjNpUEqfkfMJxna2aYmsKI9atKkDLxrOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:04:58.375087Z"},"content_sha256":"3d5fb5072dbc27e106435d0108bc179abd3f8adf18499e3076cbe8770c1fd447","schema_version":"1.0","event_id":"sha256:3d5fb5072dbc27e106435d0108bc179abd3f8adf18499e3076cbe8770c1fd447"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/bundle.json","state_url":"https://pith.science/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/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-11T06:04:58Z","links":{"resolver":"https://pith.science/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT","bundle":"https://pith.science/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/bundle.json","state":"https://pith.science/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3RDUOJVOZPMFQE7Y4FEKBX6XT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S3RDUOJVOZPMFQE7Y4FEKBX6XT","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":"188fe4aea7fc20a30ff8c203503fe91973d0ea8388d2a4fafdcf3273d52e3cb9","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T18:36:17Z","title_canon_sha256":"2531dd541f92bb3ab973b95d8c50b3f4afa84ec07f1be097d7b13be132ae5781"},"schema_version":"1.0","source":{"id":"1703.09258","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.09258","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"arxiv_version","alias_value":"1703.09258v2","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09258","created_at":"2026-05-18T00:46:53Z"},{"alias_kind":"pith_short_12","alias_value":"S3RDUOJVOZPM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S3RDUOJVOZPMFQE7","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S3RDUOJV","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:3d5fb5072dbc27e106435d0108bc179abd3f8adf18499e3076cbe8770c1fd447","target":"graph","created_at":"2026-05-18T00:46:53Z","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 Minimum Coloring Cut Problem is defined as follows: given a connected graph G with colored edges, find an edge cut E' of G (a minimal set of edges whose removal renders the graph disconnected) such that the number of colors used by the edges in E' is minimum. In this work, we present two approaches based on Variable Neighborhood Search to solve this problem. Our algorithms are able to find all the optimum solutions described in the literature.","authors_text":"Augusto Bordini, F\\'abio Protti","cross_cats":["cs.DM","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T18:36:17Z","title":"New algorithms for the Minimum Coloring Cut Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09258","kind":"arxiv","version":2},"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:10c01e5680b44cbae49c35c2d1f38ed2b0d78cfb1cb0c693cdb9e9c5d0e6aac9","target":"record","created_at":"2026-05-18T00:46:53Z","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":"188fe4aea7fc20a30ff8c203503fe91973d0ea8388d2a4fafdcf3273d52e3cb9","cross_cats_sorted":["cs.DM","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-27T18:36:17Z","title_canon_sha256":"2531dd541f92bb3ab973b95d8c50b3f4afa84ec07f1be097d7b13be132ae5781"},"schema_version":"1.0","source":{"id":"1703.09258","kind":"arxiv","version":2}},"canonical_sha256":"96e23a3935765ec2c09fc70a4506febcc0b6ff8cbba0bd8ba0c6844ce7126d6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96e23a3935765ec2c09fc70a4506febcc0b6ff8cbba0bd8ba0c6844ce7126d6e","first_computed_at":"2026-05-18T00:46:53.935515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:53.935515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7B1Zb+ehI7qvY+IpyIBtpMKq0VeqNNF9KNqbXKfrwOdW5MUnaoSia1iHR5zWD0bmtW4M1iurvqnjTLva/7GmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:53.936075Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.09258","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10c01e5680b44cbae49c35c2d1f38ed2b0d78cfb1cb0c693cdb9e9c5d0e6aac9","sha256:3d5fb5072dbc27e106435d0108bc179abd3f8adf18499e3076cbe8770c1fd447"],"state_sha256":"957782c19265251ff15b147dc44d15e12086687eefe97cdee8c901383f3a8849"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rgt1f9dPWzAN2wqqCJZ0B1dbP4LDdBcpJk3fLXz6Zt8QQwFR+fNjZe+H1MQVAUosGdIVGBxqiNUQeVcXENPpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:04:58.379479Z","bundle_sha256":"1b16c592ca4c4e9d0f6dbed7d8e16e3d4c432e3d60f518f70bddec7d5a8ecd22"}}