{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SDRQCBG4P2JOFESULYPGM2LQGK","short_pith_number":"pith:SDRQCBG4","canonical_record":{"source":{"id":"1405.1223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-06T10:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"bea4af43e5af5d2767aaf8b70c25d5a2a5414efb34e12593f5f863a4180553eb","abstract_canon_sha256":"667a46aca24728a6e38692ab5dbf0ae3e140d49d16cfe0f202e9d8ed923e217f"},"schema_version":"1.0"},"canonical_sha256":"90e30104dc7e92e292545e1e6669703287b26b8455bef299b90da087bb2ff884","source":{"kind":"arxiv","id":"1405.1223","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1223","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1223v2","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1223","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"SDRQCBG4P2JO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SDRQCBG4P2JOFESU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SDRQCBG4","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SDRQCBG4P2JOFESULYPGM2LQGK","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1223","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-06T10:51:09Z","cross_cats_sorted":[],"title_canon_sha256":"bea4af43e5af5d2767aaf8b70c25d5a2a5414efb34e12593f5f863a4180553eb","abstract_canon_sha256":"667a46aca24728a6e38692ab5dbf0ae3e140d49d16cfe0f202e9d8ed923e217f"},"schema_version":"1.0"},"canonical_sha256":"90e30104dc7e92e292545e1e6669703287b26b8455bef299b90da087bb2ff884","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:01.691460Z","signature_b64":"i62zQb4KOg2e6+DjhGlPu8crd/ITNur7gAfBrAJpZ1NH+u4o9BLEhO3oKYji9QaAsXXeLCRg3YCS68k643ODBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90e30104dc7e92e292545e1e6669703287b26b8455bef299b90da087bb2ff884","last_reissued_at":"2026-05-18T02:41:01.690849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:01.690849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1223","source_version":2,"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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I1ZN6bxq9/G3DEqQSOK6oYrnL1LxbI+P97d5tzsu+KhLdLWTwM2O4J+lA4szWrlEr1vDA0iZAKs5oydX7U7rAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:17:53.583708Z"},"content_sha256":"7ef526fa63dedcf145d32cf69dddc467965319481f0492655d4421cd4372e40c","schema_version":"1.0","event_id":"sha256:7ef526fa63dedcf145d32cf69dddc467965319481f0492655d4421cd4372e40c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SDRQCBG4P2JOFESULYPGM2LQGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Largest Rectangles in Convex Polygons","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Christian Knauer, Lena Schlipf, Otfried Cheong, Sergio Cabello","submitted_at":"2014-05-06T10:51:09Z","abstract_excerpt":"We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time $O(n^3)$. We also give $(1-\\varepsilon)$-approximation algorithms that take time $O(\\varepsilon^{-3/2}+ \\varepsilon^{-1/2} \\log n)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1223","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"},"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-18T02:41:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RaadXnE9qU/arp2RdOAFF+iIv/jYv9MBaQjLjhXqmHlWfoqZGjFh0y7rH4zsCxY2jJxPp+8MJGUe2krdRKR4Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:17:53.584052Z"},"content_sha256":"3b0028c33e0cf3e69c6e31c4c85d6fe0ffefc1c49704816ee771b97040d6b316","schema_version":"1.0","event_id":"sha256:3b0028c33e0cf3e69c6e31c4c85d6fe0ffefc1c49704816ee771b97040d6b316"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDRQCBG4P2JOFESULYPGM2LQGK/bundle.json","state_url":"https://pith.science/pith/SDRQCBG4P2JOFESULYPGM2LQGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDRQCBG4P2JOFESULYPGM2LQGK/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-01T16:17:53Z","links":{"resolver":"https://pith.science/pith/SDRQCBG4P2JOFESULYPGM2LQGK","bundle":"https://pith.science/pith/SDRQCBG4P2JOFESULYPGM2LQGK/bundle.json","state":"https://pith.science/pith/SDRQCBG4P2JOFESULYPGM2LQGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDRQCBG4P2JOFESULYPGM2LQGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SDRQCBG4P2JOFESULYPGM2LQGK","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":"667a46aca24728a6e38692ab5dbf0ae3e140d49d16cfe0f202e9d8ed923e217f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-06T10:51:09Z","title_canon_sha256":"bea4af43e5af5d2767aaf8b70c25d5a2a5414efb34e12593f5f863a4180553eb"},"schema_version":"1.0","source":{"id":"1405.1223","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1223","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1223v2","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1223","created_at":"2026-05-18T02:41:01Z"},{"alias_kind":"pith_short_12","alias_value":"SDRQCBG4P2JO","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SDRQCBG4P2JOFESU","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SDRQCBG4","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:3b0028c33e0cf3e69c6e31c4c85d6fe0ffefc1c49704816ee771b97040d6b316","target":"graph","created_at":"2026-05-18T02:41:01Z","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":"We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time $O(n^3)$. We also give $(1-\\varepsilon)$-approximation algorithms that take time $O(\\varepsilon^{-3/2}+ \\varepsilon^{-1/2} \\log n)$.","authors_text":"Christian Knauer, Lena Schlipf, Otfried Cheong, Sergio Cabello","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-06T10:51:09Z","title":"Finding Largest Rectangles in Convex Polygons"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1223","kind":"arxiv","version":2},"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:7ef526fa63dedcf145d32cf69dddc467965319481f0492655d4421cd4372e40c","target":"record","created_at":"2026-05-18T02:41:01Z","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":"667a46aca24728a6e38692ab5dbf0ae3e140d49d16cfe0f202e9d8ed923e217f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-05-06T10:51:09Z","title_canon_sha256":"bea4af43e5af5d2767aaf8b70c25d5a2a5414efb34e12593f5f863a4180553eb"},"schema_version":"1.0","source":{"id":"1405.1223","kind":"arxiv","version":2}},"canonical_sha256":"90e30104dc7e92e292545e1e6669703287b26b8455bef299b90da087bb2ff884","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90e30104dc7e92e292545e1e6669703287b26b8455bef299b90da087bb2ff884","first_computed_at":"2026-05-18T02:41:01.690849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:01.690849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i62zQb4KOg2e6+DjhGlPu8crd/ITNur7gAfBrAJpZ1NH+u4o9BLEhO3oKYji9QaAsXXeLCRg3YCS68k643ODBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:01.691460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1223","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ef526fa63dedcf145d32cf69dddc467965319481f0492655d4421cd4372e40c","sha256:3b0028c33e0cf3e69c6e31c4c85d6fe0ffefc1c49704816ee771b97040d6b316"],"state_sha256":"036c7e03fe160e91eee05f8b9ce080d36da7ff588344320313e332e4e47d5210"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X5v4IkibD30ZcWdjFwmEsyq1hcV2Iqn6vnqV7ZxarJeI0KkMQRAR5KkYsb8RoKVDzDmjDNfxV+3qU/c5ajBiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:17:53.585961Z","bundle_sha256":"459f6d886e49775c32ea34d93fd18fe3ae37100acddf435b37bde1b7a60dc7ad"}}