{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:VST3A5VJ5BM66NZ2AB4QECCRYS","short_pith_number":"pith:VST3A5VJ","canonical_record":{"source":{"id":"2505.18278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T18:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"f2f6f3854ae0e37d1a136fb48d3d2c327e8a9124e8f92566cd9d476efb1e9aa4","abstract_canon_sha256":"51631215a96ecf2fd3f33d968b2ebc56abffaf1302d4c7ed2315d743e4324abe"},"schema_version":"1.0"},"canonical_sha256":"aca7b076a9e859ef373a0079020851c49d676af2acbab30c155b71df49b6ad67","source":{"kind":"arxiv","id":"2505.18278","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18278","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18278v1","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18278","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"VST3A5VJ5BM6","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"VST3A5VJ5BM66NZ2","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"VST3A5VJ","created_at":"2026-07-05T11:08:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:VST3A5VJ5BM66NZ2AB4QECCRYS","target":"record","payload":{"canonical_record":{"source":{"id":"2505.18278","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T18:14:24Z","cross_cats_sorted":[],"title_canon_sha256":"f2f6f3854ae0e37d1a136fb48d3d2c327e8a9124e8f92566cd9d476efb1e9aa4","abstract_canon_sha256":"51631215a96ecf2fd3f33d968b2ebc56abffaf1302d4c7ed2315d743e4324abe"},"schema_version":"1.0"},"canonical_sha256":"aca7b076a9e859ef373a0079020851c49d676af2acbab30c155b71df49b6ad67","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:44.009126Z","signature_b64":"TIBaUAo5VBIvB5yaUJh9jaEGiNavXRkWcE+bl6zluroQc1SX3WuM3dYpgUOLh/4n+f+UQ9M5qOXAvh6M7e4XDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aca7b076a9e859ef373a0079020851c49d676af2acbab30c155b71df49b6ad67","last_reissued_at":"2026-07-05T11:08:44.008726Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:44.008726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.18278","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-07-05T11:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cWno1HJhoF8gD9e/4hSrPq/w9tL1bBpfe3RSMCQqbbfl6P9WVxK0c6GOwjmwnaPJuKKXN9t6HOr6D9oHPS3kAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:46:22.236440Z"},"content_sha256":"b752bf1b6ec8cf7a942cd8a525bee3eb8c83285f5eff0d81a43a1f6d7847cabb","schema_version":"1.0","event_id":"sha256:b752bf1b6ec8cf7a942cd8a525bee3eb8c83285f5eff0d81a43a1f6d7847cabb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:VST3A5VJ5BM66NZ2AB4QECCRYS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Boushra Almazroua, Dana Alhaidan, Fatima Alkhomayes, Jumana Almuhaidib, Maryam Alothman, Rabab Alkhalifa","submitted_at":"2025-05-23T18:14:24Z","abstract_excerpt":"The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with wide-ranging applications in logistics, routing, and intelligent systems. Due to its factorial complexity, solving large-scale instances requires scalable and efficient algorithmic frameworks, often enabled by parallel computing. This literature review provides a comparative evaluation of parallel TSP optimization methods, including exact algorithms, heuristic-based approaches, hybrid metaheuristics, and machine learning-enhanced models. In addition, we introduce task-specific evaluation metric"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18278","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.18278/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Icooi5f2yYO9jVXK/lNUQ6UNU1NS3ts8r5yu5pTDgX+uCQlr02C4s0mnR10de2NWUgGvHZE5bBvIW+Z7TO12Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T19:46:22.236940Z"},"content_sha256":"766085905fe7c2cd969032e8328bd782f076b7bc25ace30d283684388ab338a4","schema_version":"1.0","event_id":"sha256:766085905fe7c2cd969032e8328bd782f076b7bc25ace30d283684388ab338a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/bundle.json","state_url":"https://pith.science/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/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-08-07T19:46:22Z","links":{"resolver":"https://pith.science/pith/VST3A5VJ5BM66NZ2AB4QECCRYS","bundle":"https://pith.science/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/bundle.json","state":"https://pith.science/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VST3A5VJ5BM66NZ2AB4QECCRYS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VST3A5VJ5BM66NZ2AB4QECCRYS","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":"51631215a96ecf2fd3f33d968b2ebc56abffaf1302d4c7ed2315d743e4324abe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T18:14:24Z","title_canon_sha256":"f2f6f3854ae0e37d1a136fb48d3d2c327e8a9124e8f92566cd9d476efb1e9aa4"},"schema_version":"1.0","source":{"id":"2505.18278","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.18278","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2505.18278v1","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.18278","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"VST3A5VJ5BM6","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"VST3A5VJ5BM66NZ2","created_at":"2026-07-05T11:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"VST3A5VJ","created_at":"2026-07-05T11:08:44Z"}],"graph_snapshots":[{"event_id":"sha256:766085905fe7c2cd969032e8328bd782f076b7bc25ace30d283684388ab338a4","target":"graph","created_at":"2026-07-05T11:08: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.18278/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem with wide-ranging applications in logistics, routing, and intelligent systems. Due to its factorial complexity, solving large-scale instances requires scalable and efficient algorithmic frameworks, often enabled by parallel computing. This literature review provides a comparative evaluation of parallel TSP optimization methods, including exact algorithms, heuristic-based approaches, hybrid metaheuristics, and machine learning-enhanced models. In addition, we introduce task-specific evaluation metric","authors_text":"Boushra Almazroua, Dana Alhaidan, Fatima Alkhomayes, Jumana Almuhaidib, Maryam Alothman, Rabab Alkhalifa","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.18278","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:b752bf1b6ec8cf7a942cd8a525bee3eb8c83285f5eff0d81a43a1f6d7847cabb","target":"record","created_at":"2026-07-05T11:08: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":"51631215a96ecf2fd3f33d968b2ebc56abffaf1302d4c7ed2315d743e4324abe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T18:14:24Z","title_canon_sha256":"f2f6f3854ae0e37d1a136fb48d3d2c327e8a9124e8f92566cd9d476efb1e9aa4"},"schema_version":"1.0","source":{"id":"2505.18278","kind":"arxiv","version":1}},"canonical_sha256":"aca7b076a9e859ef373a0079020851c49d676af2acbab30c155b71df49b6ad67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aca7b076a9e859ef373a0079020851c49d676af2acbab30c155b71df49b6ad67","first_computed_at":"2026-07-05T11:08:44.008726Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:44.008726Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TIBaUAo5VBIvB5yaUJh9jaEGiNavXRkWcE+bl6zluroQc1SX3WuM3dYpgUOLh/4n+f+UQ9M5qOXAvh6M7e4XDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:44.009126Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.18278","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b752bf1b6ec8cf7a942cd8a525bee3eb8c83285f5eff0d81a43a1f6d7847cabb","sha256:766085905fe7c2cd969032e8328bd782f076b7bc25ace30d283684388ab338a4"],"state_sha256":"c01b5c6c2449db9ec02761232c98e4cea66addb30a955b8cdb57b54de85a7d36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbCtDEEe/Mt5CzBACSrS8WfvCDU1HfKt8hkuAZVabl+6mAMkS1sX7wUEhWq83uJsp8Yu9CKzbv+V1YRYlFdXBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T19:46:22.240832Z","bundle_sha256":"48e65ef1017c5b403a061b8e4beca1022909f276036b29a13393f5260f93f2c7"}}