{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VX2WAW4WSHJTK5WAWP2ZKRV4OM","short_pith_number":"pith:VX2WAW4W","canonical_record":{"source":{"id":"2205.14352","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-28T06:35:40Z","cross_cats_sorted":[],"title_canon_sha256":"0e284cd33779bcbffa77b0581efcdccd448ba4c9dbfee30cb1cc79b0819f21c9","abstract_canon_sha256":"265c6febcbc6f707907f0c5ec8b64e5c1cb27d1ff501f0e048ad6a531d96ffbd"},"schema_version":"1.0"},"canonical_sha256":"adf5605b9691d33576c0b3f59546bc73168c8a54dde1ec2fb8936e5b04496557","source":{"kind":"arxiv","id":"2205.14352","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14352","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14352v1","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14352","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"VX2WAW4WSHJT","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"VX2WAW4WSHJTK5WA","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"VX2WAW4W","created_at":"2026-07-05T04:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VX2WAW4WSHJTK5WAWP2ZKRV4OM","target":"record","payload":{"canonical_record":{"source":{"id":"2205.14352","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-28T06:35:40Z","cross_cats_sorted":[],"title_canon_sha256":"0e284cd33779bcbffa77b0581efcdccd448ba4c9dbfee30cb1cc79b0819f21c9","abstract_canon_sha256":"265c6febcbc6f707907f0c5ec8b64e5c1cb27d1ff501f0e048ad6a531d96ffbd"},"schema_version":"1.0"},"canonical_sha256":"adf5605b9691d33576c0b3f59546bc73168c8a54dde1ec2fb8936e5b04496557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:27:16.571640Z","signature_b64":"kfCi1L6JCHEaboRUM6XQcQA13OHFr6S38Q15TUgU+D6QDLujB9ESsPSpkmMMMtCeO7HomnErX1Wfhiv+QotNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adf5605b9691d33576c0b3f59546bc73168c8a54dde1ec2fb8936e5b04496557","last_reissued_at":"2026-07-05T04:27:16.571079Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:27:16.571079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2205.14352","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-05T04:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7h5t9IYwj7GcMfbqhKgi+AUuVAFOg6dYHWxDyjWkXfILNYiTb0izajImgjel5TAvL+4ezkMZLsoA3mtCzrkHDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:58:24.384719Z"},"content_sha256":"fe00faa9fe950869f365d7c18f30351c609435fde595e08629a1268db7a50fc9","schema_version":"1.0","event_id":"sha256:fe00faa9fe950869f365d7c18f30351c609435fde595e08629a1268db7a50fc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VX2WAW4WSHJTK5WAWP2ZKRV4OM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Travelling Salesman Problem: Parallel Implementations & Analysis","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amey Gohil, Manan Tayal, Tezan Sahu, Vyankatesh Sawalpurkar","submitted_at":"2022-05-28T06:35:40Z","abstract_excerpt":"The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is an NP-Hard problem focused on optimization. TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips; and can be slightly modified to appear as a sub-problem in many areas, such as DNA sequencing. In this paper, a study on parallelization of the Brute Force approach (under several paradigms) of the Travelling Salesman Problem is presented. Detailed timing studies for the serial and v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14352","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/2205.14352/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-05T04:27:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r3f8Uxc6PpgIDTxXGHjZ2KWWHrDEIWmfVvP0zYRAsmcLNU7aOhOVtbr/KFl5SJw6/9RF/z/3ZMjJUnuvvx5yAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:58:24.385629Z"},"content_sha256":"a660433ffe89731fa993441ac2b543a677ad50b5c8c11ebce431bdf5b4214ff3","schema_version":"1.0","event_id":"sha256:a660433ffe89731fa993441ac2b543a677ad50b5c8c11ebce431bdf5b4214ff3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/bundle.json","state_url":"https://pith.science/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/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-09T07:58:24Z","links":{"resolver":"https://pith.science/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM","bundle":"https://pith.science/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/bundle.json","state":"https://pith.science/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VX2WAW4WSHJTK5WAWP2ZKRV4OM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VX2WAW4WSHJTK5WAWP2ZKRV4OM","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":"265c6febcbc6f707907f0c5ec8b64e5c1cb27d1ff501f0e048ad6a531d96ffbd","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-28T06:35:40Z","title_canon_sha256":"0e284cd33779bcbffa77b0581efcdccd448ba4c9dbfee30cb1cc79b0819f21c9"},"schema_version":"1.0","source":{"id":"2205.14352","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2205.14352","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"arxiv_version","alias_value":"2205.14352v1","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.14352","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_12","alias_value":"VX2WAW4WSHJT","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"VX2WAW4WSHJTK5WA","created_at":"2026-07-05T04:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"VX2WAW4W","created_at":"2026-07-05T04:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:a660433ffe89731fa993441ac2b543a677ad50b5c8c11ebce431bdf5b4214ff3","target":"graph","created_at":"2026-07-05T04:27:16Z","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/2205.14352/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Traveling Salesman Problem (often called TSP) is a classic algorithmic problem in the field of computer science and operations research. It is an NP-Hard problem focused on optimization. TSP has several applications even in its purest formulation, such as planning, logistics, and the manufacture of microchips; and can be slightly modified to appear as a sub-problem in many areas, such as DNA sequencing. In this paper, a study on parallelization of the Brute Force approach (under several paradigms) of the Travelling Salesman Problem is presented. Detailed timing studies for the serial and v","authors_text":"Amey Gohil, Manan Tayal, Tezan Sahu, Vyankatesh Sawalpurkar","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-28T06:35:40Z","title":"Travelling Salesman Problem: Parallel Implementations & Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.14352","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:fe00faa9fe950869f365d7c18f30351c609435fde595e08629a1268db7a50fc9","target":"record","created_at":"2026-07-05T04:27:16Z","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":"265c6febcbc6f707907f0c5ec8b64e5c1cb27d1ff501f0e048ad6a531d96ffbd","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-28T06:35:40Z","title_canon_sha256":"0e284cd33779bcbffa77b0581efcdccd448ba4c9dbfee30cb1cc79b0819f21c9"},"schema_version":"1.0","source":{"id":"2205.14352","kind":"arxiv","version":1}},"canonical_sha256":"adf5605b9691d33576c0b3f59546bc73168c8a54dde1ec2fb8936e5b04496557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adf5605b9691d33576c0b3f59546bc73168c8a54dde1ec2fb8936e5b04496557","first_computed_at":"2026-07-05T04:27:16.571079Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:27:16.571079Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfCi1L6JCHEaboRUM6XQcQA13OHFr6S38Q15TUgU+D6QDLujB9ESsPSpkmMMMtCeO7HomnErX1Wfhiv+QotNDA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:27:16.571640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2205.14352","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fe00faa9fe950869f365d7c18f30351c609435fde595e08629a1268db7a50fc9","sha256:a660433ffe89731fa993441ac2b543a677ad50b5c8c11ebce431bdf5b4214ff3"],"state_sha256":"0447fe9492b3311fb10cc7bbc903e3a4086f885d7ab9bfd7d4e7ecd87c6c12d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BnDtOQg4PmSKwn0mfa0NzuphK5eWbact3cBemw2lfEaZRrSTLUMS1Z82QG0X6ATD3N80oXyNFzwGTjlLnprmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:58:24.392945Z","bundle_sha256":"0636611106e0a9fcdb499b195f42bd4a9174ce052f03d9f14fc980cafc35dc2c"}}