{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:YK2TQWOBFDQS5PXHJ6ZBCIQKRY","short_pith_number":"pith:YK2TQWOB","schema_version":"1.0","canonical_sha256":"c2b53859c128e12ebee74fb211220a8e06651fcef9223bb01868c8f0f95bf5aa","source":{"kind":"arxiv","id":"1209.2171","version":1},"attestation_state":"computed","paper":{"title":"A Generalization of the Convex Kakeya Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Hee-Kap Ahn, Joachim Gudmundsson, Otfried Cheong, Sang Won Bae, Takeshi Tokuyama","submitted_at":"2012-09-10T22:39:05Z","abstract_excerpt":"Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal \\Theta(n log n)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instea"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1209.2171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-09-10T22:39:05Z","cross_cats_sorted":[],"title_canon_sha256":"fadc67eced12dfee4f1634e1c89fb358710caab0b5d3b4666a0301e30eff07c3","abstract_canon_sha256":"c3a2894d403465f899b3ebed47c8f1ef3f239b8fc2d10299ba7a364582ebc562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:52.675676Z","signature_b64":"OWanumnMPUwLAs2CLg6j67L0P25CQU4W2qOVOUmI3+dwPDGFMYyy2ipRb5h/VdQe48OTmeK+vTsUZHmWLY0VBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b53859c128e12ebee74fb211220a8e06651fcef9223bb01868c8f0f95bf5aa","last_reissued_at":"2026-05-18T03:45:52.675016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:52.675016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalization of the Convex Kakeya Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Antoine Vigneron, Hee-Kap Ahn, Joachim Gudmundsson, Otfried Cheong, Sang Won Bae, Takeshi Tokuyama","submitted_at":"2012-09-10T22:39:05Z","abstract_excerpt":"Given a set of line segments in the plane, not necessarily finite, what is a convex region of smallest area that contains a translate of each input segment? This question can be seen as a generalization of Kakeya's problem of finding a convex region of smallest area such that a needle can be rotated through 360 degrees within this region. We show that there is always an optimal region that is a triangle, and we give an optimal \\Theta(n log n)-time algorithm to compute such a triangle for a given set of n segments. We also show that, if the goal is to minimize the perimeter of the region instea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2171","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.2171","created_at":"2026-05-18T03:45:52.675118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2171v1","created_at":"2026-05-18T03:45:52.675118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2171","created_at":"2026-05-18T03:45:52.675118+00:00"},{"alias_kind":"pith_short_12","alias_value":"YK2TQWOBFDQS","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"YK2TQWOBFDQS5PXH","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"YK2TQWOB","created_at":"2026-05-18T12:27:27.928770+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY","json":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY.json","graph_json":"https://pith.science/api/pith-number/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/graph.json","events_json":"https://pith.science/api/pith-number/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/events.json","paper":"https://pith.science/paper/YK2TQWOB"},"agent_actions":{"view_html":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY","download_json":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY.json","view_paper":"https://pith.science/paper/YK2TQWOB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2171&json=true","fetch_graph":"https://pith.science/api/pith-number/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/graph.json","fetch_events":"https://pith.science/api/pith-number/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/action/storage_attestation","attest_author":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/action/author_attestation","sign_citation":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/action/citation_signature","submit_replication":"https://pith.science/pith/YK2TQWOBFDQS5PXHJ6ZBCIQKRY/action/replication_record"}},"created_at":"2026-05-18T03:45:52.675118+00:00","updated_at":"2026-05-18T03:45:52.675118+00:00"}