Pith. sign in

Paper Citation Record · LEDGER

Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2406.00344.

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

pith.paper-citation-record.v1
2406.00344 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T00:49:26.328888Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-05T18:07:24.684660Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 4ac5ead7-39bb-4628-a80e-14c495d1d382 · inbound

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions cites this paper.

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-07T00:49:26.328888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T00:49:26.328888Z digest=sha256:393523b0415d84b7d653f8fb6eb827afe3c5c59270b0eceffca3d1d8be53b340

Observation ff7d19f1-baa8-4cc4-9ae0-b1456cbef216 · inbound

Temporal $k$-Core Query, Revisited cites this paper.

Temporal $k$-Core Query, Revisited Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index

Reference 20

Resolution
verified exact
local_arxiv, observed 2026-08-05T18:07:24.689936Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=pdf_text observed=2026-08-05T18:07:24.604757Z digest=sha256:26c77e7d256a4842536bc9d11beabdacd7da7495386ea8171119c0256a8d5d52