Paper Citation Record · LEDGER

Four-Cycle Counting in Low-Degeneracy Graph Streams

As of 11 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2606.17732.

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

pith.paper-citation-record.v1
2606.17732 v1

Coverage vector

measured 39 of 39 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-06-26T22:14:51.175953Z

measured 39 of 39 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+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

39 of 39 outbound references displayed

verified exact4
verified fuzzy0
unresolved34
parse uncertain0
malformed identifier1
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e4623492-0279-4ea3-a376-0b46b07ac8f9 · outbound

This paper cites Link prediction via higher-order motif features.

Four-Cycle Counting in Low-Degeneracy Graph Streams Link prediction via higher-order motif features

Reference 1

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c62d70a-ee14-4d0f-be56-3a8ae41a9b20 · outbound

This paper cites Ahmed, Jennifer Neville, and Ramana Rao Kompella.

Four-Cycle Counting in Low-Degeneracy Graph Streams Ahmed, Jennifer Neville, and Ramana Rao Kompella

Reference 2

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8b7d552f-c8e8-41d8-916a-9d801f2d01b8 · outbound

This paper cites The space complexity of approxi- mating the frequency moments.J.

Four-Cycle Counting in Low-Degeneracy Graph Streams The space complexity of approxi- mating the frequency moments.J

Reference 3

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bc35b57-9e5d-4ba6-ae57-d5e0b1d55a47 · outbound

This paper cites A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling.

Four-Cycle Counting in Low-Degeneracy Graph Streams A simple sublinear-time algorithm for counting arbitrary subgraphs via edge sampling

Reference 4

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0db9ca2d-79a6-4eb8-ba86-8d906ee56fb4 · outbound

This paper cites Bera and Amit Chakrabarti.

Four-Cycle Counting in Low-Degeneracy Graph Streams Bera and Amit Chakrabarti

Reference 5

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ffc9892-7624-4dc0-bdc0-73da980e5650 · outbound

This paper cites Bera and C.

Four-Cycle Counting in Low-Degeneracy Graph Streams Bera and C

Reference 6

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 14cb2b65-3e47-446d-b798-06a5830d3442 · outbound

This paper cites Mining large networks with subgraph counting.

Four-Cycle Counting in Low-Degeneracy Graph Streams Mining large networks with subgraph counting

Reference 7

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4474695-47bb-4b1e-bb6d-ab923033f8e4 · outbound

This paper cites How hard is counting triangles in the streaming model? InICALP (1), volume 7965 ofLecture Notes in Computer Science, pages 244–254.

Four-Cycle Counting in Low-Degeneracy Graph Streams How hard is counting triangles in the streaming model? InICALP (1), volume 7965 ofLecture Notes in Computer Science, pages 244–254

Reference 8

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9663494b-3100-4662-9524-b5452f39ecb4 · outbound

This paper cites an unresolved cited work.

Four-Cycle Counting in Low-Degeneracy Graph Streams Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88d89145-0e01-4cf0-854b-49f621b34343 · outbound

This paper cites Stars, holes, or paths across your facebook friends: A graphlet-based characterization of many networks.Netw.

Four-Cycle Counting in Low-Degeneracy Graph Streams Stars, holes, or paths across your facebook friends: A graphlet-based characterization of many networks.Netw

Reference 10

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca69cfdb-1099-4bfd-8630-40bad7a0fb2c · outbound

This paper cites Arboricity and subgraph listing algorithms.

Four-Cycle Counting in Low-Degeneracy Graph Streams Arboricity and subgraph listing algorithms

Reference 11

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 924d0ddf-9c0f-46ad-81c1-651988a0a29c · outbound

This paper cites Listing all maximal cliques in large sparse real-world graphs.ACM J.

Four-Cycle Counting in Low-Degeneracy Graph Streams Listing all maximal cliques in large sparse real-world graphs.ACM J

Reference 12

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a2679ab-a5e7-49e0-9590-2b44b924f18e · outbound

This paper cites Approximately counting subgraphs in data streams.

Four-Cycle Counting in Low-Degeneracy Graph Streams Approximately counting subgraphs in data streams

Reference 13

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de43bea1-b358-4ccf-8fe2-d68fbc20f209 · outbound

This paper cites An optimal algorithm for triangle counting in the stream.

Four-Cycle Counting in Low-Degeneracy Graph Streams An optimal algorithm for triangle counting in the stream

Reference 14

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6afe1792-97f2-4c67-ba0c-b1a2668be5c9 · outbound

This paper cites The complexity of counting cycles in the adjacency list streaming model.

Four-Cycle Counting in Low-Degeneracy Graph Streams The complexity of counting cycles in the adjacency list streaming model

Reference 15

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 88ae5712-9a83-44f6-aac7-ba8446e87c96 · outbound

This paper cites KONECT: the Koblenz network collection.

Four-Cycle Counting in Low-Degeneracy Graph Streams KONECT: the Koblenz network collection

Reference 16

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35e7db77-18df-4d06-9dd5-693a42858610 · outbound

This paper cites Understanding Money Trails of Suspicious Activities in a cryptocurrency-based Blockchain.

Four-Cycle Counting in Low-Degeneracy Graph Streams Understanding Money Trails of Suspicious Activities in a cryptocurrency-based Blockchain

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-07-03T23:29:02.528705Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 2628d853-74f2-4352-9d02-4211c417ed95 · outbound

This paper cites Approximately counting butterflies in large bipartite graph streams.IEEE Trans.

Four-Cycle Counting in Low-Degeneracy Graph Streams Approximately counting butterflies in large bipartite graph streams.IEEE Trans

Reference 18

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a87ef0d5-1868-4d21-8ea2-43dab29a3e40 · outbound

This paper cites MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams.

Four-Cycle Counting in Low-Degeneracy Graph Streams MASCOT: memory-efficient and accurate sampling for counting local triangles in graph streams

Reference 19

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f7b55ec7-0de4-4349-b19c-9d144625e93e · outbound

This paper cites Lind, Marta C.

Four-Cycle Counting in Low-Degeneracy Graph Streams Lind, Marta C

Reference 20

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3cf614cc-7868-4307-95da-2fccbc3548b8 · outbound

This paper cites Four- Cycle Counting in Low-Degeneracy Graph Streams.

Four-Cycle Counting in Low-Degeneracy Graph Streams Four- Cycle Counting in Low-Degeneracy Graph Streams

Reference 21

Resolution: malformed identifier; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0768a89f-6113-4c6b-8f3a-b32471516d01 · outbound

This paper cites Near-optimal four-cycle counting in graph streams.

Four-Cycle Counting in Low-Degeneracy Graph Streams Near-optimal four-cycle counting in graph streams

Reference 22

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b377f78-c7e6-42d8-a4b8-e8f5bb095d45 · outbound

This paper cites Triangle and four cycle counting in the data stream model.

Four-Cycle Counting in Low-Degeneracy Graph Streams Triangle and four cycle counting in the data stream model

Reference 23

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 78c8c900-9774-4806-bb0b-4fb39e4a3459 · outbound

This paper cites an unresolved cited work.

Four-Cycle Counting in Low-Degeneracy Graph Streams Unresolved cited work

Reference 24

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9dd6ca0b-c579-4a04-85a6-cbf4730add57 · outbound

This paper cites Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges.

Four-Cycle Counting in Low-Degeneracy Graph Streams Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

Reference 25

Resolution: verified exact; local_arxiv, observed 2026-07-03T23:29:02.538801Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 4316807e-7f7e-4fcf-be80-81c97038de8f · outbound

This paper cites Social network analytics for supervised fraud detection in insurance.

Four-Cycle Counting in Low-Degeneracy Graph Streams Social network analytics for supervised fraud detection in insurance

Reference 26

Resolution: verified exact; arxiv_id, observed 2026-07-03T23:29:02.532143Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Observation 48b57ac4-abf1-4994-b59e-46a20522c9b3 · outbound

This paper cites Counting butterflies in fully dynamic bipartite graph streams.

Four-Cycle Counting in Low-Degeneracy Graph Streams Counting butterflies in fully dynamic bipartite graph streams

Reference 27

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc7ab4a8-f9b3-481c-9eb8-d82b64e2a397 · outbound

This paper cites Rossi and Nesreen K.

Four-Cycle Counting in Low-Degeneracy Graph Streams Rossi and Nesreen K

Reference 28

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3118931-b826-4fe8-9977-289b886f16ed · outbound

This paper cites Kleinberg, and Aneesh Sharma.

Four-Cycle Counting in Low-Degeneracy Graph Streams Kleinberg, and Aneesh Sharma

Reference 29

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 914850d2-bcee-4320-992e-3c145d25ae93 · outbound

This paper cites FLEET: butterfly estimation from a bipartite graph stream.

Four-Cycle Counting in Low-Degeneracy Graph Streams FLEET: butterfly estimation from a bipartite graph stream

Reference 30

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f433f44-3411-42aa-bfbb-2fda1c99f533 · outbound

This paper cites Tracking the trackers: A large-scale analysis of embedded web trackers.

Four-Cycle Counting in Low-Degeneracy Graph Streams Tracking the trackers: A large-scale analysis of embedded web trackers

Reference 31

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d8950215-5538-479b-8526-1caaeb997327 · outbound

This paper cites Tamer Özsu.

Four-Cycle Counting in Low-Degeneracy Graph Streams Tamer Özsu

Reference 32

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a3270d6c-f153-48bc-b100-987c452910c8 · outbound

This paper cites Patterns and anomalies in k-cores of real-world graphs with applications.Knowl.

Four-Cycle Counting in Low-Degeneracy Graph Streams Patterns and anomalies in k-cores of real-world graphs with applications.Knowl

Reference 33

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9600c906-1d2e-443f-bc9f-c8a45d1ff41a · outbound

This paper cites Lee, Yanick Charette, George Iosifidis, and Nicholas A.

Four-Cycle Counting in Low-Degeneracy Graph Streams Lee, Yanick Charette, George Iosifidis, and Nicholas A

Reference 34

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a81b74f-45c0-45e9-8ec3-e30e2cb689c6 · outbound

This paper cites Motifs in brain networks.PLoS Biology, 2(11):e369, 2004.

Four-Cycle Counting in Low-Degeneracy Graph Streams Motifs in brain networks.PLoS Biology, 2(11):e369, 2004

Reference 35

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 00a1d69e-33c1-45bb-bfbb-7950e8968783 · outbound

This paper cites Trièst: Counting local and global triangles in fully-dynamic streams with fixed memory size.

Four-Cycle Counting in Low-Degeneracy Graph Streams Trièst: Counting local and global triangles in fully-dynamic streams with fixed memory size

Reference 36

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8542853-4fa5-41ff-9cfa-0223909cd663 · outbound

This paper cites FABLE: approximate butterfly counting in bipartite graph stream with duplicate edges.

Four-Cycle Counting in Low-Degeneracy Graph Streams FABLE: approximate butterfly counting in bipartite graph stream with duplicate edges

Reference 37

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25fb52a8-4e03-42f1-9f88-5700a9d8d7ab · outbound

This paper cites Random sampling with a reservoir.ACM Trans.

Four-Cycle Counting in Low-Degeneracy Graph Streams Random sampling with a reservoir.ACM Trans

Reference 38

Resolution: unresolved; no resolver link, observed 2026-06-26T22:14:51.175953Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6a3c1a0f-cb94-45d1-8d26-4b2c1e313010 · outbound

This paper cites Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming.

Four-Cycle Counting in Low-Degeneracy Graph Streams Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-07-03T23:29:02.535612Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.

Pith citing papers

No inbound Pith citation observations are available.