{"as_of":"2026-08-21T12:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f7c3442b9307c9d6f9686ea87e81bf190c0b0abbe0f85bae98de52011a5690b0","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T12:13:30.288998Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2504.13757/citation-record","integrity":"/paper/2504.13757/integrity","json":"/paper/2504.13757/citation-record.json","paper":"/paper/2504.13757"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.04063","last_updated":"2021-02-08T08:52:19Z","snapshot_observed_at":"2026-08-16T18:47:06.273077Z","submitted_at":"2021-02-08T08:52:19Z","title":"$\\scriptstyle{BASALT}$: A Rock-Solid Foundation for Epidemic Consensus Algorithms in Very Large, Very Open Networks","version":1},"cited_work":{"arxiv_id":"2102.04063","doi":null,"metadata_source":"pith","pith_arxiv_id":"2102.04063","snapshot_observed_at":"2026-08-16T12:13:30.372615Z","title":"$\\scriptstyle{BASALT}$: A Rock-Solid Foundation for Epidemic Consensus Algorithms in Very Large, Very Open Networks","venue":"cs.CR","work_id":"b58de6a7-e3c9-4ae4-927f-8ddc9abf0320","year":2021},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.825981Z"},"links":{"cited_paper":"/paper/2102.04063","citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:86274d873a83ea2b70ef57eb1c874708b5ffd7a19af9fcd53a8f727f88fdef78","observation_id":"476161e1-7d56-44a4-9587-f885a5550644","resolution":{"observed_at":"2026-08-16T12:13:30.377367Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.282125Z","title":"Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes","venue":null,"work_id":"75c3e45b-3dc1-4d71-84a5-7f4ece5df506","year":2010},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.928497Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:6ccc0fdffaa850d7868ddcb4b4951052526fb18697fac81af17cb6e745a6beac","observation_id":"580118e5-3cb4-4909-b7a2-b253c86e4961","resolution":{"observed_at":"2026-08-16T12:13:33.346801Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.193130Z","title":"Locally self-adjusting tree networks","venue":null,"work_id":"e20c1a29-c1ea-4246-a019-fa965de00db9","year":2013},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.969288Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:3a08dbe70a2ad2be592ac5f522d6bac992b08d461f14ccb8f5cfe540e8c75e64","observation_id":"caebff42-5222-4baa-83cb-108b17128e55","resolution":{"observed_at":"2026-08-16T12:13:33.198160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.180902Z","title":"P A N D A S : A P ractical A pproach for N ext- G eneration D ata A vailability S ampling","venue":null,"work_id":"e047b5e8-f9da-42a8-9059-23b64f95216b","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.974691Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:4bd40744cc4acb2333eb2fa25e25cb918b802cc51b76c3d3769fafff4e58c634","observation_id":"ce93ccec-7a6e-41d9-a4eb-7659bf3de5ce","resolution":{"observed_at":"2026-08-16T12:13:33.184924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.169436Z","title":"Skip graphs","venue":null,"work_id":"1d3581ef-6b15-40d5-9de5-b7871be90e44","year":2003},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.980229Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:cf0b565e79813e9b96cde3b12dc376227558cfbd8f212fe95d696e44c3037a5f","observation_id":"a38bd587-b313-4723-9d3e-2abac029d78f","resolution":{"observed_at":"2026-08-16T12:13:33.173166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.157878Z","title":"a ki, Arto Lepist \\","venue":null,"work_id":"db1026be-8ce0-4a48-ae00-8dd9f8f295c1","year":2004},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.985085Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:1daef82412a040e393e0a12e92b83b35bfc336d255e2a3422e1ccd001fe3150c","observation_id":"354d0a52-8a76-4195-a99c-63d4494eb80e","resolution":{"observed_at":"2026-08-16T12:13:33.162113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:33.145128Z","title":"Robust random number generation for peer-to-peer systems","venue":null,"work_id":"0b0e601c-c19d-4dd5-95a2-92a9292e9ae0","year":2006},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.989325Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:ffac68f8ba88d61e7733ee9b47720b85b18d9c1659b610528d10ba5a8e373605","observation_id":"ab17b332-fe99-4d09-a625-0a3f36d1bb16","resolution":{"observed_at":"2026-08-16T12:13:33.149658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.929886Z","title":"Towards a scalable and robust DHT","venue":null,"work_id":"258de38e-9f16-4519-97c1-16b5d4a8e558","year":2006},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.994003Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:6bc80b550c8b3de2f9e7428fd4ce525e33e488db3ec0a5c4935b3615fd5338cd","observation_id":"e370dca7-8102-4674-8d88-fa6569ba0b6a","resolution":{"observed_at":"2026-08-16T12:13:33.021980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.812079Z","title":"Towards scalable and robust overlay networks","venue":null,"work_id":"e37e55ed-e510-4e0e-b688-b35057448d76","year":2007},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:28.998706Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:fd29ed59eb53d0cfce57a0ceb0b36489df6542deae2bde46bd87283544dc5316","observation_id":"9c2f473d-2cea-4da8-b402-667409d9ec7a","resolution":{"observed_at":"2026-08-16T12:13:32.864395Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.800117Z","title":"Fraud and data availability proofs: Detecting invalid blocks in light clients","venue":null,"work_id":"f17d6e90-2625-43af-8a91-38c6f9aa3d29","year":2021},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.003050Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:e3a14fb97575fdb3cc58af2427bcffbb54dc809f301b5530e3c490cf9b1e9fdd","observation_id":"1feaa8d0-ab66-4550-8f0f-4b41658f78f0","resolution":{"observed_at":"2026-08-16T12:13:32.804580Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.787756Z","title":"The expansion and mixing time of skip graphs with applications","venue":null,"work_id":"396c4c02-eeed-4e4b-82db-0a0b5ff1607d","year":2009},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.007607Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:970986075891f43c4a7ea2481fc09d6ca7b7424ca0d759c1825c3356959b8b9e","observation_id":"b2b87d90-dd15-42be-a73b-9a963ed5780e","resolution":{"observed_at":"2026-08-16T12:13:32.792154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.775855Z","title":"Constructing distributed doubly linked lists without distributed locking","venue":null,"work_id":"3b4794a6-58f9-408b-9634-b019adced9af","year":2015},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.108265Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:06b9f54925809a79bf791bd7761f11fefadb0e7566c160deefa5aad75c7906bc","observation_id":"f222d52b-f5b9-46b9-8838-65422b281232","resolution":{"observed_at":"2026-08-16T12:13:32.780194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.764227Z","title":"Brahms: byzantine resilient random membership sampling","venue":null,"work_id":"2daec99e-e59b-46af-8997-14f016efa11c","year":2008},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.182625Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:f43191255f1030a25bb55930b5bdf0e8f32c23dc8f73e3a5b700501faeb34fb5","observation_id":"b155feb3-58fa-424b-8ad8-8b987206738c","resolution":{"observed_at":"2026-08-16T12:13:32.768814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.714723Z","title":"Better space-time-robustness trade-offs for set reconciliation","venue":null,"work_id":"3bb250b4-0db3-44a9-91dc-1adcc860de1c","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.188307Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:61350118f65c600ca355e9206f4c7f47e31945bddaf148ec3e759e01e6333fb6","observation_id":"7dee26af-72d9-45dd-af76-4412fc648c9b","resolution":{"observed_at":"2026-08-16T12:13:32.756212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.608795Z","title":"S/kademlia: A practicable approach towards secure key-based routing","venue":null,"work_id":"b8f9e99a-e546-42b5-9228-ad78c7f4287a","year":2007},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.192502Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:85429fefda3cc47a834f42cadde1e18343927015fc5b801b4924967c6f373e3d","observation_id":"0e590619-2017-4a32-b959-740ff2a6b913","resolution":{"observed_at":"2026-08-16T12:13:32.623864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.595145Z","title":"Random oracles are practical: A paradigm for designing efficient protocols","venue":null,"work_id":"42c6ce40-38cb-4d73-923a-10d9459499e2","year":1993},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.196695Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:fb43ff3798bda046cb0f1eead139baa9e7b9497e943733157703aa1b54c0305b","observation_id":"c49471aa-5898-4439-9487-3306c9d093c7","resolution":{"observed_at":"2026-08-16T12:13:32.600385Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.582323Z","title":"Skip suffix array: A partial match retrieval method on structured overlay networks","venue":null,"work_id":"a4a2101c-4e44-40a7-925c-f442618530b7","year":2020},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.202187Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:ee864b5120c4d37559b2850236afc5c1f775f5ceae3802fb6606437ddf15227f","observation_id":"5e864b0a-fd68-4736-93ff-8100217fe614","resolution":{"observed_at":"2026-08-16T12:13:32.587589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.569647Z","title":"Ganesh, Antony I","venue":null,"work_id":"3d111a08-cf5b-4f22-8d47-e7ae032b528c","year":2002},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.206896Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:1add09b7aa515eb1ee1b2d6e99e7fa92f0b1344845c3ada816c49a38af9fa9e9","observation_id":"ff9c04ae-de1c-42fc-a771-f0ca71576f4e","resolution":{"observed_at":"2026-08-16T12:13:32.573910Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.557075Z","title":"N umber of peers you need for peer sampling in P eer D A S ( E I P -7594)","venue":null,"work_id":"febc8bf9-2b56-49d4-acbe-c254346fb9c3","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.210939Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:e5ecaab49d70ee771b4d2fddd6bbc88202c0222a068efae5c9f2b2efc7aaebb9","observation_id":"bb37358b-7b30-4dc5-b36c-88ccc150d182","resolution":{"observed_at":"2026-08-16T12:13:32.561485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09993","last_updated":"2024-02-15T14:56:44Z","snapshot_observed_at":"2026-08-16T14:18:17.673546Z","submitted_at":"2024-02-15T14:56:44Z","title":"Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum","version":1},"cited_work":{"arxiv_id":"2402.09993","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.09993","snapshot_observed_at":"2026-08-16T12:13:30.352673Z","title":"Scalability limitations of Kademlia DHTs when enabling Data Availability Sampling in Ethereum","venue":"cs.NI","work_id":"9cf2c8ef-1d61-4538-a090-ac1972016e00","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.216116Z"},"links":{"cited_paper":"/paper/2402.09993","citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:c5597a893049cd41321dfccdd32884631277b65b6598243fecd48b56d082c756","observation_id":"29d02863-71e3-4cde-9a76-4efe817559f9","resolution":{"observed_at":"2026-08-16T12:13:30.358899Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.544330Z","title":"The accidental computer: Polynomial commitments from data availability","venue":null,"work_id":"a2d5e308-d650-4606-b43e-9ea150431c99","year":2025},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.258550Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:55e6adea5e26b02e87fd5bf58311c58218ef601636783c84e8d14e300041a65d","observation_id":"4f2bea91-67a1-44ad-a041-f02ec7350518","resolution":{"observed_at":"2026-08-16T12:13:32.549111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.346124Z","title":"ZODA : Zero-overhead data availability","venue":null,"work_id":"2e60aabb-5c48-499e-88f1-3c54c365418a","year":2025},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.345118Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:002971f1a89d78b8c0724078ebf25b458b59ca8ccc75e4211ad3843bdbf52ca7","observation_id":"c7d0bd92-8fc9-4f92-ba26-6c40dffd370c","resolution":{"observed_at":"2026-08-16T12:13:32.470011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.142208Z","title":"Censorship resistant peer-to-peer content addressable networks","venue":null,"work_id":"9d0d7607-ac8e-4272-ae08-3b6c109b6e22","year":2002},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.440087Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:1877010c6da87671d40fb6ad3b69ea9097c0336fd7a34a1dedf8e5f8f5ad4c04","observation_id":"2c7bba95-c03c-475c-98e6-afe165e2f743","resolution":{"observed_at":"2026-08-16T12:13:32.248619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.049438Z","title":"Distributed arrays: A P2P data structure for efficient logical arrays","venue":null,"work_id":"11c466a1-bbf7-43dc-9a6a-e7d29433518a","year":2009},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.481358Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:768336afa592744381c05fa4e5dd49884488e863d294b629b7944def57be70b3","observation_id":"ce1af269-24c9-41d3-8826-4598905eaf78","resolution":{"observed_at":"2026-08-16T12:13:32.053100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.038599Z","title":"Making chord robust to byzantine attacks","venue":null,"work_id":"57fd98ce-8b23-4b96-8f8c-1e50951d2818","year":2005},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.485030Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:aa2a24359e9db70765e7d87712f0b98ab7b71375cb599f03f87055fa17950ada","observation_id":"afd67e82-c0a2-416d-a0e1-bc2c28b90367","resolution":{"observed_at":"2026-08-16T12:13:32.042532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.026975Z","title":"Birman, Prakash Linga, Alan J","venue":null,"work_id":"7bff03cb-8a57-4730-8cfb-dafba31ab1e3","year":2003},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.488018Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:f91bd3b7636583e09f688b2519e481b0ee8759473e284ee4d65c2e3a8ccf744e","observation_id":"fb63b865-af60-4afc-b9f1-a3f8a40ef74a","resolution":{"observed_at":"2026-08-16T12:13:32.031133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:32.016060Z","title":"Highly dynamic distributed computing with byzantine failures","venue":null,"work_id":"d06b73db-755d-4889-920c-7283d619fe79","year":2013},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.491926Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:eacb88f6abdbc30079925a3ce4d103f754c050db53d9347c9b8a3d07cf035a66","observation_id":"5cef1a2d-c979-4471-bdcf-5ba8fcca8ee6","resolution":{"observed_at":"2026-08-16T12:13:32.019336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.980726Z","title":"Gonz \\' a lez - Beltr \\' a n, Peter Milligan, and Paul Sage","venue":null,"work_id":"878cb8c0-fb09-4eb2-9a48-6c96c3aa70f8","year":2008},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.495521Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:bbc202c7f7c4dc9fb58097481e5a0b7e7461b0d98c777122c9657667bfcb17af","observation_id":"c9382ef1-1911-44a9-b23c-6ff88c19e04a","resolution":{"observed_at":"2026-08-16T12:13:32.006342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.857963Z","title":"Goodrich, Michael J","venue":null,"work_id":"64642a7a-f188-4acf-bf7d-cd06c9437d75","year":2006},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.500530Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:0ec26be188a7fd990aed40949b491b3ee4c1ddf77ce142fcd8e895d6d3d2b874","observation_id":"bac45611-9f11-44e3-abf6-01d91aaa8955","resolution":{"observed_at":"2026-08-16T12:13:31.932932Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.738195Z","title":"On the size of pairing-based non-interactive arguments","venue":null,"work_id":"ea683db9-dba7-41ab-91db-dd42878af1a6","year":2016},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.505155Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:503eb64f6ab4a687da775c6e178ecc47fed20fa53843e78fdb0a9e3b0fab2a96","observation_id":"a5e56dba-59a6-4eb3-a4b3-72aedb6f7b16","resolution":{"observed_at":"2026-08-16T12:13:31.742353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.723118Z","title":"Foundations of data availability sampling","venue":null,"work_id":"6d636217-6579-44bc-bc78-869f3bb67d5b","year":2023},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.510209Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:9c452b0fd1387328938c8b47f79560a296fd44b35e8d11ca8bd92a4c1997ab7a","observation_id":"863f6bff-65af-4109-b9a8-1f07b1700a11","resolution":{"observed_at":"2026-08-16T12:13:31.727977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.710009Z","title":"FRIDA : Data availability sampling from FRI","venue":null,"work_id":"95ad299a-0953-4120-b19c-98ec968fe5d2","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.514760Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:89cbffbaebc8ff08816a80041be55d69c5757a840867b235aa82c6e9b1629c19","observation_id":"bc462c84-71a0-4868-99ca-b38cb824d272","resolution":{"observed_at":"2026-08-16T12:13:31.714799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.563492Z","title":"Locally self-adjusting skip graphs","venue":null,"work_id":"5d24ed7f-bfa7-4d7f-9cb1-3703ad5df719","year":2017},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.519557Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:1b09948b1ffa13fc61143e15e05727e129f9e45dae86e00b6bb62acb62106347","observation_id":"42b3d743-2d8a-422d-a1dc-fc1be8bc0275","resolution":{"observed_at":"2026-08-16T12:13:31.701224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.379632Z","title":"Jaiyeola, Kyle Patron, Jared Saia, Maxwell Young, and Qian M","venue":null,"work_id":"d55dc72f-a49b-41f5-9d4c-62dd74e04df4","year":2018},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.524668Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:612831a90b4fbae7581691566ec31b484e3ef053d6f4d72d16ffb8ec3f3d2eba","observation_id":"62c2a412-3a5a-4870-a29e-46a2a7bc6733","resolution":{"observed_at":"2026-08-16T12:13:31.495995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.365523Z","title":"Richa, Christian Scheideler, Stefan Schmid, and Hanjo T \\\"a ubig","venue":null,"work_id":"94639c47-2b50-41de-9d98-c803ac8d51ad","year":2009},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.662522Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:feea23688ad38c8f3c3c7e5b47fe7db750dc97a888ca591bde966dcd8a380078","observation_id":"2bdf7faa-d1a0-4c7a-b977-768c78e8408e","resolution":{"observed_at":"2026-08-16T12:13:31.370565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.11456","last_updated":"2023-06-20T11:12:59Z","snapshot_observed_at":"2026-08-16T15:22:35.548184Z","submitted_at":"2023-06-20T11:12:59Z","title":"Data Availability Sampling in Ethereum: Analysis of P2P Networking Requirements","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.11456","snapshot_observed_at":"2026-08-16T12:13:29.794932Z","title":"Data availability sampling in ethereum: Analysis of P2P networking requirements","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.794932Z"},"links":{"cited_paper":"/paper/2306.11456","citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:cf71f6d7cc833a8c514337f2609b1d5a1516238476b328209c2744fffa98db19","observation_id":"8a74fca3-1285-4812-a174-df150af53df6","resolution":{"observed_at":"2026-08-16T12:13:29.794932Z","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-16T12:13:31.352156Z","title":"A note on efficient zero-knowledge proofs and arguments (extended abstract)","venue":null,"work_id":"59f25f48-d2e2-4d73-96fe-4a283ccab912","year":1992},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.800197Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:67285e6b3c87f41ddf63922ebcb860a4b000ee52f61296ee6b2f5434664f070f","observation_id":"e0a8374b-e0d0-4d94-9695-b702f5e78158","resolution":{"observed_at":"2026-08-16T12:13:31.356251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.337998Z","title":"Karger, Eric Lehman, Frank Thomson Leighton, Rina Panigrahy, Matthew S","venue":null,"work_id":"09d12209-05fb-4851-a309-dcb55d031545","year":1997},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.804270Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:44ef4232ba85e2ae7e388cdfc7512edfd0b2fc02e3d9455703cb775a95650e83","observation_id":"f26c71a5-5683-48da-a623-105e704bfa08","resolution":{"observed_at":"2026-08-16T12:13:31.342388Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.323351Z","title":"Computationally sound proofs","venue":null,"work_id":"5590ec86-88c0-4a25-9096-6c02ab2e50d0","year":2000},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.809026Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:0cdddefcfd085db8936232e27557b6a56b8015d9573197f7a15e4b8ec3a13cf9","observation_id":"779bb5b3-2ae2-4883-9a88-6fa7560d6550","resolution":{"observed_at":"2026-08-16T12:13:31.328025Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.308975Z","title":"Kademlia: A peer-to-peer information system based on the XOR metric","venue":null,"work_id":"dbdceee2-b474-4c57-b8f0-82ce2ff1253d","year":2002},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.916698Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:05a0ca0b2b88369b299af14d7e089acf300b0a53def8f788943f5b0509db8a9e","observation_id":"c95db669-6c73-415f-8a5d-3df60e38c66a","resolution":{"observed_at":"2026-08-16T12:13:31.313807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.174678Z","title":"Set reconciliation with nearly optimal communication complexity","venue":null,"work_id":"d394e67d-f63c-44bb-b148-6a2abb964fa3","year":2003},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.949396Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:741a0ea11a791c245b72aefb6df2fec90581fda016325ecf3773803920b2fdab","observation_id":"881146ff-aa23-45e3-9ddf-c92b23bfd6ff","resolution":{"observed_at":"2026-08-16T12:13:31.243208Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:29.953862Z","title":"Probability and Computing: Randomized Algorithms and Probabilistic Analysis","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.953862Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:82c4a4d1b35ae20bb21dd9ba6eb2daba03be3b018de05e2920cb6ede88f58ae4","observation_id":"8f859e40-72bc-4ee0-a872-680d4744d8a9","resolution":{"observed_at":"2026-08-16T12:13:29.953862Z","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-16T12:13:31.033209Z","title":"A simple fault tolerant distributed hash table","venue":null,"work_id":"0fa6b71e-eb9c-46fa-b2ba-30adc2d10427","year":2003},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.957796Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:4b1776fdc96d1555772bbc8519fa80f1b385dbf80e45ee5dc208a5f795542164","observation_id":"c721e65e-d1b1-49b2-88ab-4367a38ea736","resolution":{"observed_at":"2026-08-16T12:13:31.037429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.019397Z","title":null,"venue":null,"work_id":"54dd7dfd-a1b2-47c2-8670-c70fe1e2eddc","year":2001},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.962161Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:f8a188ee4af78d6cc8f2577c8ec9a84c185777d89df360d44a25092a96850862","observation_id":"6354d145-2f4f-4019-b8a7-d4fd35b5a418","resolution":{"observed_at":"2026-08-16T12:13:31.023589Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:31.003970Z","title":"Karp, and Scott Shenker","venue":null,"work_id":"68a39644-6733-4fcf-b61b-7a6ad427be2e","year":2001},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.966031Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:f112dd208d0e1cbeeb7eecaaf1ec6debc865dbfcf8a682d4471024de15199c98","observation_id":"37772808-ce75-4307-9a5b-4809fceadc3f","resolution":{"observed_at":"2026-08-16T12:13:31.009162Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.989327Z","title":"P eer D A S -- a simpler D A S approach using battle-tested p2p components","venue":null,"work_id":"add6d433-7b77-4b37-91d5-17c3f366bce6","year":2023},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.970246Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:2ea2284387e04ace32624c5d88c4eba6f30c9ca7235f2e65bf75798a20a27574","observation_id":"8ab4c285-1447-4f4e-8416-f990a8e5c58a","resolution":{"observed_at":"2026-08-16T12:13:30.994604Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.973429Z","title":"How to spread adversarial nodes? Rotate ! In Harold N","venue":null,"work_id":"a9ed3f71-553a-496f-843a-dac7f99c9d87","year":2005},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:29.973990Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:1a2d16156eb32db26cd2df0813e07f41e2dd61cd50ee23c55b11363366eddf19","observation_id":"de5a88cf-3c76-493a-ba1a-033ea6523ef7","resolution":{"observed_at":"2026-08-16T12:13:30.978690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.697205Z","title":"Freedman","venue":null,"work_id":"bf86a7d3-504c-4962-9362-23568dbf515f","year":2012},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.037116Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:2df9d1276bb0663c5edd2ff82dd0a1b79e3db121008eec57ffd4787ef16d5baf","observation_id":"6175defb-ad31-4711-b07d-f349b47f6e1b","resolution":{"observed_at":"2026-08-16T12:13:30.848398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.681370Z","title":"Karger, M","venue":null,"work_id":"1f54c824-64eb-4991-9b9f-e536c2d85552","year":2001},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.139258Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:25c63afb6dc4692880c9e1e41a6eca04c120f08dc6b87183dc106db335287a88","observation_id":"7d66dc1a-7c73-4c2c-a6dc-d7e439e03ce9","resolution":{"observed_at":"2026-08-16T12:13:30.686183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.666672Z","title":"A documentation of ethereum’s PeerDAS","venue":null,"work_id":"f51a6dbf-3bc6-49ee-a150-ee11d0d268f3","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.143088Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:f415fbf17eb634fa7392740430abe83bed966b19a7cd9dde2a303dbd5d8415cc","observation_id":"7aee8476-02de-4655-8132-78a30dbf1f48","resolution":{"observed_at":"2026-08-16T12:13:30.671755Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.653133Z","title":"Practical rateless set reconciliation","venue":null,"work_id":"eeec22fe-ec3e-46e4-af6b-c554fcf4177d","year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.147295Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:2e82407c50a3010fbf7cd9c38814625e686ed9af5fb33719762a20e74afbfadf","observation_id":"2145bc8d-b314-424e-9432-be4cbd2dd63c","resolution":{"observed_at":"2026-08-16T12:13:30.658152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.639843Z","title":"Towards practical communication in byzantine-resistant dhts","venue":null,"work_id":"b8e8420f-69ad-44af-88e1-50200cdd9914","year":2013},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.151841Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:dd2123ac7fbe10171ba29d936bd3e27df1bf6fc3e50f579f899a92d39e9fa603","observation_id":"3591940e-1ab9-4127-905b-ddf6f3be8cf8","resolution":{"observed_at":"2026-08-16T12:13:30.643871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T12:13:30.516652Z","title":"Kadabra: Adapting kademlia for the decentralized web","venue":null,"work_id":"f7a17195-b08f-4649-9e4a-b4542a7c18b7","year":2023},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.156222Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:0bd3bdc391eeaddf58376198aba80e6d0057803d8990363f4c1eacae69a4c92d","observation_id":"42361bc9-6b12-4bcc-bb44-e8d8fa7d4dac","resolution":{"observed_at":"2026-08-16T12:13:30.630845Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.16201","last_updated":"2025-04-24T02:50:21Z","snapshot_observed_at":"2026-08-16T14:15:30.101229Z","submitted_at":"2024-02-25T21:29:44Z","title":"Honeybee: Byzantine Tolerant Decentralized Peer Sampling with Verifiable Random Walks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.16201","snapshot_observed_at":"2026-08-16T12:13:30.161220Z","title":"Honeybee: Decentralized peer sampling with verifiable random walks for blockchain data sharding","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.161220Z"},"links":{"cited_paper":"/paper/2402.16201","citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:d88dc0ac5fffbb0dc0dfdf0a129865d74bc6e008e9bdf9ec914de674d079c8c4","observation_id":"9ca12c09-ada2-47b4-ba22-2962a119d438","resolution":{"observed_at":"2026-08-16T12:13:30.161220Z","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-16T12:13:30.243242Z","title":", \" * write output.state after.block = add.period write","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.243242Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:b1807b219274f01672a3beddbe35da35f3a3f39a68473cb89b9afeb14249a352","observation_id":"701e24c3-2f1f-45a7-94c6-f1df2e30e3d9","resolution":{"observed_at":"2026-08-16T12:13:30.243242Z","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-16T12:13:30.288998Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-16T12:13:30.288998Z"},"links":{"citing_paper":"/paper/2504.13757"},"observation_digest":"sha256:8a428737b4c4ef1d3c14ae0d63a6d7781c9ba27dbf04b52cd48dc76cfbe17017","observation_id":"19d13c10-99d3-4767-8d1c-7bd389687c60","resolution":{"observed_at":"2026-08-16T12:13:30.288998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.13757","last_updated":"2025-04-22T12:23:28Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T11:58:33.317537Z","submitted_at":"2025-04-18T15:46:38Z","title":"Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":2,"verified_fuzzy":48},"total_outbound_references":56},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 0 inbound Pith citation observations for arXiv:2504.13757."}