{"as_of":"2026-08-19T03:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f598ac2e25e1c9013d879b4b617c686f4ec603daadd717dc14a5105e9f929b76","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-18T06:34:40.430872+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-15T20:40:48.730256Z","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-15T20:40:48.790209Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2009.05356","last_updated":"2021-03-31T12:02:25Z","snapshot_observed_at":"2026-08-12T23:53:11.820316Z","submitted_at":"2020-09-11T11:50:37Z","title":"Efficient Privacy-Preserving Computation Based on Additive Secret Sharing","version":2},"cited_work":{"arxiv_id":"2009.05356","doi":null,"metadata_source":"pith","pith_arxiv_id":"2009.05356","snapshot_observed_at":"2026-08-15T20:40:48.790209Z","title":"Efficient Privacy-Preserving Computation Based on Additive Secret Sharing","venue":"cs.CR","work_id":"c5b64018-f81a-468f-8cf5-660ece31b014","year":2020},"citing_paper":{"arxiv_id":"2505.12453","last_updated":"2025-06-07T14:39:22Z","snapshot_observed_at":"2026-08-18T00:54:32.586915Z","submitted_at":"2025-05-18T15:05:11Z","title":"SecEmb: Sparsity-Aware Secure Federated Learning of On-Device Recommender System with Large Embedding","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T20:40:48.730256Z"},"links":{"cited_paper":"/paper/2009.05356","citing_paper":"/paper/2505.12453"},"observation_digest":"sha256:8ff50502feee12dfbfd55366a268d4e82ad79961a4de1dbb90d15d6bdd33af74","observation_id":"0d28be81-df51-4050-adcc-c0bc5a135969","resolution":{"observed_at":"2026-08-15T20:40:48.796707Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2009.05356","last_updated":"2021-03-31T12:02:25Z","snapshot_observed_at":"2026-08-12T23:53:11.820316Z","submitted_at":"2020-09-11T11:50:37Z","title":"Efficient Privacy-Preserving Computation Based on Additive Secret Sharing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.05356","snapshot_observed_at":"2026-08-04T19:49:44.100571Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09107","last_updated":"2025-09-11T02:35:33Z","snapshot_observed_at":"2026-08-17T07:15:09.257506Z","submitted_at":"2025-09-11T02:35:33Z","title":"CryptGNN: Enabling Secure Inference for Graph Neural Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T19:49:44.100571Z"},"links":{"cited_paper":"/paper/2009.05356","citing_paper":"/paper/2509.09107"},"observation_digest":"sha256:ba54b4f52c755373be079aa4899e9c4cae8bdb5bd60a1587b57d30c5546353d6","observation_id":"2df50143-4e2b-4eb4-905f-e29f70b0fcc7","resolution":{"observed_at":"2026-08-04T19:49:44.100571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2009.05356/citation-record","integrity":"/paper/2009.05356/integrity","json":"/paper/2009.05356/citation-record.json","paper":"/paper/2009.05356"},"outbound":[],"paper":{"arxiv_id":"2009.05356","last_updated":"2021-03-31T12:02:25Z","latest_version":2,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-12T23:53:11.820316Z","submitted_at":"2020-09-11T11:50:37Z","title":"Efficient Privacy-Preserving Computation Based on Additive Secret Sharing"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2009.05356."}