{"as_of":"2026-08-15T10:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2049abe2612d98d4f48982f5b8e796d62faa16c6d94bc9bc4691cedfc3a853df","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:57:09.480108Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T06:07:19.130524Z","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-14T06:07:19.356662Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"cited_work":{"arxiv_id":"1908.04255","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.04255","snapshot_observed_at":"2026-08-14T06:07:19.356662Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","venue":"cs.IT","work_id":"d703279d-9051-4712-848e-c9e564daf0df","year":2019},"citing_paper":{"arxiv_id":"1909.00407","last_updated":"2019-12-18T18:36:45Z","snapshot_observed_at":"2026-08-14T23:34:54.662960Z","submitted_at":"2019-09-01T14:09:01Z","title":"Private and Secure Distributed Matrix Multiplication with Flexible Communication Load","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T06:07:19.130524Z"},"links":{"cited_paper":"/paper/1908.04255","citing_paper":"/paper/1909.00407"},"observation_digest":"sha256:24661b4913c6a3a95589158ac93536692e94a5e5bf2ef17f0e3ffb12dda8ee46","observation_id":"6a53c7ca-2479-4798-9b77-354f40f94159","resolution":{"observed_at":"2026-08-14T06:07:19.361071Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1908.04255/citation-record","integrity":"/paper/1908.04255/integrity","json":"/paper/1908.04255/citation-record.json","paper":"/paper/1908.04255"},"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-14T13:57:10.334118Z","title":"Limited-sharing multi-party computation for massive matrix operations,","venue":null,"work_id":"27ddeb2d-be87-4241-a25d-f43bbe3b58c3","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.225226Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:e10c047c7960858d49f74365518f57511b2bcbebcb518359792aa1426b626875","observation_id":"f7279099-7a2a-48d3-920a-259c75801809","resolution":{"observed_at":"2026-08-14T13:57:10.339332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.316533Z","title":"The round complexity of secure protocols,","venue":null,"work_id":"d35c131b-137b-4a6d-90bf-619b1db031d4","year":1990},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.231127Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:66e3e37d2b92c428f50bb4f8b29cf1b6df2293d753f0540b7d4e44a6dcb0f7db","observation_id":"beafec2e-1bc8-4a67-9cc2-75aff085d73a","resolution":{"observed_at":"2026-08-14T13:57:10.322617Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.298460Z","title":"Simplified vss and fast-track multiparty computations with applications to threshold cryptography,","venue":null,"work_id":"1d5482c7-b9de-41dd-ba76-135c998337a4","year":1998},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.236836Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:26f8ffda850f29cab5cad5fd8a3819a3b23edc920f115d62c4bc8103b5ef187d","observation_id":"f691a631-0ca2-49ce-a2a1-47a5f3c276a5","resolution":{"observed_at":"2026-08-14T13:57:10.303583Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.281749Z","title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation,","venue":null,"work_id":"7608d2b3-466d-4711-9746-0fb8adeaa4db","year":1988},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.242204Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:a4e58d9e228bda7adb23498c30210632894937b4bd86b4aaf55bae8abd86baeb","observation_id":"4a4ff7a0-a432-412d-8a52-74732c15b18a","resolution":{"observed_at":"2026-08-14T13:57:10.287226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.265150Z","title":"Multiparty unconditionally secure protocols,","venue":null,"work_id":"687bf459-7154-48bc-b359-c5c408f6c4b2","year":1988},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.247616Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:88b8a1ccd74b0581e59a25cf7a6f9d5323d2000a2bf0f49a80dcc87e871558f2","observation_id":"144b6573-5a07-468d-9a1f-54429f3def02","resolution":{"observed_at":"2026-08-14T13:57:10.270540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.249265Z","title":"Efficient multiparty protocols using circuit randomization,","venue":null,"work_id":"2948db51-e8e6-47e4-9a31-e8750a8122aa","year":1991},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.252763Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:8e0e7de8e175b114a06381ab3a8d61291279d48d14e0c400adaf8eba55f2b567","observation_id":"0c24bf68-194c-4bf8-9d53-a9807c8f8d6f","resolution":{"observed_at":"2026-08-14T13:57:10.254441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.233705Z","title":"A pragmatic introduction to secure multi-party computation,","venue":null,"work_id":"d9462b92-b3fc-4d7d-82e9-57b1f4e0be4f","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.258456Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:429866fa12cd9d0860709d31f6bf322be39d25fa5cd7f91b930188f9d8aaf617","observation_id":"801de360-2d5c-4670-b235-264c025359ac","resolution":{"observed_at":"2026-08-14T13:57:10.238914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.263415Z","title":"How to share a secret,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.263415Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:1ebad1c95159c7d6307f1ee220d00a07aca94f45b7123313c524e9cf50cf8243","observation_id":"4fb80d3b-a905-4486-a2b5-05e42e5607e5","resolution":{"observed_at":"2026-08-14T13:57:09.263415Z","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-14T13:57:10.205775Z","title":"Recent results in scalable multi-party computation,","venue":null,"work_id":"2f267570-a6fb-44c9-a37f-7d614451726a","year":2015},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.268821Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:dbacef34bdbef6d7ca0b951a35903e113135569fb0010e5dd0ddcc6e8ca4eb3a","observation_id":"3c4533fe-2986-4e4b-b1c5-f91f0f0e7a2f","resolution":{"observed_at":"2026-08-14T13:57:10.211487Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.273926Z","title":"The tail at scale,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.273926Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:28f5dc2cf94213b818d5aa87fb7e2505735a992d102a3380bad2a2f08c9b6d72","observation_id":"41e43d2d-3afe-4f77-90a4-97acb03a6679","resolution":{"observed_at":"2026-08-14T13:57:09.273926Z","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-14T13:57:10.179852Z","title":"Speeding up distributed machine learning using codes,","venue":null,"work_id":"92164749-f332-4eac-ae0b-8af7ac0805f8","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.278866Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:3e8a2b0016c57c1ad0ad01bc35a832cf26f306b1a7dd2a3bf466a45b3c9b19c9","observation_id":"893b53b4-6f26-48aa-b145-b7c731b8d41f","resolution":{"observed_at":"2026-08-14T13:57:10.184866Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.164744Z","title":"High-dimensional coded matrix multiplication,","venue":null,"work_id":"8b325ee8-c949-488b-bdee-5d5df89ad30d","year":2017},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.283634Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:cfadea4738938d59d2295ddb1fa24a47d49a20e52e8771e7eb7b5b65aa77fb90","observation_id":"43a6a59e-ac04-47bb-af93-967ff0bcc527","resolution":{"observed_at":"2026-08-14T13:57:10.169671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.149117Z","title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication,","venue":null,"work_id":"91755c2d-3a25-4691-8f9b-6a2da2662c20","year":2017},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.288381Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:17b7c2a032692cb519ce3426c16e7dfd30c54a02af475dbda2a421608eed8610","observation_id":"6dd46017-02ea-4eec-8ca6-7ee2b25b9081","resolution":{"observed_at":"2026-08-14T13:57:10.153981Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.133698Z","title":"Straggler mitigation in distributed matrix multiplication: Fundamental limits and optimal coding,","venue":null,"work_id":"ccf750e6-c182-4dc4-9be7-48e34dcf8406","year":2022},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.293240Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:5ad8d38e5d8686d4df7cca51ec5597e4533747fb6c5500269e09aa29a8ce5283","observation_id":"f0a3e7fb-29c1-4d1e-bbd7-b3be5d8e433b","resolution":{"observed_at":"2026-08-14T13:57:10.139017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.118172Z","title":"On the optimal recovery threshold of coded matrix multiplication,","venue":null,"work_id":"3ee07646-1bb6-4b2b-bd93-250ecd2db66e","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.298169Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:6039ebd3df158b4881ffcdfcd561adb8a64a84f0cdd20585628d239eb6547847","observation_id":"4099880d-bb85-41d2-a249-bb78d7f08b33","resolution":{"observed_at":"2026-08-14T13:57:10.123202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.102639Z","title":"Short-dot: Computing large linear transforms distributedly using coded short dot products,","venue":null,"work_id":"e3b16196-8897-4f7f-9461-2d086ba4eab5","year":2016},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.302899Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:3b64189d3bb1628f63bcde6c77d7f38d5ddba707fda8d953e1c98fffb0e49592","observation_id":"571a74a2-a515-4cbe-aa24-37d5250c7302","resolution":{"observed_at":"2026-08-14T13:57:10.107619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.087722Z","title":"Oversketch: Approximate matrix multiplication for the cloud,","venue":null,"work_id":"ac834d7b-9f94-4407-ae33-e35e6d842514","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.307517Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:83a12ea66ebf46b45176415ff0f43ad66077b39214b7c79adf8110f3ac1daeba","observation_id":"8c6a96dc-27b3-40b3-a01b-544fd3d2c1b5","resolution":{"observed_at":"2026-08-14T13:57:10.092630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.072450Z","title":"Coded sparse matrix multiplication,","venue":null,"work_id":"0699f5e7-d427-4909-b6b3-427ea79f2986","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.312348Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:64cfe1794cb7d43762f4ab4667f84cb7eb53b7bee910142847417e3fd2c5d22f","observation_id":"2776defd-5985-4847-be89-3fdfcc93fc61","resolution":{"observed_at":"2026-08-14T13:57:10.077627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.056602Z","title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy,","venue":null,"work_id":"4575960b-980e-42e0-ae1e-ad8cfc22156b","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.317377Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:387a40009b93e8fbe2a586b4bdaa2260877b0153d2a6f9437656f045c449c03d","observation_id":"e0fb87ef-0f14-4d2e-9a1a-4e107bfe8296","resolution":{"observed_at":"2026-08-14T13:57:10.061697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.10460","last_updated":"2021-02-12T07:02:11Z","snapshot_observed_at":"2026-08-14T17:38:12.209529Z","submitted_at":"2018-12-26T18:52:41Z","title":"CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication","version":3},"cited_work":{"arxiv_id":"1812.10460","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.10460","snapshot_observed_at":"2026-08-14T13:57:09.561972Z","title":"CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication","venue":"cs.IT","work_id":"93806b78-6c8a-437d-8467-eabc52ffdf04","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.322043Z"},"links":{"cited_paper":"/paper/1812.10460","citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:a92a5217c9351d71f4c341e9150f1b075339ef069c64307b1638741dbf7621ed","observation_id":"a00c0b45-8ecd-4b05-b5cf-90e25a3ac8c0","resolution":{"observed_at":"2026-08-14T13:57:09.567275Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.040704Z","title":"Accessible privacy-preserving web-based data analysis for assessing and addressing economic inequalities,","venue":null,"work_id":"e3f9610f-8171-4f0f-98ad-c01d56c8dc67","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.327279Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:f666936213ebc8ffe8e178e86ecd2c4b2395fa3b8b77097c88def698864332a9","observation_id":"364895cc-fce1-4752-8488-0a364dd08e85","resolution":{"observed_at":"2026-08-14T13:57:10.045894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.024775Z","title":"Bishop, Pattern Recognition and Machine Learning","venue":null,"work_id":"b46f375d-edaf-49ce-b22d-f00c53c6375a","year":2006},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.331626Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:e46bf42b71c986d236ef06668a695028d9520a888bf59f6ccd7361e2f0575a02","observation_id":"88f7549c-2ec6-4fd8-b35a-437d5d31a379","resolution":{"observed_at":"2026-08-14T13:57:10.029418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:10.009517Z","title":"Entangled polynomial coding in limited-sharing multi-party computation,","venue":null,"work_id":"926e68f2-20dc-4c3d-af33-bdc74e385e93","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.336084Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:8d2f3e44f7181fc2b8f11774c2fc999aa1e8737bf64469fded4967b60aa7be36","observation_id":"55bbc5b9-d026-4502-8122-f4be07814338","resolution":{"observed_at":"2026-08-14T13:57:10.014263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.992315Z","title":"Coding for private and secure multiparty computing,","venue":null,"work_id":"c103f641-6471-4a78-9fb7-07c8f806cd90","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.341016Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:4fc9ae04275255c4c0757ed0b74f93496b12bbf364d06c9d15ff50ac16b079b4","observation_id":"67e3c3b4-9b94-4146-a593-ab5d71f5d9e9","resolution":{"observed_at":"2026-08-14T13:57:09.996985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1902.00641","last_updated":"2021-02-20T20:01:10Z","snapshot_observed_at":"2026-08-14T17:22:03.166724Z","submitted_at":"2019-02-02T05:09:39Z","title":"CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning","version":2},"cited_work":{"arxiv_id":"1902.00641","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.00641","snapshot_observed_at":"2026-08-14T13:57:09.538230Z","title":"CodedPrivateML: A Fast and Privacy-Preserving Framework for Distributed Machine Learning","venue":"cs.LG","work_id":"6ddbc79c-3fa3-41d3-874c-d1ff7fba60d3","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.346085Z"},"links":{"cited_paper":"/paper/1902.00641","citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:9d357c2525d780bf511965152aa7342c232fbcd552c147c88ab9fd439b0644db","observation_id":"90369a07-86a0-45c1-88a6-45d4257cd743","resolution":{"observed_at":"2026-08-14T13:57:09.544919Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.975531Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":"8c0154df-b697-4c60-8f14-8822f4ef8ba3","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.350804Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:f5a83ff3f9fc4fcef7275de64a42ac2ed49905221bdc6b437ebfa4ec746c32bc","observation_id":"cc64d4eb-d5a2-4ab8-90be-f47c194697d8","resolution":{"observed_at":"2026-08-14T13:57:09.980930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.959209Z","title":"On the capacity and straggler-robustness of distributed secure matrix multiplication,","venue":null,"work_id":"12145c7d-2c0e-4ed0-a572-fcfe269cb1fd","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.355157Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:d24a7292fdf5345393e3038b5eea15c57505dd8c3498ce58e58e71b7eb14beb6","observation_id":"eb161d70-edbe-4121-a737-f2fd0299e2ab","resolution":{"observed_at":"2026-08-14T13:57:09.964370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.940930Z","title":"Gasp codes for secure distributed matrix multiplication,","venue":null,"work_id":"9b209272-291e-4d65-931f-a0d403b4d7b2","year":2020},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.359325Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:607cce298dbe25393f3a6307d401a1f80aab102fc2fc48871f0150d9ba8fce6f","observation_id":"b1b9eac5-e3d4-42c7-9c67-2979242e7bd4","resolution":{"observed_at":"2026-08-14T13:57:09.947415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.06957","last_updated":"2021-06-22T16:39:38Z","snapshot_observed_at":"2026-08-15T03:21:11.196405Z","submitted_at":"2019-08-19T17:52:22Z","title":"On the Capacity of Secure Distributed Batch Matrix Multiplication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.06957","snapshot_observed_at":"2026-08-14T13:57:09.364103Z","title":"On the capacity of secure distributed matrix multiplication,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.364103Z"},"links":{"cited_paper":"/paper/1908.06957","citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:1279e2b1af3541f841ac0c43f0ba16dff2070d24844bf2b62c311a47c81d44f2","observation_id":"14acc4e0-b5b4-45b0-8d60-03ee6f0edc9a","resolution":{"observed_at":"2026-08-14T13:57:09.364103Z","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-14T13:57:09.922966Z","title":"Private secure coded computation,","venue":null,"work_id":"4114ed03-c12b-453f-9150-da62149acc8b","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.369666Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:d366a90615ef4ea1f09a431f0c84d72613864d236173bf3b7fcc1066965f16e2","observation_id":"309116f0-fbc0-4236-abf5-7410cb78931a","resolution":{"observed_at":"2026-08-14T13:57:09.928556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.906288Z","title":"Private and secure distributed matrix multiplication with flexible communication load,","venue":null,"work_id":"9ea2cc14-f4f0-4112-a791-9cf2be0d9ee4","year":2020},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.374028Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:02d964bb6a19b0485a6a9e28c5bdd8fd0acee92eb38244603b27a4a33d8ad18b","observation_id":"9a7c7515-bfe7-4e53-bb89-46d8e269f574","resolution":{"observed_at":"2026-08-14T13:57:09.911651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.889292Z","title":"Private sequential function computation,","venue":null,"work_id":"9929e5b9-738f-4fed-aec7-0754470ddd9a","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.378671Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:94dc2339e9ee70d81f3fdd9a901b3d3f3ea016279b7a18d4277276f6c489402e","observation_id":"f60f6f55-882a-4366-bd4a-6a7bb1354f76","resolution":{"observed_at":"2026-08-14T13:57:09.894722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.873358Z","title":"Private function computation,","venue":null,"work_id":"83422c35-3838-44b2-b7b2-1b80fcd792b8","year":2020},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.383265Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:18e2e54f25a751a3dd91f602b30e5a3ec861e42f924c7814fe17edf8b80f3186","observation_id":"fe82b404-b0a0-469c-bad6-7d699a4dd54f","resolution":{"observed_at":"2026-08-14T13:57:09.878224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.857314Z","title":"Numerical methods: analysis, algebra, ordinary differential equations,","venue":null,"work_id":"03a7d668-e1bc-4d4e-97f0-26a2197e66da","year":1977},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.387901Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:27dfb678119784f50e404e25cead5c46d905be642b8c226adebaa7d4ada35b4d","observation_id":"901fb577-ec41-4050-850f-5b6cb2c1b7c9","resolution":{"observed_at":"2026-08-14T13:57:09.862806Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.392824Z","title":"Fast polynomial factorization and modular composition,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.392824Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:a18cec7a92c45b888c8d9cea843e5c7e4b82f0071a7f782be69f7f31b01a971d","observation_id":"d42663e6-55a3-40c8-b0f8-cff67af2cc9e","resolution":{"observed_at":"2026-08-14T13:57:09.392824Z","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-14T13:57:09.831298Z","title":"Horner’s method — Wikipedia, the free encyclopedia,","venue":null,"work_id":"3d2e3f1f-7efd-4fd1-a1f3-93e0f0e5b49f","year":2020},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.397504Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:cb999465d328333b6592e907dcf2f501d74cc3684cb4acaec40163f0c792b819","observation_id":"40055d9b-059d-4314-be09-ff072302de8a","resolution":{"observed_at":"2026-08-14T13:57:09.836029Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.816852Z","title":"Practical covertly secure mpc for dishonest majority–or: breaking the spdz limits,","venue":null,"work_id":"4170480a-21e8-4565-b42c-cdb4f1236c44","year":2013},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.402599Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:2f250f03f336cef205e2efb4e726777cbd7589d97fb8ca3b9c0a7ec2e69327bc","observation_id":"798bce94-4f02-4fed-90dd-e07cd3ba1c56","resolution":{"observed_at":"2026-08-14T13:57:09.821598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.800789Z","title":"A note on the communication complexity of multiparty computation in the correlated randomness model,","venue":null,"work_id":"bc2029a1-364a-4932-b88e-9ec1fcb6b1cf","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.407553Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:26eaa56a0d541dadafbdf7132729736b1541a60c3bc7884fdf3ceccf8be6ba86","observation_id":"3ee806ba-89bc-4c4b-968f-e4f5c9d0bbbe","resolution":{"observed_at":"2026-08-14T13:57:09.805954Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.785422Z","title":"On the (in) efficiency of non-interactive secure multiparty computation,","venue":null,"work_id":"02234d86-5d30-4367-b08e-932ed3f933dc","year":2018},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.412442Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:8daf00bad12119b834b683bab91414a3b16d9efd35dd2a6bf4fb07aa6f2a6a6c","observation_id":"7bdc4548-bfe2-4e6e-8b71-2e051cc019aa","resolution":{"observed_at":"2026-08-14T13:57:09.790492Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.769517Z","title":"An efficient framework for unconditionally secure multiparty computation,","venue":null,"work_id":"3ea57f53-2f21-41b6-8dae-51b99ce003a6","year":2016},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.417490Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:85b827cab1573d4fe14abf6ebb2abb7a28eba01bb05ad0f1bcbc145ffd848bc2","observation_id":"7250f00c-90ad-4267-b8cd-d7a5587206b2","resolution":{"observed_at":"2026-08-14T13:57:09.774589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.754324Z","title":"Secure coded multi-party computation for massive matrices with adversarial nodes,","venue":null,"work_id":"cab6aa0d-ea5c-4fb3-af79-dfd9dc51ddb0","year":2019},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.422878Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:776ff27d5b75e2c98659c7e34d3f64575d4142b77fb74dc448a7e66614f54c23","observation_id":"cd18061f-07b7-4839-b03b-d209004b57d3","resolution":{"observed_at":"2026-08-14T13:57:09.759151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.740278Z","title":"Generalized vandermonde determinants and applications,","venue":null,"work_id":"3a712775-58be-41a2-83f0-3e03b0188f38","year":2002},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.428000Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:ea945596bd02436a2610ce57d3ee1d13407458d44cef6531d733b28d326e047c","observation_id":"f50accb4-d7a9-4a69-a881-c137cc2a7347","resolution":{"observed_at":"2026-08-14T13:57:09.744733Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.725404Z","title":"On the computation of the determinant of a generalized vandermonde matrix,","venue":null,"work_id":"fd160a24-fb3a-4d71-9cd3-6148a9609335","year":2014},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.433498Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:c1a248aab165092b2ee1b454ccd4cf78f097e3673994293575ad23088c9f34f3","observation_id":"6b6be6c0-7c10-4eaf-acd8-ba28f4fed939","resolution":{"observed_at":"2026-08-14T13:57:09.729877Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.709638Z","title":"Schur polynomial — Wikipedia, the free encyclopedia,","venue":null,"work_id":"4d36a2ad-44e6-4e60-806e-ab4dac54e535","year":2020},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.438832Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:005791ee608e7be84f5d0fd98713825d2dfca350376d1235751a642edfb99037","observation_id":"1adfd883-4393-435e-a968-741ad8fd855c","resolution":{"observed_at":"2026-08-14T13:57:09.715391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.693885Z","title":"An algebraic approach to network coding,","venue":null,"work_id":"3d5bcfeb-2dea-48a8-89a3-8f3a1a831334","year":2003},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.443603Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:3cb0163c2d547054ead692fe22eedde23b688ee1afdcab94b1859b1d61d8eab6","observation_id":"dc973822-59e5-44c7-b312-6478a47fcb09","resolution":{"observed_at":"2026-08-14T13:57:09.699254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.678043Z","title":"Fast probabilistic algorithms for verification of polynomial identities,","venue":null,"work_id":"ffe8bded-17de-463c-b489-dea68be5b62c","year":1980},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.449583Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:564c0e1d45be1d71ea044437c72aba0c19ad967385a331f9aa24aa3159dc129e","observation_id":"3da96833-7689-4b53-9b6f-c5d6e8a2de8a","resolution":{"observed_at":"2026-08-14T13:57:09.683586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.662281Z","title":"Probabilistic algorithms for sparse polynomials,","venue":null,"work_id":"644b567c-7838-43b0-b4f0-cbb5dc457ad7","year":1979},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.454394Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:1c06126713c54b0fa1df81abb4683a68f672d9a4cd3d0ccaf4a3291a0897c474","observation_id":"8ecb5fdc-e907-46b7-9e51-9e1340951f84","resolution":{"observed_at":"2026-08-14T13:57:09.667384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.645263Z","title":"Therefore, in this case non of the coefficients of H(x), is equal to zero","venue":null,"work_id":"d3b8d5b4-f931-4634-8e8b-df13d5f44951","year":null},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.459250Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:f437658b97ef018f5253a60facf4fb078e21162aa4fe9f988c7d99027be882be","observation_id":"3a8ed648-15f6-4a6c-a4e1-fbcd4fc24422","resolution":{"observed_at":"2026-08-14T13:57:09.650259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.628171Z","title":"In this case we claim that the number of zero coefficients of H(x) is (k−t + 1)(k− 1), thus the number of nonzero coefficients is (2k2 + 2t− 3)− (k−t + 1)(k− 1) =k2 +kt +t− 2","venue":null,"work_id":"8f6279b6-736f-4f62-84f7-596cae9753fd","year":null},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.464248Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:0dc90c4e0b71b968b5959a6c498107d425aae6ce6cd53005ce24260fac88c9d4","observation_id":"201d2389-d447-4147-9e58-9ff875294a58","resolution":{"observed_at":"2026-08-14T13:57:09.633966Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.611812Z","title":"In order to represent this function, first we multiply the last two matrices ( X[Γ−1], X[Γ]), then we multiply X[Γ−2] to the result of the previous operation and so on","venue":null,"work_id":"d26776e5-ba61-4922-89f3-593515f920de","year":null},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.470103Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:6abb210d5b44e085e462c30c9749196ef6d6482fde6a514217e2c675b4277d74","observation_id":"af455ef4-0119-4520-9a5d-81b636722ea1","resolution":{"observed_at":"2026-08-14T13:57:09.617199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.594445Z","title":"In order to represent this function, first we add the last two matrices ( X[Γ−1] + X[Γ]), then we add X[Γ−2] to the result of the previous operation, and so on","venue":null,"work_id":"aea3994d-43eb-47e6-9831-93ccdeac891d","year":null},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.475335Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:646ea5e7c4c62aa62d887bb1d8db0c2600359ef9ca0d3141a43d359e5f4da660","observation_id":"9e06f2a9-60ac-449b-bd03-4ecf21e9a4a2","resolution":{"observed_at":"2026-08-14T13:57:09.600037Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-14T13:57:09.578304Z","title":"The representation and order of computation are shown for an example in Fig.4","venue":null,"work_id":"2ecd1e15-803c-4317-88ee-1f64dc3f14dc","year":null},"citing_paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T13:57:09.480108Z"},"links":{"citing_paper":"/paper/1908.04255"},"observation_digest":"sha256:b197796a60ec5d8a0669a65e0e48d4dd1fed1ac68fd02daf237d9dd0a0d3396b","observation_id":"c00079ba-3282-46bc-a049-2506a71aab41","resolution":{"observed_at":"2026-08-14T13:57:09.583445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.04255","last_updated":"2020-09-15T16:21:59Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-15T05:17:30.143160Z","submitted_at":"2019-08-12T17:09:26Z","title":"Secure Coded Multi-Party Computation for Massive Matrix Operations"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":46},"total_outbound_references":52},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:1908.04255."}