{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:T7FXDE3B6TVKSF43MDIBQPHPLT","short_pith_number":"pith:T7FXDE3B","canonical_record":{"source":{"id":"2410.19203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-10-24T23:24:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dba883a97c245320f43699a66c4d08b2ee53189713eda5c542213a67ec444574","abstract_canon_sha256":"7c6c931308568ddb2dc5a417b29c4e239033b37ea4f1fef1195004e7b48e74f7"},"schema_version":"1.0"},"canonical_sha256":"9fcb719361f4eaa9179b60d0183cef5ce865014ef56cbd7c0b9ba98abbf4ae5a","source":{"kind":"arxiv","id":"2410.19203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.19203","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"arxiv_version","alias_value":"2410.19203v1","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19203","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_12","alias_value":"T7FXDE3B6TVK","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"T7FXDE3B6TVKSF43","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"T7FXDE3B","created_at":"2026-07-05T09:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:T7FXDE3B6TVKSF43MDIBQPHPLT","target":"record","payload":{"canonical_record":{"source":{"id":"2410.19203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-10-24T23:24:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dba883a97c245320f43699a66c4d08b2ee53189713eda5c542213a67ec444574","abstract_canon_sha256":"7c6c931308568ddb2dc5a417b29c4e239033b37ea4f1fef1195004e7b48e74f7"},"schema_version":"1.0"},"canonical_sha256":"9fcb719361f4eaa9179b60d0183cef5ce865014ef56cbd7c0b9ba98abbf4ae5a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:53.151805Z","signature_b64":"jRW9ju1EACEOfAPrRLRsIUXQeeh3Z3vT2UcAQ54bA0UtV0SwWWNXbCPokEffkYxRmRqfwWnI5icdrGEWCmUxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fcb719361f4eaa9179b60d0183cef5ce865014ef56cbd7c0b9ba98abbf4ae5a","last_reissued_at":"2026-07-05T09:25:53.151279Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:53.151279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.19203","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-07-05T09:25:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+76xn+um2Rhkrz8ndC19bzxU0I2L02DcAb1cLUPxLQul5xj3ikPtOK5PgwQYhFHbyhudBaidxw8yv6qIwhLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T23:33:46.720926Z"},"content_sha256":"f968744fd7af6ff56302f10c4178eb2089cf16d5d9ebf202e5076401ae4e3a97","schema_version":"1.0","event_id":"sha256:f968744fd7af6ff56302f10c4178eb2089cf16d5d9ebf202e5076401ae4e3a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:T7FXDE3B6TVKSF43MDIBQPHPLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Inverse Modeling Constrained Multi-Objective Evolutionary Algorithm Based on Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.NE","authors_text":"Aluizio F. R. Ara\\'ujo, Lucas R. C. Farias","submitted_at":"2024-10-24T23:24:44Z","abstract_excerpt":"This paper introduces the inverse modeling constrained multi-objective evolutionary algorithm based on decomposition (IM-C-MOEA/D) for addressing constrained real-world optimization problems. Our research builds upon the advancements made in evolutionary computing-based inverse modeling, and it strategically bridges the gaps in applying inverse models based on decomposition to problem domains with constraints. The proposed approach is experimentally evaluated on diverse real-world problems (RWMOP1-35), showing superior performance to state-of-the-art constrained multi-objective evolutionary al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19203","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/2410.19203/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"},"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-07-05T09:25:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g+lZD/czIbV0VsA0lhcNamGGlL4QAuTqTDqEWhkvfUchMKPqAKB+20WS6dqPYhQAqfrIrUAdVLjmzDx8OkkVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-16T23:33:46.721294Z"},"content_sha256":"d806570c379b14af9009cc059bbad04066467b0192d5c2d43c89bb0a3b5d7cac","schema_version":"1.0","event_id":"sha256:d806570c379b14af9009cc059bbad04066467b0192d5c2d43c89bb0a3b5d7cac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/bundle.json","state_url":"https://pith.science/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/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-07-16T23:33:46Z","links":{"resolver":"https://pith.science/pith/T7FXDE3B6TVKSF43MDIBQPHPLT","bundle":"https://pith.science/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/bundle.json","state":"https://pith.science/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T7FXDE3B6TVKSF43MDIBQPHPLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:T7FXDE3B6TVKSF43MDIBQPHPLT","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":"7c6c931308568ddb2dc5a417b29c4e239033b37ea4f1fef1195004e7b48e74f7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-10-24T23:24:44Z","title_canon_sha256":"dba883a97c245320f43699a66c4d08b2ee53189713eda5c542213a67ec444574"},"schema_version":"1.0","source":{"id":"2410.19203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.19203","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"arxiv_version","alias_value":"2410.19203v1","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.19203","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_12","alias_value":"T7FXDE3B6TVK","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"T7FXDE3B6TVKSF43","created_at":"2026-07-05T09:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"T7FXDE3B","created_at":"2026-07-05T09:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:d806570c379b14af9009cc059bbad04066467b0192d5c2d43c89bb0a3b5d7cac","target":"graph","created_at":"2026-07-05T09:25:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.19203/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces the inverse modeling constrained multi-objective evolutionary algorithm based on decomposition (IM-C-MOEA/D) for addressing constrained real-world optimization problems. Our research builds upon the advancements made in evolutionary computing-based inverse modeling, and it strategically bridges the gaps in applying inverse models based on decomposition to problem domains with constraints. The proposed approach is experimentally evaluated on diverse real-world problems (RWMOP1-35), showing superior performance to state-of-the-art constrained multi-objective evolutionary al","authors_text":"Aluizio F. R. Ara\\'ujo, Lucas R. C. Farias","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-10-24T23:24:44Z","title":"An Inverse Modeling Constrained Multi-Objective Evolutionary Algorithm Based on Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.19203","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:f968744fd7af6ff56302f10c4178eb2089cf16d5d9ebf202e5076401ae4e3a97","target":"record","created_at":"2026-07-05T09:25:53Z","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":"7c6c931308568ddb2dc5a417b29c4e239033b37ea4f1fef1195004e7b48e74f7","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2024-10-24T23:24:44Z","title_canon_sha256":"dba883a97c245320f43699a66c4d08b2ee53189713eda5c542213a67ec444574"},"schema_version":"1.0","source":{"id":"2410.19203","kind":"arxiv","version":1}},"canonical_sha256":"9fcb719361f4eaa9179b60d0183cef5ce865014ef56cbd7c0b9ba98abbf4ae5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fcb719361f4eaa9179b60d0183cef5ce865014ef56cbd7c0b9ba98abbf4ae5a","first_computed_at":"2026-07-05T09:25:53.151279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:53.151279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jRW9ju1EACEOfAPrRLRsIUXQeeh3Z3vT2UcAQ54bA0UtV0SwWWNXbCPokEffkYxRmRqfwWnI5icdrGEWCmUxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:53.151805Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.19203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f968744fd7af6ff56302f10c4178eb2089cf16d5d9ebf202e5076401ae4e3a97","sha256:d806570c379b14af9009cc059bbad04066467b0192d5c2d43c89bb0a3b5d7cac"],"state_sha256":"45eae1a02e3c6af035d4834c497cf6b516c10b44e9bc01933a66c2e1892d69f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyvKoIZnDr0PuOCxl6fisvFP22JBUnCyoYnp5S6mvtpi83pwvJrKsqm45SiPm3iO9Bvjmj4AFFt9U+MAeprMBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-16T23:33:46.723456Z","bundle_sha256":"f59e73d5af49301bc9ce165a9de28676d1c082b2baccbd68289c7ac82c6087f0"}}