SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2401.06493 · 2024

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases

arXiv · PDF · Open in the Atlas

Code that ran

2 of 3 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 2 have no contract verdict; 0 failures of our instrument; 1 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/2401.06493.json · badge: /api/ran/2401.06493.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
pierresenellart/provsql community (classifier label)
classifier basis not recorded on the link
2 ran · 1 no recorded run
FunctionStatusWhere it lives
split_statements Ran
ran on a synthesized input
pierresenellart/provsql/studio/web/build-casestudies.py
code served (permissive licence) · get_code("765961cfa686817b")
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 re

def split_statements(sql):
    """Split a SQL script into individual statements on top-level semicolons.

    Needed because PGlite runs a whole multi-statement exec() as ONE
    transaction, so an ``ON COMMIT DROP`` temp table created by
    provsql.create_provenance_mapping (and re-created on the next call) would
    collide. Run one statement per exec instead -> each autocommits and the
    temp table is dropped between calls, matching how psql loads the script.

    Tracks single-quoted strings, double-quoted identifiers, dollar-quoted
    blocks and -- / block comments so a semicolon inside any of them does not
    split. (The case-study scripts use none of dollar-quotes, but it is cheap
    to be correct.)"""
    stmts, buf = ([], [])
    i, n = (0, len(sql))
    sq = dq = lc = bc = False
    dollar = None
    while i < n:
        c = sql[i]
        two = sql[i:i + 2]
        if lc:
            buf.append(c)
            if c == '\n':
                lc = False
        elif bc:
            buf.append(c)
            if two == '*/':
                buf.append('/')
                i += 2
                bc = False
                continue
        elif sq:
            buf.append(c)
            if c == "'":
                sq = False
        elif dq:
            buf.append(c)
            if c == '"':
                dq = False
        elif dollar is not None:
            if sql.startswith(dollar, i):
                buf.append(dollar)
                i += len(dollar)
                dollar = None
                continue
            buf.append(c)
        elif two == '--':
            buf.append(two)
            i += 2
            lc = True
            continue
        elif two == '/*':
            buf.append(two)
            i += 2
            bc = True
            continue
        elif c == "'":
            buf.append(c)
            sq = True
        elif c == '"':
            buf.append(c)
            dq = True
        elif c == '$':
            m = re.match('\\$[A-Za-z_0-9]*\\$', sql[i:])
            if m:
                dollar = m.group(0)
                buf.append(dollar)
                i += len(dollar)
                continue
            buf.append(c)
        elif c == ';':
            s = ''.join(buf).strip()
            if s:
                stmts.append(s)
            buf = []
        else:
            buf.append(c)
        i += 1
    tail = ''.join(buf).strip()
    if tail:
        stmts.append(tail)
    return [s for s in stmts if not all((ln.strip() == '' or ln.strip().startswith('--') for ln in s.splitlines()))]


ARGS = {
    "sql": "SELECT * FROM users; INSERT INTO logs VALUES (1, 'test'); -- comment\nUPDATE users SET active=1;"
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
none outside the standard library — 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
validate_panel_option Ran
ran on a synthesized input
pierresenellart/provsql/studio/provsql_studio/db.py
code served (permissive licence) · get_code("e084d1f77fb4a27a")
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 tuple, 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.

# Setup code for validate_panel_option

ARGS = {
    'name': 'max_circuit_depth',
    'value': 25
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
none outside the standard library — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type tuple, ndim 1, dtype family float — a tuple 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
convert Not yet run
unverified (harvested, no recorded run)
pierresenellart/provsql/studio/web/build-casestudies.py
code served (permissive licence) · get_code("e649afb50f545dbd")
How it ran

no invocation recorded.

Also present in other papers' code

Of 3 samples lifted from this paper's linked repositories, 3 carry a function identity and 0 do not. Of the 3 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 3 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

Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, along with other similar power indices such as Banzhaf values. In this work we adapt these Shapley-like scores to probabilistic settings, the objective being to compute their expected value. We show that the computations of expected Shapley values and of the expected values of Boolean functions are interreducible in polynomial time, thus obtaining the same tractability landscape. We investigate the specific tractable case where Boolean functions are represented as deterministic decomposable circuits, designing a polynomial-time algorithm for this setting. We present applications to probabilistic databases through database provenance, and an effective implementation of this algorithm within the ProvSQL system, which experimentally validates its feasibility over a standard benchmark.

For agents

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

get_harvested_code_for_paper("2401.06493")
get_code_for_paper("2401.06493")
have("2401.06493")

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

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

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

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

Connect an agent — have() is free.