{"as_of":"2026-08-12T21:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1a06cf0d9356b10f9587bb621a841193a888170486af4cdccbcd99f52a4b1aa","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T13:30:42.670623Z","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-05T13:30:45.532409Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.05394","last_updated":"2021-03-09T12:33:57Z","snapshot_observed_at":"2026-08-12T14:32:14.479095Z","submitted_at":"2021-03-09T12:33:57Z","title":"Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments","version":1},"cited_work":{"arxiv_id":"2103.05394","doi":null,"metadata_source":"pith","pith_arxiv_id":"2103.05394","snapshot_observed_at":"2026-08-05T13:30:45.532409Z","title":"Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments","venue":"cs.DS","work_id":"abd997b3-3dec-471d-81bb-ab61bfb87708","year":2021},"citing_paper":{"arxiv_id":"2509.00674","last_updated":"2025-08-31T03:02:34Z","snapshot_observed_at":"2026-08-11T18:43:07.167609Z","submitted_at":"2025-08-31T03:02:34Z","title":"Triangle Counting in Hypergraph Streams: A Complete and Practical Approach","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-05T13:30:42.670623Z"},"links":{"cited_paper":"/paper/2103.05394","citing_paper":"/paper/2509.00674"},"observation_digest":"sha256:75cb760efd07bc581e33a063e80bba6f47d8281bfca990b325dc2b4fbc8bdd88","observation_id":"06655aea-c9c9-476b-ab11-0e802c57bcda","resolution":{"observed_at":"2026-08-05T13:30:45.618935Z","resolver_source":"local_arxiv","status":"verified_exact"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2103.05394/citation-record","integrity":"/paper/2103.05394/integrity","json":"/paper/2103.05394/citation-record.json","paper":"/paper/2103.05394"},"outbound":[],"paper":{"arxiv_id":"2103.05394","last_updated":"2021-03-09T12:33:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T14:32:14.479095Z","submitted_at":"2021-03-09T12:33:57Z","title":"Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments"},"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 1 inbound Pith citation observation for arXiv:2103.05394."}