{"as_of":"2026-08-08T16:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:efebba19d95833aa8c73056e2b15f9e0ce28862cda3818390bac2b8a3f387978","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:08:17.621396Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.00518/citation-record","integrity":"/paper/2506.00518/integrity","json":"/paper/2506.00518/citation-record.json","paper":"/paper/2506.00518"},"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-07T12:08:22.801737Z","title":"Protocols for secure computations (extended abstract),","venue":null,"work_id":"82c2ece2-d494-4dfd-a0fc-7149bf643fc1","year":1982},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:14.857029Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:47af13950d36251851f3fddc934a463e45bb87d0809301e3d8fada856de69b1e","observation_id":"376b7e2f-97e8-43d9-acee-b2579f0a3eda","resolution":{"observed_at":"2026-08-07T12:08:22.918233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:22.557336Z","title":"How to play any mental game or A completeness theorem for protocols with honest majority,","venue":null,"work_id":"18a7176d-327f-470b-a7a2-ac993fd5e8a9","year":1987},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:14.923503Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:eb3ff33b736ad736d3cc5f745d21349c80aca92e8c8d1cb4b8cfcd9bd4dd9ab2","observation_id":"c4ba81a9-38dd-45d0-b664-e9335a5abf65","resolution":{"observed_at":"2026-08-07T12:08:22.666062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:22.375007Z","title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract),","venue":null,"work_id":"6e20938b-d5eb-40b4-a9f9-4e76ddc45414","year":1988},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.015836Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:52ea5fff5053d2423d1c2a60e030d8ba9044f203764278eb5b2e2549cd384c41","observation_id":"f6da39cb-116f-46e5-8548-560a0f76fcac","resolution":{"observed_at":"2026-08-07T12:08:22.476008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:22.153557Z","title":"Multiparty unconditionally secure protocols (abstract),","venue":null,"work_id":"5ecc7a9b-8263-4f87-a06b-294c31f895d7","year":1988},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.107388Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:aecf61cf8685969ae6b509e81b26e6f0278deabd56e2ace12c87f0577b3b6ad4","observation_id":"6bae5dfc-47a3-4845-85d7-277481839e18","resolution":{"observed_at":"2026-08-07T12:08:22.272474Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:21.947040Z","title":"Multiparty computation from somewhat homomorphic encryption,","venue":null,"work_id":"3f648d0b-ad1f-448f-ad19-120c500983c9","year":2012},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.229188Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:cb521d31cfe3782651c833df6608230cb518290f7976858bb322fabc2d67ab3b","observation_id":"561ecbf0-4ff5-45d7-b5bf-cdb44e8bf985","resolution":{"observed_at":"2026-08-07T12:08:22.052910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:21.708493Z","title":"Catching MPC cheaters: Identification and openability,","venue":null,"work_id":"c4841d5c-28c6-4f0c-ac9f-4eb33d45aefc","year":2017},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.322081Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:5c1e127aa9266665f45aa7ab06b8eb9b4fea2187086a3ec2b0133c5c99364c41","observation_id":"a938171e-3f21-44fd-b5ad-caf780a5dbde","resolution":{"observed_at":"2026-08-07T12:08:21.795094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:21.393035Z","title":"Publicly account- able robust multi-party computation,","venue":null,"work_id":"74c2a35a-4598-41da-bc5e-f1054ca0f583","year":2022},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.440372Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:64ba37c4a3571d4d1280b08e5626ccccd1f72f255aa986ea072e945a2e0a56ca","observation_id":"ef81deb5-f411-4847-a4b4-f421a8aab7a1","resolution":{"observed_at":"2026-08-07T12:08:21.552287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:21.182832Z","title":"Secureml: A system for scalable privacy- preserving machine learning,","venue":null,"work_id":"0b31c499-8594-4535-8eea-8d50c0c29e5b","year":2017},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.543335Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:90051d2bcb38599ceb50c683ed8ecb0f96a67505161327902fe7b0d1166bcbc3","observation_id":"0feb0331-a800-43b8-87b7-e73ba5428b21","resolution":{"observed_at":"2026-08-07T12:08:21.251007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.957744Z","title":"MP-SPDZ: A versatile framework for multi-party compu- tation,","venue":null,"work_id":"e7c1de8a-3f63-4134-90f2-39e4eaeb3e74","year":2020},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.638603Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:73c577c4246c6d30253f12ab4fcd64289fef1b10621d6f74ed0ce3dcf533a046","observation_id":"82adf0dc-a3d6-42fb-984e-3af44a30963b","resolution":{"observed_at":"2026-08-07T12:08:21.075810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.790642Z","title":"Homomorphic evaluation of the AES circuit,","venue":null,"work_id":"1529ca3d-ae8e-49bf-ae99-28adf670e593","year":2012},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.738768Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:338468da5b1325b1fffa2cfdcec981e2c4c3012fbdab2856a5c9048cb9c708ca","observation_id":"a705fb71-889c-4489-ab40-a491dc71cb5e","resolution":{"observed_at":"2026-08-07T12:08:20.875458Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.561004Z","title":"Overdrive: Making SPDZ great again,","venue":null,"work_id":"606b0b36-5ec3-4cdd-aabf-ae6066272299","year":2017},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.828795Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:8eaf9eee4af282d22644eed52dae70a2e153e0cd6e0a902021c9b8893449f3ad","observation_id":"951d55cf-bf13-4dfc-bfa2-ceca04a51948","resolution":{"observed_at":"2026-08-07T12:08:20.678434Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.377131Z","title":"MASCOT: faster malicious arith- metic secure computation with oblivious transfer,","venue":null,"work_id":"cac295c9-2ba5-42de-9ead-4d1acbab0918","year":2016},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:15.911192Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:e85f9dd81f7305bcdf39951502c131c2b5c51a7fc671464071990a8d8df3ccd6","observation_id":"70fddc99-aa0f-4bc9-a814-714521af33c9","resolution":{"observed_at":"2026-08-07T12:08:20.468848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.218882Z","title":"Multiparty computation with covert security and public verifiability,","venue":null,"work_id":"f484e51e-332e-4bd2-8ad6-f1f557eb84e7","year":2021},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.003043Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:5c3a2c9f110eb2093d13ea437abc38c8a26a571a0b653381a47ad790f1631dfc","observation_id":"aa73c9e2-416e-4851-9fb8-36442e32c336","resolution":{"observed_at":"2026-08-07T12:08:20.296917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:20.007536Z","title":"How to generate and exchange secrets (extended abstract),","venue":null,"work_id":"97648cb2-748f-4a3d-9896-0869539a0d84","year":1986},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.099648Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:b00fcc1103b09444576d98c12a9163b5f2c4a3832857a1dd726ffb8b3f2fcd04","observation_id":"1141f878-0555-409b-8731-cf732a5da7de","resolution":{"observed_at":"2026-08-07T12:08:20.107054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:19.845720Z","title":"Verifiable secret sharing and multiparty protocols with honest majority,","venue":null,"work_id":"825f0e12-fd38-4a56-b72e-6fed5948e1b9","year":1989},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.178448Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:b4f0451f46363c4e83445fd9c4e2e8dc0e047f1d606046c6df0da1d143f976c7","observation_id":"7f77cdfd-09df-444f-9a20-97eab05afd4a","resolution":{"observed_at":"2026-08-07T12:08:19.911575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:19.660877Z","title":"Efficient multiparty computations secure against an adaptive adversary,","venue":null,"work_id":"19624699-0e53-4451-b264-a9bce6ec0735","year":1999},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.285484Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:8a9241020b70dc7998679a3f90ebcb5d667a2df331e6188246b04628825d37da","observation_id":"2bd8d68e-535b-4653-a665-8294b4348859","resolution":{"observed_at":"2026-08-07T12:08:19.741579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:19.445876Z","title":"Katz and Y","venue":null,"work_id":"de8aa98d-b239-4329-90f8-aa4fcc84c74d","year":2007},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.365340Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:e117a4876cf01aa24eeb1d6129e7d3b7ff5fad17ee8280b0dabc1ed8e45755f4","observation_id":"350dff88-52f2-465c-961c-fbdb6bc3b629","resolution":{"observed_at":"2026-08-07T12:08:19.546623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:19.261652Z","title":"Proofs of partial knowl- edge and simplified design of witness hiding protocols,","venue":null,"work_id":"ce92a6b7-7628-4a53-a855-458cb10fe3f5","year":1994},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.462073Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:27875532cbf1ab719efbcc7ad56973dbfea94141b3ccb4943b2d6272c4c58bd9","observation_id":"c408cdcd-3da3-4681-8258-1a42957203f2","resolution":{"observed_at":"2026-08-07T12:08:19.341164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:19.096352Z","title":"Fiat-shamir with aborts: Applications to lattice and factoring-based signatures,","venue":null,"work_id":"22f0395c-3abc-44e4-a534-0e538c4a81d3","year":2009},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.586956Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:46fdb9e39316dcee0bdcfa0a1fef7b27f3e1b08764f951de2cc847578dedc163","observation_id":"20c760e2-18bd-46b4-b406-72cd5f07e855","resolution":{"observed_at":"2026-08-07T12:08:19.177687Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.988520Z","title":"Lattice signatures without trapdoors,","venue":null,"work_id":"65d6d376-9a95-40d5-a420-a944eecfb69b","year":2012},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.681474Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:08998a3abde69e3bbe0801d69e464edd4dce573085ef60865384e27842491345","observation_id":"2afef642-90cd-4747-a2db-a728a3619921","resolution":{"observed_at":"2026-08-07T12:08:19.050044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.854509Z","title":"(leveled) fully ho- momorphic encryption without bootstrapping,","venue":null,"work_id":"f673d07c-6751-4ffd-ae67-23fcb7b036c8","year":2014},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.759849Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:227ea1042fb9fe3f726490f53c36cd6429ef913592e36eec1ce3c883d7fd4a2e","observation_id":"b746f8fc-df1c-4567-866f-ca0bcc923943","resolution":{"observed_at":"2026-08-07T12:08:18.915966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.744702Z","title":"Universally composable security: A new paradigm for cryptographic protocols,","venue":null,"work_id":"d7467ecf-b4dc-4211-93f2-0afcd51e22f8","year":2000},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.858120Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:614602d43bc5585e9b1b573532c3824803b5c4094f52e130959ff8f7eaa3dd11","observation_id":"5000bce0-fca7-4aa7-bd3e-8d0e431584d0","resolution":{"observed_at":"2026-08-07T12:08:18.792528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.616976Z","title":"On ideal lattices and learning with errors over rings,","venue":null,"work_id":"90ddb249-8442-4a10-842c-790de0d15ba8","year":2013},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:16.951958Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:4db648b96a6927d98e4dc64cb7df421dfebefbde6fea9e0438e0eb75fb2faf45","observation_id":"c95827fe-8801-4049-96df-2d9db510aba4","resolution":{"observed_at":"2026-08-07T12:08:18.681624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.455802Z","title":"On the concrete hardness of learning with errors,","venue":null,"work_id":"74f3a75a-378e-44f2-acb0-127fdc183d3e","year":2015},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.036285Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:b95fac80852914240fa30618eb969f730ed126960e420a6b6a7bf95a7a3816e8","observation_id":"e57828d1-15e6-4a8e-9e53-fccd6c51a08d","resolution":{"observed_at":"2026-08-07T12:08:18.541296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.294677Z","title":"Mascot: Faster malicious arithmetic secure computation with oblivious transfer,","venue":null,"work_id":"3dece6a4-1f36-44c0-bfc8-48a1e1572ac3","year":2016},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.151929Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:bd53c46f609bf739e5ce2d217bb86ed7faa9d0214fad94882a680fa0b219a23e","observation_id":"6caf0005-401e-4259-9a31-ac12a94b03c7","resolution":{"observed_at":"2026-08-07T12:08:18.378910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.155655Z","title":"Spdz2k: Efficient mpc mod 2k for dishonest majority,","venue":null,"work_id":"d5592fa4-80d6-402b-a9d5-75eb201b0370","year":2018},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.280042Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:a6e7f9a5eead5bec6fbfc527cae05a227ca73b97fdec6f3e20eb03b6815a1b24","observation_id":"f8ce7742-d362-45d2-8bb1-0232e313f093","resolution":{"observed_at":"2026-08-07T12:08:18.217932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:18.040846Z","title":"Overdrive: Making spdz great again,","venue":null,"work_id":"55a41f44-6471-473a-86d6-e4963faa1b6e","year":2017},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.370246Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:b6603b1e7baff36a8d01c3a62e68b46615be4f33e7e75eedf8a1d49d560b9043","observation_id":"f1e7fc94-c57e-4344-bfba-d4e2e88a7bda","resolution":{"observed_at":"2026-08-07T12:08:18.087008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:17.916202Z","title":"Breast Cancer Wisconsin (Diagnostic)","venue":null,"work_id":"4f60353a-9231-4a61-803d-2b3d267fb7a7","year":null},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.449476Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:a1f7a7160745d487f0138af8c0357266c44d434deb5fddb0f91926e5474cb19e","observation_id":"3f5f1eef-2921-40d1-af44-b5b1f64e9877","resolution":{"observed_at":"2026-08-07T12:08:17.957407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:17.745196Z","title":"The use of multiple measurements in taxonomic prob- lems,","venue":null,"work_id":"f7851a79-4f4c-4e97-aa35-1d77321630d5","year":1936},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.621396Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:4c6b6d89190dad321a54f5fc5535dd7e18016ce24e8ae403bb86401243d75a3b","observation_id":"c4e0c50a-2786-4607-b844-c6d31eca226a","resolution":{"observed_at":"2026-08-07T12:08:17.843212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T12:08:17.505752Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference","version":1},"reference_index":1995,"source":"pdf_text","source_observed_at":"2026-08-07T12:08:17.505752Z"},"links":{"citing_paper":"/paper/2506.00518"},"observation_digest":"sha256:222aa0cdd0a10bb53dd5133ad38f2ed2b9fa84ece8319d02ec84807af5ea57b3","observation_id":"95ef2f89-24ff-460d-8336-7bcb34aea693","resolution":{"observed_at":"2026-08-07T12:08:17.505752Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.00518","last_updated":"2025-05-31T11:26:57Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T12:01:25.951158Z","submitted_at":"2025-05-31T11:26:57Z","title":"Robust and Verifiable MPC with Applications to Linear Machine Learning Inference"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":29},"total_outbound_references":30},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2506.00518."}