{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MFCUSBD6E6ORQDHAVB75WBS3ZH","short_pith_number":"pith:MFCUSBD6","canonical_record":{"source":{"id":"1606.02328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T20:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"ac8d1a081a9b7f72106c9f710dd4cf00560bdeb74797baf4ce051ebf6b140313","abstract_canon_sha256":"4844202f24b659f8b57a312ee8862cd850d0bb829bd52a332e5bfaab3e43a85f"},"schema_version":"1.0"},"canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","source":{"kind":"arxiv","id":"1606.02328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02328","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02328v1","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02328","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"MFCUSBD6E6OR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MFCUSBD6E6ORQDHA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MFCUSBD6","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MFCUSBD6E6ORQDHAVB75WBS3ZH","target":"record","payload":{"canonical_record":{"source":{"id":"1606.02328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T20:41:34Z","cross_cats_sorted":[],"title_canon_sha256":"ac8d1a081a9b7f72106c9f710dd4cf00560bdeb74797baf4ce051ebf6b140313","abstract_canon_sha256":"4844202f24b659f8b57a312ee8862cd850d0bb829bd52a332e5bfaab3e43a85f"},"schema_version":"1.0"},"canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:41.572883Z","signature_b64":"8GO5d0Z+nyc5AAXksPOxhUZvPWYnOeW1f9zLmzTdxjRZI8fGKxXKHF5s4Z3ai08rZ75V8c2NeuoduZzkbe7wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","last_reissued_at":"2026-05-18T01:12:41.572560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:41.572560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.02328","source_version":1,"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-18T01:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DQGsJf8jubWLM+nNF7nrdKVtY0zxbbBL3lmcT0MRE8qtC+rCAM7ox0nSumEsitT4cbzZlKx0GRzXmNDEDqTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:19.253837Z"},"content_sha256":"eb8ec1aa14f795f9eb7d0f64a93e73c25e90c4180af35d90939e3b49c463dab0","schema_version":"1.0","event_id":"sha256:eb8ec1aa14f795f9eb7d0f64a93e73c25e90c4180af35d90939e3b49c463dab0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MFCUSBD6E6ORQDHAVB75WBS3ZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Drawing the Almost Convex Set in an Integer Grid of Minimum Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carlos Hidalgo-Toscano, Frank Duque, Pablo P\\'erez-Lantero, Ruy Fabila-Monroy","submitted_at":"2016-06-07T20:41:34Z","abstract_excerpt":"In 2001, K\\'arolyi, Pach and T\\'oth introduced a family of point sets to solve an Erd\\H{o}s-Szekeres type problem; which have been used to solve several other Ed\\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set $\\mathcal{X}$ has the property that the interior of every triangle determined by three points in the same convex layer of $\\mathcal{X}$, contains exactly one point of $\\mathcal{X}$. In this paper, we introduce a characterization of nested almost convex sets. Our characterization implies that there exists at most "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02328","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"},"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-18T01:12:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJ/s8/cGUCj0wSUmu2hBltszG0ZPzgs2upkV0JcI5e6lSNLciF1fqOcI7JhnSp3Yz/qm5hML+Y1WI/vxB3jZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:25:19.254522Z"},"content_sha256":"352fa03e35ff84f6b1d0e49e1f3ad96082be911cd482322ebdc282b9e80a8b1d","schema_version":"1.0","event_id":"sha256:352fa03e35ff84f6b1d0e49e1f3ad96082be911cd482322ebdc282b9e80a8b1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/bundle.json","state_url":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/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-06-01T11:25:19Z","links":{"resolver":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH","bundle":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/bundle.json","state":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MFCUSBD6E6ORQDHAVB75WBS3ZH","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":"4844202f24b659f8b57a312ee8862cd850d0bb829bd52a332e5bfaab3e43a85f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T20:41:34Z","title_canon_sha256":"ac8d1a081a9b7f72106c9f710dd4cf00560bdeb74797baf4ce051ebf6b140313"},"schema_version":"1.0","source":{"id":"1606.02328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02328","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02328v1","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02328","created_at":"2026-05-18T01:12:41Z"},{"alias_kind":"pith_short_12","alias_value":"MFCUSBD6E6OR","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MFCUSBD6E6ORQDHA","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MFCUSBD6","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:352fa03e35ff84f6b1d0e49e1f3ad96082be911cd482322ebdc282b9e80a8b1d","target":"graph","created_at":"2026-05-18T01:12:41Z","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":"In 2001, K\\'arolyi, Pach and T\\'oth introduced a family of point sets to solve an Erd\\H{o}s-Szekeres type problem; which have been used to solve several other Ed\\H{o}s-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set $\\mathcal{X}$ has the property that the interior of every triangle determined by three points in the same convex layer of $\\mathcal{X}$, contains exactly one point of $\\mathcal{X}$. In this paper, we introduce a characterization of nested almost convex sets. Our characterization implies that there exists at most ","authors_text":"Carlos Hidalgo-Toscano, Frank Duque, Pablo P\\'erez-Lantero, Ruy Fabila-Monroy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T20:41:34Z","title":"Drawing the Almost Convex Set in an Integer Grid of Minimum Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02328","kind":"arxiv","version":1},"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:eb8ec1aa14f795f9eb7d0f64a93e73c25e90c4180af35d90939e3b49c463dab0","target":"record","created_at":"2026-05-18T01:12:41Z","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":"4844202f24b659f8b57a312ee8862cd850d0bb829bd52a332e5bfaab3e43a85f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-06-07T20:41:34Z","title_canon_sha256":"ac8d1a081a9b7f72106c9f710dd4cf00560bdeb74797baf4ce051ebf6b140313"},"schema_version":"1.0","source":{"id":"1606.02328","kind":"arxiv","version":1}},"canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","first_computed_at":"2026-05-18T01:12:41.572560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:41.572560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8GO5d0Z+nyc5AAXksPOxhUZvPWYnOeW1f9zLmzTdxjRZI8fGKxXKHF5s4Z3ai08rZ75V8c2NeuoduZzkbe7wCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:41.572883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb8ec1aa14f795f9eb7d0f64a93e73c25e90c4180af35d90939e3b49c463dab0","sha256:352fa03e35ff84f6b1d0e49e1f3ad96082be911cd482322ebdc282b9e80a8b1d"],"state_sha256":"39286f2d7055c4e7f12f21611b38f30aa92cdd8cbf882537d87f6b5ae6e7f1b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxXyhgoLkVPZfSGfUW/Yd1bcanOVme2DyC0XOynJHOL3SMknEUG5dkAA1NQjLAxfWR8YsgD15b2MyoS2wjyvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:25:19.258070Z","bundle_sha256":"ee36e319337d96623a543a0f4ca11a4717872c3b2ba49697708831c795857f95"}}