{"as_of":"2026-08-18T05:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e9c422cd33fda23f1d1f2c26f05915a3e77be9763bf3c97b7e7764b21888914d","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-22T15:13:55.535934Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.12600/citation-record","integrity":"/paper/2505.12600/integrity","json":"/paper/2505.12600/citation-record.json","paper":"/paper/2505.12600"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"github.io/","venue":null,"work_id":"90fefdc0-1a79-4052-9d44-af7317a3d4f6","year":2025},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:f3abd643a9623dac2b1e5aff6827e2f692d18ef4ebc52c7b6a3d893a65e54b5e","observation_id":"e7471978-537d-41a6-821f-71ba74d010b0","resolution":{"observed_at":"2026-05-22T15:14:58.102292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chen, Siddharth Gollapudi, Sandeep Silwal, and Hao Wu","venue":null,"work_id":"26a0de8c-d4b2-4250-b41c-7348b439c454","year":2025},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:3dcea672fb3c953c2168a554a265c1b684d42e012e1189f9cced365163fd9a65","observation_id":"17c037bd-7397-4ee2-80d9-4ba32f47d757","resolution":{"observed_at":"2026-05-22T15:14:58.108998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0702032","last_updated":"2007-02-05T19:29:38Z","snapshot_observed_at":"2026-08-15T10:48:38.319904Z","submitted_at":"2007-02-05T19:29:38Z","title":"Finding large and small dense subgraphs","version":1},"cited_work":{"arxiv_id":"cs/0702032","doi":null,"metadata_source":"pith","pith_arxiv_id":"cs/0702032","snapshot_observed_at":"2026-07-01T16:55:50.849895Z","title":"Finding large and small dense subgraphs","venue":"cs.DS","work_id":"817e278b-1747-42b4-9048-ad6fad76d889","year":2007},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"cited_paper":"/paper/cs/0702032","citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:7f4efb253cd2e12bb2a1b7b77255fb9b09fba731811ee56b36f65a9d75ee68ff","observation_id":"14d40adc-9b9e-482d-93c5-b8ade264bc82","resolution":{"observed_at":"2026-05-22T15:14:57.345616Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Finding dense subgraphs with size bounds","venue":null,"work_id":"57b9f05f-06a8-49a8-84ec-543029f76875","year":2009},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:62208ab3f923c67b51eb3156737e4c63c328955ee13319be82d80d7e020d0e40","observation_id":"2b28ae74-03bc-4b94-a1e2-f182b8a63206","resolution":{"observed_at":"2026-05-22T15:14:58.105666Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bilu- linial stability, certified algorithms and the independent set problem","venue":null,"work_id":"04820866-93f9-4fef-9ada-d57a32a2e6fc","year":2019},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:5df824cbe8a92b694abfde8c198222654b19d81fa99cfd65e114265fbb18e752","observation_id":"01895676-1a7c-48d9-afa4-e59a888feb27","resolution":{"observed_at":"2026-05-22T15:14:58.204016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Center-based clustering under perturbation stability.Inf","venue":null,"work_id":"259b221b-2141-4fab-a023-5554d1dc7b72","year":2012},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:cac4d95c44666551384eec094f09fcf734ed24ad540592f2de651abcc6f057db","observation_id":"4246f859-4f6f-498e-a7ca-ab405356d401","resolution":{"observed_at":"2026-05-22T15:14:58.196106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient primal-dual graph algo- rithms for mapreduce","venue":null,"work_id":"50760250-0f93-4410-bbc4-5e2510e439de","year":2014},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:327dc41fe5fa594dde1693899d3b953f24574d52864289fcb9b39268376231f3","observation_id":"02ba1c06-6656-4540-b52a-1944d89e1f36","resolution":{"observed_at":"2026-05-22T15:14:58.200471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Densest subgraph in streaming and mapreduce.PVLDB, 5(5):454–465","venue":null,"work_id":"3bd5b4de-af52-4220-8932-2e66b514773d","year":2012},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:3721c9eae9e34ef7fd001acecb670a4639c6ed121dfc2a8c2932fc1480b9533d","observation_id":"90128fdf-a47c-4768-9080-5a9fc2e049ca","resolution":{"observed_at":"2026-05-22T15:14:58.174386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithms, 16(2):22:1–22:39","venue":null,"work_id":"53c0a3b3-17fc-4e85-833d-176fd50ec368","year":2020},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:a55f90a990322ff515e24a203827ac30b29939dac1f6664b3e787034185a3641","observation_id":"6a91b26e-4499-4953-9d03-e10df51cb1bf","resolution":{"observed_at":"2026-05-22T15:14:58.221202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Copycatch: Stopping group attacks by spotting lockstep behavior in social networks","venue":null,"work_id":"02771f12-972a-4b2f-a8f1-85fa570868e7","year":2013},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:ce025cc2f7e83069d16b30661b0c0ba28c45aa8991eb42158136f57ed1c63792","observation_id":"e6a61ccb-2a18-45ca-99b9-a1a6f68c5a90","resolution":{"observed_at":"2026-05-22T15:14:58.231604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Detecting high log-densities: anO(n 1/4) approximation for densestk-subgraph","venue":null,"work_id":"e7a9e447-968b-48dd-be8d-d471b01d7707","year":2010},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:38195061e2111fed9541699ec864604fbd6a43574d99aa7b335d9a3cba1cc099","observation_id":"29bbd42a-f6a0-4a7a-954c-7640b1240e94","resolution":{"observed_at":"2026-05-22T15:14:58.179374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tsourakakis","venue":null,"work_id":"49a3bdc8-9d64-427c-b869-b1b18a58d0d4","year":2015},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:7553c9d60d6aa49e849caa045d229174e26762f40da2df57505f7d212c960cea","observation_id":"97df3585-1397-4199-bfb8-7d8ca44aa84b","resolution":{"observed_at":"2026-05-22T15:14:58.192608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Are stable instances easy?Combinatorics, Probability and Computing, 21(5):643–660","venue":null,"work_id":"b6b5197e-d3f2-4085-9669-5ae0508d1925","year":2012},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:a322452e2c90a3c6d5cf6626cfc6a075169a6048726ad15a1a35eda3064d059f","observation_id":"6ebdfd1c-3a64-45f6-8a11-18ccc65ec6fe","resolution":{"observed_at":"2026-05-22T15:14:58.166379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Fast and accurate triangle counting in graph streams using predictions","venue":null,"work_id":"eaebd6a7-c8ea-4626-be4c-fd264b6e00cb","year":2024},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:6586c1e621e045c6f95720502bc8b438e2b59a6cd88339a4ec95aca177356aa8","observation_id":"41277fe3-ed8a-4d66-b6a4-e1561d89a843","resolution":{"observed_at":"2026-05-22T15:14:58.182356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tsourakakis, Di Wang, and Junxing Wang","venue":null,"work_id":"e040c4a1-d51f-48b5-98b5-3503614f4cc5","year":2020},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:e15eee3adfd415e5f683839d0b0f8f5a614b26c3cae1c22f7c1e044f6cd186a3","observation_id":"cc9c9411-1a69-421d-b78a-4ff35a743b5b","resolution":{"observed_at":"2026-05-22T15:14:58.169877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning- augmented maximum independent set","venue":null,"work_id":"11d6daee-12b7-4a7c-a5b9-3297f0f4336c","year":2024},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:5e9040e6d2363eb90b72e467f3cdda141aa31462f5877e4e5fe27f6c6734d42e","observation_id":"58719ef3-a35f-431f-99b2-02c0ca84c533","resolution":{"observed_at":"2026-05-22T15:14:58.173149Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Greedy approximation algorithms for finding dense components in a graph","venue":null,"work_id":"b76ba4b9-1002-4c2c-a0ac-65219aa8b616","year":1913},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:efe0ff97d1099d9bc32ece1a592d892abd57f0644a0437c4daacd0b3cc50195c","observation_id":"7ef5c245-cdb8-4221-b131-17f0d734352d","resolution":{"observed_at":"2026-05-22T15:14:58.189276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3bf6b396-d7d3-4152-863c-d48082481a72","year":2022},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:e929d8c26d4d37c6ff16c973f5e47ff992465fe887bbb1e33e0a15c0281f1e82","observation_id":"5983913c-7b47-4469-b7bc-91a0f3477fe6","resolution":{"observed_at":"2026-05-22T15:14:58.162748Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense subgraph extraction with application to community detec- tion.IEEE Trans","venue":null,"work_id":"89e463fa-1596-4756-acb3-aa7b23f55576","year":2012},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:b8aab2274a06c79001624d803b81b07c046e20fd71c3d6ee459ac18c71586f8f","observation_id":"ddb78b8e-89a3-4137-853b-16597b465c1c","resolution":{"observed_at":"2026-05-22T15:14:58.185711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chen, Sandeep Silwal, Ali Vakilian, and Fred Zhang","venue":null,"work_id":"cdeaf4c4-6958-4f91-9920-941604c3a5ac","year":2022},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:58fa9ae0204bec7e5c3d0258ffdb4e3a35c7ac86af09849e8fa6d1c0fdafb9d9","observation_id":"f9e858c4-1118-457d-b09d-2e94730d3fc4","resolution":{"observed_at":"2026-05-22T15:14:58.224531Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Learning-augmented streaming algorithms for approximating MAX-CUT","venue":null,"work_id":"55581523-9d4c-4cd3-bd5a-061afcb0b9e9","year":2025},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:00b9d832e509c587ba5327aa8dcfca2497211bca08ad5cffe50c173f2199a6a0","observation_id":"495f66b3-da7c-41b6-8275-542a672f22d6","resolution":{"observed_at":"2026-05-22T15:14:58.234839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Extraction and classification of dense communities in the web","venue":null,"work_id":"a265a380-c128-4676-820b-22f7eec1d68d","year":2007},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:a84189b1e5dd77c0605a30a53e46a9a130e14693aa40ea687b00bc79963a237d","observation_id":"276783ed-8071-473b-8a94-18bd3a2b48c7","resolution":{"observed_at":"2026-05-22T15:14:58.164040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.04505","last_updated":"2015-07-29T05:43:49Z","snapshot_observed_at":"2026-08-15T13:00:33.631004Z","submitted_at":"2015-06-15T08:08:55Z","title":"Applications of Uniform Sampling: Densest Subgraph and Beyond","version":3},"cited_work":{"arxiv_id":"1506.04505","doi":null,"metadata_source":"pith","pith_arxiv_id":"1506.04505","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Applications of Uniform Sampling: Densest Subgraph and Beyond","venue":"cs.DS","work_id":"452936a5-24db-4392-ac4e-3c26cbcfa16c","year":2015},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"cited_paper":"/paper/1506.04505","citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:17bd4488caed37e10e7fccce34edafcaa497e23c66f63c062bee3c69686de1f1","observation_id":"2aeb074f-4142-4d85-a81d-6d6d9cd09bc4","resolution":{"observed_at":"2026-05-22T15:14:57.351161Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2112.11927","last_updated":"2023-03-04T16:30:23Z","snapshot_observed_at":"2026-08-16T17:32:39.468573Z","submitted_at":"2021-12-22T14:47:32Z","title":"Dijkstras algorithm with predictions to solve the single-source many-targets shortest-path problem","version":2},"cited_work":{"arxiv_id":"2112.11927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2112.11927","snapshot_observed_at":"2026-07-03T13:38:19.452377Z","title":"Using machine learning predictions to speed-up dijkstra’s shortest path algorithm.CoRR, abs/2112.11927","venue":null,"work_id":"6b87dd23-3f79-486d-a464-b5efdb5cd333","year":2021},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"cited_paper":"/paper/2112.11927","citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:3d77522012615b0a01ee75a4b3c054e49db3c424641c8db265d0ce34d1426891","observation_id":"6b27d959-0d2c-4332-9092-8e361a0cba1b","resolution":{"observed_at":"2026-05-22T15:14:57.335838Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Naughton, Douglas Brutlag, and Serafim Batzoglou","venue":null,"work_id":"d1e13f85-b3e1-4aed-8c26-a645f89ec374","year":2006},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:6d97e0a672711a425e614fdaf8f11c7b1f336bef48092c8531f20635b44f9b8e","observation_id":"a1969d44-fc02-4ef9-b0f0-0cd663eabd68","resolution":{"observed_at":"2026-05-22T15:14:58.121856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Gallo, M","venue":null,"work_id":"e143bc83-ae5a-4b3b-85df-17e4234f4522","year":1989},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:aff0440d8c6d970c05632d06ac3da1e1e86155c5792756a7355f4cbb68fe6d71","observation_id":"1f21c0ec-f97f-475a-8b16-0b0ce88bacfb","resolution":{"observed_at":"2026-05-22T15:14:58.167275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved parallel algorithms for density-based network clustering","venue":null,"work_id":"2036ec5e-62df-4d2f-a0a8-c0e0ea6fadd1","year":2019},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:893989d27cb018a187219fae98f6a575b3af1260603ddd9accfb1917b8eb01bd","observation_id":"370558ab-9a7e-44a2-a77c-64fb38e26113","resolution":{"observed_at":"2026-05-22T15:14:58.210948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Improved parallel algorithms for density-based network clustering","venue":null,"work_id":"d5c4ef5c-a178-4e15-9144-e72a0cbf8134","year":2019},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:729fbec66e3daaa6708ac52da09fcba14bbf3050d651f0587a364a11cdbe927c","observation_id":"b4c19630-aed7-4356-aa75-6372fbe99545","resolution":{"observed_at":"2026-05-22T15:14:58.153000Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Discovering large dense subgraphs in massive graphs","venue":null,"work_id":"3758a018-fa52-4916-a102-c5b1357b10a3","year":2005},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:2b6684b0e6b0b79133a8d4eeb82e73b303685c110ca228718425a388e7ab5f23","observation_id":"fe8ee56a-49f2-49b2-994f-fad1bf4f97fd","resolution":{"observed_at":"2026-05-22T15:14:58.156337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"0acff433-04a3-4000-9293-c380d8f9aaa4","year":1984},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:1e15b539afeeff8b8c2fd734d1a3186a759a39e46022e9b7ed9fae89e9cba5c6","observation_id":"946d9602-40c2-40d7-a313-5c78429c9ca0","resolution":{"observed_at":"2026-05-22T15:14:58.159585Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On finding dense subgraphs","venue":null,"work_id":"042b490c-abe7-46aa-b6fc-dc1fa8df1ad3","year":2009},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:c10cbee8507e671fd8329ec311073a1984ea50606cb800ff3ece4884d8fc2b75","observation_id":"ffa2b84c-cbea-4dd3-a20b-2fa1a9e4b3f5","resolution":{"observed_at":"2026-05-22T15:14:58.175994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"On finding dense subgraphs","venue":null,"work_id":"dbb897c4-c9ae-46a7-9b16-e123c3ebcb5c","year":2009},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:b52c70e8eee9a409bbaa93b5b1c0a0e096a50b0607e5d346a6a216a90055e7f7","observation_id":"b6f05c9b-cc0b-48f0-bc09-71f744effacf","resolution":{"observed_at":"2026-05-22T15:14:58.207617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A survey on the densest subgraph problem and its variants.ACM Comput","venue":null,"work_id":"fa70be15-041c-491b-a23b-d67df337d3ec","year":2024},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:d09810081cada78d3598a6a186e22f75fe1aaff994a9a7caae500cb42aff6944","observation_id":"871ebe52-9a8d-4b46-8baf-8db42be31687","resolution":{"observed_at":"2026-05-22T15:14:58.125086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T20:05:34.544374Z","title":"SNAP Datasets: Stanford large network dataset collection","venue":null,"work_id":"1ca5edd6-5128-4184-a3b9-a23e7926f729","year":2014},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:0974eb3000f63e39e7fbe1b67b3f21061deac66843ea1095f05571150ef9991d","observation_id":"45c7116d-2783-4fa7-a112-1eb8878ce871","resolution":{"observed_at":"2026-05-22T15:14:58.128497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Almost-polynomial ratio eth-hardness of approximating densest k- subgraph","venue":null,"work_id":"09035b42-dd3e-43e0-b847-b0553fcdd9e4","year":2017},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:a80aa8281f164b4024a277f4c4007b20e790debcb1b24bd29696c45524499a3b","observation_id":"a1f2a7dc-5fb6-4554-89cf-87b71f952614","resolution":{"observed_at":"2026-05-22T15:14:58.160887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8946a356-ea19-4678-aea1-add0826e75e9","year":2015},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:0b49062086cb4edbb2946079f8ee7060f7e24c92af1d1183d16e146cd9be3061","observation_id":"6d99eebd-b316-4d51-84a8-65c350a1452d","resolution":{"observed_at":"2026-05-22T15:14:58.217757Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algorithms with predictions.Commun","venue":null,"work_id":"08d69615-7fb1-470e-b4c4-1877783d7281","year":2022},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:0cd00d7fde027148434c82a0d43b4e5fae188e5c4c740ca75b704e5bc4787709","observation_id":"8209c2fa-2457-4d20-9388-f3d8550e7d38","resolution":{"observed_at":"2026-05-22T15:14:58.146880Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05004","last_updated":"2025-03-06T22:09:21Z","snapshot_observed_at":"2026-08-16T12:52:20.652752Z","submitted_at":"2025-03-06T22:09:21Z","title":"Faster Global Minimum Cut with Predictions","version":1},"cited_work":{"arxiv_id":"2503.05004","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.05004","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Faster global minimum cut with pre- dictions.CoRR, abs/2503.05004","venue":null,"work_id":"656f496e-131f-411a-a373-dde5c0b2fe94","year":2025},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"cited_paper":"/paper/2503.05004","citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:70e4e0bc979dba67749182aa7b61d275f9f692c594b8d23df6c75fb12cad9637","observation_id":"9eb62beb-56d4-4f18-967e-92ed44bce259","resolution":{"observed_at":"2026-05-22T15:14:57.340651Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory.Networks, 12(2):141–159","venue":null,"work_id":"40d70f6c-72ec-4ee4-9ffd-5b37a6a721bc","year":1982},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:919509867450aab7f38924179913d2e52a7417efb748c0e5ab4e588c1a9efb1b","observation_id":"a67c8af9-4285-4597-a6b7-c638bbda3da4","resolution":{"observed_at":"2026-05-22T15:14:58.214448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Karate Club: An API Oriented Open- source Python Framework for Unsupervised Learning on Graphs","venue":null,"work_id":"c1559526-2c3f-47ce-a755-4c93a1940c94","year":2020},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:040875b3ffd63305546b901cbde2b5af3714c407f7c196fd55720db420e01446","observation_id":"4f9da7ee-94dc-419c-bc57-4739c6e82308","resolution":{"observed_at":"2026-05-22T15:14:58.227941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense sub- graphs with restrictions and applications to gene annotation graphs","venue":null,"work_id":"6b6a02cb-cde5-43b3-a8e5-c9f6e8ee1f41","year":2010},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:58e8901377ada4f2dd6585accc9c14136cae93e5643c012b00183c38193152bf","observation_id":"f4c3af32-6409-4175-80b0-5c1726b6a013","resolution":{"observed_at":"2026-05-22T15:14:58.146354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Dense subgraphs on dynamic networks","venue":null,"work_id":"69f817b6-3897-489e-82b3-f2c55cb23fc7","year":2012},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:4b4cef89a73ac9ac728965f505445745ee894dde44d978ecc24e78a02aad07bc","observation_id":"bc580276-1b40-4f30-8a95-f0a494262ea1","resolution":{"observed_at":"2026-05-22T15:14:58.143644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal fully dynamic densest subgraph","venue":null,"work_id":"bb47d4db-52d9-4d07-bc65-baad52d1d080","year":2020},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:cd41c42ea99842749c2441702f284e4e380f0c8f55e07a306af5abd0f74fa5f1","observation_id":"4edb2ef9-5dbd-4773-8517-d360da942445","resolution":{"observed_at":"2026-05-22T15:14:58.154440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7efdf5e4-c636-424a-b474-cfa26634371f","year":2020},"citing_paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:55.535934Z"},"links":{"citing_paper":"/paper/2505.12600"},"observation_digest":"sha256:f573a5aa515f1fbf83bac97a5ac73550d08f545328410a258f418f41f52d537a","observation_id":"4e598f2f-c3be-422b-aaa9-d29be7ac1b02","resolution":{"observed_at":"2026-05-22T15:14:58.139043Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.12600","last_updated":"2026-04-14T23:37:08Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-17T08:10:34.125390Z","submitted_at":"2025-05-19T01:32:03Z","title":"Fast and Simple Densest Subgraph with Predictions"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":4,"verified_fuzzy":36},"total_outbound_references":44},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2505.12600."}