{"as_of":"2026-08-12T18:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dc0d14074470978377bac64e714f585740a937ffa6be951e3da7df549416f2e4","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:38:41.832321Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:38:41.832321Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-09T15:38:41.872708Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"cited_work":{"arxiv_id":"2502.01381","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.01381","snapshot_observed_at":"2026-08-09T15:38:41.872708Z","title":"Fair densest subgraph across multiple graphs","venue":"cs.DS","work_id":"50cbad8d-cc96-405e-a23c-8b4eb1c39d2d","year":2025},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.832321Z"},"links":{"cited_paper":"/paper/2502.01381","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:a03d33f49e09d72ac74b4d04f8ceef94134be48fa44025e76db5fa681a392549","observation_id":"31a89f0a-0b0e-4325-8f31-e21d9dc28e35","resolution":{"observed_at":"2026-08-09T15:38:41.878840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.01381/citation-record","integrity":"/paper/2502.01381/integrity","json":"/paper/2502.01381/citation-record.json","paper":"/paper/2502.01381"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T15:38:42.662379Z","title":null,"venue":null,"work_id":"a0d800e9-d5f1-460f-827e-ff9bb0aaa142","year":2019},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.718387Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:e9d0c1441e5a34a169017c19d46f4b1235e328c5c86aa66b40638c1e4c1d1bd0","observation_id":"b229625c-a1f6-41ca-8736-31884505e5cd","resolution":{"observed_at":"2026-08-09T15:38:42.665573Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.652836Z","title":"In: CIKM","venue":null,"work_id":"9fa98b60-05fa-4d9a-988a-8a1d3ac58e26","year":2020},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.754915Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:70049bdb8cdf74216082ac135cf377ac5e04d2b282823d4aed20e436926b6421","observation_id":"9a7aac47-749c-4dba-9a33-d7ee7400b7b1","resolution":{"observed_at":"2026-08-09T15:38:42.655952Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.15936","last_updated":"2023-08-30T10:33:02Z","snapshot_observed_at":"2026-08-10T07:46:12.952395Z","submitted_at":"2023-08-30T10:33:02Z","title":"Jaccard-constrained dense subgraph discovery","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.15936","snapshot_observed_at":"2026-08-09T15:38:41.758699Z","title":"arXiv preprint arXiv:2308.15936 (2023)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.758699Z"},"links":{"cited_paper":"/paper/2308.15936","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:1252ecf7e23306143e84f076adce5db58c835c6b478816e69e3375c6693e8869","observation_id":"8d2647f2-55aa-4ec7-88e0-08be934f9dda","resolution":{"observed_at":"2026-08-09T15:38:41.758699Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T15:38:42.643861Z","title":"In: APPROX","venue":null,"work_id":"c2a9b8dd-d3e9-411c-b19a-a9e45c4812cc","year":2000},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.762357Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:57fa8d618f01a86d26f141504fc501fb27d5e2222d19ed0d657f82b41eb8dc5d","observation_id":"ea0eb119-06d8-429d-8eb7-ab41a173e742","resolution":{"observed_at":"2026-08-09T15:38:42.647014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.06361","last_updated":"2018-02-18T10:52:52Z","snapshot_observed_at":"2026-07-06T06:24:02.844055Z","submitted_at":"2018-02-18T10:52:52Z","title":"On Finding Dense Common Subgraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1802.06361","snapshot_observed_at":"2026-08-09T15:38:41.766710Z","title":"https://doi.org/10.48550/ARXIV.1802.06361, https://arxiv.org/abs/1802.06361","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.766710Z"},"links":{"cited_paper":"/paper/1802.06361","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:a98b7111e59125d9d0ba17961d7e5f660a7694550f6eb4ac578fa9194c422c0b","observation_id":"ac6238b8-f0c6-4b2b-9fca-2c2d0eb660c5","resolution":{"observed_at":"2026-08-09T15:38:41.766710Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T15:38:42.632778Z","title":"M anagement science 13(7), 492–498 (1967) Fair densest subgraph across multiple graphs 17","venue":null,"work_id":"0974e975-8f6f-47f8-9af9-3904ed3de6b5","year":1967},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.770892Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:c483e4d5909d700bd2906074d527a8d111473067d60c3b4b1dfa86133aa0f079","observation_id":"b23fb850-2c78-4320-9be7-ae232d97ddf7","resolution":{"observed_at":"2026-08-09T15:38:42.636399Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.623289Z","title":null,"venue":null,"work_id":"f5112a86-d551-4378-b360-22cf6de78f05","year":2009},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.774138Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:38524a40fba8bde860f133515fe664bf0732d70a82d4524e2e089a063a76e5e7","observation_id":"c6d4e1a6-3f48-479b-9970-4c48026f9776","resolution":{"observed_at":"2026-08-09T15:38:42.626786Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.613029Z","title":"Bioi nformatics 22(14), e150–e157 (2006)","venue":null,"work_id":"deba856e-aeb7-42f1-ab0b-1e6db3b8b627","year":2006},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.777721Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:03a54a8c39ba9ce37d88df0de0149d3f9fdc52186855a74c73122c244685ec9e","observation_id":"d3d28d0c-5822-4d10-a90a-b515e78acd70","resolution":{"observed_at":"2026-08-09T15:38:42.616725Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.602438Z","title":"TKDD 14(1), 1–40 (2020)","venue":null,"work_id":"e80b6ce7-fa6e-43a5-8e36-b1d76212bc51","year":2020},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.781836Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:a920d40477335e79e6ad980738f521158f75ba3b57e0eb20ae202eaaa5a0fee3","observation_id":"68bb7ca9-ebe5-4fb4-a8d5-5ff658d918b3","resolution":{"observed_at":"2026-08-09T15:38:42.606117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.429105Z","title":null,"venue":null,"work_id":"24a9fcb7-36fe-4294-95ba-42864a56dde2","year":null},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.785546Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:7a0f4a6d21138c65c9485fe3d9760f6e8db83edc0aae34fb520c849629b2652c","observation_id":"7ed56989-b0af-4f84-b25f-5b5220e38a0b","resolution":{"observed_at":"2026-08-09T15:38:42.489688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.307967Z","title":"In: STOC","venue":null,"work_id":"bdd5db35-c800-4a8d-b6bf-0cef34d290aa","year":1996},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.789087Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:fd6fb6b3586bdb92b11c8139f03c50f53f043afec7322ffcba2e20bf32e6d0b8","observation_id":"7c18cbd3-53f5-4bf8-90b1-9d74d3a06123","resolution":{"observed_at":"2026-08-09T15:38:42.358173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.234485Z","title":"In: ECMLPKDD","venue":null,"work_id":"57c136db-4066-4bc6-b6d8-c566a89f2ef4","year":2015},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.792634Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:959effe532f8bb2d9d48bd246fab862f5b38680a28c7427bb7bc153ec800020a","observation_id":"2e3179ac-8e76-4377-a290-7ed539dac4f7","resolution":{"observed_at":"2026-08-09T15:38:42.270978Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.189394Z","title":null,"venue":null,"work_id":"4107712a-89a5-4d4d-aca8-24cb445f9073","year":2009},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.796127Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:af7ffd7c48ad038beaaa5650c6ed341e44e96a8ab6a38411b9e9da0114ff6e18","observation_id":"30e845df-f644-44ca-a9da-f2ded1977759","resolution":{"observed_at":"2026-08-09T15:38:42.192623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.179903Z","title":"In: ASO NAM","venue":null,"work_id":"a10ca8c3-b534-470a-a5e2-3d8fc336f925","year":2019},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.799371Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:cf211bae4429de884245e3b4f98139be80683dc217812da3a7ff9e860e38c917","observation_id":"b8f18325-bd07-4421-b4b1-9f288927bc08","resolution":{"observed_at":"2026-08-09T15:38:42.182932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.170375Z","title":"ACM computing surv eys (CSUR) 54(6), 1–35 (2021)","venue":null,"work_id":"029a9fb1-8325-4a78-93fa-dda889a0d2e1","year":2021},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.802462Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:09b686538a0e5e12f8141dfaa23fc3bdee6f98f3523d8e1249b64ec0295a566b","observation_id":"a827cd2d-6c6c-4ae3-98c9-c3a02fc72670","resolution":{"observed_at":"2026-08-09T15:38:42.173743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.159603Z","title":"In: KDD (2023)","venue":null,"work_id":"ba1c83a8-aeeb-4140-b2f1-5d97cdf966e6","year":2023},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.806099Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:0a2dba0eb20eea7b373daed0a7e9cfb82b22927e0802e5253efc006061b4858a","observation_id":"cc89bddb-e12c-4f8c-a80e-f278c14da326","resolution":{"observed_at":"2026-08-09T15:38:42.163321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09124","last_updated":"2024-02-14T12:22:50Z","snapshot_observed_at":"2026-08-12T11:15:20.596085Z","submitted_at":"2024-02-14T12:22:50Z","title":"Finding Densest Subgraphs with Edge-Color Constraints","version":1},"cited_work":{"arxiv_id":"2402.09124","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09124","snapshot_observed_at":"2026-08-09T15:38:41.906720Z","title":"Finding Densest Subgraphs with Edge-Color Constraints","venue":"cs.SI","work_id":"dbdc8c0b-1c1d-4161-a563-74717d52fa10","year":2024},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.809426Z"},"links":{"cited_paper":"/paper/2402.09124","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:338ebb075066dd165a05e05450bad52bd2caaa0dd7125d619873ca92c9062442","observation_id":"02be1a1d-533a-4e6d-9587-7b1199ada240","resolution":{"observed_at":"2026-08-09T15:38:41.982638Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.148801Z","title":"KAIS 62(4), 1611–1639 (2020)","venue":null,"work_id":"bf0ec4c3-9ba7-4fe2-b0ef-20767f8d7676","year":2020},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.813152Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:ea55eb38885e05585eef287d16c0861d7d384678ebc5c4de5b2e6cedd80302a1","observation_id":"ff82eb11-26af-43ff-8a18-79cffe5cd7be","resolution":{"observed_at":"2026-08-09T15:38:42.152595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.137327Z","title":"J ohn Wiley & Sons (Jun 1998)","venue":null,"work_id":"28ad43f4-4b38-47d3-995d-59779f09130c","year":1998},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.816110Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:3f4272f44a47d2d9825580f330508383ed1a18c7030eb84ebd21403e4538f654","observation_id":"c1cbea92-ec06-42e1-a587-c61dbd058369","resolution":{"observed_at":"2026-08-09T15:38:42.140890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.125886Z","title":"DMKD 33(5), 1417–1445 (2019)","venue":null,"work_id":"9f7ec649-025b-4a63-979b-89dd94d088ae","year":2019},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.818903Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:87909200ad5ad7b2a121505561d5d25c794c273aebdb99446e26f54b3c0e2890","observation_id":"9eb6c273-9b99-40ae-befd-81dd8f63bc0f","resolution":{"observed_at":"2026-08-09T15:38:42.129868Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.114980Z","title":"In: EDBT/ICDT Workshops","venue":null,"work_id":"9bf33d86-2c24-4898-b0a7-418892f44311","year":2015},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.822177Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:8b2348d226a5cd543a1d87230fcfd52bc21d931a5ca9975447ba62d4ba13349b","observation_id":"84276fe3-9048-49f7-8818-644363981264","resolution":{"observed_at":"2026-08-09T15:38:42.118492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.103031Z","title":null,"venue":null,"work_id":"18a11d19-c00c-4c65-b31c-e9a5ee257b37","year":2015},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.825506Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:c901d0cecbfa6cc65c56f045cae38606ecbed93e585d491436493412986440cb","observation_id":"c13b7cf4-5d76-4e3e-83ee-b94ed1cfef7f","resolution":{"observed_at":"2026-08-09T15:38:42.107250Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-08-09T15:38:42.065232Z","title":null,"venue":null,"work_id":"5bd4594c-1ad2-4945-91a0-d83c538b93e9","year":2013},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.829084Z"},"links":{"citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:d32c48a7cb689bd613922d2a68095921bae3ec43943b094f906d261f665c570c","observation_id":"13550fd5-c011-4ee5-9e9e-b6d588baa94f","resolution":{"observed_at":"2026-08-09T15:38:42.094203Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"cited_work":{"arxiv_id":"2502.01381","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.01381","snapshot_observed_at":"2026-08-09T15:38:41.872708Z","title":"Fair densest subgraph across multiple graphs","venue":"cs.DS","work_id":"50cbad8d-cc96-405e-a23c-8b4eb1c39d2d","year":2025},"citing_paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T15:38:41.832321Z"},"links":{"cited_paper":"/paper/2502.01381","citing_paper":"/paper/2502.01381"},"observation_digest":"sha256:a03d33f49e09d72ac74b4d04f8ceef94134be48fa44025e76db5fa681a392549","observation_id":"31a89f0a-0b0e-4325-8f31-e21d9dc28e35","resolution":{"observed_at":"2026-08-09T15:38:41.878840Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.01381","last_updated":"2025-02-03T14:17:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-09T15:27:30.559586Z","submitted_at":"2025-02-03T14:17:57Z","title":"Fair densest subgraph across multiple graphs"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":14},"total_outbound_references":24},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"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."}