{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AUEETSOM2GTO57LS2FMMXC6MXS","short_pith_number":"pith:AUEETSOM","schema_version":"1.0","canonical_sha256":"050849c9ccd1a6eefd72d158cb8bccbc8fff562fe845cab7340b6e829eaa5dda","source":{"kind":"arxiv","id":"1411.1699","version":2},"attestation_state":"computed","paper":{"title":"The $2nd-$convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"J. Lea\\~nos, L. M. Rivera-Mart\\'inez, M. Lomeli, M. Ram\\'irez-Ib\\'a\\~nez","submitted_at":"2014-11-02T21:43:32Z","abstract_excerpt":"A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$. In this paper it is shown that for $n\\geq 8$, the second convex hull of every optimal rectilinear drawing of the complete graph $K_n$ is a triangle."},"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":"1411.1699","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-11-02T21:43:32Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"8ffafe86c1e3eaf03d976f13f5b24e2896e41c0753434a2c79daf5075070d403","abstract_canon_sha256":"ab270ef51d6bd1c67aceb179864570e6548ca358e3d9e99ddab7ccb5624041df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:25.353135Z","signature_b64":"yhF2JIdy5M/GJB4UaPOYPmR6Rd79GJPxlE2R0Yk3APPW05HGKCxEzk3PetR7P+iVS4Lsdfc8YVNF1vBYNLqhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"050849c9ccd1a6eefd72d158cb8bccbc8fff562fe845cab7340b6e829eaa5dda","last_reissued_at":"2026-05-18T01:12:25.352797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:25.352797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $2nd-$convex hull of every optimal rectilinear drawing of $K_{n}$ is a triangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.MG","authors_text":"J. Lea\\~nos, L. M. Rivera-Mart\\'inez, M. Lomeli, M. Ram\\'irez-Ib\\'a\\~nez","submitted_at":"2014-11-02T21:43:32Z","abstract_excerpt":"A rectilinear drawing of a graph $G$ is optimal if it has the smallest number of crossings among all rectilinear drawings of $G$. In this paper it is shown that for $n\\geq 8$, the second convex hull of every optimal rectilinear drawing of the complete graph $K_n$ is a triangle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1699","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.1699","created_at":"2026-05-18T01:12:25.352854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1699v2","created_at":"2026-05-18T01:12:25.352854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1699","created_at":"2026-05-18T01:12:25.352854+00:00"},{"alias_kind":"pith_short_12","alias_value":"AUEETSOM2GTO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AUEETSOM2GTO57LS","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AUEETSOM","created_at":"2026-05-18T12:28:19.803747+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/AUEETSOM2GTO57LS2FMMXC6MXS","json":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS.json","graph_json":"https://pith.science/api/pith-number/AUEETSOM2GTO57LS2FMMXC6MXS/graph.json","events_json":"https://pith.science/api/pith-number/AUEETSOM2GTO57LS2FMMXC6MXS/events.json","paper":"https://pith.science/paper/AUEETSOM"},"agent_actions":{"view_html":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS","download_json":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS.json","view_paper":"https://pith.science/paper/AUEETSOM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1699&json=true","fetch_graph":"https://pith.science/api/pith-number/AUEETSOM2GTO57LS2FMMXC6MXS/graph.json","fetch_events":"https://pith.science/api/pith-number/AUEETSOM2GTO57LS2FMMXC6MXS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS/action/storage_attestation","attest_author":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS/action/author_attestation","sign_citation":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS/action/citation_signature","submit_replication":"https://pith.science/pith/AUEETSOM2GTO57LS2FMMXC6MXS/action/replication_record"}},"created_at":"2026-05-18T01:12:25.352854+00:00","updated_at":"2026-05-18T01:12:25.352854+00:00"}