{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MFCUSBD6E6ORQDHAVB75WBS3ZH","short_pith_number":"pith:MFCUSBD6","schema_version":"1.0","canonical_sha256":"614549047e279d180ce0a87fdb065bc9e24829102e1094e2483b57e39374c896","source":{"kind":"arxiv","id":"1606.02328","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.02328","created_at":"2026-05-18T01:12:41.572614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02328v1","created_at":"2026-05-18T01:12:41.572614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02328","created_at":"2026-05-18T01:12:41.572614+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFCUSBD6E6OR","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFCUSBD6E6ORQDHA","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFCUSBD6","created_at":"2026-05-18T12:30:32.724797+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/MFCUSBD6E6ORQDHAVB75WBS3ZH","json":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH.json","graph_json":"https://pith.science/api/pith-number/MFCUSBD6E6ORQDHAVB75WBS3ZH/graph.json","events_json":"https://pith.science/api/pith-number/MFCUSBD6E6ORQDHAVB75WBS3ZH/events.json","paper":"https://pith.science/paper/MFCUSBD6"},"agent_actions":{"view_html":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH","download_json":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH.json","view_paper":"https://pith.science/paper/MFCUSBD6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02328&json=true","fetch_graph":"https://pith.science/api/pith-number/MFCUSBD6E6ORQDHAVB75WBS3ZH/graph.json","fetch_events":"https://pith.science/api/pith-number/MFCUSBD6E6ORQDHAVB75WBS3ZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/action/storage_attestation","attest_author":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/action/author_attestation","sign_citation":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/action/citation_signature","submit_replication":"https://pith.science/pith/MFCUSBD6E6ORQDHAVB75WBS3ZH/action/replication_record"}},"created_at":"2026-05-18T01:12:41.572614+00:00","updated_at":"2026-05-18T01:12:41.572614+00:00"}