{"as_of":"2026-08-10T18:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc8a3bd2950a0d5fe3c82da008cddc6fcc0e244f22987a58da6e0cc0913d7658","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-10T06:31:04.303077+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-07T00:49:28.566491Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-24T08:34:11.942883Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.12101","last_updated":"2022-11-22T09:07:10Z","snapshot_observed_at":"2026-07-06T14:21:38.060588Z","submitted_at":"2022-11-22T09:07:10Z","title":"Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams","version":1},"cited_work":{"arxiv_id":"2211.12101","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.12101","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9866c8db-d029-4387-bed4-5a5573b77019","year":2022},"citing_paper":{"arxiv_id":"2306.00893","last_updated":"2024-01-08T13:22:57Z","snapshot_observed_at":"2026-08-04T06:07:16.438397Z","submitted_at":"2023-06-01T16:50:48Z","title":"Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-05-24T08:30:26.911283Z"},"links":{"cited_paper":"/paper/2211.12101","citing_paper":"/paper/2306.00893"},"observation_digest":"sha256:633b2f8fccba092b7f4a71e2a6b7533ed4cd53230c885049d8d6f7ee287714d5","observation_id":"bde5209a-5bd7-4cd5-af36-efa8918dd67a","resolution":{"observed_at":"2026-05-24T08:34:11.945006Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.12101","last_updated":"2022-11-22T09:07:10Z","snapshot_observed_at":"2026-07-06T14:21:38.060588Z","submitted_at":"2022-11-22T09:07:10Z","title":"Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.12101","snapshot_observed_at":"2026-08-07T00:49:28.566491Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.13173","last_updated":"2025-06-16T07:34:54Z","snapshot_observed_at":"2026-08-09T11:41:21.821744Z","submitted_at":"2025-06-16T07:34:54Z","title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T00:49:28.566491Z"},"links":{"cited_paper":"/paper/2211.12101","citing_paper":"/paper/2506.13173"},"observation_digest":"sha256:5791714f28636aef00b506ec242eb3b574ce2c565fe71438a9e8f67a2e4ffdad","observation_id":"6d12c744-6709-4050-a2c9-2ab1d0fec784","resolution":{"observed_at":"2026-08-07T00:49:28.566491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.12101/citation-record","integrity":"/paper/2211.12101/integrity","json":"/paper/2211.12101/citation-record.json","paper":"/paper/2211.12101"},"outbound":[],"paper":{"arxiv_id":"2211.12101","last_updated":"2022-11-22T09:07:10Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-07-06T14:21:38.060588Z","submitted_at":"2022-11-22T09:07:10Z","title":"Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.12101."}