{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PH5SC57CKIUCSPEHV7JG6BSU7I","short_pith_number":"pith:PH5SC57C","canonical_record":{"source":{"id":"2409.10232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-16T12:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"aa6898d6d4ef926d110edca40f666b092a7d108ad326428daa3b271d9169c7f9","abstract_canon_sha256":"4e37373712f8d0e40928359fd3b1d21c0a5fae5fcb18dc66f3423135cb7048b0"},"schema_version":"1.0"},"canonical_sha256":"79fb2177e25228293c87afd26f0654fa320f2af50bb386bc86b21188b42ecd00","source":{"kind":"arxiv","id":"2409.10232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10232","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10232v1","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10232","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_12","alias_value":"PH5SC57CKIUC","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5SC57CKIUCSPEH","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5SC57C","created_at":"2026-07-05T09:07:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PH5SC57CKIUCSPEHV7JG6BSU7I","target":"record","payload":{"canonical_record":{"source":{"id":"2409.10232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-16T12:31:11Z","cross_cats_sorted":[],"title_canon_sha256":"aa6898d6d4ef926d110edca40f666b092a7d108ad326428daa3b271d9169c7f9","abstract_canon_sha256":"4e37373712f8d0e40928359fd3b1d21c0a5fae5fcb18dc66f3423135cb7048b0"},"schema_version":"1.0"},"canonical_sha256":"79fb2177e25228293c87afd26f0654fa320f2af50bb386bc86b21188b42ecd00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:37.215384Z","signature_b64":"DS3lyxU9EPMm37cmCV2H56v2SDssgk+SK53i1jGs4DrhXZhHLsACEN/jDJM66a+wOLXG5F0rpBJw2If5kF7XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79fb2177e25228293c87afd26f0654fa320f2af50bb386bc86b21188b42ecd00","last_reissued_at":"2026-07-05T09:07:37.214914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:37.214914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.10232","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:07:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XvPlHXw3NjwQwOK9xPJzNd/QvvG6M1+bDrX8SrDphP0QiSbtFjZH8Kw7ZqccM57XzRXDO0CQnAA0HmJwtv9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:43:29.567496Z"},"content_sha256":"36ed82981019b58ca02461f8b84428a383b56b0c163f13c1d34c1e996ca22132","schema_version":"1.0","event_id":"sha256:36ed82981019b58ca02461f8b84428a383b56b0c163f13c1d34c1e996ca22132"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PH5SC57CKIUCSPEHV7JG6BSU7I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carina Truschel, Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt","submitted_at":"2024-09-16T12:31:11Z","abstract_excerpt":"In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets. In this article, we consider the task of computing the Pareto sum of two given Pareto sets $A, B$ of size $n$. The Pareto sum $C$ contains all non-dominated points of the Minkowski sum $M = \\{a+b|a \\in A, b\\in B\\}$. Since the Minkowski sum has a size of $n^2$, but the Pareto sum $C$ can be much smaller, the goal is to compute "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10232","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/2409.10232/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:07:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VnC3z34xz0U6O8oxtzLsJFNmCmPaHUYSSxfhmrO7R8dt03nwRyYT1ijqlRXtr5c+TRfEm2DsgGi0uDqMJIofBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:43:29.568151Z"},"content_sha256":"35c8ccd5fc58784ade91ec18474aa2a833f72816cc811f23e5cf0a5160a27aa2","schema_version":"1.0","event_id":"sha256:35c8ccd5fc58784ade91ec18474aa2a833f72816cc811f23e5cf0a5160a27aa2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/bundle.json","state_url":"https://pith.science/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/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-08-06T16:43:29Z","links":{"resolver":"https://pith.science/pith/PH5SC57CKIUCSPEHV7JG6BSU7I","bundle":"https://pith.science/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/bundle.json","state":"https://pith.science/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PH5SC57CKIUCSPEHV7JG6BSU7I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PH5SC57CKIUCSPEHV7JG6BSU7I","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":"4e37373712f8d0e40928359fd3b1d21c0a5fae5fcb18dc66f3423135cb7048b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-16T12:31:11Z","title_canon_sha256":"aa6898d6d4ef926d110edca40f666b092a7d108ad326428daa3b271d9169c7f9"},"schema_version":"1.0","source":{"id":"2409.10232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10232","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10232v1","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10232","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_12","alias_value":"PH5SC57CKIUC","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_16","alias_value":"PH5SC57CKIUCSPEH","created_at":"2026-07-05T09:07:37Z"},{"alias_kind":"pith_short_8","alias_value":"PH5SC57C","created_at":"2026-07-05T09:07:37Z"}],"graph_snapshots":[{"event_id":"sha256:35c8ccd5fc58784ade91ec18474aa2a833f72816cc811f23e5cf0a5160a27aa2","target":"graph","created_at":"2026-07-05T09:07:37Z","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/2409.10232/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets. In this article, we consider the task of computing the Pareto sum of two given Pareto sets $A, B$ of size $n$. The Pareto sum $C$ contains all non-dominated points of the Minkowski sum $M = \\{a+b|a \\in A, b\\in B\\}$. Since the Minkowski sum has a size of $n^2$, but the Pareto sum $C$ can be much smaller, the goal is to compute ","authors_text":"Carina Truschel, Daniel Funke, Demian Hespe, Peter Sanders, Sabine Storandt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-16T12:31:11Z","title":"Pareto Sums of Pareto Sets: Lower Bounds and Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10232","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:36ed82981019b58ca02461f8b84428a383b56b0c163f13c1d34c1e996ca22132","target":"record","created_at":"2026-07-05T09:07:37Z","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":"4e37373712f8d0e40928359fd3b1d21c0a5fae5fcb18dc66f3423135cb7048b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-16T12:31:11Z","title_canon_sha256":"aa6898d6d4ef926d110edca40f666b092a7d108ad326428daa3b271d9169c7f9"},"schema_version":"1.0","source":{"id":"2409.10232","kind":"arxiv","version":1}},"canonical_sha256":"79fb2177e25228293c87afd26f0654fa320f2af50bb386bc86b21188b42ecd00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79fb2177e25228293c87afd26f0654fa320f2af50bb386bc86b21188b42ecd00","first_computed_at":"2026-07-05T09:07:37.214914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:07:37.214914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DS3lyxU9EPMm37cmCV2H56v2SDssgk+SK53i1jGs4DrhXZhHLsACEN/jDJM66a+wOLXG5F0rpBJw2If5kF7XBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:07:37.215384Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36ed82981019b58ca02461f8b84428a383b56b0c163f13c1d34c1e996ca22132","sha256:35c8ccd5fc58784ade91ec18474aa2a833f72816cc811f23e5cf0a5160a27aa2"],"state_sha256":"80d401638f13bc87c33127a308aaff187e7ecebfbabcb774ac01eb6f58b8993c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YkdAxr4WbT406xDRlBdaoh1ZRVgn4Rvto1Ibj7J8ku+I4mdrCaeiZZdKcWdAeb0+xeonKOtxoa2rs6G/2iAgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:43:29.575080Z","bundle_sha256":"e67c9077e84949514c9c50a11a6f3daab3474b22db07a79b0e28d373a0d6ab73"}}