{"as_of":"2026-08-12T16:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64cc1e2287f3aadf3665c5625eb385b053615bb593637e4f559d6064c98e255d","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:38:41.766710Z","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-07-02T05:56:40.079150Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":{"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":"1802.06361","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.06361","snapshot_observed_at":"2026-07-02T05:56:40.079150Z","title":"On Finding Dense Common Subgraphs","venue":"cs.DS","work_id":"67aa5c64-cb90-41a3-a8b8-5a6cfd64a2fc","year":2018},"citing_paper":{"arxiv_id":"2607.00897","last_updated":"2026-07-01T13:02:12Z","snapshot_observed_at":"2026-07-07T00:06:29.765578Z","submitted_at":"2026-07-01T13:02:12Z","title":"Recovery of Planted Subgraphs","version":1},"reference_index":225,"source":"arxiv_source","source_observed_at":"2026-07-02T05:49:41.894386Z"},"links":{"cited_paper":"/paper/1802.06361","citing_paper":"/paper/2607.00897"},"observation_digest":"sha256:627f7876d3372ffde3cacf28dfe399ab3d93a1a75ae5529a53267421f1be0398","observation_id":"1cb38924-f753-4b2d-92e3-9107522df2a5","resolution":{"observed_at":"2026-07-02T05:56:40.080304Z","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":{"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-01T19:10:36.900175Z","title":"arXiv preprint arXiv:1802.06361 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":227,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:36.900175Z"},"links":{"cited_paper":"/paper/1802.06361","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:8ed8d67db71050d3426ccab869bc8ccfb43b2c1572d7a2fc7242a5ea5f353c9e","observation_id":"7a0bed9f-5b91-4e0f-87e3-470e7d7f6fdc","resolution":{"observed_at":"2026-08-01T19:10:36.900175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1802.06361/citation-record","integrity":"/paper/1802.06361/integrity","json":"/paper/1802.06361/citation-record.json","paper":"/paper/1802.06361"},"outbound":[],"paper":{"arxiv_id":"1802.06361","last_updated":"2018-02-18T10:52:52Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T06:24:02.844055Z","submitted_at":"2018-02-18T10:52:52Z","title":"On Finding Dense Common Subgraphs"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1802.06361."}