{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XRUZKPM5ALCII2EOWDAC5MYBD2","short_pith_number":"pith:XRUZKPM5","canonical_record":{"source":{"id":"1505.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T11:24:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c7c02122c6191c2ca0fdb7bcbd72a36d6fb8b061616e5575ba68cbcbe2641384","abstract_canon_sha256":"0d9d01f4a5380382247687ff616afff106402ae35a4d4574b6f53ff4d22110b1"},"schema_version":"1.0"},"canonical_sha256":"bc69953d9d02c484688eb0c02eb3011eaa1f1f74f7f98b9492bd40d2d9f9595d","source":{"kind":"arxiv","id":"1505.06032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06032","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06032v1","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06032","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"XRUZKPM5ALCI","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XRUZKPM5ALCII2EO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XRUZKPM5","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XRUZKPM5ALCII2EOWDAC5MYBD2","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T11:24:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c7c02122c6191c2ca0fdb7bcbd72a36d6fb8b061616e5575ba68cbcbe2641384","abstract_canon_sha256":"0d9d01f4a5380382247687ff616afff106402ae35a4d4574b6f53ff4d22110b1"},"schema_version":"1.0"},"canonical_sha256":"bc69953d9d02c484688eb0c02eb3011eaa1f1f74f7f98b9492bd40d2d9f9595d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:44.623337Z","signature_b64":"lgprBl7FS/4MqSXwymnXD1mCs8uJTMMUpNYcGtGUqpDMkOXaCJ9nERFkfleRxST1tkq8EAS9AF880xnQP6oADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc69953d9d02c484688eb0c02eb3011eaa1f1f74f7f98b9492bd40d2d9f9595d","last_reissued_at":"2026-05-17T23:53:44.622673Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:44.622673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06032","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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IM9dTQbp9BvMaQyBdxMTp34hahxKgt/ypS0G+UdLF/t7M0X4gLciqcYbuD+Evuu0cPc8Bo4KLddV5e8xVZ4vDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:33:50.641606Z"},"content_sha256":"4d751fbd12f148d6298d22c26822bf1bd62b59bec0f87ff07d4b5a046fdecd48","schema_version":"1.0","event_id":"sha256:4d751fbd12f148d6298d22c26822bf1bd62b59bec0f87ff07d4b5a046fdecd48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XRUZKPM5ALCII2EOWDAC5MYBD2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Neighborhood Search for solving Bandwidth Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dragan Matic, Jozef Kratica, Vladimir Filipovic","submitted_at":"2015-05-22T11:24:03Z","abstract_excerpt":"This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06032","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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRCKiFkbO5vMpZ4QrZjjYUtebsb7rHemRBr18XBHqaaB6ge1xI7kAhfWJPm8/m1xWyyK3OB8xAN13EL86lCZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T11:33:50.641954Z"},"content_sha256":"b808646662ac4849d0db33abc392afa0866e4d2e2e990b7e991c2c6a9ad74a3c","schema_version":"1.0","event_id":"sha256:b808646662ac4849d0db33abc392afa0866e4d2e2e990b7e991c2c6a9ad74a3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/bundle.json","state_url":"https://pith.science/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/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-24T11:33:50Z","links":{"resolver":"https://pith.science/pith/XRUZKPM5ALCII2EOWDAC5MYBD2","bundle":"https://pith.science/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/bundle.json","state":"https://pith.science/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XRUZKPM5ALCII2EOWDAC5MYBD2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XRUZKPM5ALCII2EOWDAC5MYBD2","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":"0d9d01f4a5380382247687ff616afff106402ae35a4d4574b6f53ff4d22110b1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T11:24:03Z","title_canon_sha256":"c7c02122c6191c2ca0fdb7bcbd72a36d6fb8b061616e5575ba68cbcbe2641384"},"schema_version":"1.0","source":{"id":"1505.06032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06032","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06032v1","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06032","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"XRUZKPM5ALCI","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XRUZKPM5ALCII2EO","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XRUZKPM5","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:b808646662ac4849d0db33abc392afa0866e4d2e2e990b7e991c2c6a9ad74a3c","target":"graph","created_at":"2026-05-17T23:53:44Z","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":"This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an increasing number of vertices and a specific variable neighborhood descent (VND) procedure, based on the specially designed arrangement of the vertices which are the subject of re-coloring. By this approach, ","authors_text":"Dragan Matic, Jozef Kratica, Vladimir Filipovic","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T11:24:03Z","title":"Variable Neighborhood Search for solving Bandwidth Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06032","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:4d751fbd12f148d6298d22c26822bf1bd62b59bec0f87ff07d4b5a046fdecd48","target":"record","created_at":"2026-05-17T23:53:44Z","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":"0d9d01f4a5380382247687ff616afff106402ae35a4d4574b6f53ff4d22110b1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-22T11:24:03Z","title_canon_sha256":"c7c02122c6191c2ca0fdb7bcbd72a36d6fb8b061616e5575ba68cbcbe2641384"},"schema_version":"1.0","source":{"id":"1505.06032","kind":"arxiv","version":1}},"canonical_sha256":"bc69953d9d02c484688eb0c02eb3011eaa1f1f74f7f98b9492bd40d2d9f9595d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc69953d9d02c484688eb0c02eb3011eaa1f1f74f7f98b9492bd40d2d9f9595d","first_computed_at":"2026-05-17T23:53:44.622673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:44.622673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lgprBl7FS/4MqSXwymnXD1mCs8uJTMMUpNYcGtGUqpDMkOXaCJ9nERFkfleRxST1tkq8EAS9AF880xnQP6oADQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:44.623337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d751fbd12f148d6298d22c26822bf1bd62b59bec0f87ff07d4b5a046fdecd48","sha256:b808646662ac4849d0db33abc392afa0866e4d2e2e990b7e991c2c6a9ad74a3c"],"state_sha256":"d20856b3b8d227ee0a2838f64cc2a3c95cba81b29a981a44f6df030d7c09222f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L3e0I3jlOklGkvsGBJO4jo9+AH0afkNCOxiLHymkPiqVb4jbYvTULTX5gNBn96W7himSy3GHnht8rDzgL+usAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T11:33:50.643913Z","bundle_sha256":"6b823e69539223c4dfd0ae2ec6487f508d56d9eb48d270b1bc2f68ae7a779d8e"}}