{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PXG5JDBZLDHLXRZMQNB5JCP3HS","short_pith_number":"pith:PXG5JDBZ","canonical_record":{"source":{"id":"1503.02009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-03-05T14:10:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c98146bc7a089bffecc9dbee1f11b03285000114dd5de20a81eaa0956916bfa2","abstract_canon_sha256":"c2e9e0d1966d2e3c1d24e25f47df6061efcc8d894e577866db96f2948151cc82"},"schema_version":"1.0"},"canonical_sha256":"7dcdd48c3958cebbc72c8343d489fb3cbdf714ce3cdbf7a2b5e8f0ec6c247eb5","source":{"kind":"arxiv","id":"1503.02009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02009","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02009v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02009","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PXG5JDBZLDHL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXG5JDBZLDHLXRZM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXG5JDBZ","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PXG5JDBZLDHLXRZMQNB5JCP3HS","target":"record","payload":{"canonical_record":{"source":{"id":"1503.02009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-03-05T14:10:19Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c98146bc7a089bffecc9dbee1f11b03285000114dd5de20a81eaa0956916bfa2","abstract_canon_sha256":"c2e9e0d1966d2e3c1d24e25f47df6061efcc8d894e577866db96f2948151cc82"},"schema_version":"1.0"},"canonical_sha256":"7dcdd48c3958cebbc72c8343d489fb3cbdf714ce3cdbf7a2b5e8f0ec6c247eb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.072196Z","signature_b64":"HE3qDy8m4co1SsIEKjsHKSMX24+G2kwd6ba4JxhfnBMInpVIbEqiLzTZxrno+RMuCuBEmx62aqZUFydLLzxYBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7dcdd48c3958cebbc72c8343d489fb3cbdf714ce3cdbf7a2b5e8f0ec6c247eb5","last_reissued_at":"2026-05-18T02:25:27.071749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.071749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.02009","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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"082gEy8ed0I6xAyYGz2P2+zRRJU5IggcfH/QRtDl0U7rwPZb0A4Y2gMoHMmy80mAeRZHedDeX/ZML8rx0fx8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:19:28.504506Z"},"content_sha256":"98489b8a0fb58277870e4a81e791f99708bb04033da0ba6b0eaff70226f354ba","schema_version":"1.0","event_id":"sha256:98489b8a0fb58277870e4a81e791f99708bb04033da0ba6b0eaff70226f354ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PXG5JDBZLDHLXRZMQNB5JCP3HS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an intelligent VNS heuristic for the k-labelled spanning forest problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.OH","authors_text":"Jos\\`e Andr\\`es Moreno P\\`erez, Nenad Mladenovic, Sergio Consoli","submitted_at":"2015-03-05T14:10:19Z","abstract_excerpt":"In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS) metaheuristic. In the kLSF problem we are given an undirected input graph G and an integer positive value k, and the aim is to find a spanning forest of G having the minimum number of connected components and the upper bound k on the number of labels to use. The problem is related to the minimum labelling spanning tree (MLST) problem, whose goal is to get the spanning tree of the input graph with the minimum number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02009","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-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kuy1j2YT2LYT8ivwksguII3FI2JcAMT9sEGoOvPkGkkmMzmzgSMOSO33D71PtNwTch3QpVliaHLRSBdGsWQQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T12:19:28.504852Z"},"content_sha256":"c472f8f7e03d4aaf9e689c23624caef45844aa15803368e97e26b921f753dfd0","schema_version":"1.0","event_id":"sha256:c472f8f7e03d4aaf9e689c23624caef45844aa15803368e97e26b921f753dfd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/bundle.json","state_url":"https://pith.science/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/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-29T12:19:28Z","links":{"resolver":"https://pith.science/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS","bundle":"https://pith.science/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/bundle.json","state":"https://pith.science/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PXG5JDBZLDHLXRZMQNB5JCP3HS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PXG5JDBZLDHLXRZMQNB5JCP3HS","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":"c2e9e0d1966d2e3c1d24e25f47df6061efcc8d894e577866db96f2948151cc82","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-03-05T14:10:19Z","title_canon_sha256":"c98146bc7a089bffecc9dbee1f11b03285000114dd5de20a81eaa0956916bfa2"},"schema_version":"1.0","source":{"id":"1503.02009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.02009","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.02009v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02009","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"PXG5JDBZLDHL","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PXG5JDBZLDHLXRZM","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PXG5JDBZ","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:c472f8f7e03d4aaf9e689c23624caef45844aa15803368e97e26b921f753dfd0","target":"graph","created_at":"2026-05-18T02:25:27Z","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":"In a currently ongoing project, we investigate a new possibility for solving the k-labelled spanning forest (kLSF) problem by an intelligent Variable Neighbourhood Search (Int-VNS) metaheuristic. In the kLSF problem we are given an undirected input graph G and an integer positive value k, and the aim is to find a spanning forest of G having the minimum number of connected components and the upper bound k on the number of labels to use. The problem is related to the minimum labelling spanning tree (MLST) problem, whose goal is to get the spanning tree of the input graph with the minimum number ","authors_text":"Jos\\`e Andr\\`es Moreno P\\`erez, Nenad Mladenovic, Sergio Consoli","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-03-05T14:10:19Z","title":"Towards an intelligent VNS heuristic for the k-labelled spanning forest problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02009","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:98489b8a0fb58277870e4a81e791f99708bb04033da0ba6b0eaff70226f354ba","target":"record","created_at":"2026-05-18T02:25:27Z","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":"c2e9e0d1966d2e3c1d24e25f47df6061efcc8d894e577866db96f2948151cc82","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OH","submitted_at":"2015-03-05T14:10:19Z","title_canon_sha256":"c98146bc7a089bffecc9dbee1f11b03285000114dd5de20a81eaa0956916bfa2"},"schema_version":"1.0","source":{"id":"1503.02009","kind":"arxiv","version":1}},"canonical_sha256":"7dcdd48c3958cebbc72c8343d489fb3cbdf714ce3cdbf7a2b5e8f0ec6c247eb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7dcdd48c3958cebbc72c8343d489fb3cbdf714ce3cdbf7a2b5e8f0ec6c247eb5","first_computed_at":"2026-05-18T02:25:27.071749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:27.071749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HE3qDy8m4co1SsIEKjsHKSMX24+G2kwd6ba4JxhfnBMInpVIbEqiLzTZxrno+RMuCuBEmx62aqZUFydLLzxYBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:27.072196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.02009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98489b8a0fb58277870e4a81e791f99708bb04033da0ba6b0eaff70226f354ba","sha256:c472f8f7e03d4aaf9e689c23624caef45844aa15803368e97e26b921f753dfd0"],"state_sha256":"08b269e248d004d8d169018c22650cd975339912eb8a574b2bea40ad52fd0837"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jjPN3TS8bD13DAwRiED2EZRMp7K4O8EKdBvr0U/Qs6pjis4668D6iiLhHX3KComGDBS/jsBzRWdi7mhAPDW1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T12:19:28.506732Z","bundle_sha256":"455e14d61b3357f2c737b4477191c459ba4b4f8cf62ffe387386824425136f0a"}}