{
  "abstract": "Periodic Bloom-filter transmission can impose substantial overhead in communication-constrained distributed systems. Lossless compression preserves membership behavior but provides a single transmission size, whereas established OR folding produces smaller representations with higher false-positive rates (FPRs) while preserving the no-false-negative property. This paper investigates channel-aware selection among OR-folded representations. The sender retains an unchanged canonical filter, constructs a catalog satisfying a maximum FPR, and selects the FPR-qualified representation with the largest retained length supported by the communication resources available at each reporting opportunity. Unlike folding driven principally by cardinality and false-positive constraints, selection is driven by time-varying communication conditions. Using two phishing URL datasets, the framework is evaluated under Five-State Markov Capacity, Gilbert--Elliott burst-error, and Rayleigh block-fading models. Channel-aware folding improves communication efficiency and receiver freshness relative to complete-filter and lossless-compression baselines when communication opportunities vary substantially. Under the more favorable Gilbert--Elliott model, it remains competitive in efficiency while maintaining the freshest receiver state. These results show that FPR-qualified folded views provide useful transmission operating points when a recent lower-fidelity update is preferable to delaying a larger representation.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.14458",
  "author_total": 3,
  "authors": [
    {
      "name": "John Cartmell"
    },
    {
      "name": "Mihaela Cardei"
    },
    {
      "name": "Ionut Cardei"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/1ck135shrd213.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.14458",
  "fulltext_url": null,
  "id": "1ck135shrd213",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.14458",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CR"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "cs.NI"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1702|Algorithms and Data Compression"
    ]
  ],
  "openalex": "W7213304860",
  "pdf_url": "https://arxiv.org/pdf/2609.14458",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-13",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/1ck135shrd213.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:21:29Z",
      "native_id": "2609.14458",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.14458"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Channel-Aware Selection of Folded Bloom Filters for Distributed Systems",
  "title_text": "Channel-Aware Selection of Folded Bloom Filters for Distributed Systems",
  "type": "preprint",
  "updated_at": "2026-10-30T12:21:29Z",
  "url": "https://research.draconitic.com/paper/1ck135shrd213",
  "venue": "arXiv",
  "versions": []
}