{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MGGWIYYUNMC6LLT5OG45V6CJAS","short_pith_number":"pith:MGGWIYYU","schema_version":"1.0","canonical_sha256":"618d6463146b05e5ae7d71b9daf84904a0ae25fa30121749a1b49eeef9da0696","source":{"kind":"arxiv","id":"1107.0055","version":1},"attestation_state":"computed","paper":{"title":"Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"W. Zhang","submitted_at":"2011-06-30T20:45:03Z","abstract_excerpt":"In recent years, there has been much interest in phase transitions of combinatorial problems.  Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate the hardest problem instances.  In this paper, we study phase transitions of the asymmetric Traveling Salesman Problem (ATSP), an NP-hard combinatorial optimization problem that has many real-world applications.  Using random instances of up to 1,500 cities in which intercity distances are uniformly distributed, we empirically show that many properties of t"},"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":"1107.0055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-30T20:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"48b7540c92712d6376d4ce45c3735d794470e90dc48b4e69626042b8bcd3bcaf","abstract_canon_sha256":"e70e84fdcb1416cf3836d50df6640134cb14bde2dfe1b092133f51daf366a1a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:02.760355Z","signature_b64":"AE6fVjv+YvdgY3NR3Q+EznuzH78Z1/FeVwuUsDc44ZQ3KragGszQH2GUkzlCHcOmk1rXHYieVe53qVCcZCdWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618d6463146b05e5ae7d71b9daf84904a0ae25fa30121749a1b49eeef9da0696","last_reissued_at":"2026-05-18T04:19:02.759693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:02.759693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Phase Transitions and Backbones of the Asymmetric Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"W. Zhang","submitted_at":"2011-06-30T20:45:03Z","abstract_excerpt":"In recent years, there has been much interest in phase transitions of combinatorial problems.  Phase transitions have been successfully used to analyze combinatorial optimization problems, characterize their typical-case features and locate the hardest problem instances.  In this paper, we study phase transitions of the asymmetric Traveling Salesman Problem (ATSP), an NP-hard combinatorial optimization problem that has many real-world applications.  Using random instances of up to 1,500 cities in which intercity distances are uniformly distributed, we empirically show that many properties of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0055","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1107.0055","created_at":"2026-05-18T04:19:02.759797+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.0055v1","created_at":"2026-05-18T04:19:02.759797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0055","created_at":"2026-05-18T04:19:02.759797+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGGWIYYUNMC6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGGWIYYUNMC6LLT5","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGGWIYYU","created_at":"2026-05-18T12:26:34.985390+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/MGGWIYYUNMC6LLT5OG45V6CJAS","json":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS.json","graph_json":"https://pith.science/api/pith-number/MGGWIYYUNMC6LLT5OG45V6CJAS/graph.json","events_json":"https://pith.science/api/pith-number/MGGWIYYUNMC6LLT5OG45V6CJAS/events.json","paper":"https://pith.science/paper/MGGWIYYU"},"agent_actions":{"view_html":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS","download_json":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS.json","view_paper":"https://pith.science/paper/MGGWIYYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.0055&json=true","fetch_graph":"https://pith.science/api/pith-number/MGGWIYYUNMC6LLT5OG45V6CJAS/graph.json","fetch_events":"https://pith.science/api/pith-number/MGGWIYYUNMC6LLT5OG45V6CJAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS/action/storage_attestation","attest_author":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS/action/author_attestation","sign_citation":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS/action/citation_signature","submit_replication":"https://pith.science/pith/MGGWIYYUNMC6LLT5OG45V6CJAS/action/replication_record"}},"created_at":"2026-05-18T04:19:02.759797+00:00","updated_at":"2026-05-18T04:19:02.759797+00:00"}