{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SGSHJ5SIFVI5XB6ECO4DYHTHFK","short_pith_number":"pith:SGSHJ5SI","schema_version":"1.0","canonical_sha256":"91a474f6482d51db87c413b83c1e672aa7c2a874b2cc481118e6b0c4050ea7d6","source":{"kind":"arxiv","id":"2507.02381","version":1},"attestation_state":"computed","paper":{"title":"Running-time Analysis of ($\\mu+\\lambda$) Evolutionary Combinatorial Optimization Based on Multiple-gain Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Han Huang, Min Huang, Pengxiang Chen, Tongli He, Yushan Zhang, Zhifeng Hao","submitted_at":"2025-07-03T07:23:57Z","abstract_excerpt":"The running-time analysis of evolutionary combinatorial optimization is a fundamental topic in evolutionary computation. However, theoretical results regarding the $(\\mu+\\lambda)$ evolutionary algorithm (EA) for combinatorial optimization problems remain relatively scarce compared to those for simple pseudo-Boolean problems. This paper proposes a multiple-gain model to analyze the running time of EAs for combinatorial optimization problems. The proposed model is an improved version of the average gain model, which is a fitness-difference drift approach under the sigma-algebra condition to esti"},"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":"2507.02381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2025-07-03T07:23:57Z","cross_cats_sorted":[],"title_canon_sha256":"0232882d0eb037319869f34ef03c25822e47afe86a8c085308c3985e710107ec","abstract_canon_sha256":"e6c45dcc42dbe9d434bbbdd6e1d30f43ffc562359007f1b2b40c5828a33db462"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:17.294089Z","signature_b64":"h2uAZwm1ns4x6N57WnpYEqPWQS0/I0+IvWfLAhBaAVZPc/omY/KY7mRyWsNMVsik0cexJQpoEGQhMQTtq1LvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91a474f6482d51db87c413b83c1e672aa7c2a874b2cc481118e6b0c4050ea7d6","last_reissued_at":"2026-07-05T11:31:17.293463Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:17.293463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Running-time Analysis of ($\\mu+\\lambda$) Evolutionary Combinatorial Optimization Based on Multiple-gain Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Han Huang, Min Huang, Pengxiang Chen, Tongli He, Yushan Zhang, Zhifeng Hao","submitted_at":"2025-07-03T07:23:57Z","abstract_excerpt":"The running-time analysis of evolutionary combinatorial optimization is a fundamental topic in evolutionary computation. However, theoretical results regarding the $(\\mu+\\lambda)$ evolutionary algorithm (EA) for combinatorial optimization problems remain relatively scarce compared to those for simple pseudo-Boolean problems. This paper proposes a multiple-gain model to analyze the running time of EAs for combinatorial optimization problems. The proposed model is an improved version of the average gain model, which is a fitness-difference drift approach under the sigma-algebra condition to esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.02381","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.02381/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.02381","created_at":"2026-07-05T11:31:17.293541+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.02381v1","created_at":"2026-07-05T11:31:17.293541+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.02381","created_at":"2026-07-05T11:31:17.293541+00:00"},{"alias_kind":"pith_short_12","alias_value":"SGSHJ5SIFVI5","created_at":"2026-07-05T11:31:17.293541+00:00"},{"alias_kind":"pith_short_16","alias_value":"SGSHJ5SIFVI5XB6E","created_at":"2026-07-05T11:31:17.293541+00:00"},{"alias_kind":"pith_short_8","alias_value":"SGSHJ5SI","created_at":"2026-07-05T11:31:17.293541+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/SGSHJ5SIFVI5XB6ECO4DYHTHFK","json":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK.json","graph_json":"https://pith.science/api/pith-number/SGSHJ5SIFVI5XB6ECO4DYHTHFK/graph.json","events_json":"https://pith.science/api/pith-number/SGSHJ5SIFVI5XB6ECO4DYHTHFK/events.json","paper":"https://pith.science/paper/SGSHJ5SI"},"agent_actions":{"view_html":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK","download_json":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK.json","view_paper":"https://pith.science/paper/SGSHJ5SI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.02381&json=true","fetch_graph":"https://pith.science/api/pith-number/SGSHJ5SIFVI5XB6ECO4DYHTHFK/graph.json","fetch_events":"https://pith.science/api/pith-number/SGSHJ5SIFVI5XB6ECO4DYHTHFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK/action/storage_attestation","attest_author":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK/action/author_attestation","sign_citation":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK/action/citation_signature","submit_replication":"https://pith.science/pith/SGSHJ5SIFVI5XB6ECO4DYHTHFK/action/replication_record"}},"created_at":"2026-07-05T11:31:17.293541+00:00","updated_at":"2026-07-05T11:31:17.293541+00:00"}