{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:P4PFOJ24K2RB6MNNNZKD5GHV3D","short_pith_number":"pith:P4PFOJ24","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"},"canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","source":{"kind":"arxiv","id":"1208.2318","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2318","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2318v1","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2318","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"P4PFOJ24K2RB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P4PFOJ24K2RB6MNN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P4PFOJ24","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:P4PFOJ24K2RB6MNNNZKD5GHV3D","target":"record","payload":{"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"},"canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","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"},"source_kind":"arxiv","source_id":"1208.2318","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-18T03:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5I/kW5/yasiMiJigrd++uhCherxC1EkZ3WaPLy+khKwbFzMc1eYUeTTfkQWevwrowPRQKKQ8adnS6fm84IVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:37.362175Z"},"content_sha256":"dc32710d5639dbf670c3633d4c3353a26395f7c67f35895af9a440681fdd4178","schema_version":"1.0","event_id":"sha256:dc32710d5639dbf670c3633d4c3353a26395f7c67f35895af9a440681fdd4178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:P4PFOJ24K2RB6MNNNZKD5GHV3D","target":"graph","payload":{"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"},"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-18T03:48:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H9zVB2Po1JBwoIVk31iXiJVvYd74xQfddOnWr4Qc9Gx83D9YDXp4nlD5z0j5ULynyOTgASzV0mLrDZ0Lsv2tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:29:37.362538Z"},"content_sha256":"f4d2d7de9c49e87ed50da1e195ef1f04d1055f5da20a2a55fc7f3b4cbe21379c","schema_version":"1.0","event_id":"sha256:f4d2d7de9c49e87ed50da1e195ef1f04d1055f5da20a2a55fc7f3b4cbe21379c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/bundle.json","state_url":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/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-06-01T15:29:37Z","links":{"resolver":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D","bundle":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/bundle.json","state":"https://pith.science/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P4PFOJ24K2RB6MNNNZKD5GHV3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:P4PFOJ24K2RB6MNNNZKD5GHV3D","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":"417d7ed17e62f0efd4a46a49276d1cd631981992ae3c147ffc5e7bc1d4418652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-11T07:31:50Z","title_canon_sha256":"4deeaa562c8beec90bf5714a97172adad0903277d6a0a26b1ffec6b0261610be"},"schema_version":"1.0","source":{"id":"1208.2318","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.2318","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.2318v1","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.2318","created_at":"2026-05-18T03:48:58Z"},{"alias_kind":"pith_short_12","alias_value":"P4PFOJ24K2RB","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"P4PFOJ24K2RB6MNN","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"P4PFOJ24","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:f4d2d7de9c49e87ed50da1e195ef1f04d1055f5da20a2a55fc7f3b4cbe21379c","target":"graph","created_at":"2026-05-18T03:48:58Z","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":"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","authors_text":"Bernd Bischl, Frank Neumann, Heike Trautmann, Markus Wagner, Olaf Mersmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-11T07:31:50Z","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.2318","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:dc32710d5639dbf670c3633d4c3353a26395f7c67f35895af9a440681fdd4178","target":"record","created_at":"2026-05-18T03:48:58Z","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":"417d7ed17e62f0efd4a46a49276d1cd631981992ae3c147ffc5e7bc1d4418652","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-08-11T07:31:50Z","title_canon_sha256":"4deeaa562c8beec90bf5714a97172adad0903277d6a0a26b1ffec6b0261610be"},"schema_version":"1.0","source":{"id":"1208.2318","kind":"arxiv","version":1}},"canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f1e57275c56a21f31ad6e543e98f5d8d560172cc313210d4be5d547cc51589a","first_computed_at":"2026-05-18T03:48:58.202703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:58.202703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZLqYouSMRDoZD6eJnqXaFwz9FMdCAxwTsxVhFL7EwFj8dqkkARyKHuoUFtBpzta4nLlBR/QQHjkbPiiaVv4ZAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:58.203467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.2318","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc32710d5639dbf670c3633d4c3353a26395f7c67f35895af9a440681fdd4178","sha256:f4d2d7de9c49e87ed50da1e195ef1f04d1055f5da20a2a55fc7f3b4cbe21379c"],"state_sha256":"22d19122bffa3b093edb4ab3ae966bc05ffde37c42289eefaed02a3893e71a9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77nlFmppK5qrA9cGvWIv7Al9Kmz46JzuuS0IbiS9mCP0lYCeGClNlu8fgWy2jFCw4LrQ4enNyFTf1jl0Mqh0DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:29:37.364438Z","bundle_sha256":"0d72b7de0c25b3396ac5c386651de54f6adfcea40825bdb904de892f3069700b"}}