SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2303.11700 · 2023

Dynamically Expandable Graph Convolution for Streaming Recommendation

arXiv · PDF · Open in the Atlas

Code that ran

2 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; 0 honoured the contract we drafted, 0 violated it and 2 have no contract verdict; 0 failures of our instrument; 0 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/2303.11700.json · badge: /api/ran/2303.11700.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
bokwaiho/degc canonical (classifier label)
classifier basis not recorded on the link
2 ran · 0 no recorded run
FunctionStatusWhere it lives
calculate_contrastive_loss Ran
ran on a synthesized input
bokwaiho/degc/degc/DEGC_MGCCF.py
code served (permissive licence) · get_code("bb05b57172211798")
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 EagerTensor, 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 tensorflow as tf
import numpy as np

# Set seed for reproducibility
np.random.seed(0)
tf.random.set_seed(0)

# Create small test tensors
embedding_dim = 4
num_old_items = 6
num_selected = 2
num_neighbors = 3

# old_embedding: shape [num_old_items + some_buffer, embedding_dim]
# Contains embeddings from previous time point
old_embedding = tf.Variable(
    tf.random.normal([num_old_items + 2, embedding_dim], dtype=tf.float32)
)

# old_num: number of valid items from previous time point
old_num = num_old_items

# cur_pos_neigh: positive neighbors embeddings at current time
# shape should allow indexing by selected_id and have neighbor dimension
# Based on the function: tf.nn.embedding_lookup(cur_pos_neigh, selected_id)
# This suggests shape [num_items, num_neighbors, embedding_dim]
cur_pos_neigh = tf.Variable(
    tf.random.normal([num_old_items + 2, num_neighbors, embedding_dim], dtype=tf.float32)
)

# cur_neg_neigh: negative neighbors embeddings at current time
# Same structure as cur_pos_neigh
cur_neg_neigh = tf.Variable(
    tf.random.normal([num_old_items + 2, num_neighbors, embedding_dim], dtype=tf.float32)
)

# tau: temperature hyperparameter for contrastive loss
tau = 0.5

# selected_id: indices of selected items to compute loss for
# Based on embedding_lookup, this should be indices within [0, old_num)
selected_id = tf.constant([1, 3], dtype=tf.int32)

ARGS = {
    "old_embedding": old_embedding,
    "old_num": old_num,
    "cur_pos_neigh": cur_pos_neigh,
    "cur_neg_neigh": cur_neg_neigh,
    "tau": tau,
    "selected_id": selected_id,
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, tensorflow — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type EagerTensor, 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
uniform_sample Ran
ran on a synthesized input
bokwaiho/degc/degc/DEGC_MGCCF.py
code served (permissive licence) · get_code("566ca71b5a839708")
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 EagerTensor, ndim 2, dtype family int, shape (2, 15) 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 tensorflow as tf
import numpy as np

# Create sample data for the function
# ids: shape (N,) - indices of central nodes
ids = tf.constant([0, 1], dtype=tf.int32)

# adj: adjacency list - needs to be indexable via embedding_lookup
# Shape should be (num_nodes, max_neighbors) to support embedding_lookup
# Let's create a small adjacency matrix with 2 nodes, each with up to 20 potential neighbors
adj = tf.constant([
    [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20],
    [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21]
], dtype=tf.int32)

# num_samples: number of neighbors to sample
num_samples = 15

ARGS = {
    "ids": ids,
    "adj": adj,
    "num_samples": num_samples
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API
Imports
numpy, tensorflow — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type EagerTensor, ndim 2, dtype family int, shape (2, 15) — shape (2, 15) 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 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

Personalized recommender systems have been widely studied and deployed to reduce information overload and satisfy users' diverse needs. However, conventional recommendation models solely conduct a one-time training-test fashion and can hardly adapt to evolving demands, considering user preference shifts and ever-increasing users and items in the real world. To tackle such challenges, the streaming recommendation is proposed and has attracted great attention recently. Among these, continual graph learning is widely regarded as a promising approach for the streaming recommendation by academia and industry. However, existing methods either rely on the historical data replay which is often not practical under increasingly strict data regulations, or can seldom solve the \textit{over-stability} issue. To overcome these difficulties, we propose a novel \textbf{D}ynamically \textbf{E}xpandable \textbf{G}raph \textbf{C}onvolution (DEGC) algorithm from a \textit{model isolation} perspective for the streaming recommendation which is orthogonal to previous methods. Based on the motivation of disentangling outdated short-term preferences from useful long-term preferences, we design a sequence of operations including graph convolution pruning, refining, and expanding to only preserve beneficial long-term preference-related parameters and extract fresh short-term preferences. Moreover, we model the temporal user preference, which is utilized as user embedding initialization, for better capturing the individual-level preference shifts. Extensive experiments on the three most representative GCN-based recommendation models and four industrial datasets demonstrate the effectiveness and robustness of our method.

For agents

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

get_harvested_code_for_paper("2303.11700")
get_code_for_paper("2303.11700")
have("2303.11700")

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

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

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

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

Connect an agent — have() is free.