{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZYH7U4W33F7UYRN63CQ6PP6WTI","short_pith_number":"pith:ZYH7U4W3","canonical_record":{"source":{"id":"1709.10438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T14:52:16Z","cross_cats_sorted":[],"title_canon_sha256":"fdffd89088bcae5a7360b3a09abb74900b2f3c4072f479e73fd0dbea31285b3e","abstract_canon_sha256":"b20e0cb1e31cc3934b9826db7f50d16ef3a3a87a467158494d98596bee918fd4"},"schema_version":"1.0"},"canonical_sha256":"ce0ffa72dbd97f4c45bed8a1e7bfd69a1a7bce021c3d1eb798819ef8f52911ec","source":{"kind":"arxiv","id":"1709.10438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10438","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10438v2","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10438","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZYH7U4W33F7U","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYH7U4W33F7UYRN6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYH7U4W3","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZYH7U4W33F7UYRN63CQ6PP6WTI","target":"record","payload":{"canonical_record":{"source":{"id":"1709.10438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T14:52:16Z","cross_cats_sorted":[],"title_canon_sha256":"fdffd89088bcae5a7360b3a09abb74900b2f3c4072f479e73fd0dbea31285b3e","abstract_canon_sha256":"b20e0cb1e31cc3934b9826db7f50d16ef3a3a87a467158494d98596bee918fd4"},"schema_version":"1.0"},"canonical_sha256":"ce0ffa72dbd97f4c45bed8a1e7bfd69a1a7bce021c3d1eb798819ef8f52911ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:47.427872Z","signature_b64":"VJHxoRFrz4dQON37Yk2GK6F8/q6+rz3l3If+oklNVeW8w68/IWMig0urgVSF/sj7pO/SkRpIXbDt/4Zk9wpsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce0ffa72dbd97f4c45bed8a1e7bfd69a1a7bce021c3d1eb798819ef8f52911ec","last_reissued_at":"2026-05-18T00:01:47.427116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:47.427116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.10438","source_version":2,"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-18T00:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tai9AZ8kAVvjB6lezt9D3h7wfTQwznJ3soD8F/L35Wb4j82SsGFqZWntUTP7euOyzWvP7dDyzX/4fZDeImlnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:56.582731Z"},"content_sha256":"e92592b6b96d7366d90952cc9cd72c7d7d8b295da82d41b0bb22efb4b810a7d5","schema_version":"1.0","event_id":"sha256:e92592b6b96d7366d90952cc9cd72c7d7d8b295da82d41b0bb22efb4b810a7d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZYH7U4W33F7UYRN63CQ6PP6WTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upper and lower bounds for rich lines in grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Brendan Murphy","submitted_at":"2017-09-29T14:52:16Z","abstract_excerpt":"We prove upper and lower bounds for the number of lines in general position that are rich in a Cartesian product point set. This disproves a conjecture of Solymosi and improves work of Elekes, Borenstein and Croot, and Amirkhanyan, Bush, Croot, and Pryby.\n  The upper bounds are based on a version of the asymmetric Balog-Szemeredi-Gowers theorem for group actions combined with product theorems for the affine group. The lower bounds are based on a connection between rich lines in Cartesian product sets and amenability (or expanding families of graphs in the finite field case).\n  As an applicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10438","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"},"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-18T00:01:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmiPbKWgksECtPSUhhGu0y0++LwGhz5u4gXMMCqwRod5nf+n4nSqRwlkXnUh7iqNX7/GzilwFR6WOwoaKgKcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:42:56.583381Z"},"content_sha256":"c6e83f1bdc0532cc5f86207084471c0758786d3b040727916f9035f3a0fe9a0b","schema_version":"1.0","event_id":"sha256:c6e83f1bdc0532cc5f86207084471c0758786d3b040727916f9035f3a0fe9a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/bundle.json","state_url":"https://pith.science/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/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-31T07:42:56Z","links":{"resolver":"https://pith.science/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI","bundle":"https://pith.science/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/bundle.json","state":"https://pith.science/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYH7U4W33F7UYRN63CQ6PP6WTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZYH7U4W33F7UYRN63CQ6PP6WTI","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":"b20e0cb1e31cc3934b9826db7f50d16ef3a3a87a467158494d98596bee918fd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T14:52:16Z","title_canon_sha256":"fdffd89088bcae5a7360b3a09abb74900b2f3c4072f479e73fd0dbea31285b3e"},"schema_version":"1.0","source":{"id":"1709.10438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.10438","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"arxiv_version","alias_value":"1709.10438v2","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.10438","created_at":"2026-05-18T00:01:47Z"},{"alias_kind":"pith_short_12","alias_value":"ZYH7U4W33F7U","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYH7U4W33F7UYRN6","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYH7U4W3","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:c6e83f1bdc0532cc5f86207084471c0758786d3b040727916f9035f3a0fe9a0b","target":"graph","created_at":"2026-05-18T00:01:47Z","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 upper and lower bounds for the number of lines in general position that are rich in a Cartesian product point set. This disproves a conjecture of Solymosi and improves work of Elekes, Borenstein and Croot, and Amirkhanyan, Bush, Croot, and Pryby.\n  The upper bounds are based on a version of the asymmetric Balog-Szemeredi-Gowers theorem for group actions combined with product theorems for the affine group. The lower bounds are based on a connection between rich lines in Cartesian product sets and amenability (or expanding families of graphs in the finite field case).\n  As an applicatio","authors_text":"Brendan Murphy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T14:52:16Z","title":"Upper and lower bounds for rich lines in grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.10438","kind":"arxiv","version":2},"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:e92592b6b96d7366d90952cc9cd72c7d7d8b295da82d41b0bb22efb4b810a7d5","target":"record","created_at":"2026-05-18T00:01:47Z","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":"b20e0cb1e31cc3934b9826db7f50d16ef3a3a87a467158494d98596bee918fd4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-29T14:52:16Z","title_canon_sha256":"fdffd89088bcae5a7360b3a09abb74900b2f3c4072f479e73fd0dbea31285b3e"},"schema_version":"1.0","source":{"id":"1709.10438","kind":"arxiv","version":2}},"canonical_sha256":"ce0ffa72dbd97f4c45bed8a1e7bfd69a1a7bce021c3d1eb798819ef8f52911ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce0ffa72dbd97f4c45bed8a1e7bfd69a1a7bce021c3d1eb798819ef8f52911ec","first_computed_at":"2026-05-18T00:01:47.427116Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:47.427116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VJHxoRFrz4dQON37Yk2GK6F8/q6+rz3l3If+oklNVeW8w68/IWMig0urgVSF/sj7pO/SkRpIXbDt/4Zk9wpsCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:47.427872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.10438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92592b6b96d7366d90952cc9cd72c7d7d8b295da82d41b0bb22efb4b810a7d5","sha256:c6e83f1bdc0532cc5f86207084471c0758786d3b040727916f9035f3a0fe9a0b"],"state_sha256":"cfa216d730760be1a001374fdd058d5741b5c163079962528cc8921a907ae203"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gyNCzric8/qWJzKmBYAbtskiChDoXVOw1/bh+pbrtykdrgoRmJ4VrkvA7ld2jhmPfgfC70RLwMHYLeD4pj8ZBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:42:56.587988Z","bundle_sha256":"dc3f0c059d63178cba027e7ba962a1747635d0c2245cf8692691b98c9c304651"}}