{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D6FO45DQ3LZD6PXT5JTZ5QQY72","short_pith_number":"pith:D6FO45DQ","schema_version":"1.0","canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","source":{"kind":"arxiv","id":"1009.4736","version":2},"attestation_state":"computed","paper":{"title":"Point sets that minimize $(\\le k)$-edges, 3-decomposable drawings, and the rectilinear crossing number of $K_{30}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Hern\\'andez-V\\'elez, C. Villalobos, J. Lea\\~nos, M. Cetina","submitted_at":"2010-09-23T23:07:53Z","abstract_excerpt":"There are two properties shared by all known crossing-minimizing geometric drawings of $K_n$, for $n$ a multiple of 3. First, the underlying $n$-point set of these drawings has exactly $3\\binom{k+2}{2}$ $(\\le k)$-edges, for all $0\\le k < n/3$. Second, all such drawings have the $n$ points divided into three groups of equal size; this last property is captured under the concept of 3-decomposability. In this paper we show that these properties are tightly related: every $n$-point set with exactly $3\\binom{k+2}{2}$ $(\\le k)$-edges for all $0\\le k < n/3$, is 3-decomposable. As an application, we p"},"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":"1009.4736","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T23:07:53Z","cross_cats_sorted":[],"title_canon_sha256":"50a6e3fa7e40621b3a540a85437873809c021cdb9733ba89937b2ec0f401ad2b","abstract_canon_sha256":"b52a240feeab06ca98e0099fbffa6c33e70bfecd89a28d97babcd0f5eb32653c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.706046Z","signature_b64":"dw0sxZY/JVXfa/tg4IQu4Gn90Y1xCZvdumLIsCRom87tpj7z17GRdR4sX33nJVsTagiQBthABx27YHlqJq/WAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","last_reissued_at":"2026-05-17T23:47:44.705524Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.705524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Point sets that minimize $(\\le k)$-edges, 3-decomposable drawings, and the rectilinear crossing number of $K_{30}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"C. Hern\\'andez-V\\'elez, C. Villalobos, J. Lea\\~nos, M. Cetina","submitted_at":"2010-09-23T23:07:53Z","abstract_excerpt":"There are two properties shared by all known crossing-minimizing geometric drawings of $K_n$, for $n$ a multiple of 3. First, the underlying $n$-point set of these drawings has exactly $3\\binom{k+2}{2}$ $(\\le k)$-edges, for all $0\\le k < n/3$. Second, all such drawings have the $n$ points divided into three groups of equal size; this last property is captured under the concept of 3-decomposability. In this paper we show that these properties are tightly related: every $n$-point set with exactly $3\\binom{k+2}{2}$ $(\\le k)$-edges for all $0\\le k < n/3$, is 3-decomposable. As an application, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4736","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":"1009.4736","created_at":"2026-05-17T23:47:44.705630+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.4736v2","created_at":"2026-05-17T23:47:44.705630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4736","created_at":"2026-05-17T23:47:44.705630+00:00"},{"alias_kind":"pith_short_12","alias_value":"D6FO45DQ3LZD","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D6FO45DQ3LZD6PXT","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D6FO45DQ","created_at":"2026-05-18T12:26:06.534383+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/D6FO45DQ3LZD6PXT5JTZ5QQY72","json":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72.json","graph_json":"https://pith.science/api/pith-number/D6FO45DQ3LZD6PXT5JTZ5QQY72/graph.json","events_json":"https://pith.science/api/pith-number/D6FO45DQ3LZD6PXT5JTZ5QQY72/events.json","paper":"https://pith.science/paper/D6FO45DQ"},"agent_actions":{"view_html":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72","download_json":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72.json","view_paper":"https://pith.science/paper/D6FO45DQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.4736&json=true","fetch_graph":"https://pith.science/api/pith-number/D6FO45DQ3LZD6PXT5JTZ5QQY72/graph.json","fetch_events":"https://pith.science/api/pith-number/D6FO45DQ3LZD6PXT5JTZ5QQY72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/action/storage_attestation","attest_author":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/action/author_attestation","sign_citation":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/action/citation_signature","submit_replication":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/action/replication_record"}},"created_at":"2026-05-17T23:47:44.705630+00:00","updated_at":"2026-05-17T23:47:44.705630+00:00"}