{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:AD42GTSDA5QB7ZXG6Q2QPZ3NP2","short_pith_number":"pith:AD42GTSD","schema_version":"1.0","canonical_sha256":"00f9a34e4307601fe6e6f43507e76d7e820a290934d4c7ab79a500a0259349a4","source":{"kind":"arxiv","id":"1208.4714","version":3},"attestation_state":"computed","paper":{"title":"On sets defining few ordinary lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2012-08-23T10:39:37Z","abstract_excerpt":"Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of Dirac and Motzkin. In fact we describe the exact extremisers for this problem, as well as all sets having fewer than n - C ordinary lines for some absolute constant C. We also solve, for large n, the \"orchard-planting problem\", which asks for the maximum number of lines through exactly 3 points of P. Underlying these results is a structure theorem which states "},"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":"1208.4714","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-23T10:39:37Z","cross_cats_sorted":[],"title_canon_sha256":"93399ee2a7f731e86ea951c69a7e6a4bc0f14206d5b4bc37dd53e7556b2ea7ad","abstract_canon_sha256":"c9b6a8383b275c327a3876df9d301c7c7b32ab0ce4a8ba7abe285234d078f0c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:00.546599Z","signature_b64":"nH5p6gBuBiUOR27SJZW+oC0RLzJfJ5AZpdr4EBe/JhEdIFIk75dnCfkQjLQFTH21gSL6e4wnbF4JLsFdpSgFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00f9a34e4307601fe6e6f43507e76d7e820a290934d4c7ab79a500a0259349a4","last_reissued_at":"2026-05-18T02:21:00.546106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:00.546106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On sets defining few ordinary lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ben Green, Terence Tao","submitted_at":"2012-08-23T10:39:37Z","abstract_excerpt":"Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of Dirac and Motzkin. In fact we describe the exact extremisers for this problem, as well as all sets having fewer than n - C ordinary lines for some absolute constant C. We also solve, for large n, the \"orchard-planting problem\", which asks for the maximum number of lines through exactly 3 points of P. Underlying these results is a structure theorem which states "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4714","kind":"arxiv","version":3},"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":"1208.4714","created_at":"2026-05-18T02:21:00.546168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4714v3","created_at":"2026-05-18T02:21:00.546168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4714","created_at":"2026-05-18T02:21:00.546168+00:00"},{"alias_kind":"pith_short_12","alias_value":"AD42GTSDA5QB","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"AD42GTSDA5QB7ZXG","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"AD42GTSD","created_at":"2026-05-18T12:26:58.693483+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/AD42GTSDA5QB7ZXG6Q2QPZ3NP2","json":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2.json","graph_json":"https://pith.science/api/pith-number/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/graph.json","events_json":"https://pith.science/api/pith-number/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/events.json","paper":"https://pith.science/paper/AD42GTSD"},"agent_actions":{"view_html":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2","download_json":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2.json","view_paper":"https://pith.science/paper/AD42GTSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4714&json=true","fetch_graph":"https://pith.science/api/pith-number/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/graph.json","fetch_events":"https://pith.science/api/pith-number/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/action/storage_attestation","attest_author":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/action/author_attestation","sign_citation":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/action/citation_signature","submit_replication":"https://pith.science/pith/AD42GTSDA5QB7ZXG6Q2QPZ3NP2/action/replication_record"}},"created_at":"2026-05-18T02:21:00.546168+00:00","updated_at":"2026-05-18T02:21:00.546168+00:00"}