{"as_of":"2026-08-22T07:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5aa6bf3c61aa00eecccc84a671045e78c698fd0f54828f890eb5053d6a605e7","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-22T06:32:14.747728+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-08-15T20:56:01.420217Z","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-09T13:32:18.937615Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.05530","last_updated":"2024-02-06T08:29:25Z","snapshot_observed_at":"2026-08-19T20:27:39.336535Z","submitted_at":"2020-11-11T03:32:22Z","title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks","version":4},"cited_work":{"arxiv_id":"2011.05530","doi":null,"metadata_source":"pith","pith_arxiv_id":"2011.05530","snapshot_observed_at":"2026-08-09T13:32:18.937615Z","title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks","venue":"cs.LG","work_id":"8f01ce2c-501e-41ac-8644-550d7f0d4797","year":2020},"citing_paper":{"arxiv_id":"2502.02068","last_updated":"2026-08-11T05:33:43Z","snapshot_observed_at":"2026-08-20T14:49:07.555123Z","submitted_at":"2025-02-04T07:35:28Z","title":"Robust and Secure Code Watermarking for Large Language Models via ML/Crypto Codesign","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T13:32:18.608576Z"},"links":{"cited_paper":"/paper/2011.05530","citing_paper":"/paper/2502.02068"},"observation_digest":"sha256:050f00558762caf6850869fb1a6f402e0703f8a96cc091bc6e317b9422983348","observation_id":"0f20f754-484f-47d4-a1f6-13d7373b3c7c","resolution":{"observed_at":"2026-08-09T13:32:18.943796Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05530","last_updated":"2024-02-06T08:29:25Z","snapshot_observed_at":"2026-08-19T20:27:39.336535Z","submitted_at":"2020-11-11T03:32:22Z","title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.05530","snapshot_observed_at":"2026-08-15T20:56:01.420217Z","title":"Ali, Jinhyun So, and Amir Salman Avestimehr","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.11589","last_updated":"2025-05-16T18:00:02Z","snapshot_observed_at":"2026-08-19T20:27:03.152771Z","submitted_at":"2025-05-16T18:00:02Z","title":"A Training Framework for Optimal and Stable Training of Polynomial Neural Networks","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T20:56:01.420217Z"},"links":{"cited_paper":"/paper/2011.05530","citing_paper":"/paper/2505.11589"},"observation_digest":"sha256:be00b6fd897db05f9fd8ef30f58e18c2a4a4e00c18b887fe69e1643e1d7d92cd","observation_id":"6d70c6ef-0e97-4b08-bd7c-dfb0fa1c215f","resolution":{"observed_at":"2026-08-15T20:56:01.420217Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.05530","last_updated":"2024-02-06T08:29:25Z","snapshot_observed_at":"2026-08-19T20:27:39.336535Z","submitted_at":"2020-11-11T03:32:22Z","title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.05530","snapshot_observed_at":"2026-08-15T18:32:23.731262Z","title":"Ali, Jinhyun So, and A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.19693","last_updated":"2025-06-24T15:00:14Z","snapshot_observed_at":"2026-08-20T03:51:22.959090Z","submitted_at":"2025-06-24T15:00:14Z","title":"ReBoot: Encrypted Training of Deep Neural Networks with CKKS Bootstrapping","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T18:32:23.731262Z"},"links":{"cited_paper":"/paper/2011.05530","citing_paper":"/paper/2506.19693"},"observation_digest":"sha256:f64015184e95179ad8a35e40d8e5b6a4fea7abbab5493f28280338793f81ca56","observation_id":"1cae2627-9ae1-40e8-88fd-30402401c2a2","resolution":{"observed_at":"2026-08-15T18:32:23.731262Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.05530/citation-record","integrity":"/paper/2011.05530/integrity","json":"/paper/2011.05530/citation-record.json","paper":"/paper/2011.05530"},"outbound":[],"paper":{"arxiv_id":"2011.05530","last_updated":"2024-02-06T08:29:25Z","latest_version":4,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-19T20:27:39.336535Z","submitted_at":"2020-11-11T03:32:22Z","title":"On Polynomial Approximations for Privacy-Preserving and Verifiable ReLU 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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2011.05530."}