{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UAKGGTDSEXLI74Z4DZ554ZZQGY","short_pith_number":"pith:UAKGGTDS","schema_version":"1.0","canonical_sha256":"a014634c7225d68ff33c1e7bde6730360f7390e2ac60c6aea964e8c4573471ef","source":{"kind":"arxiv","id":"1506.05424","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Algorithm for Multi-Objective Optimization by Greedy Hypervolume Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Conrado Silva Miranda, Fernando Jos\\'e Von Zuben","submitted_at":"2015-06-17T18:52:18Z","abstract_excerpt":"This paper introduces a high-performance hybrid algorithm, called Hybrid Hypervolume Maximization Algorithm (H2MA), for multi-objective optimization that alternates between exploring the decision space and exploiting the already obtained non-dominated solutions. The proposal is centered on maximizing the hypervolume indicator, thus converting the multi-objective problem into a single-objective one. The exploitation employs gradient-based methods, but considering a single candidate efficient solution at a time, to overcome limitations associated with population-based approaches and also to allo"},"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":"1506.05424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-06-17T18:52:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c040fcbb2f348103b2876089580f58bccbc78e74d003e27f770e57fe53a23e92","abstract_canon_sha256":"29b41912471a79f67631ed9f5e33125101a3d9b01fa07be58bc45a76782a175b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:46:12.318723Z","signature_b64":"FA3EdxGHPCZqiDI0JRj18OlSQxNe/uKAikmrrSamTaWTkmbrSlb8UlcFh/ADgrV3LJvMGTXyO9+Q+zanPBPOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a014634c7225d68ff33c1e7bde6730360f7390e2ac60c6aea964e8c4573471ef","last_reissued_at":"2026-05-18T01:46:12.318189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:46:12.318189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Algorithm for Multi-Objective Optimization by Greedy Hypervolume Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Conrado Silva Miranda, Fernando Jos\\'e Von Zuben","submitted_at":"2015-06-17T18:52:18Z","abstract_excerpt":"This paper introduces a high-performance hybrid algorithm, called Hybrid Hypervolume Maximization Algorithm (H2MA), for multi-objective optimization that alternates between exploring the decision space and exploiting the already obtained non-dominated solutions. The proposal is centered on maximizing the hypervolume indicator, thus converting the multi-objective problem into a single-objective one. The exploitation employs gradient-based methods, but considering a single candidate efficient solution at a time, to overcome limitations associated with population-based approaches and also to allo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.05424","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":"1506.05424","created_at":"2026-05-18T01:46:12.318256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.05424v1","created_at":"2026-05-18T01:46:12.318256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.05424","created_at":"2026-05-18T01:46:12.318256+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAKGGTDSEXLI","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAKGGTDSEXLI74Z4","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAKGGTDS","created_at":"2026-05-18T12:29:44.643036+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/UAKGGTDSEXLI74Z4DZ554ZZQGY","json":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY.json","graph_json":"https://pith.science/api/pith-number/UAKGGTDSEXLI74Z4DZ554ZZQGY/graph.json","events_json":"https://pith.science/api/pith-number/UAKGGTDSEXLI74Z4DZ554ZZQGY/events.json","paper":"https://pith.science/paper/UAKGGTDS"},"agent_actions":{"view_html":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY","download_json":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY.json","view_paper":"https://pith.science/paper/UAKGGTDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.05424&json=true","fetch_graph":"https://pith.science/api/pith-number/UAKGGTDSEXLI74Z4DZ554ZZQGY/graph.json","fetch_events":"https://pith.science/api/pith-number/UAKGGTDSEXLI74Z4DZ554ZZQGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY/action/storage_attestation","attest_author":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY/action/author_attestation","sign_citation":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY/action/citation_signature","submit_replication":"https://pith.science/pith/UAKGGTDSEXLI74Z4DZ554ZZQGY/action/replication_record"}},"created_at":"2026-05-18T01:46:12.318256+00:00","updated_at":"2026-05-18T01:46:12.318256+00:00"}