{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3VI2E2USUPLSWE66SC2DIYLUL7","short_pith_number":"pith:3VI2E2US","canonical_record":{"source":{"id":"1803.00849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-02T13:58:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f954c469f2d0a740fde1cb20c005abac7f9f7651e6a70e68796b4d4be0b0f3ea","abstract_canon_sha256":"23d0bb973659f8b3054a507926f461222301fc3f7780f0f7598ed8fb15e3eeb2"},"schema_version":"1.0"},"canonical_sha256":"dd51a26a92a3d72b13de90b43461745ff705ac23ae992f910a90d70359e17acb","source":{"kind":"arxiv","id":"1803.00849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00849","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00849v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00849","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"3VI2E2USUPLS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3VI2E2USUPLSWE66","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3VI2E2US","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3VI2E2USUPLSWE66SC2DIYLUL7","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-02T13:58:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"f954c469f2d0a740fde1cb20c005abac7f9f7651e6a70e68796b4d4be0b0f3ea","abstract_canon_sha256":"23d0bb973659f8b3054a507926f461222301fc3f7780f0f7598ed8fb15e3eeb2"},"schema_version":"1.0"},"canonical_sha256":"dd51a26a92a3d72b13de90b43461745ff705ac23ae992f910a90d70359e17acb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:07.676998Z","signature_b64":"nYLcwPwb/vZ2YjE6YdOaKRyY7/Gtfslznwu2VFyLfwWSwvIBEYvAq+Eh8wIWE4638YTEfsZhocusLyr/TZQ+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd51a26a92a3d72b13de90b43461745ff705ac23ae992f910a90d70359e17acb","last_reissued_at":"2026-05-18T00:22:07.676384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:07.676384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00849","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-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cs3nO5DPK72L4he+AZBBRkzeZ/jF3DGRN7hw14IIgP2Fby65T74XQoAjBQBe23BGP1HiQblOd9NBGOdsiaEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:39:27.209391Z"},"content_sha256":"03c370455e866f99979ab50ae6f6c320c32d379e6ea8603746e1d63c38008b7e","schema_version":"1.0","event_id":"sha256:03c370455e866f99979ab50ae6f6c320c32d379e6ea8603746e1d63c38008b7e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3VI2E2USUPLSWE66SC2DIYLUL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum Volume Subset Selection for Anchored Boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Karl Bringmann, Michael T.M. Emmerich, Sergio Cabello","submitted_at":"2018-03-02T13:58:44Z","abstract_excerpt":"Let $B$ be a set of $n$ axis-parallel boxes in $\\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of selecting $k$ boxes in $B$ that maximize the volume of the union of the selected boxes. This research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem can be solved in polynomial time in the plane, while the best known "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00849","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"},"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-05-18T00:22:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4AUuJJyMOATDbWWCjSLisqCKxN6TD17ofb0yLU8w+pcsxTwC/bAibJ4bGS7BiDMId8P5+sxN3/I65B7rpAZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:39:27.210098Z"},"content_sha256":"4761b3dc8264c35d2b9beb8211ceda76565edcdc5cfea569bef6c2f35e82dd06","schema_version":"1.0","event_id":"sha256:4761b3dc8264c35d2b9beb8211ceda76565edcdc5cfea569bef6c2f35e82dd06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VI2E2USUPLSWE66SC2DIYLUL7/bundle.json","state_url":"https://pith.science/pith/3VI2E2USUPLSWE66SC2DIYLUL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VI2E2USUPLSWE66SC2DIYLUL7/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-05-24T01:39:27Z","links":{"resolver":"https://pith.science/pith/3VI2E2USUPLSWE66SC2DIYLUL7","bundle":"https://pith.science/pith/3VI2E2USUPLSWE66SC2DIYLUL7/bundle.json","state":"https://pith.science/pith/3VI2E2USUPLSWE66SC2DIYLUL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VI2E2USUPLSWE66SC2DIYLUL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3VI2E2USUPLSWE66SC2DIYLUL7","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":"23d0bb973659f8b3054a507926f461222301fc3f7780f0f7598ed8fb15e3eeb2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-02T13:58:44Z","title_canon_sha256":"f954c469f2d0a740fde1cb20c005abac7f9f7651e6a70e68796b4d4be0b0f3ea"},"schema_version":"1.0","source":{"id":"1803.00849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00849","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00849v1","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00849","created_at":"2026-05-18T00:22:07Z"},{"alias_kind":"pith_short_12","alias_value":"3VI2E2USUPLS","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"3VI2E2USUPLSWE66","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"3VI2E2US","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:4761b3dc8264c35d2b9beb8211ceda76565edcdc5cfea569bef6c2f35e82dd06","target":"graph","created_at":"2026-05-18T00:22:07Z","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"},"paper":{"abstract_excerpt":"Let $B$ be a set of $n$ axis-parallel boxes in $\\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of selecting $k$ boxes in $B$ that maximize the volume of the union of the selected boxes. This research is motivated by applications in skyline queries for databases and in multicriteria optimization, where the problem is known as the hypervolume subset selection problem. It is known that the problem can be solved in polynomial time in the plane, while the best known ","authors_text":"Karl Bringmann, Michael T.M. Emmerich, Sergio Cabello","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-02T13:58:44Z","title":"Maximum Volume Subset Selection for Anchored Boxes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00849","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:03c370455e866f99979ab50ae6f6c320c32d379e6ea8603746e1d63c38008b7e","target":"record","created_at":"2026-05-18T00:22:07Z","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":"23d0bb973659f8b3054a507926f461222301fc3f7780f0f7598ed8fb15e3eeb2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-03-02T13:58:44Z","title_canon_sha256":"f954c469f2d0a740fde1cb20c005abac7f9f7651e6a70e68796b4d4be0b0f3ea"},"schema_version":"1.0","source":{"id":"1803.00849","kind":"arxiv","version":1}},"canonical_sha256":"dd51a26a92a3d72b13de90b43461745ff705ac23ae992f910a90d70359e17acb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd51a26a92a3d72b13de90b43461745ff705ac23ae992f910a90d70359e17acb","first_computed_at":"2026-05-18T00:22:07.676384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:07.676384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nYLcwPwb/vZ2YjE6YdOaKRyY7/Gtfslznwu2VFyLfwWSwvIBEYvAq+Eh8wIWE4638YTEfsZhocusLyr/TZQ+Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:07.676998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03c370455e866f99979ab50ae6f6c320c32d379e6ea8603746e1d63c38008b7e","sha256:4761b3dc8264c35d2b9beb8211ceda76565edcdc5cfea569bef6c2f35e82dd06"],"state_sha256":"a8759b2a45dd6f7287bf41e54b5c5a87d16b588d1c69bdc401aab13924b5a9c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z93mLXjVe5847+faT7tDueS2UGqB/1gqc+t8Auy6M/gC41EcUWM1/0YLEypOKO2VLDlgJjoKjS6S/kfQecSqBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T01:39:27.214276Z","bundle_sha256":"ef8a42a84ecbbf98c25b4a9532dba6372fd8360a226c36b7aec3f288169ea769"}}