{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AFMXPLJXDZL2XH7K3QKOVMTCA4","short_pith_number":"pith:AFMXPLJX","schema_version":"1.0","canonical_sha256":"015977ad371e57ab9feadc14eab2620714bfed682523760d18df0af4d1dbfe22","source":{"kind":"arxiv","id":"1510.01963","version":2},"attestation_state":"computed","paper":{"title":"A Box Decomposition Algorithm to Compute the Hypervolume Indicator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Carlos M. Fonseca, Kathrin Klamroth, Renaud Lacour","submitted_at":"2015-10-07T14:39:23Z","abstract_excerpt":"We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We present a nonincremental algorithm and an incremental algorithm, which allows insertions of points, whose time complexities are $O(n^{\\lfloor \\frac{p-1}{2} \\rfloor+1})$ and $O(n^{\\lfloor \\frac{p}{2} \\rfloor+1})$, respectively. While the theoretical complexity of such a method is lower bounded by the complexity of the partition, which is, in the worst-case, larger than the best upper bound on the complexity of the hypervol"},"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":"1510.01963","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-07T14:39:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e9d402f2779f3cb5d92b18c693f56f0199a7b39ec8c5fbba0a42dc29deedf74","abstract_canon_sha256":"ee4431139c738c0c51b3ed9b194d2403161bc6e92cf6a50daf295706031914b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:48.545790Z","signature_b64":"p62yyYWS9FLAR72kE9Ud8TeUDfncpfWeFkXI6Jd083Q4moem5iBU9ygLVw2p5GwTOTOw90cGgypZk0rPALVvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"015977ad371e57ab9feadc14eab2620714bfed682523760d18df0af4d1dbfe22","last_reissued_at":"2026-05-18T01:30:48.545342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:48.545342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Box Decomposition Algorithm to Compute the Hypervolume Indicator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Carlos M. Fonseca, Kathrin Klamroth, Renaud Lacour","submitted_at":"2015-10-07T14:39:23Z","abstract_excerpt":"We propose a new approach to the computation of the hypervolume indicator, based on partitioning the dominated region into a set of axis-parallel hyperrectangles or boxes. We present a nonincremental algorithm and an incremental algorithm, which allows insertions of points, whose time complexities are $O(n^{\\lfloor \\frac{p-1}{2} \\rfloor+1})$ and $O(n^{\\lfloor \\frac{p}{2} \\rfloor+1})$, respectively. While the theoretical complexity of such a method is lower bounded by the complexity of the partition, which is, in the worst-case, larger than the best upper bound on the complexity of the hypervol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01963","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":"1510.01963","created_at":"2026-05-18T01:30:48.545415+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.01963v2","created_at":"2026-05-18T01:30:48.545415+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01963","created_at":"2026-05-18T01:30:48.545415+00:00"},{"alias_kind":"pith_short_12","alias_value":"AFMXPLJXDZL2","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AFMXPLJXDZL2XH7K","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AFMXPLJX","created_at":"2026-05-18T12:29:10.953037+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/AFMXPLJXDZL2XH7K3QKOVMTCA4","json":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4.json","graph_json":"https://pith.science/api/pith-number/AFMXPLJXDZL2XH7K3QKOVMTCA4/graph.json","events_json":"https://pith.science/api/pith-number/AFMXPLJXDZL2XH7K3QKOVMTCA4/events.json","paper":"https://pith.science/paper/AFMXPLJX"},"agent_actions":{"view_html":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4","download_json":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4.json","view_paper":"https://pith.science/paper/AFMXPLJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.01963&json=true","fetch_graph":"https://pith.science/api/pith-number/AFMXPLJXDZL2XH7K3QKOVMTCA4/graph.json","fetch_events":"https://pith.science/api/pith-number/AFMXPLJXDZL2XH7K3QKOVMTCA4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4/action/storage_attestation","attest_author":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4/action/author_attestation","sign_citation":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4/action/citation_signature","submit_replication":"https://pith.science/pith/AFMXPLJXDZL2XH7K3QKOVMTCA4/action/replication_record"}},"created_at":"2026-05-18T01:30:48.545415+00:00","updated_at":"2026-05-18T01:30:48.545415+00:00"}