{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NYOJZUML3O2N2VAIQKCGS5SJSK","short_pith_number":"pith:NYOJZUML","schema_version":"1.0","canonical_sha256":"6e1c9cd18bdbb4dd5408828469764992a67cb4d6a85bf35b251d897a0df94fce","source":{"kind":"arxiv","id":"1608.01716","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01716","created_at":"2026-05-18T00:00:37.305336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01716v4","created_at":"2026-05-18T00:00:37.305336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01716","created_at":"2026-05-18T00:00:37.305336+00:00"},{"alias_kind":"pith_short_12","alias_value":"NYOJZUML3O2N","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NYOJZUML3O2N2VAI","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NYOJZUML","created_at":"2026-05-18T12:30:36.002864+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK","json":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK.json","graph_json":"https://pith.science/api/pith-number/NYOJZUML3O2N2VAIQKCGS5SJSK/graph.json","events_json":"https://pith.science/api/pith-number/NYOJZUML3O2N2VAIQKCGS5SJSK/events.json","paper":"https://pith.science/paper/NYOJZUML"},"agent_actions":{"view_html":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK","download_json":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK.json","view_paper":"https://pith.science/paper/NYOJZUML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01716&json=true","fetch_graph":"https://pith.science/api/pith-number/NYOJZUML3O2N2VAIQKCGS5SJSK/graph.json","fetch_events":"https://pith.science/api/pith-number/NYOJZUML3O2N2VAIQKCGS5SJSK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/action/storage_attestation","attest_author":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/action/author_attestation","sign_citation":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/action/citation_signature","submit_replication":"https://pith.science/pith/NYOJZUML3O2N2VAIQKCGS5SJSK/action/replication_record"}},"created_at":"2026-05-18T00:00:37.305336+00:00","updated_at":"2026-05-18T00:00:37.305336+00:00"}