{"as_of":"2026-08-18T20:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:186e732bee79a7a77e9cfa91c4e7ddc0ed8633e516d5a1e6a45664f7defedf79","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T16:46:43.890086Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T16:53:40.978601Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.05508","last_updated":"2021-06-10T05:26:50Z","snapshot_observed_at":"2026-08-16T18:18:11.971046Z","submitted_at":"2021-06-10T05:26:50Z","title":"Vertical Federated Learning without Revealing Intersection Membership","version":1},"cited_work":{"arxiv_id":"2106.05508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05508","snapshot_observed_at":"2026-06-29T16:53:40.978601Z","title":"Vertical federated learning without revealing intersection member- ship,","venue":null,"work_id":"e2d09300-5757-48ae-8b22-5378c99b428e","year":2021},"citing_paper":{"arxiv_id":"2604.19219","last_updated":"2026-05-17T09:37:34Z","snapshot_observed_at":"2026-08-04T07:47:00.105102Z","submitted_at":"2026-04-21T08:24:07Z","title":"Sherpa.ai Privacy-Preserving Multi-Party Entity Alignment without Intersection Disclosure for Noisy Identifiers","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T03:00:50.529341Z"},"links":{"cited_paper":"/paper/2106.05508","citing_paper":"/paper/2604.19219"},"observation_digest":"sha256:6a7426ad10d53947ce5172cb71aa31210584cccf938f45f7aeac7017a40bace7","observation_id":"faa77f5e-b63f-4e1b-a378-25dbc22102e9","resolution":{"observed_at":"2026-05-11T12:46:05.528869Z","resolver_source":"arxiv_id","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":"2106.05508","last_updated":"2021-06-10T05:26:50Z","snapshot_observed_at":"2026-08-16T18:18:11.971046Z","submitted_at":"2021-06-10T05:26:50Z","title":"Vertical Federated Learning without Revealing Intersection Membership","version":1},"cited_work":{"arxiv_id":"2106.05508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05508","snapshot_observed_at":"2026-06-29T16:53:40.978601Z","title":"Vertical federated learning without revealing intersection member- ship,","venue":null,"work_id":"e2d09300-5757-48ae-8b22-5378c99b428e","year":2021},"citing_paper":{"arxiv_id":"2604.19219","last_updated":"2026-05-17T09:37:34Z","snapshot_observed_at":"2026-08-04T07:47:00.105102Z","submitted_at":"2026-04-21T08:24:07Z","title":"Sherpa.ai Privacy-Preserving Multi-Party Entity Alignment without Intersection Disclosure for Noisy Identifiers","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T00:12:28.462186Z"},"links":{"cited_paper":"/paper/2106.05508","citing_paper":"/paper/2604.19219"},"observation_digest":"sha256:fd8577d9f599a07f65f8753ad82145b9805fbd9ad29404d3c337c6cff5c8e01b","observation_id":"297ae33e-7713-40c7-889f-5d30cbb159d6","resolution":{"observed_at":"2026-05-21T00:13:52.884797Z","resolver_source":"arxiv_id","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":"2106.05508","last_updated":"2021-06-10T05:26:50Z","snapshot_observed_at":"2026-08-16T18:18:11.971046Z","submitted_at":"2021-06-10T05:26:50Z","title":"Vertical Federated Learning without Revealing Intersection Membership","version":1},"cited_work":{"arxiv_id":"2106.05508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.05508","snapshot_observed_at":"2026-06-29T16:53:40.978601Z","title":"Vertical federated learning without revealing intersection member- ship,","venue":null,"work_id":"e2d09300-5757-48ae-8b22-5378c99b428e","year":2021},"citing_paper":{"arxiv_id":"2605.26903","last_updated":"2026-06-17T08:51:04Z","snapshot_observed_at":"2026-08-07T07:04:59.951692Z","submitted_at":"2026-05-26T12:02:14Z","title":"Practical Anonymous Two-Party Gradient Boosting Decision Tree","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-06-29T16:46:43.890086Z"},"links":{"cited_paper":"/paper/2106.05508","citing_paper":"/paper/2605.26903"},"observation_digest":"sha256:c46f404dfc471a916972640fbcaa4660e870524f090ec4ab707cc59bb056e234","observation_id":"996cfd1b-832f-45dd-b78d-f2428e659d66","resolution":{"observed_at":"2026-06-29T16:53:40.980090Z","resolver_source":"arxiv_id","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"}}],"links":{"evidence":"/evidence","html":"/paper/2106.05508/citation-record","integrity":"/paper/2106.05508/integrity","json":"/paper/2106.05508/citation-record.json","paper":"/paper/2106.05508"},"outbound":[],"paper":{"arxiv_id":"2106.05508","last_updated":"2021-06-10T05:26:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T18:18:11.971046Z","submitted_at":"2021-06-10T05:26:50Z","title":"Vertical Federated Learning without Revealing Intersection Membership"},"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 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2106.05508."}