{"as_of":"2026-08-15T09:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17c2cac580bf9b67285c2792fec7c307fe8d791423fe285a2f1d278aec498778","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-15T06:32:42.880941+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-12T05:11:03.443464Z","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-10T19:27:40.508323Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1003.2429","last_updated":"2010-03-11T21:27:11Z","snapshot_observed_at":"2026-08-15T06:16:39.534569Z","submitted_at":"2010-03-11T21:27:11Z","title":"Predicting Positive and Negative Links in Online Social Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1003.2429","snapshot_observed_at":"2026-08-12T05:11:03.443464Z","title":"Predict- ing positive and negative links in online social networks,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.00704","last_updated":"2024-12-01T07:01:06Z","snapshot_observed_at":"2026-08-12T05:03:33.283546Z","submitted_at":"2024-12-01T07:01:06Z","title":"Efficient Kernelization Algorithm for Bipartite Graph Matching","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-12T05:11:03.443464Z"},"links":{"cited_paper":"/paper/1003.2429","citing_paper":"/paper/2412.00704"},"observation_digest":"sha256:06e73953014b454eb145d4ac722bfad59053627c33f837dbb06a095da1777c1e","observation_id":"cfcdbfc8-6e68-4243-b00f-e2f27304442f","resolution":{"observed_at":"2026-08-12T05:11:03.443464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1003.2429","last_updated":"2010-03-11T21:27:11Z","snapshot_observed_at":"2026-08-15T06:16:39.534569Z","submitted_at":"2010-03-11T21:27:11Z","title":"Predicting Positive and Negative Links in Online Social Networks","version":1},"cited_work":{"arxiv_id":"1003.2429","doi":null,"metadata_source":"pith","pith_arxiv_id":"1003.2429","snapshot_observed_at":"2026-08-10T19:27:40.508323Z","title":"Predicting Positive and Negative Links in Online Social Networks","venue":"physics.soc-ph","work_id":"5d677901-06c6-46c3-9370-64992e4a294b","year":2010},"citing_paper":{"arxiv_id":"2501.10010","last_updated":"2025-01-17T07:48:18Z","snapshot_observed_at":"2026-08-10T23:03:20.373506Z","submitted_at":"2025-01-17T07:48:18Z","title":"Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T19:27:40.336232Z"},"links":{"cited_paper":"/paper/1003.2429","citing_paper":"/paper/2501.10010"},"observation_digest":"sha256:fdb5da19fca73c9fa0010d35cb2f0881892a565fe3e30653c967280c4fa0ac1e","observation_id":"f0c63702-c79d-49a7-91ca-137c8316caf1","resolution":{"observed_at":"2026-08-10T19:27:40.520198Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1003.2429/citation-record","integrity":"/paper/1003.2429/integrity","json":"/paper/1003.2429/citation-record.json","paper":"/paper/1003.2429"},"outbound":[],"paper":{"arxiv_id":"1003.2429","last_updated":"2010-03-11T21:27:11Z","latest_version":1,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-08-15T06:16:39.534569Z","submitted_at":"2010-03-11T21:27:11Z","title":"Predicting Positive and Negative Links in Online Social 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1003.2429."}