{"as_of":"2026-08-18T22:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9fa79703de7ac8658b43de73577f9cd40bdcf360c8bdfc572ff2788b83bf8a57","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-18T06:34:40.430872+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-10T18:09:16.234813Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":16,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1012.0009","last_updated":"2012-02-17T20:51:42Z","snapshot_observed_at":"2026-08-15T05:01:31.972992Z","submitted_at":"2010-11-30T21:03:42Z","title":"Time-Varying Graphs and Dynamic Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1012.0009","snapshot_observed_at":"2026-08-10T18:09:16.234813Z","title":"Time- Varying Graphs and Dynamic Networks , February 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2501.11697","last_updated":"2025-01-20T19:22:08Z","snapshot_observed_at":"2026-08-15T05:07:00.211145Z","submitted_at":"2025-01-20T19:22:08Z","title":"Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-10T18:09:16.234813Z"},"links":{"cited_paper":"/paper/1012.0009","citing_paper":"/paper/2501.11697"},"observation_digest":"sha256:76962d47aee846e2f7aeb2e9de49ed20c31728311abf6f0175b136762e07d4e3","observation_id":"5ddfae1d-54b1-4bd1-a423-d6f1a47c9221","resolution":{"observed_at":"2026-08-10T18:09:16.234813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1012.0009","last_updated":"2012-02-17T20:51:42Z","snapshot_observed_at":"2026-08-15T05:01:31.972992Z","submitted_at":"2010-11-30T21:03:42Z","title":"Time-Varying Graphs and Dynamic Networks","version":3},"cited_work":{"arxiv_id":"1012.0009","doi":"10.48550/arxiv.1012.0009","metadata_source":"arxiv_reference","pith_arxiv_id":"1012.0009","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Time- varying graphs and dynamic networks","venue":"arXiv (Cornell University)","work_id":"787294d9-61a2-4770-8bb0-f1f14f02e007","year":2012},"citing_paper":{"arxiv_id":"2604.19399","last_updated":"2026-04-21T12:26:42Z","snapshot_observed_at":"2026-08-14T09:33:31.152137Z","submitted_at":"2026-04-21T12:26:42Z","title":"Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not?","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T03:21:30.310819Z"},"links":{"cited_paper":"/paper/1012.0009","citing_paper":"/paper/2604.19399"},"observation_digest":"sha256:5bf1dce3d7ff9fb006831d19fb24355349f49a1533b52201dad3c9dd0794751d","observation_id":"ae41e669-8a3f-49c2-aa54-d891ddc55e8d","resolution":{"observed_at":"2026-07-04T18:01:47.900848Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1012.0009","last_updated":"2012-02-17T20:51:42Z","snapshot_observed_at":"2026-08-15T05:01:31.972992Z","submitted_at":"2010-11-30T21:03:42Z","title":"Time-Varying Graphs and Dynamic Networks","version":3},"cited_work":{"arxiv_id":"1012.0009","doi":"10.48550/arxiv.1012.0009","metadata_source":"arxiv_reference","pith_arxiv_id":"1012.0009","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Time- varying graphs and dynamic networks","venue":"arXiv (Cornell University)","work_id":"787294d9-61a2-4770-8bb0-f1f14f02e007","year":2012},"citing_paper":{"arxiv_id":"2605.11873","last_updated":"2026-05-12T09:51:59Z","snapshot_observed_at":"2026-08-17T11:11:48.016918Z","submitted_at":"2026-05-12T09:51:59Z","title":"Maximizing Reachability via Shifting of Temporal Paths","version":1},"reference_index":200,"source":"arxiv_source","source_observed_at":"2026-05-13T05:00:02.957536Z"},"links":{"cited_paper":"/paper/1012.0009","citing_paper":"/paper/2605.11873"},"observation_digest":"sha256:af1ac16e02bb3e8781f232ffdfbcd015b99f54109bd66328674c51e9a045d601","observation_id":"c5ed7b9e-b9e0-406d-89c9-0e3f844527ca","resolution":{"observed_at":"2026-07-04T18:01:47.900848Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1012.0009/citation-record","integrity":"/paper/1012.0009/integrity","json":"/paper/1012.0009/citation-record.json","paper":"/paper/1012.0009"},"outbound":[],"paper":{"arxiv_id":"1012.0009","last_updated":"2012-02-17T20:51:42Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-15T05:01:31.972992Z","submitted_at":"2010-11-30T21:03:42Z","title":"Time-Varying Graphs and Dynamic 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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1012.0009."}