{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NYOJZUML3O2N2VAIQKCGS5SJSK","short_pith_number":"pith:NYOJZUML","canonical_record":{"source":{"id":"1608.01716","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:18:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"666cc473ace875b1d860d5e7aec71c63e3afed785afed66a7f5c2e3e6be7eb9a","abstract_canon_sha256":"6d862c14e5c65edc21c89fd5ceccd5bd906df885ba66a7050e68e3f13103dcde"},"schema_version":"1.0"},"canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","source":{"kind":"arxiv","id":"1608.01716","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01716","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01716v4","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01716","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"NYOJZUML3O2N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYOJZUML3O2N2VAI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYOJZUML","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NYOJZUML3O2N2VAIQKCGS5SJSK","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01716","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:18:47Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"666cc473ace875b1d860d5e7aec71c63e3afed785afed66a7f5c2e3e6be7eb9a","abstract_canon_sha256":"6d862c14e5c65edc21c89fd5ceccd5bd906df885ba66a7050e68e3f13103dcde"},"schema_version":"1.0"},"canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:37.305740Z","signature_b64":"ZO5sJY2EiUchhq4amH5HyEwU9gpQx4tg9EVH+0JOzVfR1wkjM/PUD1r7ry+aqldyml63/1DpLTCsiHAA3UscAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","last_reissued_at":"2026-05-18T00:00:37.305246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:37.305246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01716","source_version":4,"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DYWNfOeV9QkDhAeqm4taRnOkN2PGXH7sVMJ4azhMHBz+0KyeU88Vd5oHvAdEkYl+1vG6Af8XPYn2EsN/imxUDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:23:52.141891Z"},"content_sha256":"677b738e4dafd9acdff1d7358fe178a1c3c7410f45596c4d327e8a94b22ec122","schema_version":"1.0","event_id":"sha256:677b738e4dafd9acdff1d7358fe178a1c3c7410f45596c4d327e8a94b22ec122"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NYOJZUML3O2N2VAIQKCGS5SJSK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.DS","authors_text":"Ali Jazayeri, Hiroki Sayama","submitted_at":"2016-08-04T23:18:47Z","abstract_excerpt":"We propose a new polynomial-time deterministic algorithm that produces an approximated solution for the traveling salesperson problem. The proposed algorithm ranks cities based on their priorities calculated using a power function of means and standard deviations of their distances from other cities and then connects the cities to their neighbors in the order of their priorities. When connecting a city, a neighbor is selected based on their neighbors' priorities calculated as another power function that additionally includes their distance from the focal city to be connected. This repeats unti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01716","kind":"arxiv","version":4},"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:00:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Es02o8ZTXEhDH0DDBXUXgLm3yUegYT6c3vIzDQr+ZB4QoMafZ7DjlCD2BjqtIGxF2uTaG2ZQsyEAosme3LsaBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T20:23:52.142227Z"},"content_sha256":"1bc29a05b338a4e4e84098e65b9671ba1e22079901aa91790faad44c50a5d717","schema_version":"1.0","event_id":"sha256:1bc29a05b338a4e4e84098e65b9671ba1e22079901aa91790faad44c50a5d717"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/bundle.json","state_url":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/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-04T20:23:52Z","links":{"resolver":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK","bundle":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/bundle.json","state":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NYOJZUML3O2N2VAIQKCGS5SJSK","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":"6d862c14e5c65edc21c89fd5ceccd5bd906df885ba66a7050e68e3f13103dcde","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:18:47Z","title_canon_sha256":"666cc473ace875b1d860d5e7aec71c63e3afed785afed66a7f5c2e3e6be7eb9a"},"schema_version":"1.0","source":{"id":"1608.01716","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01716","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01716v4","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01716","created_at":"2026-05-18T00:00:37Z"},{"alias_kind":"pith_short_12","alias_value":"NYOJZUML3O2N","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NYOJZUML3O2N2VAI","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NYOJZUML","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:1bc29a05b338a4e4e84098e65b9671ba1e22079901aa91790faad44c50a5d717","target":"graph","created_at":"2026-05-18T00:00:37Z","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":"We propose a new polynomial-time deterministic algorithm that produces an approximated solution for the traveling salesperson problem. The proposed algorithm ranks cities based on their priorities calculated using a power function of means and standard deviations of their distances from other cities and then connects the cities to their neighbors in the order of their priorities. When connecting a city, a neighbor is selected based on their neighbors' priorities calculated as another power function that additionally includes their distance from the focal city to be connected. This repeats unti","authors_text":"Ali Jazayeri, Hiroki Sayama","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:18:47Z","title":"A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01716","kind":"arxiv","version":4},"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:677b738e4dafd9acdff1d7358fe178a1c3c7410f45596c4d327e8a94b22ec122","target":"record","created_at":"2026-05-18T00:00:37Z","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":"6d862c14e5c65edc21c89fd5ceccd5bd906df885ba66a7050e68e3f13103dcde","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-04T23:18:47Z","title_canon_sha256":"666cc473ace875b1d860d5e7aec71c63e3afed785afed66a7f5c2e3e6be7eb9a"},"schema_version":"1.0","source":{"id":"1608.01716","kind":"arxiv","version":4}},"canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","first_computed_at":"2026-05-18T00:00:37.305246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:37.305246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZO5sJY2EiUchhq4amH5HyEwU9gpQx4tg9EVH+0JOzVfR1wkjM/PUD1r7ry+aqldyml63/1DpLTCsiHAA3UscAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:37.305740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01716","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:677b738e4dafd9acdff1d7358fe178a1c3c7410f45596c4d327e8a94b22ec122","sha256:1bc29a05b338a4e4e84098e65b9671ba1e22079901aa91790faad44c50a5d717"],"state_sha256":"ce065db4258929a4c2efc7885aeb524879b52a81b6002cf27ff81a958c8799d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T5ADV5tsEBOuIBUeEfJ+02z3+j96C+MMnK0/k1eCNJC3NLDADkwo2yl6iJvoUgnXfLLmd/+YI2Y9UtQmEO3OBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T20:23:52.144279Z","bundle_sha256":"999ef2285fe61038524ce62d23955ba1c8ab6aa32ff82a29be945cd66948545b"}}