{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I5KW3CWI2OOCQ74QDDB3XJCUZL","short_pith_number":"pith:I5KW3CWI","schema_version":"1.0","canonical_sha256":"47556d8ac8d39c287f9018c3bba454caf7de50fd22b16ae2d8b0b4d4d50969bd","source":{"kind":"arxiv","id":"1301.6667","version":1},"attestation_state":"computed","paper":{"title":"Extremal antipodal polygons and polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.MG","authors_text":"C. Ochoa, J. M. D\\'iaz-B\\'a\\~nez, L.E. Caraballo, O. Aichholzer, P. Nigsch, R. Fabila-Monroy","submitted_at":"2013-01-28T20:48:30Z","abstract_excerpt":"Let $S$ be a set of $2n$ points on a circle such that for each point $p \\in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \\emph{antipodal} if it consists of precisely one point of each antipodal pair $(p,p')$ of $S$.\n  We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all antipodal polygons of $S$. Based on this characterization, a simple linear time algorithm is presented for computing extremal antipodal polygons. Moreover, for the generalizatio"},"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":"1301.6667","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-01-28T20:48:30Z","cross_cats_sorted":["cs.CG","math.CO"],"title_canon_sha256":"649001cd37a83000b48891f4234cbdc37b4d7c4473e1f6464d37b05caae7f90f","abstract_canon_sha256":"5d2771d5072f87fafc1170fb303ff01f563aa7dda87af41117c79e6d1dd910ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:14.697688Z","signature_b64":"dF02uMV+hUTM/KIk8JeKsyU0GnWJ8JfRfHiGOZUeS0iszN14CzYh8oDB7/vHq1E/lW+CKaFfalBGcykCemZQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47556d8ac8d39c287f9018c3bba454caf7de50fd22b16ae2d8b0b4d4d50969bd","last_reissued_at":"2026-05-18T03:35:14.697084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:14.697084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extremal antipodal polygons and polytopes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","math.CO"],"primary_cat":"math.MG","authors_text":"C. Ochoa, J. M. D\\'iaz-B\\'a\\~nez, L.E. Caraballo, O. Aichholzer, P. Nigsch, R. Fabila-Monroy","submitted_at":"2013-01-28T20:48:30Z","abstract_excerpt":"Let $S$ be a set of $2n$ points on a circle such that for each point $p \\in S$ also its antipodal (mirrored with respect to the circle center) point $p'$ belongs to $S$. A polygon $P$ of size $n$ is called \\emph{antipodal} if it consists of precisely one point of each antipodal pair $(p,p')$ of $S$.\n  We provide a complete characterization of antipodal polygons which maximize (minimize, respectively) the area among all antipodal polygons of $S$. Based on this characterization, a simple linear time algorithm is presented for computing extremal antipodal polygons. Moreover, for the generalizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6667","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":"1301.6667","created_at":"2026-05-18T03:35:14.697175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6667v1","created_at":"2026-05-18T03:35:14.697175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6667","created_at":"2026-05-18T03:35:14.697175+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5KW3CWI2OOC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5KW3CWI2OOCQ74Q","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5KW3CWI","created_at":"2026-05-18T12:27:46.883200+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/I5KW3CWI2OOCQ74QDDB3XJCUZL","json":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL.json","graph_json":"https://pith.science/api/pith-number/I5KW3CWI2OOCQ74QDDB3XJCUZL/graph.json","events_json":"https://pith.science/api/pith-number/I5KW3CWI2OOCQ74QDDB3XJCUZL/events.json","paper":"https://pith.science/paper/I5KW3CWI"},"agent_actions":{"view_html":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL","download_json":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL.json","view_paper":"https://pith.science/paper/I5KW3CWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6667&json=true","fetch_graph":"https://pith.science/api/pith-number/I5KW3CWI2OOCQ74QDDB3XJCUZL/graph.json","fetch_events":"https://pith.science/api/pith-number/I5KW3CWI2OOCQ74QDDB3XJCUZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL/action/storage_attestation","attest_author":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL/action/author_attestation","sign_citation":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL/action/citation_signature","submit_replication":"https://pith.science/pith/I5KW3CWI2OOCQ74QDDB3XJCUZL/action/replication_record"}},"created_at":"2026-05-18T03:35:14.697175+00:00","updated_at":"2026-05-18T03:35:14.697175+00:00"}