{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KLI5QHQDQ6HBEWK2LSGDCGAGAS","short_pith_number":"pith:KLI5QHQD","canonical_record":{"source":{"id":"1107.0327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T20:23:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"43752dafdba963ea27a95c41689ccab7a942d1df1a880a57e81734ddbfa4432e","abstract_canon_sha256":"a69f5c597442846b9c81b3de610ba6ae22b4e6498399bfec407579e95ff97f31"},"schema_version":"1.0"},"canonical_sha256":"52d1d81e03878e12595a5c8c311806048053b253eaabc4fe685a0819471d6763","source":{"kind":"arxiv","id":"1107.0327","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0327","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0327v3","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0327","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLI5QHQDQ6HB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLI5QHQDQ6HBEWK2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLI5QHQD","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KLI5QHQDQ6HBEWK2LSGDCGAGAS","target":"record","payload":{"canonical_record":{"source":{"id":"1107.0327","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T20:23:29Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"43752dafdba963ea27a95c41689ccab7a942d1df1a880a57e81734ddbfa4432e","abstract_canon_sha256":"a69f5c597442846b9c81b3de610ba6ae22b4e6498399bfec407579e95ff97f31"},"schema_version":"1.0"},"canonical_sha256":"52d1d81e03878e12595a5c8c311806048053b253eaabc4fe685a0819471d6763","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:33.513545Z","signature_b64":"B/rXla9czakK/NS8j3w25lwok4hwLE6DdINsYRObSQ4D7dtiXtEKTYKCvAjySbTPiwTDM++JUC+IHpWs85B3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52d1d81e03878e12595a5c8c311806048053b253eaabc4fe685a0819471d6763","last_reissued_at":"2026-05-18T03:12:33.512850Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:33.512850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.0327","source_version":3,"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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcmiexG+pJqlo+kxWVh14d5HF7AxDrnDKl+0EdcSv/6Xn0TkdSO/ioakO86k3isBwE2RTXaBIRgCZoOzgc53Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T07:30:14.068226Z"},"content_sha256":"2b4b95397b63b6c64a8d592d9d51c52b8e0fdc5dee77822991c37f94b5180198","schema_version":"1.0","event_id":"sha256:2b4b95397b63b6c64a8d592d9d51c52b8e0fdc5dee77822991c37f94b5180198"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KLI5QHQDQ6HBEWK2LSGDCGAGAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many collinear k-tuples with no k+1 collinear points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"J\\'ozsef Solymosi, Milo\\v{s} Stojakovi\\'c","submitted_at":"2011-07-01T20:23:29Z","abstract_excerpt":"For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\\geq n_0$, then there exists a set of $n$ points in the plane that does not contain $k+1$ points on a line, but it contains at least $n^{2-\\frac{c}{\\sqrt{\\log n}}}$ collinear $k$-tuples of points. Thus, we significantly improve the previously best known lower bound for the largest number of collinear $k$-tuples in such a set, and get reasonably close to the trivial upper bound $O(n^2)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0327","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"},"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-18T03:12:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OWJM6TXJDURRWbUgcTqSTc1viM81VvXpRGJqkthuBxR6tCV7RxbHiqGQVY/uKprd3luq6OmHAEZ8h5NI3GOgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T07:30:14.069319Z"},"content_sha256":"b2cd91552fbee0a92aaa700a91167fe186ba64079c9ddd1113c060d3ae2426c8","schema_version":"1.0","event_id":"sha256:b2cd91552fbee0a92aaa700a91167fe186ba64079c9ddd1113c060d3ae2426c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/bundle.json","state_url":"https://pith.science/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/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-08-13T07:30:14Z","links":{"resolver":"https://pith.science/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS","bundle":"https://pith.science/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/bundle.json","state":"https://pith.science/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLI5QHQDQ6HBEWK2LSGDCGAGAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KLI5QHQDQ6HBEWK2LSGDCGAGAS","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":"a69f5c597442846b9c81b3de610ba6ae22b4e6498399bfec407579e95ff97f31","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T20:23:29Z","title_canon_sha256":"43752dafdba963ea27a95c41689ccab7a942d1df1a880a57e81734ddbfa4432e"},"schema_version":"1.0","source":{"id":"1107.0327","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.0327","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"arxiv_version","alias_value":"1107.0327v3","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.0327","created_at":"2026-05-18T03:12:33Z"},{"alias_kind":"pith_short_12","alias_value":"KLI5QHQDQ6HB","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"KLI5QHQDQ6HBEWK2","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"KLI5QHQD","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:b2cd91552fbee0a92aaa700a91167fe186ba64079c9ddd1113c060d3ae2426c8","target":"graph","created_at":"2026-05-18T03:12:33Z","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":"For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\\geq n_0$, then there exists a set of $n$ points in the plane that does not contain $k+1$ points on a line, but it contains at least $n^{2-\\frac{c}{\\sqrt{\\log n}}}$ collinear $k$-tuples of points. Thus, we significantly improve the previously best known lower bound for the largest number of collinear $k$-tuples in such a set, and get reasonably close to the trivial upper bound $O(n^2)$.","authors_text":"J\\'ozsef Solymosi, Milo\\v{s} Stojakovi\\'c","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T20:23:29Z","title":"Many collinear k-tuples with no k+1 collinear points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.0327","kind":"arxiv","version":3},"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:2b4b95397b63b6c64a8d592d9d51c52b8e0fdc5dee77822991c37f94b5180198","target":"record","created_at":"2026-05-18T03:12:33Z","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":"a69f5c597442846b9c81b3de610ba6ae22b4e6498399bfec407579e95ff97f31","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-07-01T20:23:29Z","title_canon_sha256":"43752dafdba963ea27a95c41689ccab7a942d1df1a880a57e81734ddbfa4432e"},"schema_version":"1.0","source":{"id":"1107.0327","kind":"arxiv","version":3}},"canonical_sha256":"52d1d81e03878e12595a5c8c311806048053b253eaabc4fe685a0819471d6763","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52d1d81e03878e12595a5c8c311806048053b253eaabc4fe685a0819471d6763","first_computed_at":"2026-05-18T03:12:33.512850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:33.512850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/rXla9czakK/NS8j3w25lwok4hwLE6DdINsYRObSQ4D7dtiXtEKTYKCvAjySbTPiwTDM++JUC+IHpWs85B3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:33.513545Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.0327","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b4b95397b63b6c64a8d592d9d51c52b8e0fdc5dee77822991c37f94b5180198","sha256:b2cd91552fbee0a92aaa700a91167fe186ba64079c9ddd1113c060d3ae2426c8"],"state_sha256":"28bcbcc11e368f8f67e78f145f1a44b1b94b2044aa57296893dd3cd3e83c7cb1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uj4QtzgOSO8BUhuDLvLO5KcDGzcNRyHjszCsjgQluUJUXidyiaEvPcWAbgRAHLaDyIB5wS0OuShiVUimuWxmAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T07:30:14.078099Z","bundle_sha256":"d86173db374e54747ec9cd0f10805758238a09d4cd6f21baacd151d55e5e380f"}}