{"as_of":"2026-08-10T13:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a01f00f76ca47d5f7b772cf33efa924c3fa2368627b68607425bab6f26b7d275","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:26.328888Z","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-05T18:07:24.684660Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.00344","last_updated":"2025-01-13T15:50:17Z","snapshot_observed_at":"2026-07-06T18:23:44.289062Z","submitted_at":"2024-06-01T07:42:34Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00344","snapshot_observed_at":"2026-08-07T00:49:26.328888Z","title":null,"venue":null,"work_id":null,"year":2024},"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":39,"source":"arxiv_source","source_observed_at":"2026-08-07T00:49:26.328888Z"},"links":{"cited_paper":"/paper/2406.00344","citing_paper":"/paper/2506.13173"},"observation_digest":"sha256:393523b0415d84b7d653f8fb6eb827afe3c5c59270b0eceffca3d1d8be53b340","observation_id":"4ac5ead7-39bb-4628-a80e-14c495d1d382","resolution":{"observed_at":"2026-08-07T00:49:26.328888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00344","last_updated":"2025-01-13T15:50:17Z","snapshot_observed_at":"2026-07-06T18:23:44.289062Z","submitted_at":"2024-06-01T07:42:34Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index","version":2},"cited_work":{"arxiv_id":"2406.00344","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.00344","snapshot_observed_at":"2026-08-05T18:07:24.684660Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index","venue":"cs.SI","work_id":"48a657c0-093c-4e6f-adb8-248a10877c0c","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-07T11:47:10.357296Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.604757Z"},"links":{"cited_paper":"/paper/2406.00344","citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:26c77e7d256a4842536bc9d11beabdacd7da7495386ea8171119c0256a8d5d52","observation_id":"ff7d19f1-baa8-4cc4-9ae0-b1456cbef216","resolution":{"observed_at":"2026-08-05T18:07:24.689936Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2406.00344/citation-record","integrity":"/paper/2406.00344/integrity","json":"/paper/2406.00344/citation-record.json","paper":"/paper/2406.00344"},"outbound":[],"paper":{"arxiv_id":"2406.00344","last_updated":"2025-01-13T15:50:17Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-07-06T18:23:44.289062Z","submitted_at":"2024-06-01T07:42:34Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index"},"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:2406.00344."}