{"as_of":"2026-08-14T20:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b26957c08794905c0ac12663cc7516b82768e4a8b67097aaf1120c183203fa5b","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T05:11:03.451035Z","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-12T05:11:03.489991Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1404.5874","last_updated":"2014-04-23T16:09:37Z","snapshot_observed_at":"2026-07-06T03:41:52.476525Z","submitted_at":"2014-04-23T16:09:37Z","title":"Using Triangles to Improve Community Detection in Directed Networks","version":1},"cited_work":{"arxiv_id":"1404.5874","doi":null,"metadata_source":"pith","pith_arxiv_id":"1404.5874","snapshot_observed_at":"2026-08-12T05:11:03.489991Z","title":"Using Triangles to Improve Community Detection in Directed Networks","venue":"cs.SI","work_id":"d6e9cf7f-a2e1-45f4-94ba-5a5bb141a2de","year":2014},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.451035Z"},"links":{"cited_paper":"/paper/1404.5874","citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:a6212777cc09102c35580583e3b2625191df5b2da3429ff6335dbdda667bd1dc","observation_id":"fb841213-ef87-47d5-a5ba-892eae232963","resolution":{"observed_at":"2026-08-12T05:11:03.497086Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5874","last_updated":"2014-04-23T16:09:37Z","snapshot_observed_at":"2026-07-06T03:41:52.476525Z","submitted_at":"2014-04-23T16:09:37Z","title":"Using Triangles to Improve Community Detection in Directed Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.5874","snapshot_observed_at":"2026-08-03T20:26:41.095985Z","title":"Using triangles to im- prove community detection in directed networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.19973","last_updated":"2026-07-08T07:30:57Z","snapshot_observed_at":"2026-08-12T13:16:20.257212Z","submitted_at":"2025-11-25T06:36:32Z","title":"Pickle: Precise, Flexible Cross-Core Last-level Cache Data Prefetching for Irregular Memory Accesses","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T20:26:41.095985Z"},"links":{"cited_paper":"/paper/1404.5874","citing_paper":"/paper/2511.19973"},"observation_digest":"sha256:7de1a4e61200456202a8cd019f4b57426e4a001ad05accbb886a65d41147965c","observation_id":"e1e9ddfa-ce07-48a2-98c0-bbd534fc1602","resolution":{"observed_at":"2026-08-03T20:26:41.095985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1404.5874/citation-record","integrity":"/paper/1404.5874/integrity","json":"/paper/1404.5874/citation-record.json","paper":"/paper/1404.5874"},"outbound":[],"paper":{"arxiv_id":"1404.5874","last_updated":"2014-04-23T16:09:37Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-07-06T03:41:52.476525Z","submitted_at":"2014-04-23T16:09:37Z","title":"Using Triangles to Improve Community Detection in Directed Networks"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1404.5874."}