{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QLZXALPOZQNEQPDVTV5XSO2LW5","short_pith_number":"pith:QLZXALPO","canonical_record":{"source":{"id":"1706.03049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T17:17:47Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"3770e32131189b2481b7e6c62fb73f01672bd9273fe0aad498a8e3c87696a469","abstract_canon_sha256":"de72875999d2cb1762689587bbbe8e994ae6b93edbe08173f3b8288479e61276"},"schema_version":"1.0"},"canonical_sha256":"82f3702deecc1a483c759d7b793b4bb742fe96090b499d583f90b7fbc70f7de7","source":{"kind":"arxiv","id":"1706.03049","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03049","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03049v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03049","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"QLZXALPOZQNE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QLZXALPOZQNEQPDV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QLZXALPO","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QLZXALPOZQNEQPDVTV5XSO2LW5","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T17:17:47Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"3770e32131189b2481b7e6c62fb73f01672bd9273fe0aad498a8e3c87696a469","abstract_canon_sha256":"de72875999d2cb1762689587bbbe8e994ae6b93edbe08173f3b8288479e61276"},"schema_version":"1.0"},"canonical_sha256":"82f3702deecc1a483c759d7b793b4bb742fe96090b499d583f90b7fbc70f7de7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:40.146177Z","signature_b64":"WttljFW/tbSzJ0Z2VqG5EUXiRMRQpx9TMsFGZWnQkr9vjerT9fD5PkIJbPSCLtlzb/Y1+WR/zwBT+VjsE2jDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"82f3702deecc1a483c759d7b793b4bb742fe96090b499d583f90b7fbc70f7de7","last_reissued_at":"2026-05-18T00:42:40.145444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:40.145444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03049","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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HyqkI2vb74/ZGBDrp0AOrvTrSW9ayG+Wcy5m/bLjkujJgOBk2r6PjV1DYXNkjPXcW94rpeObBd4MOLNNT//GDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:12.929232Z"},"content_sha256":"24bd5b011ba4bf7ffd8de22b83cc4978706b7e23e8e403b3f90c8d42987eef25","schema_version":"1.0","event_id":"sha256:24bd5b011ba4bf7ffd8de22b83cc4978706b7e23e8e403b3f90c8d42987eef25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QLZXALPOZQNEQPDVTV5XSO2LW5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"cs.CG","authors_text":"Yoav Kallus","submitted_at":"2017-06-09T17:17:47Z","abstract_excerpt":"Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, L\\\"offler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here we give an algorithm with linear time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03049","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:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+X9ZB0BRSxVutyH+/BM1H9N2kzmvZPanELbJ6kGRefYyiIJmOT33V+2ZGDJo6uWNwhukfZzRWdYpHTD9mPUdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:15:12.929955Z"},"content_sha256":"ce427d64902834477da0e403cd86baa7ca4aa147377ceebf61caf21295dc42f0","schema_version":"1.0","event_id":"sha256:ce427d64902834477da0e403cd86baa7ca4aa147377ceebf61caf21295dc42f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/bundle.json","state_url":"https://pith.science/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/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-07T16:15:12Z","links":{"resolver":"https://pith.science/pith/QLZXALPOZQNEQPDVTV5XSO2LW5","bundle":"https://pith.science/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/bundle.json","state":"https://pith.science/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QLZXALPOZQNEQPDVTV5XSO2LW5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QLZXALPOZQNEQPDVTV5XSO2LW5","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":"de72875999d2cb1762689587bbbe8e994ae6b93edbe08173f3b8288479e61276","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T17:17:47Z","title_canon_sha256":"3770e32131189b2481b7e6c62fb73f01672bd9273fe0aad498a8e3c87696a469"},"schema_version":"1.0","source":{"id":"1706.03049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03049","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03049v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03049","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"QLZXALPOZQNE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QLZXALPOZQNEQPDV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QLZXALPO","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ce427d64902834477da0e403cd86baa7ca4aa147377ceebf61caf21295dc42f0","target":"graph","created_at":"2026-05-18T00:42:40Z","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 the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, L\\\"offler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here we give an algorithm with linear time complexity.","authors_text":"Yoav Kallus","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T17:17:47Z","title":"A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03049","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:24bd5b011ba4bf7ffd8de22b83cc4978706b7e23e8e403b3f90c8d42987eef25","target":"record","created_at":"2026-05-18T00:42:40Z","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":"de72875999d2cb1762689587bbbe8e994ae6b93edbe08173f3b8288479e61276","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-06-09T17:17:47Z","title_canon_sha256":"3770e32131189b2481b7e6c62fb73f01672bd9273fe0aad498a8e3c87696a469"},"schema_version":"1.0","source":{"id":"1706.03049","kind":"arxiv","version":1}},"canonical_sha256":"82f3702deecc1a483c759d7b793b4bb742fe96090b499d583f90b7fbc70f7de7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"82f3702deecc1a483c759d7b793b4bb742fe96090b499d583f90b7fbc70f7de7","first_computed_at":"2026-05-18T00:42:40.145444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:40.145444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WttljFW/tbSzJ0Z2VqG5EUXiRMRQpx9TMsFGZWnQkr9vjerT9fD5PkIJbPSCLtlzb/Y1+WR/zwBT+VjsE2jDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:40.146177Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24bd5b011ba4bf7ffd8de22b83cc4978706b7e23e8e403b3f90c8d42987eef25","sha256:ce427d64902834477da0e403cd86baa7ca4aa147377ceebf61caf21295dc42f0"],"state_sha256":"f6ed4e201bcfd281b04148c99b5ced1cf2de26d381bbfd179e827b2a0e29b519"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cFEhtz/vwOGSIz+5zvitc0ag8tzKLj0uMzcEJOoCXaXgd30TeVrfQpWHdmNbSzCXv1pnILg0lIHccFuetzkMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:15:12.934101Z","bundle_sha256":"7112c69dd2cf2465da2cd4d55431e88786135080dfcbc0a6b9c88022ab986883"}}