SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2306.02846 · NeurIPS · 2023

Fast Partitioned Learned Bloom Filter

Atsuki Sato, Yusuke Matsui

arXiv · PDF · Open in the Atlas

Code that ran

4 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 4 have no contract verdict; 0 failures of our instrument; 0 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2306.02846.json · badge: /api/ran/2306.02846.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
atsukisato/FastPLBF canonical (classifier label)
classifier basis: census
4 ran · 0 no recorded run
FunctionStatusWhere it lives
ThresMaxDiv Ran
ran on a synthesized input
atsukisato/FastPLBF/src/PLBFs/utils/ThresMaxDivDP.py
code served (permissive licence) · get_code("22015f11d87bbd44")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned list, ndim 1, dtype family float; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import numpy as np

# Construct DPPre: a 2D list of integers where some values can be None
# The function accesses DPPre[j-1][k-1] and DPPre[now][i]
# We need at least j=3 and k=3 to have valid indices
# Let's create a small DP table where entries represent segment indices
DPPre = [
    [0, 1, 2],
    [1, 2, None],
    [2, None, None]
]

# j-th to N-th segments are clustered as k-th region
# j is 1-indexed, so j=2 means starting from 2nd segment
j = 2

# number of regions
k = 2

# thre_list: list of floats representing thresholds
# The function accesses thre_list[now] where now comes from indices in DPPre
# We need at least len(thre_list) >= max indices used in DPPre traversal
# Safe to make it length equal to the size of DPPre
thre_list = [0.1, 0.2, 0.3]

ARGS = {
    "DPPre": DPPre,
    "j": j,
    "k": k,
    "thre_list": thre_list
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list, ndim 1, dtype family float — a list output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
calc_G_sum Ran
ran on a synthesized input
atsukisato/FastPLBF/src/PLBFs/utils/OptimalFPR_M.py
code served (permissive licence) · get_code("674ba7a99d8dba39")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch
import numpy as np

torch.manual_seed(0)

# Analyze the function:
# - pos_pr_list: list[float] - list of positive probabilities
# - neg_pr_list: list[float] - list of negative probabilities
# - valid_list: list[bool] - list of validity flags
# Function iterates through all three lists in parallel, skips if valid==True,
# otherwise accumulates pos_pr values

ARGS = {
    "pos_pr_list": [0.9, 0.7, 0.85, 0.6],
    "neg_pr_list": [0.1, 0.3, 0.15, 0.4],
    "valid_list": [True, False, True, False]
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type float, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
calc_K_sum Ran
ran on a synthesized input
atsukisato/FastPLBF/src/PLBFs/utils/OptimalFPR_M.py
code served (permissive licence) · get_code("238cb171a6286f28")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned float, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import math

torch_imported = False
try:
    import torch
    torch_imported = True
except ImportError:
    pass

# Construct arguments for calc_K_sum
# The function takes three lists:
# - pos_pr_list: list of positive probabilities (floats)
# - neg_pr_list: list of negative probabilities (floats)
# - valid_list: list of booleans indicating validity

pos_pr_list = [0.5, 0.3, 0.0, 0.7]
neg_pr_list = [0.2, 0.1, 0.05, 0.4]
valid_list = [True, True, False, True]

ARGS = {
    "pos_pr_list": pos_pr_list,
    "neg_pr_list": neg_pr_list,
    "valid_list": valid_list,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type float, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
some_f_i_is_greater_than_1 Ran
ran on a synthesized input
atsukisato/FastPLBF/src/PLBFs/utils/OptimalFPR_M.py
code served (permissive licence) · get_code("1519d27e22c89b43")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned bool, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.

import torch

torch.manual_seed(0)

# The function expects a list of floats
# It iterates through the list and returns True if any element is > 1
# Let's create a simple list of floats with at least one value greater than 1
f = [0.5, 1.5, 0.3]

ARGS = {
    "f": f
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type bool, ndim 0, dtype family float, shape () — shape () as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 4 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

A Bloom filter is a memory-efficient data structure for approximate membership queries used in numerous fields of computer science. Recently, learned Bloom filters that achieve better memory efficiency using machine learning models have attracted attention. One such filter, the partitioned learned Bloom filter (PLBF), achieves excellent memory efficiency. However, PLBF requires a O(N 3 k) time complexity to construct the data structure, where N and k are the hyperparameters of PLBF. One can improve memory efficiency by increasing N , but the construction time becomes extremely long. Thus, we propose two methods that can reduce the construction time while maintaining the memory efficiency of PLBF. First, we propose fast PLBF, which can construct the same data structure as PLBF with a smaller time complexity O(N 2 k). Second, we propose fast PLBF++, which can construct the data structure with even smaller time complexity O(N k log N +N k 2 ). Fast PLBF++ does not necessarily construct the same data structure as PLBF. Still, it is almost as memory efficient as PLBF, and it is proved that fast PLBF++ has the same data structure as PLBF when the distribution satisfies a certain constraint. Our experimental results from real-world datasets show that (i) fast PLBF and fast PLBF++ can construct the data structure up to 233 and 761 times faster than PLBF, (ii) fast PLBF can achieve the same memory efficiency as PLBF, and (iii) fast PLBF++ can achieve almost the same memory efficiency as PLBF. The codes are available at https://github.com/atsukisato/FastPLBF.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2306.02846")
get_code_for_paper("2306.02846")
have("2306.02846")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2306.02846.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2306.02846.svg)](https://syntology.ai/paper/2306.02846)

Connect an agent — have() is free.