{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:E6KKO7UFEGQQ2HIJP6KKSECNBU","short_pith_number":"pith:E6KKO7UF","schema_version":"1.0","canonical_sha256":"2794a77e8521a10d1d097f94a9104d0d22f69b1acd7bf7cb66affa4d5c8f0c39","source":{"kind":"arxiv","id":"1011.1866","version":2},"attestation_state":"computed","paper":{"title":"On Pseudo-Convex Partitions of a Planar Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhaswar B. Bhattacharya, Sandip Das","submitted_at":"2010-11-08T18:39:40Z","abstract_excerpt":"Aichholzer et al. [{\\it Graphs and Combinatorics}, Vol. 23, 481-507, 2007] introduced the notion of pseudo-convex partitioning of planar point sets and proved that the pseudo-convex partition number $\\psi(n)$ satisfies, $\\frac{3}{4}\\lfloor\\frac{n}{4}\\rfloor\\leq \\psi(n)\\leq\\lceil\\frac{n}{4}\\rceil$. In this paper we prove that $\\psi(13)=3$, which immediately improves the upper bound on $\\psi(n)$ to $\\lceil\\frac{3n}{13}\\rceil$, thus answering a question posed by Aichholzer et al. in the same paper."},"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":"1011.1866","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-08T18:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"8922ba5c4085a443a23878b9a567810d08be6663f6aed9530ec1311d1b9f31fe","abstract_canon_sha256":"52b05f31c9f63903781f1bff6d9799b495a822b5238167148a47e1ae5c7455e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:37.311185Z","signature_b64":"u2H3qxmt3rko3eoeM7oR5YNLNkV3CtEuy0EXDksx56iJI7Y/yphUs39qg4jpJaiJsMpTTJaKPxsrKjkopG9HCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2794a77e8521a10d1d097f94a9104d0d22f69b1acd7bf7cb66affa4d5c8f0c39","last_reissued_at":"2026-05-18T02:23:37.310571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:37.310571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Pseudo-Convex Partitions of a Planar Point Set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhaswar B. Bhattacharya, Sandip Das","submitted_at":"2010-11-08T18:39:40Z","abstract_excerpt":"Aichholzer et al. [{\\it Graphs and Combinatorics}, Vol. 23, 481-507, 2007] introduced the notion of pseudo-convex partitioning of planar point sets and proved that the pseudo-convex partition number $\\psi(n)$ satisfies, $\\frac{3}{4}\\lfloor\\frac{n}{4}\\rfloor\\leq \\psi(n)\\leq\\lceil\\frac{n}{4}\\rceil$. In this paper we prove that $\\psi(13)=3$, which immediately improves the upper bound on $\\psi(n)$ to $\\lceil\\frac{3n}{13}\\rceil$, thus answering a question posed by Aichholzer et al. in the same paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.1866","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":"1011.1866","created_at":"2026-05-18T02:23:37.310663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.1866v2","created_at":"2026-05-18T02:23:37.310663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.1866","created_at":"2026-05-18T02:23:37.310663+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6KKO7UFEGQQ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6KKO7UFEGQQ2HIJ","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6KKO7UF","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/E6KKO7UFEGQQ2HIJP6KKSECNBU","json":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU.json","graph_json":"https://pith.science/api/pith-number/E6KKO7UFEGQQ2HIJP6KKSECNBU/graph.json","events_json":"https://pith.science/api/pith-number/E6KKO7UFEGQQ2HIJP6KKSECNBU/events.json","paper":"https://pith.science/paper/E6KKO7UF"},"agent_actions":{"view_html":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU","download_json":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU.json","view_paper":"https://pith.science/paper/E6KKO7UF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.1866&json=true","fetch_graph":"https://pith.science/api/pith-number/E6KKO7UFEGQQ2HIJP6KKSECNBU/graph.json","fetch_events":"https://pith.science/api/pith-number/E6KKO7UFEGQQ2HIJP6KKSECNBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU/action/storage_attestation","attest_author":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU/action/author_attestation","sign_citation":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU/action/citation_signature","submit_replication":"https://pith.science/pith/E6KKO7UFEGQQ2HIJP6KKSECNBU/action/replication_record"}},"created_at":"2026-05-18T02:23:37.310663+00:00","updated_at":"2026-05-18T02:23:37.310663+00:00"}