2601.09489v1.pdf

{
  "dorsal/arxiv": [
    {
      "date_modified": "2026-02-17T05:53:20.460000Z",
      "hash": "ed2526c4a7f07962d914d06dc8451d5204906394ab36b54817cc1690c996e6b1",
      "id": "3b77c160-8609-49fc-a275-7c5cc045c6b3",
      "source": {
        "execution_id": "07ee39dd-8740-4777-9520-9932e5a4bece",
        "id": "arXiv Dataset",
        "type": "Model",
        "variant": "snapshot-2026-01-17",
        "version": "0.1.0"
      },
      "user_id": 1000002
    }
  ],
  "file/base": {
    "record": {
      "extension": ".pdf",
      "hash": "ed2526c4a7f07962d914d06dc8451d5204906394ab36b54817cc1690c996e6b1",
      "media_type": "application/pdf",
      "media_type_prefix": "application",
      "name": "2601.09489v1.pdf",
      "size": 709106
    },
    "source": {
      "execution_id": "b75d9296-2921-46dd-8c12-04de1910e0aa",
      "id": "file/base",
      "type": "Model",
      "version": "1.0.0"
    }
  },
  "file/pdf": {
    "private": false,
    "record": {
      "creation_date": "2026-01-15T01:54:59Z",
      "keywords": [
        "Exact and approximate counting",
        "sketching",
        "geometric algorithms",
        "lower bounds"
      ],
      "modified_date": "2026-01-15T01:54:59Z",
      "page_count": 17,
      "producer": "pikepdf 8.15.1",
      "subject": "-  Theory of computation  -\u003e  Data structures and algorithms for data management.Sketching and sampling.Lower bounds and information complexity.",
      "title": "How many users have been here for a long time? Efficient solutions for counting long aggregated visits",
      "version": "1.7"
    },
    "source": {
      "execution_id": "d5c9112f-7371-46dc-a287-ed6461dc4250",
      "id": "dorsal/pdf",
      "type": "Model",
      "version": "1.1.0"
    }
  }
}