{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6XIA2DSUDND2ZDNSL53QECW2B5","short_pith_number":"pith:6XIA2DSU","canonical_record":{"source":{"id":"2401.06670","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-12T16:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"c9133ea5642beb04bb97254d67aef8d7f466fae2646dd7b6c22c371f2613c8af","abstract_canon_sha256":"1a860bcf2d1963e7423e966412193ec3960b94e39ebf5ef71461e7784afd9d8b"},"schema_version":"1.0"},"canonical_sha256":"f5d00d0e541b47ac8db25f77020ada0f5699b49f1e84961c4757eb77f14cf6a6","source":{"kind":"arxiv","id":"2401.06670","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06670","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06670v2","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06670","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"6XIA2DSUDND2","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"6XIA2DSUDND2ZDNS","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"6XIA2DSU","created_at":"2026-07-05T08:03:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6XIA2DSUDND2ZDNSL53QECW2B5","target":"record","payload":{"canonical_record":{"source":{"id":"2401.06670","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-12T16:23:10Z","cross_cats_sorted":[],"title_canon_sha256":"c9133ea5642beb04bb97254d67aef8d7f466fae2646dd7b6c22c371f2613c8af","abstract_canon_sha256":"1a860bcf2d1963e7423e966412193ec3960b94e39ebf5ef71461e7784afd9d8b"},"schema_version":"1.0"},"canonical_sha256":"f5d00d0e541b47ac8db25f77020ada0f5699b49f1e84961c4757eb77f14cf6a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:03:47.934578Z","signature_b64":"xJSgk8b0lzftwGeqaB7R2NAkZR1tM7B20w/Amdh9BzHIrW2fOayMSgoI67Bec3nYnwQCuulPTmI4eD0Ie3/bAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5d00d0e541b47ac8db25f77020ada0f5699b49f1e84961c4757eb77f14cf6a6","last_reissued_at":"2026-07-05T08:03:47.934067Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:03:47.934067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.06670","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-07-05T08:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0KzIo+rLE/HBkpZES6m7ngnYr1y0Stlhjv54ci+6tacf3+129jTLV4tqV5FoDBldHw6pdeZDLWNRj4pVx+jRCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:54:03.494604Z"},"content_sha256":"a458707dc564fe15a4270b6f45c4b55299a9e5c59466ef3e40f8ebd18a540679","schema_version":"1.0","event_id":"sha256:a458707dc564fe15a4270b6f45c4b55299a9e5c59466ef3e40f8ebd18a540679"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6XIA2DSUDND2ZDNSL53QECW2B5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incidence bounds via extremal graph theory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon","submitted_at":"2024-01-12T16:23:10Z","abstract_excerpt":"The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as additive combinatorics and theoretical computer science. Assuming a standard non-degeneracy condition, i.e., that no $s$ points are contained in the intersection of $s$ hyperplanes, the currently best known upper bound on the number of incidences of $m$ points and $n$ hyperplanes in $\\mathbb{R}^d$ is $$O_{d, s}((mn)^{1-1/(d+1)}+m+n).$$ This bound by Apfelba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06670","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.06670/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:03:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XS3x36uGp4mkgj2TZjvLHQwzMTPSoKHqsKvxY2VLhw+1f5yWB39orwTFFmuxWS/+3rq5XlFiXZcQi9EtRUiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:54:03.495117Z"},"content_sha256":"65bdb0b3fe892ea778c829568c748cbfc8db6e8475754a0177b41c7b781b80dc","schema_version":"1.0","event_id":"sha256:65bdb0b3fe892ea778c829568c748cbfc8db6e8475754a0177b41c7b781b80dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XIA2DSUDND2ZDNSL53QECW2B5/bundle.json","state_url":"https://pith.science/pith/6XIA2DSUDND2ZDNSL53QECW2B5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XIA2DSUDND2ZDNSL53QECW2B5/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-08T04:54:03Z","links":{"resolver":"https://pith.science/pith/6XIA2DSUDND2ZDNSL53QECW2B5","bundle":"https://pith.science/pith/6XIA2DSUDND2ZDNSL53QECW2B5/bundle.json","state":"https://pith.science/pith/6XIA2DSUDND2ZDNSL53QECW2B5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XIA2DSUDND2ZDNSL53QECW2B5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6XIA2DSUDND2ZDNSL53QECW2B5","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":"1a860bcf2d1963e7423e966412193ec3960b94e39ebf5ef71461e7784afd9d8b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-12T16:23:10Z","title_canon_sha256":"c9133ea5642beb04bb97254d67aef8d7f466fae2646dd7b6c22c371f2613c8af"},"schema_version":"1.0","source":{"id":"2401.06670","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.06670","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"arxiv_version","alias_value":"2401.06670v2","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.06670","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_12","alias_value":"6XIA2DSUDND2","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_16","alias_value":"6XIA2DSUDND2ZDNS","created_at":"2026-07-05T08:03:47Z"},{"alias_kind":"pith_short_8","alias_value":"6XIA2DSU","created_at":"2026-07-05T08:03:47Z"}],"graph_snapshots":[{"event_id":"sha256:65bdb0b3fe892ea778c829568c748cbfc8db6e8475754a0177b41c7b781b80dc","target":"graph","created_at":"2026-07-05T08:03: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2401.06670/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The study of counting point-hyperplane incidences in the $d$-dimensional space was initiated in the 1990's by Chazelle and became one of the central problems in discrete geometry. It has interesting connections to many other topics, such as additive combinatorics and theoretical computer science. Assuming a standard non-degeneracy condition, i.e., that no $s$ points are contained in the intersection of $s$ hyperplanes, the currently best known upper bound on the number of incidences of $m$ points and $n$ hyperplanes in $\\mathbb{R}^d$ is $$O_{d, s}((mn)^{1-1/(d+1)}+m+n).$$ This bound by Apfelba","authors_text":"Aleksa Milojevi\\'c, Benny Sudakov, Istv\\'an Tomon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-12T16:23:10Z","title":"Incidence bounds via extremal graph theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.06670","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:a458707dc564fe15a4270b6f45c4b55299a9e5c59466ef3e40f8ebd18a540679","target":"record","created_at":"2026-07-05T08:03: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":"1a860bcf2d1963e7423e966412193ec3960b94e39ebf5ef71461e7784afd9d8b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-01-12T16:23:10Z","title_canon_sha256":"c9133ea5642beb04bb97254d67aef8d7f466fae2646dd7b6c22c371f2613c8af"},"schema_version":"1.0","source":{"id":"2401.06670","kind":"arxiv","version":2}},"canonical_sha256":"f5d00d0e541b47ac8db25f77020ada0f5699b49f1e84961c4757eb77f14cf6a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5d00d0e541b47ac8db25f77020ada0f5699b49f1e84961c4757eb77f14cf6a6","first_computed_at":"2026-07-05T08:03:47.934067Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:03:47.934067Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xJSgk8b0lzftwGeqaB7R2NAkZR1tM7B20w/Amdh9BzHIrW2fOayMSgoI67Bec3nYnwQCuulPTmI4eD0Ie3/bAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:03:47.934578Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.06670","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a458707dc564fe15a4270b6f45c4b55299a9e5c59466ef3e40f8ebd18a540679","sha256:65bdb0b3fe892ea778c829568c748cbfc8db6e8475754a0177b41c7b781b80dc"],"state_sha256":"41d905c2c4501fa46922441951b4e1d43e28e647ac5e47cb5e21ecb626a538de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2iIxoQtwnMih+U8PiRsG21yA+uopYMcfoMGTmlGcYv1mD8M3QrSyBqzJwEqpfweugjh+MQDNL4mNvgpK90KEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:54:03.500044Z","bundle_sha256":"00b53cb63681d6ec21078c9471826747457331c52db6ff0882baf4620903e1a6"}}