{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NQOVY7BCGNB4MBPNZOSVQL6X6R","short_pith_number":"pith:NQOVY7BC","canonical_record":{"source":{"id":"1906.05926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-13T20:57:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08a766b83d8002d89a2e2a6d59c49521043d0f6e1aea1a0cb2055d4e7eca00e5","abstract_canon_sha256":"9fa9173ddba129e6694582af6f5b1a7aad7f152bd00abcf9b9c526877b818fb4"},"schema_version":"1.0"},"canonical_sha256":"6c1d5c7c223343c605edcba5582fd7f46841bd0c753c42709ad175c351e2d630","source":{"kind":"arxiv","id":"1906.05926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05926","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05926v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05926","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"NQOVY7BCGNB4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQOVY7BCGNB4MBPN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQOVY7BC","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NQOVY7BCGNB4MBPNZOSVQL6X6R","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-13T20:57:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"08a766b83d8002d89a2e2a6d59c49521043d0f6e1aea1a0cb2055d4e7eca00e5","abstract_canon_sha256":"9fa9173ddba129e6694582af6f5b1a7aad7f152bd00abcf9b9c526877b818fb4"},"schema_version":"1.0"},"canonical_sha256":"6c1d5c7c223343c605edcba5582fd7f46841bd0c753c42709ad175c351e2d630","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:20.303919Z","signature_b64":"q0HXsJPb3xSIJtv7erRjR9w1zAM1ZxU0TaE8sInNurvtWR1Zqp/2WY9WNr3Fe4OOY27TFwHk8fb0NhLxp5mpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c1d5c7c223343c605edcba5582fd7f46841bd0c753c42709ad175c351e2d630","last_reissued_at":"2026-05-17T23:43:20.303374Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:20.303374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05926","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBiXGSVQLhUVyxlwSs2xCRXW+efPSGgZuCyu7fpmWoEeZIX2I0iP48Lm1NYIv1jKfCx/+Ja1+sQSOFeTFar8Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:04:07.967734Z"},"content_sha256":"0fee92444df8e6bd3b7cf7af496fb636a01e783131921813bc32fe07101fb381","schema_version":"1.0","event_id":"sha256:0fee92444df8e6bd3b7cf7af496fb636a01e783131921813bc32fe07101fb381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NQOVY7BCGNB4MBPNZOSVQL6X6R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"N-body Approach to the Traveling Salesman Problem (TSP)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Bryant Wyatt, Edwin Gonzalez, Jesse Crawford, Johnny Seay, Stephen Lowe","submitted_at":"2019-06-13T20:57:50Z","abstract_excerpt":"In the Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city. The TSP has a wide range of applications in many different industries including, but not limited to, optimizing mail and shipping routes, guiding industrial machines, mapping genomes, and improving autonomous vehicles. For centuries, traveling salesmen, politicians, and circuit preachers have tackled their own versions of the problem. Within the last century, the TSP has become on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05926","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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KB1V8SWl5t8nEVZd5yqWbkxxX3pKvlq3Y+Eugb2jYs1Yiwjica5sXO0eErl7atKT+5IvFeDOPl/4B7HY7as/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-14T11:04:07.968080Z"},"content_sha256":"3d0c44299f4646d2fdadae34cc9cfe8a1f326a9ad9802477d1d54a38b6f4475f","schema_version":"1.0","event_id":"sha256:3d0c44299f4646d2fdadae34cc9cfe8a1f326a9ad9802477d1d54a38b6f4475f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/bundle.json","state_url":"https://pith.science/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/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-07-14T11:04:07Z","links":{"resolver":"https://pith.science/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R","bundle":"https://pith.science/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/bundle.json","state":"https://pith.science/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQOVY7BCGNB4MBPNZOSVQL6X6R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NQOVY7BCGNB4MBPNZOSVQL6X6R","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":"9fa9173ddba129e6694582af6f5b1a7aad7f152bd00abcf9b9c526877b818fb4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-13T20:57:50Z","title_canon_sha256":"08a766b83d8002d89a2e2a6d59c49521043d0f6e1aea1a0cb2055d4e7eca00e5"},"schema_version":"1.0","source":{"id":"1906.05926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05926","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05926v1","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05926","created_at":"2026-05-17T23:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"NQOVY7BCGNB4","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NQOVY7BCGNB4MBPN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NQOVY7BC","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:3d0c44299f4646d2fdadae34cc9cfe8a1f326a9ad9802477d1d54a38b6f4475f","target":"graph","created_at":"2026-05-17T23:43:20Z","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 Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city. The TSP has a wide range of applications in many different industries including, but not limited to, optimizing mail and shipping routes, guiding industrial machines, mapping genomes, and improving autonomous vehicles. For centuries, traveling salesmen, politicians, and circuit preachers have tackled their own versions of the problem. Within the last century, the TSP has become on","authors_text":"Bryant Wyatt, Edwin Gonzalez, Jesse Crawford, Johnny Seay, Stephen Lowe","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-13T20:57:50Z","title":"N-body Approach to the Traveling Salesman Problem (TSP)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05926","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:0fee92444df8e6bd3b7cf7af496fb636a01e783131921813bc32fe07101fb381","target":"record","created_at":"2026-05-17T23:43:20Z","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":"9fa9173ddba129e6694582af6f5b1a7aad7f152bd00abcf9b9c526877b818fb4","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-06-13T20:57:50Z","title_canon_sha256":"08a766b83d8002d89a2e2a6d59c49521043d0f6e1aea1a0cb2055d4e7eca00e5"},"schema_version":"1.0","source":{"id":"1906.05926","kind":"arxiv","version":1}},"canonical_sha256":"6c1d5c7c223343c605edcba5582fd7f46841bd0c753c42709ad175c351e2d630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c1d5c7c223343c605edcba5582fd7f46841bd0c753c42709ad175c351e2d630","first_computed_at":"2026-05-17T23:43:20.303374Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:20.303374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q0HXsJPb3xSIJtv7erRjR9w1zAM1ZxU0TaE8sInNurvtWR1Zqp/2WY9WNr3Fe4OOY27TFwHk8fb0NhLxp5mpAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:20.303919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fee92444df8e6bd3b7cf7af496fb636a01e783131921813bc32fe07101fb381","sha256:3d0c44299f4646d2fdadae34cc9cfe8a1f326a9ad9802477d1d54a38b6f4475f"],"state_sha256":"f1088e256a1c1a234233c46a088c48024ef6c29965af4d05bb7242263a5a2a22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O96hIwF2edizdpkThhn9hiW6uWX3Bq0p4rB2JXGp7ktCYutWDRYuT4T1HqHvx+05wxDkZAh7/12P7Kjxo3dbBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-14T11:04:07.970166Z","bundle_sha256":"c4e56b0a7d4f77c2fa70261ddfe4dd1aa70a0cdc10e5c3d2df15322655a9fb60"}}