{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LVYUG2OG3CBBTHUJOHUILBTPHG","short_pith_number":"pith:LVYUG2OG","canonical_record":{"source":{"id":"1711.04556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"deed609fb537760a868462db3a98f8d08a59f5243c8e9dbb2dad69189b5543b2","abstract_canon_sha256":"7f9967828b57514bc76df4a5cbce221a536c3fc6ee1d03fdfbc3148ad15fca44"},"schema_version":"1.0"},"canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","source":{"kind":"arxiv","id":"1711.04556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04556","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04556v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04556","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"LVYUG2OG3CBB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LVYUG2OG3CBBTHUJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LVYUG2OG","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LVYUG2OG3CBBTHUJOHUILBTPHG","target":"record","payload":{"canonical_record":{"source":{"id":"1711.04556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"deed609fb537760a868462db3a98f8d08a59f5243c8e9dbb2dad69189b5543b2","abstract_canon_sha256":"7f9967828b57514bc76df4a5cbce221a536c3fc6ee1d03fdfbc3148ad15fca44"},"schema_version":"1.0"},"canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:36.344142Z","signature_b64":"fEnp9I0len1x/LvZSckvRuPCPQeI0ktX7S0wCcYH38qEfdNPe5ws0CQ3H0LmFkk2YIXuKPbGvtaXS7btFz0BAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","last_reissued_at":"2026-05-18T00:30:36.343419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:36.343419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.04556","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:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIH6rhdxVxvuXOpuQkUBwmAjXedznR8u42s/1XPeK3JOW2JgEpwDVNIekKdHXnj0jPJhDwjceum6AuUQ7zAcCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:27:42.652413Z"},"content_sha256":"77a22b1df72dc2fbbd6e37638a67a688d606611665f14e4921c73dee9190f1cb","schema_version":"1.0","event_id":"sha256:77a22b1df72dc2fbbd6e37638a67a688d606611665f14e4921c73dee9190f1cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LVYUG2OG3CBBTHUJOHUILBTPHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DC","authors_text":"Libor Bukata, Premysl Sucha, Zdenek Hanzalek","submitted_at":"2017-11-13T12:52:49Z","abstract_excerpt":"In the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial problem many optimizations have been performed. For example, a resource evaluation algorithm is selected by a heuristic and an effective Tabu List was designed. In addition to that, a capacity-indexed resource evaluation algorithm was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous model to reduce the required communication bandwidth. According to the experiments, the GPU version outperforms the optimized parallel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04556","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:30:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hIHriiatFN1aeadkrEnpoPDsLhZsAYWiVtQVkQBREFxuzJl2SMKmpBjrlbn6adj0dWMOSIJw65oMccqsXatrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:27:42.652769Z"},"content_sha256":"b357eebad781c6b074e905d859ac064851a440bf6aad4cba797c18690364f8f2","schema_version":"1.0","event_id":"sha256:b357eebad781c6b074e905d859ac064851a440bf6aad4cba797c18690364f8f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/bundle.json","state_url":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/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-08T02:27:42Z","links":{"resolver":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG","bundle":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/bundle.json","state":"https://pith.science/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVYUG2OG3CBBTHUJOHUILBTPHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LVYUG2OG3CBBTHUJOHUILBTPHG","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":"7f9967828b57514bc76df4a5cbce221a536c3fc6ee1d03fdfbc3148ad15fca44","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","title_canon_sha256":"deed609fb537760a868462db3a98f8d08a59f5243c8e9dbb2dad69189b5543b2"},"schema_version":"1.0","source":{"id":"1711.04556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.04556","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"arxiv_version","alias_value":"1711.04556v1","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.04556","created_at":"2026-05-18T00:30:36Z"},{"alias_kind":"pith_short_12","alias_value":"LVYUG2OG3CBB","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LVYUG2OG3CBBTHUJ","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LVYUG2OG","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:b357eebad781c6b074e905d859ac064851a440bf6aad4cba797c18690364f8f2","target":"graph","created_at":"2026-05-18T00:30:36Z","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 the paper, a parallel Tabu Search algorithm for the Resource Constrained Project Scheduling Problem is proposed. To deal with this NP-hard combinatorial problem many optimizations have been performed. For example, a resource evaluation algorithm is selected by a heuristic and an effective Tabu List was designed. In addition to that, a capacity-indexed resource evaluation algorithm was proposed and the GPU (Graphics Processing Unit) version uses a homogeneous model to reduce the required communication bandwidth. According to the experiments, the GPU version outperforms the optimized parallel","authors_text":"Libor Bukata, Premysl Sucha, Zdenek Hanzalek","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","title":"Solving the Resource Constrained Project Scheduling Problem Using the Parallel Tabu Search Designed for the CUDA Platform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.04556","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:77a22b1df72dc2fbbd6e37638a67a688d606611665f14e4921c73dee9190f1cb","target":"record","created_at":"2026-05-18T00:30:36Z","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":"7f9967828b57514bc76df4a5cbce221a536c3fc6ee1d03fdfbc3148ad15fca44","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-13T12:52:49Z","title_canon_sha256":"deed609fb537760a868462db3a98f8d08a59f5243c8e9dbb2dad69189b5543b2"},"schema_version":"1.0","source":{"id":"1711.04556","kind":"arxiv","version":1}},"canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d714369c6d882199e8971e885866f39aa82350f28798f32bba7f78953001a30","first_computed_at":"2026-05-18T00:30:36.343419Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:36.343419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fEnp9I0len1x/LvZSckvRuPCPQeI0ktX7S0wCcYH38qEfdNPe5ws0CQ3H0LmFkk2YIXuKPbGvtaXS7btFz0BAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:36.344142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.04556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77a22b1df72dc2fbbd6e37638a67a688d606611665f14e4921c73dee9190f1cb","sha256:b357eebad781c6b074e905d859ac064851a440bf6aad4cba797c18690364f8f2"],"state_sha256":"52d899189d5f5c435491b46cf988bff4098be18bbf14c0c6ce9cb6c57f9832b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amPHTT5AbzEoGvIgxVMO0ay7S6bpnLMepxejS3QPCOHgsYCXm0E0w9rxJNF43AmhE3kdGcZ8JP46GXMSi8WvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:27:42.655394Z","bundle_sha256":"d668839a922452b1dfb5f177575620b7863357b6ef28e2ea54f8f9fd27a45e81"}}