{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:I324EOA43GHEVUXQ6WZPBVGLF7","short_pith_number":"pith:I324EOA4","schema_version":"1.0","canonical_sha256":"46f5c2381cd98e4ad2f0f5b2f0d4cb2ffad504616b43cdf78e3ad8cdbb3cee1b","source":{"kind":"arxiv","id":"2512.18343","version":2},"attestation_state":"computed","paper":{"title":"Large-scale benchmarking of multi-objective soft-computing metaheuristics for redundancy allocation in repairable k-out-of-n systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"David Ibehej, Jakub Kudela, Mateusz Oszczypa{\\l}a","submitted_at":"2025-12-20T12:16:37Z","abstract_excerpt":"This paper presents a large-scale budget-aware benchmark of multi-objective soft-computing metaheuristics for a bi-objective redundancy allocation problem in repairable k-out-of-n systems. The problem combines cost minimization and steady-state availability maximization under weight constraints, with binary subsystem-level decisions determining both the number of redundant components and the redundancy strategy. Four strategies are considered: cold standby, warm standby, hot standby, and a mixed active-warm standby strategy. Subsystem availability is evaluated using continuous-time Markov chai"},"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":"2512.18343","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-12-20T12:16:37Z","cross_cats_sorted":[],"title_canon_sha256":"49e2a9ba2d59d7a34257063c7c802716e69a99f77f6d842d3188499469010432","abstract_canon_sha256":"70bc4fd856918f2eb34a4127fc14d19d6377275977e395214a4421bcfcd8a9b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:52.714147Z","signature_b64":"oqMzTs7O9APRI1oQLqUAwx5leB19wNlSqF8kKPdUBnsma3ALSoR6lDJqgg7qAOuPLPWmL6ip1V5za58FeSmaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46f5c2381cd98e4ad2f0f5b2f0d4cb2ffad504616b43cdf78e3ad8cdbb3cee1b","last_reissued_at":"2026-06-23T03:13:52.713697Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:52.713697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large-scale benchmarking of multi-objective soft-computing metaheuristics for redundancy allocation in repairable k-out-of-n systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"David Ibehej, Jakub Kudela, Mateusz Oszczypa{\\l}a","submitted_at":"2025-12-20T12:16:37Z","abstract_excerpt":"This paper presents a large-scale budget-aware benchmark of multi-objective soft-computing metaheuristics for a bi-objective redundancy allocation problem in repairable k-out-of-n systems. The problem combines cost minimization and steady-state availability maximization under weight constraints, with binary subsystem-level decisions determining both the number of redundant components and the redundancy strategy. Four strategies are considered: cold standby, warm standby, hot standby, and a mixed active-warm standby strategy. Subsystem availability is evaluated using continuous-time Markov chai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.18343","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2512.18343/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":"2512.18343","created_at":"2026-06-23T03:13:52.713754+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.18343v2","created_at":"2026-06-23T03:13:52.713754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.18343","created_at":"2026-06-23T03:13:52.713754+00:00"},{"alias_kind":"pith_short_12","alias_value":"I324EOA43GHE","created_at":"2026-06-23T03:13:52.713754+00:00"},{"alias_kind":"pith_short_16","alias_value":"I324EOA43GHEVUXQ","created_at":"2026-06-23T03:13:52.713754+00:00"},{"alias_kind":"pith_short_8","alias_value":"I324EOA4","created_at":"2026-06-23T03:13:52.713754+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/I324EOA43GHEVUXQ6WZPBVGLF7","json":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7.json","graph_json":"https://pith.science/api/pith-number/I324EOA43GHEVUXQ6WZPBVGLF7/graph.json","events_json":"https://pith.science/api/pith-number/I324EOA43GHEVUXQ6WZPBVGLF7/events.json","paper":"https://pith.science/paper/I324EOA4"},"agent_actions":{"view_html":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7","download_json":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7.json","view_paper":"https://pith.science/paper/I324EOA4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.18343&json=true","fetch_graph":"https://pith.science/api/pith-number/I324EOA43GHEVUXQ6WZPBVGLF7/graph.json","fetch_events":"https://pith.science/api/pith-number/I324EOA43GHEVUXQ6WZPBVGLF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7/action/storage_attestation","attest_author":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7/action/author_attestation","sign_citation":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7/action/citation_signature","submit_replication":"https://pith.science/pith/I324EOA43GHEVUXQ6WZPBVGLF7/action/replication_record"}},"created_at":"2026-06-23T03:13:52.713754+00:00","updated_at":"2026-06-23T03:13:52.713754+00:00"}