arxiv
PublishedJuly 14, 2026 at 4:00 AM
Community-Aware Vertex Ordering for Reference-Based Graph Compression: A Cross-Encoder Empirical Study
Publisher summary· verbatim
arXiv:2605.21510v2 Announce Type: replace-cross Abstract: Reference-based graph compression encodes each vertex's neighbor list as differences from a nearby encoded list. WebGraph's BVGraph fixes a single encoding pipeline and relies on a separately chosen vertex ordering -- typically URL-lexicograp
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivCapacity and Redundancy Trade-offs in Multi-Task Learning16harxivPredictive Training with Latent Imagination for Visual Quadruped Navigation16harxivWhere Not to Learn: Prior-Aligned Training with Subset-based Attribution Constraints for Reliable Decision-Making16harxivDid We Actually Fix It? An Independent Adversarial Stress-Test of Post-Point-Adjustment Evaluation Metrics for Time-Series Anomaly Detection16hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗