{"as_of":"2026-08-20T02:38:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e44b4f3e44715a38a357c699ad7b29386471fa429c629233489cf6206b3b478c","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T06:09:16.016139Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2412.17003/citation-record","integrity":"/paper/2412.17003/integrity","json":"/paper/2412.17003/citation-record.json","paper":"/paper/2412.17003"},"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-11T06:09:16.254955Z","title":"On linear and cyclic codes for correcting deletions","venue":null,"work_id":"19925fde-8955-4fd3-bc03-c60582166eb7","year":2007},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.942690Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:d4a8df800f982479514ba02c2608283b714a3bf7e6c9ffde2596a9d2b9dc0846","observation_id":"3185c499-7a04-4290-9ba2-1a113ce1828b","resolution":{"observed_at":"2026-08-11T06:09:16.257245Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.248551Z","title":"Secret-sharing schemes: A survey","venue":null,"work_id":"99ae9c62-ca24-42cf-ab79-0a75b9080c70","year":2011},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.945708Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:87dc018c5b06fb5b5cc655aa6b8ffb4b5ad2b6e75a2abfb0b49a75da231f91b3","observation_id":"7d2a75b0-5f85-4f6a-9247-371d50cab8f0","resolution":{"observed_at":"2026-08-11T06:09:16.250747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.242319Z","title":"Fully anonymous secret sharing","venue":null,"work_id":"17624292-50d8-4b74-a912-ec44025199a5","year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.948083Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:3d656240aacda8f12ee9ff4bb0d07788461ef4bece2c96bbaddfb3e704383575","observation_id":"39d797c9-a55d-4a11-97d6-dea3dc4f7854","resolution":{"observed_at":"2026-08-11T06:09:16.244677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.236380Z","title":"Threshold secret sharing requires a linear-size alphabet","venue":null,"work_id":"3e8514ed-84ef-4729-9d0e-bd4be6457dab","year":2020},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.950414Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:2c55c08f6d5a935aab7975e5bad6e48e66850767a130932efb45a009c4d47af4","observation_id":"ffa69d64-9cc0-43f6-974f-7e90d30eac0e","resolution":{"observed_at":"2026-08-11T06:09:16.238685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.230266Z","title":"Anonymous secret sharing schemes","venue":null,"work_id":"22ba3c7e-964c-4457-8404-49662564d9e3","year":1997},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.953064Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:491e6b0bfbecfbc46f08c343f40cde296aa65712882f40be0521136ce3777d8f","observation_id":"35495368-b875-4d40-974c-5855494a0028","resolution":{"observed_at":"2026-08-11T06:09:16.232586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.223986Z","title":"Efficient linear and affine codes for correcting insertions/deletions","venue":null,"work_id":"f2054906-9af4-4a55-9c31-24c6b8afdb6a","year":2023},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.955442Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:54fa841d81fd49b68a2e79acaec9008e6e1c57553a0f9ccf43e3748340fa445f","observation_id":"9c391ef3-7994-43e8-b53a-693353b3e502","resolution":{"observed_at":"2026-08-11T06:09:16.226438Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07299","last_updated":"2024-07-10T01:41:15Z","snapshot_observed_at":"2026-08-16T13:35:36.208236Z","submitted_at":"2024-07-10T01:41:15Z","title":"Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.07299","snapshot_observed_at":"2026-08-11T06:09:15.958158Z","title":"Random reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.958158Z"},"links":{"cited_paper":"/paper/2407.07299","citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:18735bd11c65ed4bd68a67124490052ba5f00277930b5be7233809b0b7be895b","observation_id":"b7aaef16-1b45-4739-8cbc-64d273368ac9","resolution":{"observed_at":"2026-08-11T06:09:15.958158Z","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-11T06:09:16.217608Z","title":"Jewels of stringology: text algorithms","venue":null,"work_id":"f5d87aad-ba1e-4bb7-b192-94421dcd1f69","year":2003},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.961081Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:9136dc59d41022a377066e2e4e1c5942665823f840afe5b3478331dd16660626","observation_id":"7664df48-175f-43d5-be70-dfcc2f0b585e","resolution":{"observed_at":"2026-08-11T06:09:16.219859Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.211164Z","title":"An overview of capacity results for synchronization channels","venue":null,"work_id":"c126a565-fbce-4a04-aaac-0324956481f6","year":2020},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.963989Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:f09b036c16993800bf5d4b7457641f3ea03087751550113f961f864047c73045","observation_id":"609a4152-716c-4fea-8fb3-b2b6edada17d","resolution":{"observed_at":"2026-08-11T06:09:16.213635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.205222Z","title":"Reed--solomon codes against adversarial insertions and deletions","venue":null,"work_id":"39735a85-1fb2-44c6-a60f-8a07b17fc8c6","year":2023},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.966252Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:ef33dd4e415bf8ed0744201d74fa18d8387c0f03b89f53c0e8eab40514606ea9","observation_id":"7eda4b3b-f7d9-4ae0-a6bd-36a0ab6cc112","resolution":{"observed_at":"2026-08-11T06:09:16.207341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.198841Z","title":"Optimal two-dimensional R eed-- S olomon codes correcting insertions and deletions","venue":null,"work_id":"50d77fc5-f0f5-486e-9987-52429fe19914","year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.968409Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:6c26cd9f33f687313be1576a625271a0249c0ce6df64e78659740f57c4f3a1e5","observation_id":"c0a4fe8f-b8cc-4f22-a541-61817f7fd0cd","resolution":{"observed_at":"2026-08-11T06:09:16.201089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.192571Z","title":"A probabilistic remark on algebraic program testing","venue":null,"work_id":"bc210d12-92ce-4171-935e-78419b7cfc7b","year":1978},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.970421Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:e656acc1a6bb321a48b6ab18617ab9b89331ff0e4acdb604908637b93c077ff3","observation_id":"f1416f3a-c964-4018-b3b8-27e886c1b9ee","resolution":{"observed_at":"2026-08-11T06:09:16.194828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.186405Z","title":"Explicit constructions of two-dimensional R eed- S olomon codes in high insertion and deletion noise regime","venue":null,"work_id":"b989716a-b10c-46f0-a5cc-b6e4cd2bd5c4","year":2021},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.972694Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:03c16d4d2944412703ccbac182b3a96a34415abad1dc9cd92b8b65353422e1a9","observation_id":"0dffb24a-5a01-4e58-81b8-7a89a172c9b0","resolution":{"observed_at":"2026-08-11T06:09:16.188838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.180109Z","title":"\\ Abuse-Resistant \\ location tracking: Balancing privacy and safety in the offline finding ecosystem","venue":null,"work_id":"a4c51784-07ce-472f-928d-a4c8d7b91818","year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.974658Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:93615f63173ded0281a161928011a63fadbe2eb7792d9191f84710d0bd3b1af5","observation_id":"ead662a7-f442-415a-b205-2cb281cf3427","resolution":{"observed_at":"2026-08-11T06:09:16.182728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.173433Z","title":"Providing anonymity in unconditionally secure secret sharing schemes","venue":null,"work_id":"bdf67336-4307-4cb6-b302-a22db7482dd2","year":2003},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.976867Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:3656d4e9a47444c984a90e3d97e142cb270d1e97d1cec2bf71e1753625860197","observation_id":"caaf544c-56ef-409f-a6c2-d8301ae57667","resolution":{"observed_at":"2026-08-11T06:09:16.175903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.166441Z","title":"Synchronization strings and codes for insertions and deletions - A survey","venue":null,"work_id":"b24fe7ec-dd27-4624-adea-79b5c38b4ae8","year":2021},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.978935Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:268b6be5f18f3b54501fae80e56226797e4359297e01a025598c8fecf5302143","observation_id":"41d002e9-5577-4cc7-b410-e01c98d0b73e","resolution":{"observed_at":"2026-08-11T06:09:16.168982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.159774Z","title":"Synchronization strings: Codes for insertions and deletions approaching the singleton bound","venue":null,"work_id":"50ca0b87-3a40-44a4-9e16-b39428a30d4b","year":2021},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.980844Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:1f26a786f1f9562b7fca62768cd4b89e0dbe99380a72dbf0e27ca7416e19b8a2","observation_id":"4031c1b1-6d95-40d3-ace6-7d3dedc04889","resolution":{"observed_at":"2026-08-11T06:09:16.162290Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.152555Z","title":"A new (k, n)-threshold secret sharing scheme and its extension","venue":null,"work_id":"c2eef180-f936-4e00-acf0-1e0b76003ca1","year":2008},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.982788Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:51ac60ba7a0bb9186f575e14a416b75e2291756810fa7d1a771e476e24f38573","observation_id":"a19ba4bd-8262-438b-81a1-cba22eaae066","resolution":{"observed_at":"2026-08-11T06:09:16.155022Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.145926Z","title":"On the bound for anonymous secret sharing schemes","venue":null,"work_id":"8af926f3-ccee-4984-8b74-a77441f864f6","year":2002},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.984587Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:7538bf98844a054194d09dde0b9f2055ebbd5279c16f2d9973c2af4577fbcc99","observation_id":"50abfd08-c022-450a-911d-abc35809a9bc","resolution":{"observed_at":"2026-08-11T06:09:16.148267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.138774Z","title":"Codes in the space of multisets—coding for permutation channels with impairments","venue":null,"work_id":"ac6dd36d-22fa-41c8-9c24-b152c1bb6528","year":2018},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.986559Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:7f8083751898d18cd01dc8b7640354bb4a9f04879cef0ac89bfcc0fb68adeab1","observation_id":"54d0a846-46c8-40f0-aaf6-11900727a77d","resolution":{"observed_at":"2026-08-11T06:09:16.141277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.131784Z","title":"Optimal RS codes and GRS codes against adversarial insertions and deletions and optimal constructions","venue":null,"work_id":"bc97a8b8-8842-454e-8d44-b90f8bb64dc3","year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.988614Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:a68d223b75ba3dc95ac65b49c351afda05d813c390c47e08691970b440ecea8a","observation_id":"350f41c5-8c32-4af5-8732-1f72d4410228","resolution":{"observed_at":"2026-08-11T06:09:16.134250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.125010Z","title":"On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability","venue":null,"work_id":"9857738d-8e10-4fe5-a202-04824929fe82","year":2021},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.990747Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:42adc17c10d8edf1876981ad941f44aefbef7e3202913c5c18b0a5a3b2ef4114","observation_id":"bfbe5c8a-980e-46ba-88f4-4d2ec70f1713","resolution":{"observed_at":"2026-08-11T06:09:16.127422Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.118619Z","title":"A survey of results for deletion channels and related synchronization channels","venue":null,"work_id":"86a7347a-d9dc-4d96-8da7-32f77b291378","year":2009},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.992695Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:15198b3783f589792a50bd708635d876020b6e15f8ddac773881d567ac628ea1","observation_id":"ff107a49-964d-4c39-9196-e3979b1f63d9","resolution":{"observed_at":"2026-08-11T06:09:16.120837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.111294Z","title":"On cryptographic anonymity and unpredictability in secret sharing","venue":null,"work_id":"7897eb4b-15c2-4ed5-aac6-d1d480207075","year":2020},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.994423Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:9ce39107b9e322ca120128f30948d8128d3cfa5e92a7a802ae5752540ee4144d","observation_id":"300cabb7-0782-4a91-ae4c-a2ee5873276b","resolution":{"observed_at":"2026-08-11T06:09:16.113654Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.104736Z","title":"Strongly ideal secret sharing schemes","venue":null,"work_id":"33dd0a85-542a-4d02-83fb-7d4b98167c71","year":1992},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.996327Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:cb548fe41c5f92c2bdc93d367daef9339a789c0062a30564cd551aba9a955d8b","observation_id":"1fd8f3d7-1a82-488b-951c-e6b8a35fb3f3","resolution":{"observed_at":"2026-08-11T06:09:16.107052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:15.998157Z","title":"Polynomial codes over certain finite fields","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.998157Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:183df2c749f62c379a5cc4d446ee5453f3cf6406c3f20492b1079de455e90bd0","observation_id":"da8009a8-c396-4a4d-a833-14d41584a2cd","resolution":{"observed_at":"2026-08-11T06:09:15.998157Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T06:09:15.999982Z","title":"Fast probabilistic algorithms for verification of polynomial identities","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:15.999982Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:ba97d9b8be619d91692f4ab854ec69c0b82a278b82733826efdff8011e2b8b90","observation_id":"0de84219-6020-4315-b8a7-d83c4789b9f4","resolution":{"observed_at":"2026-08-11T06:09:15.999982Z","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-11T06:09:16.089887Z","title":"How to share a secret","venue":null,"work_id":"5fee39c3-03c5-4302-8174-dfbe403280fb","year":1979},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.001746Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:2489e7e6cbaf6264c65c08dbdb47f3e34930b6c2669a8d38cff6c1495ab26c0a","observation_id":"acaed09e-0af2-4f57-882c-261b9826376d","resolution":{"observed_at":"2026-08-11T06:09:16.092607Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.081880Z","title":"Survey for a decade of coding for dna storage","venue":null,"work_id":"b1541654-a534-4bef-8914-c9e85685ae89","year":2024},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.003944Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:11a0e8bfac7091d4380ca4303dab0b167aaa770be45e8af2b5ae681813345ba6","observation_id":"f92ac789-0adf-4c3a-9b80-0737e406ce38","resolution":{"observed_at":"2026-08-11T06:09:16.084478Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.074732Z","title":"Traitor tracing for shortened and corrupted fingerprints","venue":null,"work_id":"41d7c49a-ccf2-43fd-8181-4073980535e5","year":2002},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.006357Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:4c41e3a514bb48f11ecabec8dd61ee390f7cb2346ea53bb99e19b8a46116fcad","observation_id":"34ef133a-c2f6-4d1c-a969-c91aa6187a8d","resolution":{"observed_at":"2026-08-11T06:09:16.077212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.067833Z","title":"A combinatorial approach to threshold schemes","venue":null,"work_id":"a84ff864-d3f4-4f08-aace-8f0d36ec84f9","year":1988},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.008396Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:bcd5daf0b06e04bf4f3fb8c05e71d7e31931fd92cb943baae3fe48ec58a46bfd","observation_id":"22928950-cbba-45cd-a7cf-e53ebab0f7dd","resolution":{"observed_at":"2026-08-11T06:09:16.070272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.060303Z","title":"Construction of deletion correcting codes using generalized Reed--Solomon codes and their subcodes","venue":null,"work_id":"95a812a6-5135-4049-8a27-5214f19c76df","year":2007},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.010281Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:5eaae207753b3085c18e04a44a5f7c0f403b2ad05514f495d5cd6f1794e5bf9c","observation_id":"b226fe07-8b14-4f55-912e-94c903f4f8d7","resolution":{"observed_at":"2026-08-11T06:09:16.062999Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.053398Z","title":"Vanishing polynomial sums","venue":null,"work_id":"17eb9be8-f653-4936-b42d-6e1c340f5784","year":2003},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.012212Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:1ee762c1092352ac3208d9fe1feef4593bf9589c80ac6327f31f1f22a4cee230","observation_id":"5851f448-1052-4159-b29b-4a73dcb2783b","resolution":{"observed_at":"2026-08-11T06:09:16.055803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.044194Z","title":"Deletion correcting using generalized Reed-Solomon codes","venue":null,"work_id":"d6d12498-9ad9-47fc-b955-8a44dc687513","year":2004},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.014176Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:6dee6129cafe493d07284ab8bb5aa06744ac21d7846f1e66b8701271a79c1cf0","observation_id":"c47e70af-9d08-4f9f-a39a-6296cd6f9666","resolution":{"observed_at":"2026-08-11T06:09:16.048715Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T06:09:16.016139Z","title":"Probabilistic algorithms for sparse polynomials","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T06:09:16.016139Z"},"links":{"citing_paper":"/paper/2412.17003"},"observation_digest":"sha256:918be745dcde188838dceb34904139a1c3a9a1aacaddb230c97eead2aa6c6fe8","observation_id":"27c32feb-084c-428b-bb88-9678476bb67c","resolution":{"observed_at":"2026-08-11T06:09:16.016139Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.17003","last_updated":"2025-06-26T12:45:57Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-19T18:24:58.151554Z","submitted_at":"2024-12-22T12:51:16Z","title":"Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":31},"total_outbound_references":35},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2412.17003."}