Paper Citation Record · LEDGER

An Efficient Streaming Algorithm for Approximating Graphlet Distributions

As of 5 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2604.25400.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2604.25400 v1

Coverage vector

measured 46 of 46 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-07T15:22:47.089454Z

measured 46 of 46 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

46 of 46 outbound references displayed

verified exact0
verified fuzzy38
unresolved8
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 271ea3aa-3a04-4396-ba85-75c01d5286cf · outbound

This paper cites Mixing time bounds for graphlet random walks.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Mixing time bounds for graphlet random walks

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.882605Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 65055ea7-8880-4737-a760-d82000e952e1 · outbound

This paper cites Ahmed, Nick G.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Ahmed, Nick G

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.789636Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a1064b87-0593-4efb-a840-d78b9fc3c68f · outbound

This paper cites D ensest subgraph in streaming and MapReduce.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions D ensest subgraph in streaming and MapReduce

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.773706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 3bc9c191-340b-44a0-b6ce-2c4124fc3a7d · outbound

This paper cites Sivakumar.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Sivakumar

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.880051Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 84e55f63-b92e-41de-be20-d2f61345cdbd · outbound

This paper cites Eﬃcient semi-streaming algorithms for local triangle counting in massive graphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Eﬃcient semi-streaming algorithms for local triangle counting in massive graphs

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.858981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4c4a28ea-6b06-46ce-bf97-620a7eedad9b · outbound

This paper cites Bera, Lior Gishboliner, Yevgeny Levanzov, C.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Bera, Lior Gishboliner, Yevgeny Levanzov, C

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.862503Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8d77694b-f8e9-4487-aba1-93d98eb9bb44 · outbound

This paper cites Bhuiyan, Mahmudur Rahman, Mahmuda Rahman, a nd Mohammad Al Hasan.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Bhuiyan, Mahmudur Rahman, Mahmuda Rahman, a nd Mohammad Al Hasan

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.754350Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8519d7c3-ed25-4d64-985d-22f0dca56057 · outbound

This paper cites Hubert Chan, Qipeng Kuang, and Mauro Sozio.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Hubert Chan, Qipeng Kuang, and Mauro Sozio

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.816125Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 6e25a352-52f2-48b6-99e9-47d5fa49db2d · outbound

This paper cites Eﬃcient and near-optimal algorithms for sampling connected subgraphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Eﬃcient and near-optimal algorithms for sampling connected subgraphs

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.757784Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9bf3bfff-dce1-4719-b3a2-6a5500488ba3 · outbound

This paper cites Eﬃcient and near-optimal algorithms fo r sampling connected subgraphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Eﬃcient and near-optimal algorithms fo r sampling connected subgraphs

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.779506Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 78318adb-865b-469f-b7dd-aa4b62f98323 · outbound

This paper cites Faster algorithms for counting subgrap hs in sparse graphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Faster algorithms for counting subgrap hs in sparse graphs

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.825398Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e33c0079-6cbd-41dd-8582-0e2be192e8fb · outbound

This paper cites Eﬃcient and near-optimal algorithms fo r sampling small connected subgraphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Eﬃcient and near-optimal algorithms fo r sampling small connected subgraphs

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.828716Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 82dfcb3f-0f84-41ee-966d-5fb6c612e057 · outbound

This paper cites Counting graphlets: Space vs time.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Counting graphlets: Space vs time

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.764032Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation fafdcedd-5945-47f4-9f19-0a77a76c9e25 · outbound

This paper cites Motif counting beyond ﬁve nodes.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Motif counting beyond ﬁve nodes

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.766758Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation efa26d6b-5574-4dc3-92ea-fb6c3a890d03 · outbound

This paper cites Motivo: Fast motif counting via succinct color coding and adaptive sampling.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Motivo: Fast motif counting via succinct color coding and adaptive sampling

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.812820Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f0fe8097-ce58-4a9d-a180-e49fe28faf36 · outbound

This paper cites Faster motif counting via succinct color coding and adaptive sampling.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Faster motif counting via succinct color coding and adaptive sampling

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.819323Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 80661791-3ab3-4d5e-9358-01672bd7d727 · outbound

This paper cites Krishna Gummadi.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Krishna Gummadi

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.809983Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 15fcf228-8e13-40f6-bb55-4846f4608805 · outbound

This paper cites Kanj, and Ge Xia.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Kanj, and Ge Xia

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.865492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 29f7e6e5-e470-40c8-9828-5a1c067407b8 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 19

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.782688Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 755b0162-202d-4e12-9059-872913711661 · outbound

This paper cites Arboricity and su bgraph listing algorithms.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Arboricity and su bgraph listing algorithms

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.841065Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1c79f127-d85c-4144-8e4c-4f257bec1d34 · outbound

This paper cites On graph problems in a semi-streaming model.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions On graph problems in a semi-streaming model

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.795853Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 00af1537-0f76-4b83-a798-b3326cd5bb68 · outbound

This paper cites Improved parallel algorithms for density-based network clustering.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Improved parallel algorithms for density-based network clustering

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.877195Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation dfdccbac-21b6-4ce7-88f3-3490c8d079a3 · outbound

This paper cites An eﬃcient framework for clustered federated learning.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions An eﬃcient framework for clustered federated learning

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.852899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1d69313b-8630-43a4-8ccc-d90d1dc1812d · outbound

This paper cites Waddling random walk: Fast a nd accurate mining of motif statistics in large graphs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Waddling random walk: Fast a nd accurate mining of motif statistics in large graphs

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.847370Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 9fd47c17-9d87-47c1-9113-f680e479787c · outbound

This paper cites A generalizati on of sampling without replacement from a ﬁnite universe.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions A generalizati on of sampling without replacement from a ﬁnite universe

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.804671Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1a4f4dec-369f-4298-94e6-e4b1450cc86e · outbound

This paper cites The parameterised complex ity of counting connected subgraphs and graph motifs.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions The parameterised complex ity of counting connected subgraphs and graph motifs

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.770208Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c9c778fc-251e-47e4-a2d8-0ba27a541b02 · outbound

This paper cites Seshadhri, and Ali Pinar.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Seshadhri, and Ali Pinar

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.801718Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a84c8e46-fe49-4559-a0d5-9bb3064a54bf · outbound

This paper cites Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.855981Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 3e92ccfe-c7c9-4362-a5ba-668758f04402 · outbound

This paper cites KONECT: the koblenz network collection.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions KONECT: the koblenz network collection

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.799044Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 04981a94-1357-4d63-bd66-2de0b621bb3c · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 30

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.831772Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 32f783c9-ef5b-4f1d-9e89-e49cb53a14cf · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 31

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.776358Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5e7b200a-2c21-43df-bda9-967506a8cc7d · outbound

This paper cites Improved mixing ti me for k-subgraph sampling.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Improved mixing ti me for k-subgraph sampling

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.844361Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 188c2f11-efbe-45df-beef-6548893d5c05 · outbound

This paper cites Matula and Leland L.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Matula and Leland L

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.748148Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 80b140fd-e145-480c-a690-5ace836e6bd3 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 34

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.834801Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 204fc943-1228-44eb-b966-8e1ed76640ac · outbound

This paper cites Estimating graphlet statistics via lifting.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Estimating graphlet statistics via lifting

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.837996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7a992d8f-0a12-4dd6-95ef-5a7e768bffde · outbound

This paper cites Pavan, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Pavan, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu

Reference 36

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.822271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f61f05b9-eea0-4cb4-989a-2330a317370c · outbound

This paper cites Motif- matching based subgraph-level attentional convolutional network for graph classiﬁcation.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Motif- matching based subgraph-level attentional convolutional network for graph classiﬁcation

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.792954Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a551f5d4-e167-4d67-a4df-bef2973f85a6 · outbound

This paper cites Finding network motifs using mcmc sampling.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Finding network motifs using mcmc sampling

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.868706Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation cefbb5b5-5664-4fec-b651-070cf2e94114 · outbound

This paper cites C ¸ ataly¨ urek.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions C ¸ ataly¨ urek

Reference 39

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.751140Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 5e16c60e-9fa6-4da2-86ac-c5e3de19ac28 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 40

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.786076Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a9d94fae-7038-484e-a1fc-6ab5bdf48489 · outbound

This paper cites Triest: Counting local and global triangles in fully dynamic streams with ﬁxe d memory size.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Triest: Counting local and global triangles in fully dynamic streams with ﬁxe d memory size

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.761147Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2b53ed97-042d-480c-9889-e02f7e61430b · outbound

This paper cites Tiere d sampling: An eﬃcient method for approximate counting sparse motifs in massive graph stream s.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Tiere d sampling: An eﬃcient method for approximate counting sparse motifs in massive graph stream s

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.874462Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 71c4385e-8597-4f77-9dfd-86e77435f5e4 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.871590Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4ec2f45d-5f98-4371-b2a3-e760da82aa41 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 44

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.744884Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a7cd5fea-27b2-42a1-ba7f-36c52d4beab6 · outbound

This paper cites an unresolved cited work.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions Unresolved cited work

Reference 45

Resolution: unresolved; raw_fallback, observed 2026-05-27T03:28:45.807083Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 05c6b544-51e1-4b20-babd-e3ed05d5f4d3 · outbound

This paper cites ounter ApproxDD-ES.

An Efficient Streaming Algorithm for Approximating Graphlet Distributions ounter ApproxDD-ES

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-05-27T03:28:45.850260Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Pith citing papers

No inbound Pith citation observations are available.