{"as_of":"2026-08-11T15:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7f9bc6f5cd2144160ab294216091f2e3cb34649bfdacbcedd8cda064bd69d197","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:09:04.870884Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11458/citation-record","integrity":"/paper/2506.11458/integrity","json":"/paper/2506.11458/citation-record.json","paper":"/paper/2506.11458"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:10.996510Z","title":"Available online: https://www2.deloitte","venue":null,"work_id":"fde725ff-6756-499a-a01f-4368289c8e11","year":2023},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:00.774541Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:c2287309571bfaed94d30c0363694e191f3dca35b8de9bfcd57da81402990869","observation_id":"de2ccb41-96f5-44b1-996d-e3d202cc01d1","resolution":{"observed_at":"2026-08-07T04:09:11.127283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:10.729686Z","title":"Avail- able online: https://eccc.weizmann.ac.il/report/2020/058/ [Accessed 20-09-2023]","venue":null,"work_id":"f751d827-2e18-4963-9458-6ec84d64f8ed","year":2020},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:01.323185Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:1fa7bd39cf5edb9b823af03f8db32039091fe3baf8598fbc752e27a582524f21","observation_id":"28c16584-3b75-4fd6-826b-dcb8bb25fc74","resolution":{"observed_at":"2026-08-07T04:09:10.859112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:10.488994Z","title":"Cryptology ePrint Archive, Paper 2016/116, 2016","venue":null,"work_id":"6db587c4-da6b-4749-b102-8e56ddad8ce9","year":2016},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:01.499050Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:e25987bb7160f792012680b1ba8904bfd39c96af8cadfb588cbb2bcbdd5b0b6f","observation_id":"53f624aa-03b0-452f-959a-361e30ca7413","resolution":{"observed_at":"2026-08-07T04:09:10.589922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:10.223783Z","title":"Cryptology ePrint Archive, Paper 2018/046, 2018","venue":null,"work_id":"032cb575-a840-440a-8a59-1e40e788a5a0","year":2018},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:01.622304Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:9c2e0a5fa350cf9b2152ce3a21ee9c99763a73cd626482d1efbcc06c0665e850","observation_id":"c4a738f4-cacb-4994-bca9-7c9de2868703","resolution":{"observed_at":"2026-08-07T04:09:10.349968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.05157","last_updated":"2020-07-10T04:28:43Z","snapshot_observed_at":"2026-08-10T04:28:32.214126Z","submitted_at":"2020-07-10T04:28:43Z","title":"Differentially Private Simple Linear Regression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.05157","snapshot_observed_at":"2026-08-07T04:09:01.724240Z","title":"arXiv preprint arXiv:2007.05157, 2020","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:01.724240Z"},"links":{"cited_paper":"/paper/2007.05157","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:928cd2027126c9f0c6fe4a6188763038683ee8f57c3dfe843742e55980eb6091","observation_id":"43b7ac43-66a4-455d-9052-04a4fa788cc2","resolution":{"observed_at":"2026-08-07T04:09:01.724240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03106","last_updated":"2020-09-07T13:51:26Z","snapshot_observed_at":"2026-08-09T16:52:23.953311Z","submitted_at":"2020-09-07T13:51:26Z","title":"Scaling up Differentially Private Deep Learning with Fast Per-Example Gradient Clipping","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03106","snapshot_observed_at":"2026-08-07T04:09:01.833903Z","title":"arXiv preprint arXiv:2009.03106, 2020","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:01.833903Z"},"links":{"cited_paper":"/paper/2009.03106","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:7e7b7905c33e192ae5445e19cdaa25359a14ca5295bc834ae65e7e89b279acde","observation_id":"d17ab64f-6d48-4427-a0f7-d7440542f00c","resolution":{"observed_at":"2026-08-07T04:09:01.833903Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:02.001979Z","title":"B., Mironov, I., Talwar, K., Zhang, L.: Deep Learning with Differential Privacy","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.001979Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:464c7199095cb124e0e217054fc74ec84ad47eec4023aac0f565df532726f8f3","observation_id":"ac040200-4c1f-43ce-9010-14864d38ae3f","resolution":{"observed_at":"2026-08-07T04:09:02.001979Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:09.998380Z","title":"Google AI Blog, 2022, Feb","venue":null,"work_id":"31cf6b16-14c0-4711-8372-58f916b4f77c","year":2022},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.123176Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:4a46fbaa4b3cb9197ea48bb4e1e0d423d6dc6c4bcbb5c796d1615a1e96061354","observation_id":"685a93c2-99d1-4458-9122-fe70b8fc80c9","resolution":{"observed_at":"2026-08-07T04:09:10.103557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:09.755880Z","title":"Founda- tions and Trends® in Theoretical Computer Science, vol","venue":null,"work_id":"408931d5-ecc2-4377-ad9c-0e5b7815c304","year":null},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.243019Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:d0e4aa5754ff3ee09a6d0f35d3560d5702c58db52dfce8b843b84d60147277d3","observation_id":"6b1b0372-53b7-468d-8cfa-0e9f9097be9d","resolution":{"observed_at":"2026-08-07T04:09:09.869751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:09.529178Z","title":"Medium, Becoming Human: Artificial Intelligence Magazine, 2020, Oct","venue":null,"work_id":"d5fe174a-c310-420b-8875-e371da9c90f8","year":2020},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.511387Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:56a46bdb6554e128cf45cd3c20c06d9a6f084da89a14466fad99a038f64425dd","observation_id":"6e599a22-a641-4fd5-b2d9-071b99e55864","resolution":{"observed_at":"2026-08-07T04:09:09.642742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:09.343519Z","title":"Wikipedia, Wikimedia Foundation, 2022, May","venue":null,"work_id":"845c420b-b357-431b-a1f5-c5871f3b468d","year":2022},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.615264Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:23ef510c3cdf02a5266f291284659d38a73609e24dcb5b6493644b490ec4b9e2","observation_id":"d6ee5f78-9967-46b0-995e-8aa084c72fb5","resolution":{"observed_at":"2026-08-07T04:09:09.427331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1501.06095","last_updated":"2015-01-24T23:26:21Z","snapshot_observed_at":"2026-07-06T04:07:08.463282Z","submitted_at":"2015-01-24T23:26:21Z","title":"Between Pure and Approximate Differential Privacy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1501.06095","snapshot_observed_at":"2026-08-07T04:09:02.721415Z","title":"arXiv preprint arXiv:1501.06095, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.721415Z"},"links":{"cited_paper":"/paper/1501.06095","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:6ddaec04b7966bbc9dc95118c04f57902a2b8ea1ce3f0465868e53c09b881b24","observation_id":"00fdf537-d9c3-4943-81b1-ef5164468e54","resolution":{"observed_at":"2026-08-07T04:09:02.721415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:09.116477Z","title":"In: Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, Lecture Notes in Computer Science, vol","venue":null,"work_id":"92ce2be3-086f-4a5b-bf22-2e0e8d128434","year":2006},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.825247Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:1246ac02d350c189af5d368d65bd29e64d446001abb24cbffec18ada380ee640","observation_id":"f0d9a4ec-9784-41c1-938a-ee0498790ddc","resolution":{"observed_at":"2026-08-07T04:09:09.212146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:08.877125Z","title":"In: Springer Tracts in Electrical and Electronics Engineer- ing","venue":null,"work_id":"4f298d05-545b-4511-9853-e3015369e42b","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.948147Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:faaab9a6848e6e94bd45d136ebbc7a4a506060adba8ed47e8eae8d968c39048a","observation_id":"3012ad0b-2405-453c-af49-c68facdaa6ea","resolution":{"observed_at":"2026-08-07T04:09:08.975882Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1311.3158","last_updated":"2018-10-23T18:24:41Z","snapshot_observed_at":"2026-07-06T03:28:04.599767Z","submitted_at":"2013-11-13T15:09:48Z","title":"Fingerprinting Codes and the Price of Approximate Differential Privacy","version":3},"cited_work":{"arxiv_id":"1311.3158","doi":null,"metadata_source":"pith","pith_arxiv_id":"1311.3158","snapshot_observed_at":"2026-08-07T04:09:05.542533Z","title":"Fingerprinting Codes and the Price of Approximate Differential Privacy","venue":"cs.CR","work_id":"819d4a5e-424f-4121-a4f0-821904fd51ff","year":2013},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.060030Z"},"links":{"cited_paper":"/paper/1311.3158","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:efbf02f20a7b5d713b43435aeae1d0cf300a7cda2e1a42f30299dca16b1b389a","observation_id":"0cc89389-ecc8-485b-b14a-c77107e393b7","resolution":{"observed_at":"2026-08-07T04:09:05.623766Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1502.06309","last_updated":"2016-04-27T19:55:21Z","snapshot_observed_at":"2026-07-06T04:09:56.630371Z","submitted_at":"2015-02-23T03:52:08Z","title":"Learning with Differential Privacy: Stability, Learnability and the Sufficiency and Necessity of ERM Principle","version":3},"cited_work":{"arxiv_id":"1502.06309","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.06309","snapshot_observed_at":"2026-08-07T04:09:05.320881Z","title":"Learning with Differential Privacy: Stability, Learnability and the Sufficiency and Necessity of ERM Principle","venue":"stat.ML","work_id":"845f3e75-fe66-4f0f-82a5-402c8ee1ebe4","year":2015},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.175576Z"},"links":{"cited_paper":"/paper/1502.06309","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:408d2ed32bc9d9e1873c6fcb0cab5c4ac474ad8b68e36b975b43b1691e600666","observation_id":"33614718-d4c8-4357-b3b5-800136e691a7","resolution":{"observed_at":"2026-08-07T04:09:05.419485Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:03.286085Z","title":"In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), IEEE, 2017, Aug","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.286085Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:2084064645537bfa580e7102344171a8f750ff49051b0aa7d911567a22cbd38e","observation_id":"e86e479b-1749-4598-b32f-40c9b6809381","resolution":{"observed_at":"2026-08-07T04:09:03.286085Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1507.02482","last_updated":"2017-08-21T21:30:27Z","snapshot_observed_at":"2026-07-06T04:23:19.807421Z","submitted_at":"2015-07-09T12:32:19Z","title":"Differentially Private Ordinary Least Squares","version":4},"cited_work":{"arxiv_id":"1507.02482","doi":null,"metadata_source":"pith","pith_arxiv_id":"1507.02482","snapshot_observed_at":"2026-08-07T04:09:05.085493Z","title":"Differentially Private Ordinary Least Squares","venue":"cs.DS","work_id":"c8af5ed7-b48d-4be5-a0c7-91febcb41a35","year":2015},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.416816Z"},"links":{"cited_paper":"/paper/1507.02482","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:5c41685a814b63c82dc4a234d30fb7b65aabf73827fdcdf9adc3336717cc87f6","observation_id":"5f0bb22b-5614-483e-92c3-f2a8c60fdd4a","resolution":{"observed_at":"2026-08-07T04:09:05.175811Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2208.07353","last_updated":"2023-03-16T19:58:23Z","snapshot_observed_at":"2026-08-03T17:02:15.640047Z","submitted_at":"2022-08-15T17:42:27Z","title":"Easy Differentially Private Linear Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.07353","snapshot_observed_at":"2026-08-07T04:09:03.567716Z","title":"arXiv preprint arXiv:2208.07353, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.567716Z"},"links":{"cited_paper":"/paper/2208.07353","citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:7cc99f400262167416b43bc61d9d5cedd2ff3c12635b91535c4e38a33ba809cf","observation_id":"79d5abc4-1167-42c8-bba9-a960e2b4dc6c","resolution":{"observed_at":"2026-08-07T04:09:03.567716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:08.623445Z","title":"TensorFlow","venue":null,"work_id":"ef061520-d769-4983-b8bb-637d694b107f","year":null},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.678124Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:23a88ba3f736fc35260b8e3fc5744a7823440fbabae78d7c5846605ef73c56bf","observation_id":"908423dc-8e9f-4b0a-93de-38be3ebe74fa","resolution":{"observed_at":"2026-08-07T04:09:08.752319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:08.366663Z","title":"Available online: https://www.risczero.com/about [Accessed 20- 09-2023]","venue":null,"work_id":"b8b7a84d-7f71-47fa-beec-53d20e8c5257","year":2023},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.777424Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:fb937d87a4926699749a02aeff2b851fa99b5ad7a117cbc07657d58d9c3a16df","observation_id":"5651a5b2-3363-48dd-af57-614d619a4fd9","resolution":{"observed_at":"2026-08-07T04:09:08.499481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:08.073129Z","title":"Available online: https://www.kaggle.com/ datasets/prasad22/healthcare-dataset, 2022","venue":null,"work_id":"e2d761ba-b1f6-45f6-9f94-c910cf6b6ae1","year":2022},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:03.910247Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:1c5a8d59d011fa94b58799f8da504147eea5248b9e394c70baf303c81f9b80ce","observation_id":"0f247716-ec82-48ab-be2f-02166dda1f68","resolution":{"observed_at":"2026-08-07T04:09:08.208105Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:07.821100Z","title":"Available online: https://l2ivresearch.substack.com/p/ tech-deep-dive-verifying-fhe-in-risc, 2024","venue":null,"work_id":"0a6ed1ed-e70a-41e5-a223-e51705baed37","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.043210Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:866e5d25f8bd05ed39a22aadda35ed27a7b02e1a9ea6a0d0751d6bca8ed05f6c","observation_id":"5f17e177-7e64-4913-82cb-119c435abb41","resolution":{"observed_at":"2026-08-07T04:09:07.969696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:07.597645Z","title":"Available on- line: https://docs.google.com/spreadsheets/d/138M4R1- zS-OLBsl2VJeN anfTSCRCFc6EguYUVG-yA/edit#gid=1339763553 [Accessed 20-09-2023]","venue":null,"work_id":"c423f569-7d24-4a65-9ee1-cbd8bb855c1a","year":2023},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.148857Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:e5148c186eece4a6105ca49d66999884bf70d0599fccb20646b07b5597d81d1d","observation_id":"3b601973-6826-4a78-a64c-85b01bdf848d","resolution":{"observed_at":"2026-08-07T04:09:07.716919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:07.282975Z","title":"Available online: https://www.notebookcheck","venue":null,"work_id":"7422cc18-e822-4682-bff5-c05c2ef5dcca","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.244578Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:0790d59a25fc850a9fb883bbbf700735669c88edeb4af53d37e098ebbec12b5a","observation_id":"072552ad-6d03-4b84-ae36-8b24a01274a3","resolution":{"observed_at":"2026-08-07T04:09:07.490375Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:07.080223Z","title":"Available online: https://openreview.net/ pdf?id=PQY2v6VtGe, 2024","venue":null,"work_id":"658ef56f-911c-43ea-a32a-535fb87a8e9d","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.384513Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:2e3f59eb7b830a41baa9af2ea53691cd3ef61732a29b580c24bb042dd1ede693","observation_id":"0bf5cc26-01bc-4f29-9ed5-7ede94c5bdc0","resolution":{"observed_at":"2026-08-07T04:09:07.169724Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:06.814256Z","title":"Available online: https://github.com/emp-toolkit/ emp-zk, 2023","venue":null,"work_id":"10b14ac0-1b37-43a3-a9e7-b7d00660d1de","year":2023},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.477378Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:b1354a8cd13ba9fb27e52a4124d57eefd645e0be2c2e70fd48cd93bc685b5b88","observation_id":"8584bd90-ee31-4970-a972-1946f2698402","resolution":{"observed_at":"2026-08-07T04:09:06.936759Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:06.530907Z","title":"et al: Wolverine: Fast, Scalable, and Communication-Efficient Zero- Knowledge Proofs for Boolean and Arithmetic Circuits","venue":null,"work_id":"5b36e15f-4f70-4624-81ea-cc3c2e9eea3c","year":2020},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.615800Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:2e978f7aa5d3f4cb413851c5036bf902b73a9e61f7408bb03b33d099c85c32a9","observation_id":"5cf6afc5-37bf-4504-a01f-ac05b63f44a4","resolution":{"observed_at":"2026-08-07T04:09:06.662309Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:06.219575Z","title":"GitHub, 2024","venue":null,"work_id":"416a4150-6522-4499-8148-86c44cc14a2f","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.750615Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:68bcedced079964b3c52b3ae9816fca554905e80c9da6e52847556c829e1ab2f","observation_id":"8b923b0d-b4e9-4df9-a5bf-d25540e7419d","resolution":{"observed_at":"2026-08-07T04:09:06.343775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:05.896897Z","title":"GitHub repository, GitHub, 2024","venue":null,"work_id":"15e0883a-8c98-400b-9ef8-303811b580eb","year":2024},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:04.870884Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:1a12c47562ff47357973f88ac69aca923f8f09c07dd17e40f9c88042305a2d4e","observation_id":"19648e89-6cff-4827-af3e-2c0f1001a33f","resolution":{"observed_at":"2026-08-07T04:09:06.033100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:09:02.386072Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T04:09:02.386072Z"},"links":{"citing_paper":"/paper/2506.11458"},"observation_digest":"sha256:ffc98d9debfb768fb7c8ecf5688ab16d6886f625955255e99cb1f1e08f05d53d","observation_id":"0e579b44-4562-4ae2-a0f8-0b1d8c755b47","resolution":{"observed_at":"2026-08-07T04:09:02.386072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.11458","last_updated":"2025-06-13T04:28:31Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-08T05:20:13.351790Z","submitted_at":"2025-06-13T04:28:31Z","title":"Computational Attestations of Polynomial Integrity Towards Verifiable Machine-Learning"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":20},"total_outbound_references":31},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2506.11458."}