{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4ZVW6MCYX4KA67M4ZQLIHII6QB","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4a4a48f5cc25e041200ad1c90e8b7e843f664b25074acf75a92d970a99f6caf2","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-08T09:53:57Z","title_canon_sha256":"8d06798e231e1bb484ea7b6a008a0c4d43850a490eb47657b8792a76cc75f194"},"schema_version":"1.0","source":{"id":"2605.07523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07523","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07523v1","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07523","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_12","alias_value":"4ZVW6MCYX4KA","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_16","alias_value":"4ZVW6MCYX4KA67M4","created_at":"2026-05-20T00:00:41Z"},{"alias_kind":"pith_short_8","alias_value":"4ZVW6MCY","created_at":"2026-05-20T00:00:41Z"}],"graph_snapshots":[{"event_id":"sha256:0848238933813894f02387e0ecb8d1c2851f9b32b26cb99bcf9925cc4501db03","target":"graph","created_at":"2026-05-20T00:00:41Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We present an algorithm to construct the Pareto front for possibly overlapping rectangles that is instance-optimal with respect to the number of retrievals, meaning that for every fixed input (F, P), there is no algorithm that retrieves asymptotically fewer regions to compute the output."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input consists of axis-aligned rectangles or unit squares in the plane and the Pareto front is defined via standard 2D dominance; the model assumes that retrieving a point from its region is the only way to resolve its exact position."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"An algorithm computes the Pareto front of imprecise overlapping rectangles by retrieving only the minimal number of exact points needed for any given input."}],"snapshot_sha256":"4304d08b93a1e9df4fea9a6169a3e1a83b4b7dc2da17cf4855c20f83c09178a1"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"99547bfbd014bae29bd29563305531cb9b3c74f6ad3d64b968d3fa3cc99dd83b"},"integrity":{"available":true,"clean":false,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.704137Z","status":"completed","version":"1.0.0"},{"findings_count":1,"name":"doi_compliance","ran_at":"2026-05-19T11:42:56.137400Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.07523/integrity.json","findings":[{"audited_at":"2026-05-19T11:42:56.137400Z","detected_arxiv_id":null,"detected_doi":"10.20382/jocg.v2i1a3ff.ffinria-00595823.13","detector":"doi_compliance","finding_type":"recoverable_identifier","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.20382/jocg.v2i1a3ff.ffinria-00595823.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","ref_index":5,"severity":"advisory","verdict_class":"incontrovertible"}],"snapshot_sha256":"a2b7998dfd7d1e7407206f090bd236176ff4ed354731b847414e34f1cfd1a258","summary":{"advisory":1,"by_detector":{"doi_compliance":{"advisory":1,"critical":0,"informational":0,"total":1}},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the imprecise geometry model, the input is an imprecise point set, which is a family of regions $F = (R_1, \\ldots,R_n)$, where for each $R_i$ one may retrieve the true point $p_i \\in R_i$. By preprocessing $F$, we can construct the output, in our case the Pareto front, on $P$ faster.\n  We efficiently construct the Pareto front of an imprecise point set in the plane. Efficiency is interpreted in two ways: minimizing (i) the number of retrievals, and (ii) the computation time used to determine the set of regions that must be retrieved and to construct the Pareto front.\n  We present an algorit","authors_text":"Daniel Rutschmann, Eva Rotenberg, Frida Astrup Eriksen, Ivor van der Hoog, Nynne Maria Foldager B{\\ae}kke, Sarita de Berg","cross_cats":["cs.DS"],"headline":"An algorithm computes the Pareto front of imprecise overlapping rectangles by retrieving only the minimal number of exact points needed for any given input.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-08T09:53:57Z","title":"Instance and Universally Optimal Bounds for Imprecise Pareto Fronts"},"references":{"count":13,"internal_anchors":0,"resolved_work":13,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.tcs.2022.07.016","is_internal_anchor":false,"ref_index":1,"title":"Jallu, Vahideh Keikha, Maarten Löffler, and Maria Saumell","work_id":"dffbd4e5-7b4a-4e5d-abaf-97aaad720277","year":2022},{"cited_arxiv_id":"","doi":"10.4230/lipics.esa.2025.25","is_internal_anchor":false,"ref_index":2,"title":"4 Sarita de Berg, Ivor van der Hoog, Eva Rotenberg, Daniel Rutschmann, and Sampson Wong","work_id":"190e8938-2429-42dd-bc5b-fad76f2212ad","year":2025},{"cited_arxiv_id":"","doi":"10.1007/s00224-004-1180-4","is_internal_anchor":false,"ref_index":3,"title":"5555/3235147","work_id":"1f988a2a-79c0-4753-9384-41fbdbbee627","year":2005},{"cited_arxiv_id":"","doi":"10.1137/0217026","is_internal_anchor":false,"ref_index":4,"title":"10 Bernard Chazelle","work_id":"853ed2a9-250c-4548-802d-979dbd0cbb13","year":1988},{"cited_arxiv_id":"","doi":"10.20382/jocg","is_internal_anchor":false,"ref_index":5,"title":"v2i1a3ff.ffinria-00595823","work_id":"9fb86da1-cbd9-40f2-a296-3298d5d0b768","year":2026}],"snapshot_sha256":"8aa9eda1f646e0cd91ffb161906963c63c280f5da348cfcbc9ced27350642f0e"},"source":{"id":"2605.07523","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-11T02:09:28.235998Z","id":"399efa97-6268-4e8b-9b1f-0633a7ac569b","model_set":{"reader":"grok-4.3"},"one_line_summary":"Instance-optimal retrieval algorithms for Pareto fronts of overlapping imprecise rectangles, plus universally optimal time bounds for unit squares.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"An algorithm computes the Pareto front of imprecise overlapping rectangles by retrieving only the minimal number of exact points needed for any given input.","strongest_claim":"We present an algorithm to construct the Pareto front for possibly overlapping rectangles that is instance-optimal with respect to the number of retrievals, meaning that for every fixed input (F, P), there is no algorithm that retrieves asymptotically fewer regions to compute the output.","weakest_assumption":"The input consists of axis-aligned rectangles or unit squares in the plane and the Pareto front is defined via standard 2D dominance; the model assumes that retrieving a point from its region is the only way to resolve its exact position."}},"verdict_id":"399efa97-6268-4e8b-9b1f-0633a7ac569b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3271bd3d32be4ec94ddd87420aa120e7463482db9e32c30a4f1647ec8c9d73a2","target":"record","created_at":"2026-05-20T00:00:41Z","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":"4a4a48f5cc25e041200ad1c90e8b7e843f664b25074acf75a92d970a99f6caf2","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2026-05-08T09:53:57Z","title_canon_sha256":"8d06798e231e1bb484ea7b6a008a0c4d43850a490eb47657b8792a76cc75f194"},"schema_version":"1.0","source":{"id":"2605.07523","kind":"arxiv","version":1}},"canonical_sha256":"e66b6f3058bf140f7d9ccc1683a11e80722fe578e48cd4cbfffabb947cc992c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e66b6f3058bf140f7d9ccc1683a11e80722fe578e48cd4cbfffabb947cc992c4","first_computed_at":"2026-05-20T00:00:41.268263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:41.268263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KDZND+x1EhRRjgwFvOLQ+JmcQapzQeYk3TMyIfWeAf8tLB+pLgCasnk2tWLEBo0x+7givscDmWYETQ8gGy3gCg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:41.269017Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.07523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59b0775d217ede2f57d69323107466d1c99836da1c10443ccfdca3a1c7631714","sha256:3271bd3d32be4ec94ddd87420aa120e7463482db9e32c30a4f1647ec8c9d73a2","sha256:0848238933813894f02387e0ecb8d1c2851f9b32b26cb99bcf9925cc4501db03"],"state_sha256":"cb58e3915203527c87364f2fec17cc466751097f76e5c25c3d19aa5107e8b797"}