{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3","short_pith_number":"pith:ZKKPVTMR","schema_version":"1.0","canonical_sha256":"ca94facd91427414e92117d189ce3ac6c2d63fa9b79a2bfe46a38d350b8df2a0","source":{"kind":"arxiv","id":"1201.2267","version":2},"attestation_state":"computed","paper":{"title":"A Lower Bound for Shallow Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Daniel Werner, Wolfgang Mulzer","submitted_at":"2012-01-11T09:56:22Z","abstract_excerpt":"Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P below it.\n  The crossing number of a k-partition is the maximum number of triangles in the partition that any k-shallow line intersects. We give a lower bound of Omega(log (n/k)/loglog(n/k)) for this crossing number, answering a 20-year old question of Matousek."},"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":"1201.2267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-01-11T09:56:22Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e2098f09cf1e1fd7b2705b6f7e997e9fd5d7dfa0408fc02371b780850651991a","abstract_canon_sha256":"4d2333c3001ecb904661e76cd6f041c98a0122b571865e72d276ef84a32c0c7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:18.920469Z","signature_b64":"gdzl3iikQm58p6cdTRSC3Pig/ybSUURffyEJq4eudhec9HIH0LbVNR6XsOtp2c2YhjQ5BqQ4hxHYJiBUi0x2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca94facd91427414e92117d189ce3ac6c2d63fa9b79a2bfe46a38d350b8df2a0","last_reissued_at":"2026-05-18T04:03:18.919982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:18.919982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound for Shallow Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Daniel Werner, Wolfgang Mulzer","submitted_at":"2012-01-11T09:56:22Z","abstract_excerpt":"Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P below it.\n  The crossing number of a k-partition is the maximum number of triangles in the partition that any k-shallow line intersects. We give a lower bound of Omega(log (n/k)/loglog(n/k)) for this crossing number, answering a 20-year old question of Matousek."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2267","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":"1201.2267","created_at":"2026-05-18T04:03:18.920055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.2267v2","created_at":"2026-05-18T04:03:18.920055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2267","created_at":"2026-05-18T04:03:18.920055+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKKPVTMRIJ2B","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKKPVTMRIJ2BJ2JB","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKKPVTMR","created_at":"2026-05-18T12:27:30.460161+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/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3","json":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3.json","graph_json":"https://pith.science/api/pith-number/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/graph.json","events_json":"https://pith.science/api/pith-number/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/events.json","paper":"https://pith.science/paper/ZKKPVTMR"},"agent_actions":{"view_html":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3","download_json":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3.json","view_paper":"https://pith.science/paper/ZKKPVTMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.2267&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/action/storage_attestation","attest_author":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/action/author_attestation","sign_citation":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/action/citation_signature","submit_replication":"https://pith.science/pith/ZKKPVTMRIJ2BJ2JBC7IYTTR2Y3/action/replication_record"}},"created_at":"2026-05-18T04:03:18.920055+00:00","updated_at":"2026-05-18T04:03:18.920055+00:00"}