SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2012.06922 · 2020

Decimated Framelet System on Graphs and Fast G-Framelet Transforms

arXiv · PDF · Open in the Atlas

Code that ran

1 of 2 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; 1 honoured the contract we drafted, 0 violated it and 0 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/2012.06922.json · badge: /api/ran/2012.06922.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
YuGuangWang/FGT canonical (classifier label)
classifier basis: classifier_2025
1 ran · 1 no recorded run
FunctionStatusWhere it lives
tree_idx2 Ran
ran, honoured the contract we drafted
YuGuangWang/FGT/fgconv_dd.py
code served (permissive licence) · get_code("8f8f9debeb9a9d4f")
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) and returned ndarray, ndim 1, dtype family int, shape (2,) 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 numpy as np

# Build a minimal tree structure
# The function expects treeG to be a list of dicts, where each dict has a 'clusters' key
# 'clusters' maps node indices to arrays of child node indices

# Create a simple tree with 3 levels (J=0, 1, 2)
# Level 2 (finest): nodes 0-3
# Level 1 (middle): nodes 0-1, where node 0 contains [0, 1] and node 1 contains [2, 3]
# Level 0 (coarsest): node 0 contains [0, 1]

treeG = [
    # Level 0 (coarsest)
    {
        'clusters': {
            0: np.array([0, 1], dtype=int)
        }
    },
    # Level 1 (middle)
    {
        'clusters': {
            0: np.array([0, 1], dtype=int),
            1: np.array([2, 3], dtype=int)
        }
    },
    # Level 2 (finest)
    {
        'clusters': {
            0: np.array([0], dtype=int),
            1: np.array([1], dtype=int),
            2: np.array([2], dtype=int),
            3: np.array([3], dtype=int)
        }
    }
]

# Test case 1: J1=1, J2=0 (adjacent levels, J2 < J1)
# Find all nodes at level 0 whose parent at level 1 is node 0
k1_test1 = 0
J1_test1 = 1
J2_test1 = 0

# Test case 2: J1=2, J2=0 (non-adjacent levels, J2 < J1)
# Find all nodes at level 0 whose ancestor at level 2 is node 0
k1_test2 = 0
J1_test2 = 2
J2_test2 = 0

ARGS = {
    'treeG': treeG,
    'k1': k1_test1,
    'J1': J1_test1,
    'J2': J2_test1
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family int, shape (2,) — shape (2,) 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
HaarGOB Not yet run
unverified (harvested, no recorded run)
YuGuangWang/FGT/fgconv_dd.py
code served (permissive licence) · get_code("1e3f7857ba8c1d85")
How it ran

no invocation recorded.

Also present in other papers' code

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

Graph representation learning has many real-world applications, from super-resolution imaging, 3D computer vision to drug repurposing, protein classification, social networks analysis. An adequate representation of graph data is vital to the learning performance of a statistical or machine learning model for graph-structured data. In this paper, we propose a novel multiscale representation system for graph data, called decimated framelets, which form a localized tight frame on the graph. The decimated framelet system allows storage of the graph data representation on a coarse-grained chain and processes the graph data at multi scales where at each scale, the data is stored at a subgraph. Based on this, we then establish decimated G-framelet transforms for the decomposition and reconstruction of the graph data at multi resolutions via a constructive data-driven filter bank. The graph framelets are built on a chain-based orthonormal basis that supports fast graph Fourier transforms. From this, we give a fast algorithm for the decimated G-framelet transforms, or FGT, that has linear computational complexity O(N) for a graph of size N. The theory of decimated framelets and FGT is verified with numerical examples for random graphs. The effectiveness is demonstrated by real-world applications, including multiresolution analysis for traffic network, and graph neural networks for graph classification tasks.

For agents

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

get_harvested_code_for_paper("2012.06922")
get_code_for_paper("2012.06922")
have("2012.06922")

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

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

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

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

Connect an agent — have() is free.