Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T15:38:41.832321Z
Paper Citation Record · LEDGER
As of 12 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 1 inbound Pith citation observation for arXiv:2502.01381.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T15:38:41.832321Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-09T15:38:41.832321Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-09T15:38:41.872708Z
24 of 24 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation b229625c-a1f6-41ca-8736-31884505e5cd · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 9a7aac47-749c-4dba-9a33-d7ee7400b7b1 · outbound
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 8d2647f2-55aa-4ec7-88e0-08be934f9dda · outbound
Fair densest subgraph across multiple graphs Jaccard-constrained dense subgraph discovery
Reference 3
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ea0eb119-06d8-429d-8eb7-ab41a173e742 · outbound
Fair densest subgraph across multiple graphs In: APPROX
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation ac6238b8-f0c6-4b2b-9fca-2c2d0eb660c5 · outbound
Fair densest subgraph across multiple graphs On Finding Dense Common Subgraphs
Reference 5
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b23fb850-2c78-4320-9be7-ae232d97ddf7 · outbound
Fair densest subgraph across multiple graphs M anagement science 13(7), 492–498 (1967) Fair densest subgraph across multiple graphs 17
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation c6d4e1a6-3f48-479b-9970-4c48026f9776 · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation d3d28d0c-5822-4d10-a90a-b515e78acd70 · outbound
Fair densest subgraph across multiple graphs Bioi nformatics 22(14), e150–e157 (2006)
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 68bb7ca9-ebe5-4fb4-a8d5-5ff658d918b3 · outbound
Fair densest subgraph across multiple graphs TKDD 14(1), 1–40 (2020)
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7ed56989-b0af-4f84-b25f-5b5220e38a0b · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 7c18cbd3-53f5-4bf8-90b1-9d74d3a06123 · outbound
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 2e3179ac-8e76-4377-a290-7ed539dac4f7 · outbound
Fair densest subgraph across multiple graphs In: ECMLPKDD
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 30e845df-f644-44ca-a9da-f2ded1977759 · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation b8f18325-bd07-4421-b4b1-9f288927bc08 · outbound
Fair densest subgraph across multiple graphs In: ASO NAM
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation a827cd2d-6c6c-4ae3-98c9-c3a02fc72670 · outbound
Fair densest subgraph across multiple graphs ACM computing surv eys (CSUR) 54(6), 1–35 (2021)
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation cc89bddb-e12c-4f8c-a80e-f278c14da326 · outbound
Fair densest subgraph across multiple graphs In: KDD (2023)
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 02be1a1d-533a-4e6d-9587-7b1199ada240 · outbound
Fair densest subgraph across multiple graphs Finding Densest Subgraphs with Edge-Color Constraints
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation ff82eb11-26af-43ff-8a18-79cffe5cd7be · outbound
Fair densest subgraph across multiple graphs KAIS 62(4), 1611–1639 (2020)
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation c1cbea92-ec06-42e1-a587-c61dbd058369 · outbound
Fair densest subgraph across multiple graphs J ohn Wiley & Sons (Jun 1998)
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 9eb6c273-9b99-40ae-befd-81dd8f63bc0f · outbound
Fair densest subgraph across multiple graphs DMKD 33(5), 1417–1445 (2019)
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 84276fe3-9048-49f7-8818-644363981264 · outbound
Fair densest subgraph across multiple graphs In: EDBT/ICDT Workshops
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation c13b7cf4-5d76-4e3e-83ee-b94ed1cfef7f · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 13550fd5-c011-4ee5-9e9e-b6d588baa94f · outbound
Fair densest subgraph across multiple graphs Unresolved cited work
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 31a89f0a-0b0e-4325-8f31-e21d9dc28e35 · outbound
Fair densest subgraph across multiple graphs Fair densest subgraph across multiple graphs
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.
Observation 31a89f0a-0b0e-4325-8f31-e21d9dc28e35 · inbound
Fair densest subgraph across multiple graphs Fair densest subgraph across multiple graphs
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.