{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:XPQ7SYA7D7LSE2GRD3MTSFRE4I","short_pith_number":"pith:XPQ7SYA7","canonical_record":{"source":{"id":"1006.3878","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-19T16:20:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"712a40bd7a0dca3a52678fba134db862e18bf14c484d1c30a921cff240d4ba57","abstract_canon_sha256":"b5b61648970ca2b673247e5b6ce6b5ff944b2622af9f5a6b5cee0788fee6c5dc"},"schema_version":"1.0"},"canonical_sha256":"bbe1f9601f1fd72268d11ed9391624e221a7f1df47bcf6a755ddbfc004a2c497","source":{"kind":"arxiv","id":"1006.3878","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3878","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3878v6","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3878","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"XPQ7SYA7D7LS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XPQ7SYA7D7LSE2GR","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XPQ7SYA7","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:XPQ7SYA7D7LSE2GRD3MTSFRE4I","target":"record","payload":{"canonical_record":{"source":{"id":"1006.3878","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-19T16:20:24Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"712a40bd7a0dca3a52678fba134db862e18bf14c484d1c30a921cff240d4ba57","abstract_canon_sha256":"b5b61648970ca2b673247e5b6ce6b5ff944b2622af9f5a6b5cee0788fee6c5dc"},"schema_version":"1.0"},"canonical_sha256":"bbe1f9601f1fd72268d11ed9391624e221a7f1df47bcf6a755ddbfc004a2c497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:04.211740Z","signature_b64":"yntKjTWLHvi6M8NLcwwviUW5qdtOBwMPXlfa166ZXpds9Qfa5z+7yFqPUHK9CiyytM6f+yFdv3NnDzSIRnUcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbe1f9601f1fd72268d11ed9391624e221a7f1df47bcf6a755ddbfc004a2c497","last_reissued_at":"2026-05-18T04:05:04.211015Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:04.211015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.3878","source_version":6,"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-18T04:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/b+0cQfIApKA4AmvycVd4cmZh742777LhoCVDXFsBpXWm24tsOjgTKN9u+2onAZWcemIPn+8uXDY6gOwNL5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:26:43.576456Z"},"content_sha256":"e5fc78c4eb0d7992119ac159506e715deddee6de97ccd5edb681695388a4270f","schema_version":"1.0","event_id":"sha256:e5fc78c4eb0d7992119ac159506e715deddee6de97ccd5edb681695388a4270f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:XPQ7SYA7D7LSE2GRD3MTSFRE4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bichromatic Incidence Bound and an Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Ben D. Lund, George B. Purdy, Justin W. Smith","submitted_at":"2010-06-19T16:20:24Z","abstract_excerpt":"We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k red points and m hyperplanes spanned by all n points provided that m = \\Omega(n^{d-2}). For the monochromatic case k = n, this was proved by Agarwal and Aronov.\n  We use this incidence bound to prove that a set of n points, no more than n-k of which lie on any plane or two lines, spans \\Omega(nk^2) planes. We also provide an infinite family of counterexample"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3878","kind":"arxiv","version":6},"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-18T04:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTs4umYplPhAhQGJ8P7kdFCcFPwN0gYm+Gl7z9SFN+Q7cJzXqbltFht4jq7o6TsRAKEo1mAWWsjHWEjNRLe8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:26:43.576812Z"},"content_sha256":"49299e2c919a8719a4b0006a32790e1b5a8b1bb9fc7882f0c6c5a389fd2b3ab9","schema_version":"1.0","event_id":"sha256:49299e2c919a8719a4b0006a32790e1b5a8b1bb9fc7882f0c6c5a389fd2b3ab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/bundle.json","state_url":"https://pith.science/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/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-05-28T11:26:43Z","links":{"resolver":"https://pith.science/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I","bundle":"https://pith.science/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/bundle.json","state":"https://pith.science/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPQ7SYA7D7LSE2GRD3MTSFRE4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:XPQ7SYA7D7LSE2GRD3MTSFRE4I","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":"b5b61648970ca2b673247e5b6ce6b5ff944b2622af9f5a6b5cee0788fee6c5dc","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-19T16:20:24Z","title_canon_sha256":"712a40bd7a0dca3a52678fba134db862e18bf14c484d1c30a921cff240d4ba57"},"schema_version":"1.0","source":{"id":"1006.3878","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.3878","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"1006.3878v6","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.3878","created_at":"2026-05-18T04:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"XPQ7SYA7D7LS","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"XPQ7SYA7D7LSE2GR","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"XPQ7SYA7","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:49299e2c919a8719a4b0006a32790e1b5a8b1bb9fc7882f0c6c5a389fd2b3ab9","target":"graph","created_at":"2026-05-18T04:05:04Z","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":"We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k red points and m hyperplanes spanned by all n points provided that m = \\Omega(n^{d-2}). For the monochromatic case k = n, this was proved by Agarwal and Aronov.\n  We use this incidence bound to prove that a set of n points, no more than n-k of which lie on any plane or two lines, spans \\Omega(nk^2) planes. We also provide an infinite family of counterexample","authors_text":"Ben D. Lund, George B. Purdy, Justin W. Smith","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-19T16:20:24Z","title":"A Bichromatic Incidence Bound and an Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.3878","kind":"arxiv","version":6},"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:e5fc78c4eb0d7992119ac159506e715deddee6de97ccd5edb681695388a4270f","target":"record","created_at":"2026-05-18T04:05:04Z","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":"b5b61648970ca2b673247e5b6ce6b5ff944b2622af9f5a6b5cee0788fee6c5dc","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-06-19T16:20:24Z","title_canon_sha256":"712a40bd7a0dca3a52678fba134db862e18bf14c484d1c30a921cff240d4ba57"},"schema_version":"1.0","source":{"id":"1006.3878","kind":"arxiv","version":6}},"canonical_sha256":"bbe1f9601f1fd72268d11ed9391624e221a7f1df47bcf6a755ddbfc004a2c497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbe1f9601f1fd72268d11ed9391624e221a7f1df47bcf6a755ddbfc004a2c497","first_computed_at":"2026-05-18T04:05:04.211015Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:04.211015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yntKjTWLHvi6M8NLcwwviUW5qdtOBwMPXlfa166ZXpds9Qfa5z+7yFqPUHK9CiyytM6f+yFdv3NnDzSIRnUcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:04.211740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.3878","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5fc78c4eb0d7992119ac159506e715deddee6de97ccd5edb681695388a4270f","sha256:49299e2c919a8719a4b0006a32790e1b5a8b1bb9fc7882f0c6c5a389fd2b3ab9"],"state_sha256":"76580c970acc05f22d612a80da48dfd657e71dc59b4948250cf5f20089ba1a20"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqqoufUDlb9ktyrfY8MKSyHtaJhgjAMYD8qW3hCfQVDRY00c+YdVdaCuddOMG59/pV3gAynzONaKHhuu2z//Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:26:43.578847Z","bundle_sha256":"169c7295155d50ff4cd98454d5cb21e54a935f9535342e44c60588b0e9736ea6"}}