{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:P4PFOJ24K2RB6MNNNZKD5GHV3D","short_pith_number":"pith:P4PFOJ24","schema_version":"1.0","canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","source":{"kind":"arxiv","id":"1208.2318","version":1},"attestation_state":"computed","paper":{"title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernd Bischl, Frank Neumann, Heike Trautmann, Markus Wagner, Olaf Mersmann","submitted_at":"2012-08-11T07:31:50Z","abstract_excerpt":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our"},"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":"1208.2318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-11T07:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"4deeaa562c8beec90bf5714a97172adad0903277d6a0a26b1ffec6b0261610be","abstract_canon_sha256":"417d7ed17e62f0efd4a46a49276d1cd631981992ae3c147ffc5e7bc1d4418652"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:58.203467Z","signature_b64":"ZLqYouSMRDoZD6eJnqXaFwz9FMdCAxwTsxVhFL7EwFj8dqkkARyKHuoUFtBpzta4nLlBR/QQHjkbPiiaVv4ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","last_reissued_at":"2026-05-18T03:48:58.202703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:58.202703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bernd Bischl, Frank Neumann, Heike Trautmann, Markus Wagner, Olaf Mersmann","submitted_at":"2012-08-11T07:31:50Z","abstract_excerpt":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2318","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":"1208.2318","created_at":"2026-05-18T03:48:58.202814+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.2318v1","created_at":"2026-05-18T03:48:58.202814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2318","created_at":"2026-05-18T03:48:58.202814+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4PFOJ24K2RB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4PFOJ24K2RB6MNN","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4PFOJ24","created_at":"2026-05-18T12:27:18.751474+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/P4PFOJ24K2RB6MNNNZKD5GHV3D","json":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D.json","graph_json":"https://pith.science/api/pith-number/P4PFOJ24K2RB6MNNNZKD5GHV3D/graph.json","events_json":"https://pith.science/api/pith-number/P4PFOJ24K2RB6MNNNZKD5GHV3D/events.json","paper":"https://pith.science/paper/P4PFOJ24"},"agent_actions":{"view_html":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D","download_json":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D.json","view_paper":"https://pith.science/paper/P4PFOJ24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.2318&json=true","fetch_graph":"https://pith.science/api/pith-number/P4PFOJ24K2RB6MNNNZKD5GHV3D/graph.json","fetch_events":"https://pith.science/api/pith-number/P4PFOJ24K2RB6MNNNZKD5GHV3D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/action/storage_attestation","attest_author":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/action/author_attestation","sign_citation":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/action/citation_signature","submit_replication":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/action/replication_record"}},"created_at":"2026-05-18T03:48:58.202814+00:00","updated_at":"2026-05-18T03:48:58.202814+00:00"}