{"as_of":"2026-08-08T20:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:933c1b77f8f1948fdb416d5490680c8506fa09927dae4a858efc025d73c3f57d","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-08T06:32:00.761636+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-07T05:29:34.822187Z","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-07T05:29:34.882872Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1609.00750","last_updated":"2016-10-04T17:23:11Z","snapshot_observed_at":"2026-07-06T05:09:08.360468Z","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","version":2},"cited_work":{"arxiv_id":"1609.00750","doi":null,"metadata_source":"pith","pith_arxiv_id":"1609.00750","snapshot_observed_at":"2026-08-07T05:29:34.882872Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","venue":"cs.DS","work_id":"3c5a9205-4648-4f83-a3ad-7cb93e6718f9","year":2016},"citing_paper":{"arxiv_id":"2506.08405","last_updated":"2025-06-10T03:22:49Z","snapshot_observed_at":"2026-08-08T16:55:14.005789Z","submitted_at":"2025-06-10T03:22:49Z","title":"Optimal Graph Reconstruction by Counting Connected Components in Induced Subgraphs","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T05:29:34.822187Z"},"links":{"cited_paper":"/paper/1609.00750","citing_paper":"/paper/2506.08405"},"observation_digest":"sha256:51a2406c58b3683218dc609548f31fff2d3a3f8a628cbce5baea804159b314c0","observation_id":"2bab7895-e125-4991-8f8e-94c19857a465","resolution":{"observed_at":"2026-08-07T05:29:34.890293Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.00750","last_updated":"2016-10-04T17:23:11Z","snapshot_observed_at":"2026-07-06T05:09:08.360468Z","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.00750","snapshot_observed_at":"2026-08-04T13:24:27.562527Z","title":"Tsourakakis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02176","last_updated":"2026-08-03T12:56:19Z","snapshot_observed_at":"2026-08-06T23:37:00.548015Z","submitted_at":"2026-08-03T12:56:19Z","title":"Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T13:24:27.562527Z"},"links":{"cited_paper":"/paper/1609.00750","citing_paper":"/paper/2608.02176"},"observation_digest":"sha256:834700a12ccf207ff76392126dbecb4e16f93805640a7043ca0665c13a000546","observation_id":"ee6505ab-7fcf-4cd4-b6ad-a12430861a7d","resolution":{"observed_at":"2026-08-04T13:24:27.562527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1609.00750/citation-record","integrity":"/paper/1609.00750/integrity","json":"/paper/1609.00750/citation-record.json","paper":"/paper/1609.00750"},"outbound":[],"paper":{"arxiv_id":"1609.00750","last_updated":"2016-10-04T17:23:11Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T05:09:08.360468Z","submitted_at":"2016-09-02T21:24:22Z","title":"Predicting Signed Edges with $O(n^{1+o(1)} \\log{n})$ Queries"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1609.00750."}