{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:D6FO45DQ3LZD6PXT5JTZ5QQY72","short_pith_number":"pith:D6FO45DQ","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"},"canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","source":{"kind":"arxiv","id":"1009.4736","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4736","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4736v2","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4736","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"D6FO45DQ3LZD","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D6FO45DQ3LZD6PXT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D6FO45DQ","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:D6FO45DQ3LZD6PXT5JTZ5QQY72","target":"record","payload":{"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"},"canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","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"},"source_kind":"arxiv","source_id":"1009.4736","source_version":2,"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YF+fpQ8MU+vGgzK/eebJA6pfGHWWqxP1J5AR0t04HzeXwfLMcEe1ELOrB+IQaFFb8uXW9YGK/iEZt7Q9RTUcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:38:32.607395Z"},"content_sha256":"2068692d793c14efb9ffe5d057b6bafbfef0d8142ad1bc215ea05ab73d337aa2","schema_version":"1.0","event_id":"sha256:2068692d793c14efb9ffe5d057b6bafbfef0d8142ad1bc215ea05ab73d337aa2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:D6FO45DQ3LZD6PXT5JTZ5QQY72","target":"graph","payload":{"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"},"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-17T23:47:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvuZOUd61Zd/7rhq+E5ddpDJVWftIY5mGwYnJ990ApJUij23NZRStI/OhC0QvnUAMuy25fJC8U/CQxw+7/bpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:38:32.607752Z"},"content_sha256":"4005070f664dc613f13fc3a238372166311c3356bc82408af99ab7c35461bc32","schema_version":"1.0","event_id":"sha256:4005070f664dc613f13fc3a238372166311c3356bc82408af99ab7c35461bc32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/bundle.json","state_url":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/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-05-28T12:38:32Z","links":{"resolver":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72","bundle":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/bundle.json","state":"https://pith.science/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D6FO45DQ3LZD6PXT5JTZ5QQY72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:D6FO45DQ3LZD6PXT5JTZ5QQY72","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":"b52a240feeab06ca98e0099fbffa6c33e70bfecd89a28d97babcd0f5eb32653c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T23:07:53Z","title_canon_sha256":"50a6e3fa7e40621b3a540a85437873809c021cdb9733ba89937b2ec0f401ad2b"},"schema_version":"1.0","source":{"id":"1009.4736","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4736","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4736v2","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4736","created_at":"2026-05-17T23:47:44Z"},{"alias_kind":"pith_short_12","alias_value":"D6FO45DQ3LZD","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"D6FO45DQ3LZD6PXT","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"D6FO45DQ","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:4005070f664dc613f13fc3a238372166311c3356bc82408af99ab7c35461bc32","target":"graph","created_at":"2026-05-17T23:47:44Z","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":"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","authors_text":"C. Hern\\'andez-V\\'elez, C. Villalobos, J. Lea\\~nos, M. Cetina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T23:07:53Z","title":"Point sets that minimize $(\\le k)$-edges, 3-decomposable drawings, and the rectilinear crossing number of $K_{30}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4736","kind":"arxiv","version":2},"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:2068692d793c14efb9ffe5d057b6bafbfef0d8142ad1bc215ea05ab73d337aa2","target":"record","created_at":"2026-05-17T23:47:44Z","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":"b52a240feeab06ca98e0099fbffa6c33e70bfecd89a28d97babcd0f5eb32653c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-23T23:07:53Z","title_canon_sha256":"50a6e3fa7e40621b3a540a85437873809c021cdb9733ba89937b2ec0f401ad2b"},"schema_version":"1.0","source":{"id":"1009.4736","kind":"arxiv","version":2}},"canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f8aee7470daf23f3ef3ea679ec218feaa761ecff46887760d4a4859f740802d","first_computed_at":"2026-05-17T23:47:44.705524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:44.705524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dw0sxZY/JVXfa/tg4IQu4Gn90Y1xCZvdumLIsCRom87tpj7z17GRdR4sX33nJVsTagiQBthABx27YHlqJq/WAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:44.706046Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4736","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2068692d793c14efb9ffe5d057b6bafbfef0d8142ad1bc215ea05ab73d337aa2","sha256:4005070f664dc613f13fc3a238372166311c3356bc82408af99ab7c35461bc32"],"state_sha256":"c6f79ac8a4b4db7e6b9064f68cc074028cd56f31e61cf6796306666f63afd5a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7OhGp506m+388CSr6DzHWEO9zeF0RPrRhxOS2uaLToDJydywtkvH3bqpQqgqkH65M6pbUYdhq34iqmfU6jFeCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:38:32.609696Z","bundle_sha256":"c4eb8fbfb6c1a1aff6425e84a836e74c4d046ac91632cea274c1a9fa00bab238"}}