SnapScope: A Platform for City-Scale Collection and Exploration of Public Snap Map Data

Mohammed Almukaynizi; Fahad Alhaqbani; Khaled Almarzoug; Sultan Alanbari

Home/Archive/arXiv

arXiv · 2608.05841

SnapScope: A Platform for City-Scale Collection and Exploration of Public Snap Map Data

Mohammed Almukaynizi·Fahad Alhaqbani·Khaled Almarzoug·Sultan Alanbari

View original source ↗Read source document ↗Export metadata ↓

Abstract

Snapchat's Snap Map is an ephemeral stream of geotagged public video and image stories, but the platform provides no documented API, no prior work describes a reproducible system for collecting this data at city scale, and no tool exists for managing and exploring the collected data interactively. We present SnapScope, an integrated platform that pairs a back-end collection pipeline with a web-based front end for scraper management, interactive data exploration, side-by-side neighborhood comparison, and data export. We deploy the platform over Riyadh, Saudi Arabia, collecting 515,364 unique public snaps across 23 days on a 1 km grid of 2,740 query points. A saturation probe over 21 consecutive runs shows that 94.8% of returned observations are duplicates of already-stored records. We provide a privacy-safe aggregate dataset under CC BY 4.0. The platform is city-agnostic and redeployable by substituting grid coordinates and boundary polygons.

Explore related subjects

cs.SI

Keep this discovery

BibTeX RIS

Mohammed Almukaynizi, Fahad Alhaqbani, Khaled Almarzoug, Sultan Alanbari. 2026-08-30. SnapScope: A Platform for City-Scale Collection and Exploration of Public Snap Map Data. https://arxiv.org/abs/2608.05841

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.SI subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related discoveries

arXiv2026

Algorithmic Simplification for Million-Vertex Diffusion History Reconstruction

Diffusion history reconstruction infers latent node states between sparse observations of SI or SIR processes. HERMES combines parameter fitting, a learned graph-neural proposal, and feasibility-aware Markov chain Monte Carlo. We remove these stages one at a time and evaluate each version on all 12 canonical datasets. The final method uses deterministic mean-field forward-backward inference, threshold decoding, and fixed rates. This fixed-rate variant, Battus-Z, achieves mean macro-F1 of 0.8726 and NRMSE of 0.1010, compared with published HERMES aggregates of 0.8692 and 0.1483. The benchmark pins the final observed frame before scoring, so we also exclude all observed frames. Under this metric, Battus-Z obtains macro-F1 0.8431 and NRMSE 0.1181. Thus, the learned proposal, MCMC, and fitting stages can be removed while retaining the published aggregate quality on the evaluated HERMES benchmark and scoring protocol. A CUDA implementation processes generated histories with up to 4.84M vertices on LiveJournal and 117M edges on Orkut. On the same CUDA backend, Battus-Z reduces the geometric-mean algorithm interval relative to fitted Battus by 5.1x for SI and 20.3x for SIR. Its event-weighted causal-violation rates are 7.50% for SI and 8.77% for SIR; graph-constrained decoding remains future work.

cs.SI↗

arXiv2026

Convergence and acceleration of a nonlinear fixed-point iteration for computing the Fitness Centrality of general graphs

We establish the global convergence of the (non-homogeneous) Fitness Centrality algorithm for general graphs, deriving an explicit convergence bound for the corresponding fixed-point iteration. Furthermore, we show how the convergence can be dramatically improved by Anderson acceleration and by switching to Newton's method once a sufficiently good approximation to the fixed point has been found. The efficacy of this strategy is illustrated by numerical experiments on different types of graphs.

math.NA↗

arXiv2026

GroupDPO: Memory-Efficient Group-Wise Direct Preference Optimization

Preference optimization is widely used to align Large Language Models (LLMs) with preference feedback. However, most existing methods train on a single positive-negative pair per prompt, discarding additional supervision available in preference datasets that typically contain multiple candidate responses. Motivated by this limitation, recent work explores group-wise preference optimization, which jointly contrasts multiple responses for the same prompt, but its empirical behavior and scalability remain underexplored due to the memory overhead of group-coupled objectives. In this work, we present a unified empirical and systems study of group-wise preference optimization and develop a memory-efficient implementation for group-coupled objectives. By instantiating first-order linearization with objective-specific per-response coefficients, our implementation preserves first-order gradients while decoupling samples during backpropagation, substantially reducing peak memory usage and enabling scalable training with larger groups. Across offline and online settings, we show that leveraging multiple responses consistently outperforms single-pair training. Furthermore, incorporating a negative log-likelihood (NLL) term on positive responses is critical for both performance gains and training stability.

cs.CL↗