{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BTXZ752YIXFGXBJQQCAIQCGUBL","short_pith_number":"pith:BTXZ752Y","canonical_record":{"source":{"id":"1612.04940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T06:19:57Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7d12d25995c3e0b201c5656d889136db32eae4202f78ad06e86765c69d935f41","abstract_canon_sha256":"ef7ae852c882348142459a8344f6fda97c17c012726f75495c6e56199e7e286b"},"schema_version":"1.0"},"canonical_sha256":"0cef9ff75845ca6b853080808808d40ad0e220a1927250680c6f8f23896e879c","source":{"kind":"arxiv","id":"1612.04940","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04940","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04940v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04940","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"BTXZ752YIXFG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTXZ752YIXFGXBJQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTXZ752Y","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BTXZ752YIXFGXBJQQCAIQCGUBL","target":"record","payload":{"canonical_record":{"source":{"id":"1612.04940","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T06:19:57Z","cross_cats_sorted":["math.MG"],"title_canon_sha256":"7d12d25995c3e0b201c5656d889136db32eae4202f78ad06e86765c69d935f41","abstract_canon_sha256":"ef7ae852c882348142459a8344f6fda97c17c012726f75495c6e56199e7e286b"},"schema_version":"1.0"},"canonical_sha256":"0cef9ff75845ca6b853080808808d40ad0e220a1927250680c6f8f23896e879c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:53.856663Z","signature_b64":"nRCoNi5pPdS4ze22Hy76jpYGCUSANLriNVKlHmoeaxdOgqFmUAHbYKD7yoYlD4c6cWCAOI3ZPNssQ/ECSbnFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cef9ff75845ca6b853080808808d40ad0e220a1927250680c6f8f23896e879c","last_reissued_at":"2026-05-18T00:54:53.855824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:53.855824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.04940","source_version":1,"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:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HVrgtmxwzHvcV6jDF4caqSADr3WauvEX05p+3lKdV3lZit33m2uTIIc7XngRFdjuHIjASgZ96X3PSFW6/UIyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:56:05.871632Z"},"content_sha256":"20d5c7df889f2bda259110f509f80d77c92f6cfe5251418eb945071ddf96d601","schema_version":"1.0","event_id":"sha256:20d5c7df889f2bda259110f509f80d77c92f6cfe5251418eb945071ddf96d601"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BTXZ752YIXFGXBJQQCAIQCGUBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distinct distances between a collinear set and an arbitrary set of points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.MG"],"primary_cat":"math.CO","authors_text":"Ariel Bruner, Micha Sharir","submitted_at":"2016-12-15T06:19:57Z","abstract_excerpt":"We consider the number of distinct distances between two finite sets of points in ${\\bf R}^k$, for any constant dimension $k\\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary points, such that no hyperplane orthogonal to $l$ and no hypercylinder having $l$ as its axis contains more than $O(1)$ points of $P_2$. The number of distinct distances between $P_1$ and $P_2$ is then $$ \\Omega\\left(\\min\\left\\{ n^{2/3}m^{2/3},\\; \\frac{n^{10/11}m^{4/11}}{\\log^{2/11}m},\\; n^2,\\; m^2\\right\\}\\right) . $$ Without the assumption on $P_2$, there e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04940","kind":"arxiv","version":1},"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:54:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFbaGHawJhYL8TSix1u3OQq+lGhiLzwnsJTDD/ytNxOsK/ZSxi860fPSvCvuA2DY9AhbyFTS9uZxiIZZ1fjICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:56:05.872281Z"},"content_sha256":"993d0ae4918554d019947773fb204faef8b8312219a9f29cba5ba4a87ba4c1d6","schema_version":"1.0","event_id":"sha256:993d0ae4918554d019947773fb204faef8b8312219a9f29cba5ba4a87ba4c1d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/bundle.json","state_url":"https://pith.science/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/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-27T15:56:05Z","links":{"resolver":"https://pith.science/pith/BTXZ752YIXFGXBJQQCAIQCGUBL","bundle":"https://pith.science/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/bundle.json","state":"https://pith.science/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTXZ752YIXFGXBJQQCAIQCGUBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BTXZ752YIXFGXBJQQCAIQCGUBL","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":"ef7ae852c882348142459a8344f6fda97c17c012726f75495c6e56199e7e286b","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T06:19:57Z","title_canon_sha256":"7d12d25995c3e0b201c5656d889136db32eae4202f78ad06e86765c69d935f41"},"schema_version":"1.0","source":{"id":"1612.04940","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04940","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04940v1","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04940","created_at":"2026-05-18T00:54:53Z"},{"alias_kind":"pith_short_12","alias_value":"BTXZ752YIXFG","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"BTXZ752YIXFGXBJQ","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"BTXZ752Y","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:993d0ae4918554d019947773fb204faef8b8312219a9f29cba5ba4a87ba4c1d6","target":"graph","created_at":"2026-05-18T00:54:53Z","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 consider the number of distinct distances between two finite sets of points in ${\\bf R}^k$, for any constant dimension $k\\ge 2$, where one set $P_1$ consists of $n$ points on a line $l$, and the other set $P_2$ consists of $m$ arbitrary points, such that no hyperplane orthogonal to $l$ and no hypercylinder having $l$ as its axis contains more than $O(1)$ points of $P_2$. The number of distinct distances between $P_1$ and $P_2$ is then $$ \\Omega\\left(\\min\\left\\{ n^{2/3}m^{2/3},\\; \\frac{n^{10/11}m^{4/11}}{\\log^{2/11}m},\\; n^2,\\; m^2\\right\\}\\right) . $$ Without the assumption on $P_2$, there e","authors_text":"Ariel Bruner, Micha Sharir","cross_cats":["math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T06:19:57Z","title":"Distinct distances between a collinear set and an arbitrary set of points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04940","kind":"arxiv","version":1},"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:20d5c7df889f2bda259110f509f80d77c92f6cfe5251418eb945071ddf96d601","target":"record","created_at":"2026-05-18T00:54:53Z","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":"ef7ae852c882348142459a8344f6fda97c17c012726f75495c6e56199e7e286b","cross_cats_sorted":["math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-12-15T06:19:57Z","title_canon_sha256":"7d12d25995c3e0b201c5656d889136db32eae4202f78ad06e86765c69d935f41"},"schema_version":"1.0","source":{"id":"1612.04940","kind":"arxiv","version":1}},"canonical_sha256":"0cef9ff75845ca6b853080808808d40ad0e220a1927250680c6f8f23896e879c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cef9ff75845ca6b853080808808d40ad0e220a1927250680c6f8f23896e879c","first_computed_at":"2026-05-18T00:54:53.855824Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:53.855824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nRCoNi5pPdS4ze22Hy76jpYGCUSANLriNVKlHmoeaxdOgqFmUAHbYKD7yoYlD4c6cWCAOI3ZPNssQ/ECSbnFCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:53.856663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04940","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20d5c7df889f2bda259110f509f80d77c92f6cfe5251418eb945071ddf96d601","sha256:993d0ae4918554d019947773fb204faef8b8312219a9f29cba5ba4a87ba4c1d6"],"state_sha256":"0509c9edeb8c8e7747af7256fb0c107a7289754460b5e66861e719208b49bc65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yi/54ID8rp8Q0X7kjzWcZ6koiXpCUvSfSrjiEgeSC4WB+Vz6TkElK4tmcwrVWBo6TW0T+vpd76+6peFMoK+5CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:56:05.875965Z","bundle_sha256":"3e693c707797c196314e7f0bb79c7b52a0bbf110176068fcd4b6c6da0970af08"}}