{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NEZALP5PWGPSZFCJG4PHLQCNCX","short_pith_number":"pith:NEZALP5P","schema_version":"1.0","canonical_sha256":"693205bfafb19f2c9449371e75c04d15debcbde7c89e063820b6d76f2c20001e","source":{"kind":"arxiv","id":"1207.0578","version":2},"attestation_state":"computed","paper":{"title":"Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Andrew M. Sutton, Frank Neumann","submitted_at":"2012-07-03T06:21:11Z","abstract_excerpt":"Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP).\n  We investigate the structural properties in TSP instances that influence the optimization process of evolutionary algorithms and use this information to bound the runtime of simple evolutionary algorithms. Our analysis studies the runtime in dependence of the number o"},"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":"1207.0578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-07-03T06:21:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"062bf05625129f38ef13ee1202ddd21f69ecc9d113072249cf3981810c48a80f","abstract_canon_sha256":"34d6672423422120a9b368a45faa60a3263b246830ead956fea09f4738c75905"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:42.028593Z","signature_b64":"mMcus+hHmla4mKsZB6JERe3g1KTdjWxwXoYbur60j+vVA8N7VjvMWaMlXZxGIpt6+/Roxl3/d6l3meKNs/TSBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"693205bfafb19f2c9449371e75c04d15debcbde7c89e063820b6d76f2c20001e","last_reissued_at":"2026-05-18T03:43:42.028034Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:42.028034Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Runtime Analyses of Evolutionary Algorithms for the Euclidean Traveling Salesperson Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NE","authors_text":"Andrew M. Sutton, Frank Neumann","submitted_at":"2012-07-03T06:21:11Z","abstract_excerpt":"Parameterized runtime analysis seeks to understand the influence of problem structure on algorithmic runtime. In this paper, we contribute to the theoretical understanding of evolutionary algorithms and carry out a parameterized analysis of evolutionary algorithms for the Euclidean traveling salesperson problem (Euclidean TSP).\n  We investigate the structural properties in TSP instances that influence the optimization process of evolutionary algorithms and use this information to bound the runtime of simple evolutionary algorithms. Our analysis studies the runtime in dependence of the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0578","kind":"arxiv","version":2},"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":"1207.0578","created_at":"2026-05-18T03:43:42.028120+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.0578v2","created_at":"2026-05-18T03:43:42.028120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0578","created_at":"2026-05-18T03:43:42.028120+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEZALP5PWGPS","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEZALP5PWGPSZFCJ","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEZALP5P","created_at":"2026-05-18T12:27:16.716162+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/NEZALP5PWGPSZFCJG4PHLQCNCX","json":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX.json","graph_json":"https://pith.science/api/pith-number/NEZALP5PWGPSZFCJG4PHLQCNCX/graph.json","events_json":"https://pith.science/api/pith-number/NEZALP5PWGPSZFCJG4PHLQCNCX/events.json","paper":"https://pith.science/paper/NEZALP5P"},"agent_actions":{"view_html":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX","download_json":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX.json","view_paper":"https://pith.science/paper/NEZALP5P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.0578&json=true","fetch_graph":"https://pith.science/api/pith-number/NEZALP5PWGPSZFCJG4PHLQCNCX/graph.json","fetch_events":"https://pith.science/api/pith-number/NEZALP5PWGPSZFCJG4PHLQCNCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX/action/storage_attestation","attest_author":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX/action/author_attestation","sign_citation":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX/action/citation_signature","submit_replication":"https://pith.science/pith/NEZALP5PWGPSZFCJG4PHLQCNCX/action/replication_record"}},"created_at":"2026-05-18T03:43:42.028120+00:00","updated_at":"2026-05-18T03:43:42.028120+00:00"}