{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5DDWFP6QL7JTPL32ZIRVSDFK7Z","short_pith_number":"pith:5DDWFP6Q","canonical_record":{"source":{"id":"1204.2034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-10T02:58:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50d7b52cac901ae62b983cdcf263ac50aaf0b0fa4b055283645db41f91bf2807","abstract_canon_sha256":"18bd58ee1973818ff25bcc77682206e66646d9cebc406731a996ab1e922c8d1c"},"schema_version":"1.0"},"canonical_sha256":"e8c762bfd05fd337af7aca23590caafe5db00f933df8bd2f95b636e650bbdb91","source":{"kind":"arxiv","id":"1204.2034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2034","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2034v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2034","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"5DDWFP6QL7JT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5DDWFP6QL7JTPL32","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5DDWFP6Q","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5DDWFP6QL7JTPL32ZIRVSDFK7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1204.2034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-10T02:58:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50d7b52cac901ae62b983cdcf263ac50aaf0b0fa4b055283645db41f91bf2807","abstract_canon_sha256":"18bd58ee1973818ff25bcc77682206e66646d9cebc406731a996ab1e922c8d1c"},"schema_version":"1.0"},"canonical_sha256":"e8c762bfd05fd337af7aca23590caafe5db00f933df8bd2f95b636e650bbdb91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:13.516880Z","signature_b64":"nK1FbTNeDVrbKvPVXRkvTiQfCHeAz+sz5fJ5FSctBvl++PWMoBLKwHIteseMw1CAmF9Tig/XOsDlzrE38REzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c762bfd05fd337af7aca23590caafe5db00f933df8bd2f95b636e650bbdb91","last_reissued_at":"2026-05-18T03:58:13.516431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:13.516431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.2034","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RwF4XaoIYglVX74g+Wpb3YnenD+WGOKRAepQcxDcVdyHASrcBEbLl5A5ocWrugtCvqfVDuXNCLhRqDGRrObsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:29:18.819564Z"},"content_sha256":"c8a3d5a3bae77702cbddbd0f85daa52b802e89f8162013726275713094b4af9c","schema_version":"1.0","event_id":"sha256:c8a3d5a3bae77702cbddbd0f85daa52b802e89f8162013726275713094b4af9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5DDWFP6QL7JTPL32ZIRVSDFK7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Techniques to find Optimal Planar Boxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"G. Navarro, J. Barbay, P. P\\'erez-Lantero","submitted_at":"2012-04-10T02:58:52Z","abstract_excerpt":"Given a set $P$ of $n$ planar points, two axes and a real-valued score function $f()$ on subsets of $P$, the Optimal Planar Box problem consists in finding a box (i.e. axis-aligned rectangle) $H$ maximizing $f(H\\cap P)$. We consider the case where $f()$ is monotone decomposable, i.e. there exists a composition function $g()$ monotone in its two arguments such that $f(A)=g(f(A_1),f(A_2))$ for every subset $A\\subseteq P$ and every partition $\\{A_1,A_2\\}$ of $A$. In this context we propose a solution for the Optimal Planar Box problem which performs in the worst case $O(n^2\\lg n)$ score compositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2034","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-18T03:58:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F25bYvknW4aSKD41OTxPs6ud/cuC/xvD8epPiA43EEOZE43HgUQNeG3yVN/0cdn+crdWO7gZcAkqfP6Af9zsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:29:18.819914Z"},"content_sha256":"1991271e053900704720fd01ea592b6eff31d2bff341a002e98a1b48f67a5a04","schema_version":"1.0","event_id":"sha256:1991271e053900704720fd01ea592b6eff31d2bff341a002e98a1b48f67a5a04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/bundle.json","state_url":"https://pith.science/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/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-06-02T12:29:18Z","links":{"resolver":"https://pith.science/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z","bundle":"https://pith.science/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/bundle.json","state":"https://pith.science/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DDWFP6QL7JTPL32ZIRVSDFK7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5DDWFP6QL7JTPL32ZIRVSDFK7Z","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":"18bd58ee1973818ff25bcc77682206e66646d9cebc406731a996ab1e922c8d1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-10T02:58:52Z","title_canon_sha256":"50d7b52cac901ae62b983cdcf263ac50aaf0b0fa4b055283645db41f91bf2807"},"schema_version":"1.0","source":{"id":"1204.2034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.2034","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"arxiv_version","alias_value":"1204.2034v1","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.2034","created_at":"2026-05-18T03:58:13Z"},{"alias_kind":"pith_short_12","alias_value":"5DDWFP6QL7JT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5DDWFP6QL7JTPL32","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5DDWFP6Q","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:1991271e053900704720fd01ea592b6eff31d2bff341a002e98a1b48f67a5a04","target":"graph","created_at":"2026-05-18T03:58:13Z","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":"Given a set $P$ of $n$ planar points, two axes and a real-valued score function $f()$ on subsets of $P$, the Optimal Planar Box problem consists in finding a box (i.e. axis-aligned rectangle) $H$ maximizing $f(H\\cap P)$. We consider the case where $f()$ is monotone decomposable, i.e. there exists a composition function $g()$ monotone in its two arguments such that $f(A)=g(f(A_1),f(A_2))$ for every subset $A\\subseteq P$ and every partition $\\{A_1,A_2\\}$ of $A$. In this context we propose a solution for the Optimal Planar Box problem which performs in the worst case $O(n^2\\lg n)$ score compositi","authors_text":"G. Navarro, J. Barbay, P. P\\'erez-Lantero","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-10T02:58:52Z","title":"Adaptive Techniques to find Optimal Planar Boxes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.2034","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:c8a3d5a3bae77702cbddbd0f85daa52b802e89f8162013726275713094b4af9c","target":"record","created_at":"2026-05-18T03:58:13Z","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":"18bd58ee1973818ff25bcc77682206e66646d9cebc406731a996ab1e922c8d1c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-04-10T02:58:52Z","title_canon_sha256":"50d7b52cac901ae62b983cdcf263ac50aaf0b0fa4b055283645db41f91bf2807"},"schema_version":"1.0","source":{"id":"1204.2034","kind":"arxiv","version":1}},"canonical_sha256":"e8c762bfd05fd337af7aca23590caafe5db00f933df8bd2f95b636e650bbdb91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8c762bfd05fd337af7aca23590caafe5db00f933df8bd2f95b636e650bbdb91","first_computed_at":"2026-05-18T03:58:13.516431Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:13.516431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nK1FbTNeDVrbKvPVXRkvTiQfCHeAz+sz5fJ5FSctBvl++PWMoBLKwHIteseMw1CAmF9Tig/XOsDlzrE38REzCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:13.516880Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.2034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8a3d5a3bae77702cbddbd0f85daa52b802e89f8162013726275713094b4af9c","sha256:1991271e053900704720fd01ea592b6eff31d2bff341a002e98a1b48f67a5a04"],"state_sha256":"1df9dd5d1f59290f1ec01cecfce76136853f88b2f68ae999864837aa3ebd9633"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjjeEWG5+F08UjzJy7dkfsj9X8wQ8luaE3yxmBuEImnj9S+CmLMjMKqkv+EJxR34+XMsWSnRnXYEMruM+AHoAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:29:18.821894Z","bundle_sha256":"5eee672d55b214a423aa72db2a7c18c2ca27bdda9cc2816077f5474a7d6e00b4"}}