Pith. sign in

Paper Citation Record · LEDGER

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

As of 11 August 2026, this Paper Citation Record lists 49 of 49 outbound references and 4 inbound Pith citation observations for arXiv:2412.11488.

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

pith.paper-citation-record.v1
2412.11488 v2

Coverage vector

measured 49 of 49 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-23T07:21:24.896928Z

measured 53 of 53 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 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T15:42:34.123815Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-07-03T23:29:02.537191Z

Reference resolution

49 of 49 outbound references displayed

  • verified exact5
  • verified fuzzy44
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 71a8434d-739a-4ac9-9149-78a357f593cb · outbound

This paper cites Rectangle counting in large bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Rectangle counting in large bipartite graphs

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.379406Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:f5660c630e9df66eafb22fe5348c80630a774d023eec1d14854a30be92ab6599

Observation 361368c1-ddeb-4c5e-a7ea-a1008e132625 · outbound

This paper cites Measuring and modeling bipartite graphs with community structure.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Measuring and modeling bipartite graphs with community structure

Reference 2

Resolution
verified exact
doi, observed 2026-05-23T07:22:41.718475Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:14408d4b3fda2f88efe18b7ba2533cfee2680b05d3f11e8851a459b50cfec005

Observation 0479d327-db90-4129-bc96-a634afea57cd · outbound

This paper cites Cycles and clustering in bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Cycles and clustering in bipartite networks

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.357376Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:00bf2bd9cafb7f4ee1fb69b1183de4c1425484a4545dcc00334a851dbbdd7c23

Observation 5d07b9ed-7299-4b60-a6fa-8a07c7cb709f · outbound

This paper cites Small worlds among interlocking direc- tors: Network structure and distance in bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Small worlds among interlocking direc- tors: Network structure and distance in bipartite graphs

Reference 4

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.385233Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:99589034bea96f89436635aa0d8baa9c0c0235c4fd172344d9fa2b81b07829c8

Observation 5515d04a-caff-4ade-bd73-5dd5320505fc · outbound

This paper cites Clustering coefficient and community structure of bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Clustering coefficient and community structure of bipartite networks

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.395026Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:28f34a98cd0f3be46f8cf6a40d8bbdc4646736380754209200de2fc0e1d68011

Observation cd043eed-6b89-4783-8517-22d3dea0fe47 · outbound

This paper cites Alleviating the data sparsity problem of recommender systems by clustering nodes in bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Alleviating the data sparsity problem of recommender systems by clustering nodes in bipartite networks

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.126999Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:a23ed3210d14189901fdddfefca65e4f1cb4b0d0510bcd7f9e6982588ab82f3b

Observation 6c109806-b7ef-4e1b-b226-a3ce8918a3f1 · outbound

This paper cites Bipartite graph partitioning and data clustering.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Bipartite graph partitioning and data clustering

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.408603Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:57e9347fd3068381a2e9eb42633ced663ebdc75310cabe58c3b383f69568c487

Observation 26f34b73-887b-4b89-b58e-74c65feeaa46 · outbound

This paper cites Optimal bipartite network clustering.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Optimal bipartite network clustering

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.113909Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:44beb77a9e3b2dfa683142aa4fb332e9162bfd825426ad8635683ec25bb4b9e0

Observation 2bbbddf7-bd36-482e-ae33-ae393d2bb099 · outbound

This paper cites Efficient bitruss decomposition for large-scale bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Efficient bitruss decomposition for large-scale bipartite graphs

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.342767Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:b227812eefa5746024feddd181aa05fa7cc7780279dd9896551c7fb1116df979

Observation 2263bbc4-715a-4694-bea7-ba5ba4e89049 · outbound

This paper cites Community detection in bipartite network: a modified coarsening approach.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Community detection in bipartite network: a modified coarsening approach

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.436661Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:e424ad7ed6ca4904b8ce2280118db1fa775a51f586b749c22d7091a868b8a239

Observation 8178da12-9e23-4616-a428-373f4b7bded4 · outbound

This paper cites Searching personalized k- wing in bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Searching personalized k- wing in bipartite graphs

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.107683Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:d309ebc631c821aaf8aa587fed5213b9a7f5735cd1fcad3000a5844cb821ddc8

Observation ce0855ac-6cdd-4989-9d9e-ae8f9c0f916b · outbound

This paper cites Butterfly-Core Community Search over Labeled Graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Butterfly-Core Community Search over Labeled Graphs

Reference 12

Resolution
verified exact
arxiv_id, observed 2026-05-23T07:22:43.112585Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:bba7e01c1abcd815895d3fa7b56c79ae0039606cb1d1257a4a58852b27e2123c

Observation f18443d4-96d3-49ee-9dfc-30eaaad8d1cd · outbound

This paper cites Distributed approaches to butterfly analysis on large dynamic bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Distributed approaches to butterfly analysis on large dynamic bipartite graphs

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.450698Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:bc266127e4f1b4da8f3f3e019952ceaee69708534022c1839633171b1e138979

Observation c59ebcfb-4eec-424b-b2fe-021184d5b6f5 · outbound

This paper cites Butterfly counting and bitruss de- composition on uncertain bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Butterfly counting and bitruss de- composition on uncertain bipartite graphs

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.367539Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:5202e24889ec03a057326da156ebae4f6ed57a0e47077bd017f07224644ae566

Observation 40e32ffc-cb9a-4e5d-8fcb-f30d037cdebd · outbound

This paper cites Butterfly counting in bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Butterfly counting in bipartite networks

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.074649Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:3f22eeb7bb87b8ad37a1f5b50a9e4325d187181a587a764bb3e430e2fa69587a

Observation 23627254-5af1-4474-bcbd-6de5a1b4ce5a · outbound

This paper cites Efficient load-balanced butterfly counting on gpu.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Efficient load-balanced butterfly counting on gpu

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.067192Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:ee909f929602a44c97c0d47bab5eeee58d70e86a5ef3a59cf892bff05d93f107

Observation 6d748213-5eee-41ef-846f-c65fade5b365 · outbound

This paper cites Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.444114Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:e8a2343238c2d62edefdd276ea7bb15bb246edda58505c360f4e02ee2b8ac4b8

Observation a6109e73-4753-449d-91d7-f882955a26c8 · outbound

This paper cites I/o-efficient butterfly counting at scale.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges I/o-efficient butterfly counting at scale

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.104618Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:91ce1fbd8ab2e31395d1ecfb962a2d9c13e47e575be37c785f4e093c4aaa22c7

Observation cffb89a9-f8a9-4109-b180-61e44a4a5c39 · outbound

This paper cites A hybrid deep learning and modified butterfly optimization based feature selection for transaction credit card fraud detection.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges A hybrid deep learning and modified butterfly optimization based feature selection for transaction credit card fraud detection

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.429991Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:a4bfa7c59af6d47f10774f42eace3aa74bce4f69b983c3cc0534a6477586f11d

Observation c30b85f6-096c-4a25-bbf5-0453439602e0 · outbound

This paper cites Fraud detection: Comparison of traditional methods, hybrid methods, monarch butterfly optimization, and temporal convo- lutional networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Fraud detection: Comparison of traditional methods, hybrid methods, monarch butterfly optimization, and temporal convo- lutional networks

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.120208Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:ac5a00099a98d9922ad419fc95c6217ec413ebffb62438b169eeb00d6f80e202

Observation 4cf46305-248c-459c-a812-9979c1670eb7 · outbound

This paper cites Vertex priority based butterfly counting for large-scale bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Vertex priority based butterfly counting for large-scale bipartite networks

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.371122Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:68ab4b319ef44880e2a2d31554ebaa4c998479953448e4578d7b92bbeeb3a308

Observation a6a300c1-c750-4e65-8102-c59639faf8fe · outbound

This paper cites Parallel algorithms for butterfly computations.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Parallel algorithms for butterfly computations

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.123506Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:a8865ae0ee80c4b300b75f57eec772cdfcbfd36b2961c9db8a61f5c0623ca267

Observation 351de2d3-662c-4f31-875d-067bb85a100d · outbound

This paper cites Families of butterfly counting algorithms for bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Families of butterfly counting algorithms for bipartite graphs

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.347896Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:f2ce6fa869b737d900fde515d1255d8c62be4232cc80090a89395bb1f8ab1224

Observation 95869d63-8b8a-4df9-bea3-1a96ad714d16 · outbound

This paper cites Parallelization of butterfly counting on hierarchical memory.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Parallelization of butterfly counting on hierarchical memory

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.116828Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:135fecf7279256a340907715470840b7988faa53e27ec564ab379213ce59129b

Observation 172a26e5-722c-4170-bcf9-abac7f90c2e2 · outbound

This paper cites Gpu-based butterfly counting.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Gpu-based butterfly counting

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.333695Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:7c55f5c386c1746750fc62a67b60868873054b2918627542259a8d3ce43b2999

Observation a60c0695-09dc-409d-83bb-33a34b405db6 · outbound

This paper cites Toward accurate butterfly counting with edge privacy preserving in bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Toward accurate butterfly counting with edge privacy preserving in bipartite networks

Reference 26

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.071716Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:14089487bbc5187d4f41427afbb5dacc63c2b502d87009b7203f67dac5ddc8ad

Observation ff344891-d3f0-4415-8bc6-9baa801a712c · outbound

This paper cites Butterfly counting over bipartite graphs with local differential privacy.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Butterfly counting over bipartite graphs with local differential privacy

Reference 27

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.400054Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:440cf0a2dc4c4110efa7420fc331e73acbc01c610f7221a54dbd400afc8cccd0

Observation 1ad4bf14-7d26-46ed-abaa-af6d6168081a · outbound

This paper cites Fleet: Butterfly estimation from a bipartite graph stream.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Fleet: Butterfly estimation from a bipartite graph stream

Reference 28

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.097870Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:70ab94908103f74256182bd0102d0b80b9358da4e2d81eb6820743f2f6c2644a

Observation 7ef20040-b511-4ab2-95d6-7f586503bb75 · outbound

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

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Approximately counting butterflies in large bipartite graph streams

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.416418Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:e95daebdc384d65868a46ec5afc58e607b7de19fe055bce9ffb5e32f882ae33e

Observation 0872e713-ff1a-4436-ae35-a4a294927710 · outbound

This paper cites sgrapp: Butterfly approximation in streaming graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges sgrapp: Butterfly approximation in streaming graphs

Reference 30

Resolution
verified exact
doi, observed 2026-05-23T07:22:41.713777Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:a056f822324376f651620b836cafb9906aa6699c39ce5de842e97aa958961622

Observation 37b48cb3-4c8f-415e-b209-14d7413d4cfa · outbound

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

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Counting butterflies in fully dynamic bipartite graph streams

Reference 31

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.094748Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:e56362c6aea47e5fede0b156296735d674d6b8a11ef5e5ab06ded48ec09fa196

Observation 56ac64b3-8e02-4b3a-af56-ff12be2fc0fc · outbound

This paper cites Scalable approximate butterfly and bi-triangle counting for large bipartite networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Scalable approximate butterfly and bi-triangle counting for large bipartite networks

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.389511Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:45b2948aacef09e79f48e8d9d0bf3148960c33bad7f49d1b44723c5f62046adc

Observation 9001f1ee-07c2-46ed-873d-46c31e591cbc · outbound

This paper cites Available: https://doi.org/10.1145/3626753.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Available: https://doi.org/10.1145/3626753

Reference 33

Resolution
verified exact
doi, observed 2026-05-23T07:22:41.709170Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:43c8f5dad4d29021cb72c4db151ff306fd0b08805f82164ee3c6d474047f0691

Observation 7885628b-e185-4b91-bdaf-3fb6aed114b3 · outbound

This paper cites Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Sampling Algorithms for Butterfly Counting on Temporal Bipartite Graphs

Reference 34

Resolution
verified exact
arxiv_id, observed 2026-05-23T07:22:43.107455Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:0927e7a07c6311ea972c2f2aca0efb733cecf259626bcf852fb9259621a30567

Observation fbedb69c-5843-4cc5-8b93-ae77850afdfb · outbound

This paper cites Scalable distributed stream join processing.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Scalable distributed stream join processing

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.455328Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:083f4d539ac6ae4bef024e28a19d8ff35e227b009c0522c10e166e6095e4a252

Observation fff29b05-e5d8-473b-b7f1-229cd63cca1f · outbound

This paper cites Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage

Reference 36

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.404517Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:c3261e50ea7f8934dcfa522eba30a9d08a9fb463f4ff80490c5f7af61e6be69e

Observation 5f44a20e-91e7-41ce-a23d-de50c0acfcc5 · outbound

This paper cites Furl: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Furl: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams

Reference 37

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.130382Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:9685c0e5c0756b77e402507a56eaf022cd965c8d06561116aea5684b46202bac

Observation 51b33ca4-f222-4b29-b9b7-3e3e5e0772d5 · outbound

This paper cites An adaptive query execution system for data integration.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges An adaptive query execution system for data integration

Reference 38

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.078053Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:d0e319f14b724b3f3f5ff624cac259ca0919ae112250d3f911031564eeb0f3ae

Observation 01729126-1820-4e9e-90a1-884f28db3b7c · outbound

This paper cites Adaptive duplicate detection using learnable string similarity measures.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Adaptive duplicate detection using learnable string similarity measures

Reference 39

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.424394Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:da23a60479b06882d9cca7b8829cd022894fe3e295d99b8b173f63280288620f

Observation e0f68b10-2ea7-41ff-ad8c-c8da35afd86f · outbound

This paper cites What’s going on? learning communication rules in edge networks.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges What’s going on? learning communication rules in edge networks

Reference 40

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.101791Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:59e096c7e8de8748e86be3b52fb86ae5bda11507df56df48d09b8fbc04fef599

Observation 039f25b2-8f69-449f-9a16-00bc9dcdebf1 · outbound

This paper cites The impact of duplicate orders on demand estimation and capacity investment.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges The impact of duplicate orders on demand estimation and capacity investment

Reference 41

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.338120Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:6a40b0b55059d03dacea0d8eebba9a59ec76040308039ed073986a450a353895

Observation 31487855-8292-47a7-b47e-63010f62e2d9 · outbound

This paper cites Exploring duplicate orders in a single-manufacturer multi-distributor supply chain.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Exploring duplicate orders in a single-manufacturer multi-distributor supply chain

Reference 42

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.375100Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:ef91a21286f1defee2258fdf1ec0d5a8cbc180a25f42ab92aa599b37cfc0ee9d

Observation 9a0a2877-c9c5-4a87-90a0-35c81e6021cc · outbound

This paper cites Fable: Approximate butterfly counting in bipartite graph stream with duplicate edges.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Fable: Approximate butterfly counting in bipartite graph stream with duplicate edges

Reference 43

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.085136Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:b035a3d07cc70ffc03ddcc324f506329a43c0468b5b076dfe4897f1a16a4b4e5

Observation 04136002-83c8-42a6-9639-c3867f6a80be · outbound

This paper cites Counting distinct elements in a data stream.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Counting distinct elements in a data stream

Reference 44

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.412749Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:16942a495fc069c6476a3a4c99766f989e568bdbd0014d64e2c9dd026ea7f116

Observation 2bab1ea7-26b1-4f22-a990-719ef2a17aa6 · outbound

This paper cites On synopses for distinct-value estimation under multiset operations.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges On synopses for distinct-value estimation under multiset operations

Reference 45

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.081820Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:cef7f33d14a9bda5df3587b6bbac18096e0695c1be97813e702bdf183c3d8232

Observation abe8b8f4-b2f6-41a7-aa1f-410f226446e5 · outbound

This paper cites Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm

Reference 46

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.353286Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:b2c44cc24fe2d3d10d0de2090d455471e6f5400b3427116218494fca61f345c7

Observation 93f93262-b396-454f-95ac-ab8331f867b7 · outbound

This paper cites Probabilistic counting algorithms for data base applications.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Probabilistic counting algorithms for data base applications

Reference 47

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.361128Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:0cbad2e6dc7978f5132ce3248819d9d6fb7c96879213a67e394d171eb507a65e

Observation 4bcf1908-7b1c-4c5a-930a-387953487058 · outbound

This paper cites Streamed approximate counting of distinct elements: Beating optimal batch methods.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Streamed approximate counting of distinct elements: Beating optimal batch methods

Reference 48

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:27:45.420301Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:3e2aa4916ef7a66dd2e4741ceb687cd8d1ddfe1658c12bd5faa32256db45b27a

Observation 8786290d-d114-47b6-885f-c3281b6ede4a · outbound

This paper cites Efficient temporal butterfly counting and enumeration on temporal bipartite graphs.

Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges Efficient temporal butterfly counting and enumeration on temporal bipartite graphs

Reference 49

Resolution
verified fuzzy
raw_fallback, observed 2026-05-23T08:25:31.110888Z

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.

source=pdf_text observed=2026-05-23T07:21:24.896928Z digest=sha256:ef1029047840e33db71a59dc36c9e3e92d07cc8a0ebd3e09f805fc074b9de015

Pith citing papers

Observation 71163fef-608f-4054-ac4a-3ec380238970 · inbound

MAS-KCL: Knowledge component graph structure learning with large language model-based agentic workflow cites this paper.

MAS-KCL: Knowledge component graph structure learning with large language model-based agentic workflow Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-07T15:42:34.123815Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T15:42:34.123815Z digest=sha256:df9e8fba8198237c2d09717ff05e2eea5ad5ef5a0f264e494ad49726715321b4

Observation 389ca2d2-9b5c-45c9-8e67-8a6300a2a67c · inbound

Triangle Counting in Hypergraph Streams: A Complete and Practical Approach cites this paper.

Triangle Counting in Hypergraph Streams: A Complete and Practical Approach Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-05T13:30:41.641693Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-05T13:30:41.641693Z digest=sha256:40ee09fa2ecbb54e6c03217053dbc3162439eefef20dea697073b7c2c89f517d

Observation 02034a56-bde1-453a-9d35-3875645739df · inbound

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs cites this paper.

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs Counting Butterflies over Streaming Bipartite Graphs with Duplicate Edges

Reference 88

Resolution
verified exact
local_arxiv, observed 2026-05-12T00:46:12.651022Z

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.

source=arxiv_source observed=2026-05-07T14:24:11.621821Z digest=sha256:86aae128cee53f352406171c23b47f41d3f559ba33f6df7256da02b793f960fb

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

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

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.

source=pdf_text observed=2026-06-26T22:14:51.175953Z digest=sha256:34018aa5d6543b44de5f83e5e9031d2f4d0f3471e3ab4e215a9a1ab69f72d490