{"as_of":"2026-08-22T07:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1540e950a73b8efc21679af3f633fc37b687b73bbd04a0b2156403ddb72a5d92","coverage":[{"denominator":70,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":70,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:22:37.934592Z","state":"measured"},{"denominator":70,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":70,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.11644/citation-record","integrity":"/paper/2506.11644/integrity","json":"/paper/2506.11644/citation-record.json","paper":"/paper/2506.11644"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2004.94569","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.178021Z","title":"IEEE Std 802.1D-2004 (Revision of IEEE Std 802.1D-1998) , pages 1–281, 2004","venue":null,"work_id":"89c644f0-35bc-45d2-86b6-35121a7c1d3d","year":2004},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.654079Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:8e1ea57efaf6dbf424e7529ecc89da0dbf6a2ffaf59e59fa347d3a3ac361392b","observation_id":"4e94bc7e-4f70-443e-945d-7bbf26433298","resolution":{"observed_at":"2026-08-07T04:22:39.183738Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.803514Z","title":"Mergeable summaries","venue":null,"work_id":"507bb37c-4416-4d9b-a354-189b05d23029","year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.659301Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:6ccf878deba34cea4c02e39b63409677b3f3c93baa26c7e06abeac4321d3788b","observation_id":"5d9c2e7b-44b8-4140-abed-ccbc29118499","resolution":{"observed_at":"2026-08-07T04:22:39.807116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.663742Z","title":"Size bounds and query plans for relational joins","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.663742Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:9499b5e3ed864b41cd47642c50232b5fc24f3cd34000de98667e44b306637bdb","observation_id":"1985294c-1d3b-407f-afb6-c69fd355954d","resolution":{"observed_at":"2026-08-07T04:22:37.663742Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.668125Z","title":"Improved routing strategies with succinct tables","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.668125Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:947a542f33a43ea9fb9a81b376c9491b21eda81ea1c14d21261dcb8babfe2136","observation_id":"72255e63-9e60-4669-9dde-2f0d4ffbcdc7","resolution":{"observed_at":"2026-08-07T04:22:37.668125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.792798Z","title":"Routing with polynomial communication- space trade-off","venue":null,"work_id":"39b29c87-5b69-41d7-86a7-d49d06a68dcc","year":1992},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.672345Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:7952343b67d32d857104c0d7434c30b1b4489b87269a933a6181eb2f3fd1dd5a","observation_id":"42d27321-1a29-4086-b806-10de7cbb804d","resolution":{"observed_at":"2026-08-07T04:22:39.796577Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.781926Z","title":"Efficient mea- surement on programmable switches using probabilistic recirculation","venue":null,"work_id":"c3053a2b-441a-429e-9586-06b874823ff0","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.676732Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:93e78636f1079d0e743a0b9a2145e854ce3ebeb961e1a362da0c07a3d31f6b86","observation_id":"598cb300-124d-4ba4-bb4b-b3b79f4d7c87","resolution":{"observed_at":"2026-08-07T04:22:39.785664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.771031Z","title":"Pint: Probabilistic in-band network telemetry","venue":null,"work_id":"4d318c16-b9bd-4d0e-828c-c2e466533b53","year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.681338Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:b8e56cc20c0e9371d9c30ee313106e80c3fc5c6e1a0a3b3d4e381f2918d06014","observation_id":"f68c5093-d153-4d02-b560-3773777cac98","resolution":{"observed_at":"2026-08-07T04:22:39.774897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.760201Z","title":"Onos: towards an open, distributed sdn os","venue":null,"work_id":"0b085c80-c3cf-464a-b080-168be9474f37","year":2014},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.685344Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:448301beb4980e75c791e80a2d20dc066779a5df7f06fe1baadbb8f0d6b55736","observation_id":"d12140a1-cb8b-48ff-ab48-8d4376c99acc","resolution":{"observed_at":"2026-08-07T04:22:39.764193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.749270Z","title":"Tres observaciones sobre el algebra lineal","venue":null,"work_id":"e9284d44-bb74-4063-b9af-53cecd5c9e4c","year":1946},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.689183Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:d28b0b7e9df0c495d476cc33d7f9ef2af5a3c969b9c49748e5702e1f48b21acb","observation_id":"3948303d-1a17-4ea6-b952-cb9142b0eb20","resolution":{"observed_at":"2026-08-07T04:22:39.752913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.736807Z","title":"P4: Programming protocol-independent packet processors","venue":null,"work_id":"718938b5-fc69-4c99-a8b5-dbcf25b57ec1","year":2014},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.693386Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:303f55e1d971a0e2fb8cefd8116620d9c2724140129599e8e5cee25ee0db70aa","observation_id":"59b3bc10-9f80-42bd-a170-d36f802cb7b2","resolution":{"observed_at":"2026-08-07T04:22:39.741106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.724551Z","title":"Forwarding metamorphosis: Fast programmable match-action processing in hardware for sdn","venue":null,"work_id":"02393b1a-d0ed-4864-96fa-e9da87280483","year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.697553Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:0a5b82c0c3a266bca85f7e899228951063855f5096705436d37329e6b421d601","observation_id":"19347c17-cbc3-40ab-9509-3f461fbd352d","resolution":{"observed_at":"2026-08-07T04:22:39.729063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.712582Z","title":"Trident Programmable Switch","venue":null,"work_id":"3672930e-4f80-4949-b18c-77ed504b1cb6","year":2017},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.702827Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:f2f6066c50abaab789a46b77f10d042e03fb8a674127d0b1177c351bc29c0018","observation_id":"f0f4974b-71dd-4f88-826b-5a617180b111","resolution":{"observed_at":"2026-08-07T04:22:39.716546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.695033Z","title":"Compact routing messages in self-healing trees","venue":null,"work_id":"33b5a999-bc06-4ef8-8210-d5c2f1c998e1","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.706492Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:47e7fbf9c2f5366f161a4581008b67d88ed490eb602b540d56e2ea8256c52142","observation_id":"d5f0dd1a-85dc-42d3-91e9-d250014fc979","resolution":{"observed_at":"2026-08-07T04:22:39.699419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.710538Z","title":"Fully compact rout- ing in low memory self-healing trees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.710538Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:5bb0539e71731c69dde80de761644b24610b1daa158c92f39c569553d26a51b3","observation_id":"0b72eea9-81e9-454c-bd98-f3ae6a4bc1a8","resolution":{"observed_at":"2026-08-07T04:22:37.710538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.684287Z","title":"Tight distributed listing of cliques","venue":null,"work_id":"6e7eade4-c3f7-4ea4-a712-68f481d34a9e","year":2021},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.714601Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:bed59fa7eb8ca3850075808f10fdd72017195801eff3ba116521e3fcbef4361d","observation_id":"1793edf9-8f07-4444-98cb-1d19707f0aa3","resolution":{"observed_at":"2026-08-07T04:22:39.687961Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/l","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.054440Z","title":"Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs","venue":null,"work_id":"5de09209-e065-4ed5-b0cc-0f8142bae0a1","year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.718409Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:aac8308cb13078da90d5b8958ee13318545afeea6252c754d992e396d11f9fb3","observation_id":"4b6f92ae-c74c-4536-bd56-873d88e3dbcb","resolution":{"observed_at":"2026-08-07T04:22:38.058350Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2734.34057","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.027608Z","title":"On distributed listing of cliques","venue":null,"work_id":"429182b5-4b15-4890-8e29-578fd76a63ae","year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.722095Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:edc65e802fa681247302963c6208fac148019bd880d10228d62ed25021e863e0","observation_id":"a805df40-5b9a-4f10-8475-84dd3c5bcc35","resolution":{"observed_at":"2026-08-07T04:22:39.032862Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.672626Z","title":"Deterministic expander routing: Faster and more versatile","venue":null,"work_id":"a784e54e-bc2d-4387-82ef-3fe20fac662f","year":2024},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.725762Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4e34b51cc5a1e5eec1b19abf956340f1861650ca004b53d9240fde987aa0d36f","observation_id":"8f428595-3abe-431c-bdd4-459a6cc40b00","resolution":{"observed_at":"2026-08-07T04:22:39.676764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.660385Z","title":"The complexity of distributed approximation of packing and covering integer linear programs","venue":null,"work_id":"14f6c701-cc9b-4be7-9c00-95c47a234ac1","year":2023},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.730079Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:45c8f8b2194527004f366189958cde4b114bb23630ef2a2852c7a9d82a8c2e82","observation_id":"420baeb2-ec7b-48e6-93c6-e8c195ab7f25","resolution":{"observed_at":"2026-08-07T04:22:39.664839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.649558Z","title":"Near- optimal distributed triangle enumeration via expander decompositions","venue":null,"work_id":"e1bcc0e5-c7ca-401c-a1ae-2f584ba1ddfb","year":2021},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.733742Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:a76d4609350bd26a1abacb03d12a6cf5f4a23050aa1c8c24c19542ce4ccd7595","observation_id":"8645d7bc-490e-4b6b-b65b-2161a03b458a","resolution":{"observed_at":"2026-08-07T04:22:39.653443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.638505Z","title":"Distributed triangle detection via expander decomposition","venue":null,"work_id":"7f592712-8e26-4c9a-aa6c-76907f98ad49","year":2019},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.737409Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:d528e01623425c3870d088db346870c1a04d4398a715eb95afedcf245217c9de","observation_id":"47ef3c7f-cd3d-4780-b07d-d3a8a40b9f63","resolution":{"observed_at":"2026-08-07T04:22:39.642293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.741825Z","title":"Improved distributed expander de- composition and nearly optimal triangle enumeration","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.741825Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:1ac14dcdb554cda3126276f4b5c4d7dbc7c9b72d1ff123f84ad3215934f8904d","observation_id":"22bf4d57-bef1-4c40-b2e2-72adfb2bb169","resolution":{"observed_at":"2026-08-07T04:22:37.741825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.626896Z","title":"Deterministic distributed expander decomposition and routing with applications in distributed derandomization","venue":null,"work_id":"4d396e68-9cca-42d9-8af6-3fab59263190","year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.745465Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:81fd6ec5335f2379348f9a320a2c925b0199765723b37f7a35067c194ac8a11c","observation_id":"38cc9086-b7ce-4fda-90aa-cfe749c5dd29","resolution":{"observed_at":"2026-08-07T04:22:39.630848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.748908Z","title":"tri, tri again","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.748908Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:464aeba2c31c996ba6754b110ecba0e0bea4dbdb9671b8e4228d5c12e259e821","observation_id":"effc8210-f96a-46d0-b420-b7ba2b376292","resolution":{"observed_at":"2026-08-07T04:22:37.748908Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.disc.2019.15","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Sublinear- time distributed algorithms for detecting small cliques and even cycles","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"4eee81e7-1bb0-4523-b4ef-a5cb8ab119ac","year":2019},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.752626Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:3d0b2c1a56da4341729a1f5e04d4e6fdc5d742f5fd16e2153dca1275806a8268","observation_id":"0b4482b4-a751-4398-932d-f629c8701f28","resolution":{"observed_at":"2026-08-07T04:22:38.039172Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3212734","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Near-optimal distributed routing with low memory","venue":null,"work_id":"6a4ece51-b319-4fc7-afe4-eeb76b475319","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.756406Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:dd2242147c1c23822151af3b6e606f7f53f7481211b19d798d77e198ff4ce712","observation_id":"89a971cd-f6cc-4fac-9f13-d4044e659ebf","resolution":{"observed_at":"2026-08-07T04:22:38.026465Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.614550Z","title":"On efficient distributed construction of near optimal routing schemes","venue":null,"work_id":"d912590f-6f14-4101-a395-7268d903e35e","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.760575Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:72f42b31b4f4e7caf0129e28528538c869be73938665223108594f5b5ceab166","observation_id":"1a7fea25-cc97-4e80-a096-e56f80fd58f3","resolution":{"observed_at":"2026-08-07T04:22:39.618592Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.603860Z","title":"Stone age distributed computing","venue":null,"work_id":"a76086de-3110-40c5-96f8-36e047c386b8","year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.764747Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:226d4f6a52657e939656939bbe6b35642071748241c83f6c0f16f5892027aa61","observation_id":"16d58a8c-4c78-4174-a6f9-4dedb55fcfc5","resolution":{"observed_at":"2026-08-07T04:22:39.607648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.591693Z","title":"Graph distances in the streaming model: the value of space","venue":null,"work_id":"ded9e5b1-099c-44ac-8362-454c8c19036c","year":2005},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.768472Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:318ac1dc16f95f816222e5425f2830e4ca43e3caaa8794ba67590cbd7c0156ec","observation_id":"b0ec82ad-591c-4070-ae78-0906f38ee8c3","resolution":{"observed_at":"2026-08-07T04:22:39.597011Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.580227Z","title":"Orion: Google’s{Software-Defined} networking control plane","venue":null,"work_id":"c2150e88-60da-43a4-9647-d37f61971334","year":2021},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.772947Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:a083d433d73bdcdecf70e90aa3ba69e3990381ed4e21a0778981b42518a2c1d3","observation_id":"dc369664-1ffa-4987-85a4-9a06db151118","resolution":{"observed_at":"2026-08-07T04:22:39.584998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.568348Z","title":"Possibilities and impossibilities for distributed subgraph detection","venue":null,"work_id":"a2a94b06-0e16-4a8e-9efb-cafaf84010ba","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.776367Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:c2469e1992fa8f33331169694211d11e4629f41ab12774a0fedeb63c7893f358","observation_id":"5c99007d-7014-4127-aa03-44e905260fa0","resolution":{"observed_at":"2026-08-07T04:22:39.572742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.556981Z","title":"Fisher and F","venue":null,"work_id":"a8cfe2cd-1868-4a88-9f35-06bd3eeaf10d","year":1953},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.780134Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:0b9f375ef37e652617679dcf5d4764a6d4eb674ce1b56867f3b5ce73aca14720","observation_id":"f8e2e491-a9fb-4747-a8c6-44a504ffed8a","resolution":{"observed_at":"2026-08-07T04:22:39.560681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4964.22498","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.870133Z","title":"Memory requirement for universal routing schemes","venue":null,"work_id":"551ff040-a250-40c1-b194-bd91513e5098","year":1995},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.784318Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:3c3b729d79e5588e3bf19a01405321c9e9e01d6356d1be0dc5533b829fbae010","observation_id":"7f0b56e2-8843-4119-b8cc-13e5c1465044","resolution":{"observed_at":"2026-08-07T04:22:38.876198Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7502.23754","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.766159Z","title":"Local memory requirement of universal routing schemes","venue":null,"work_id":"9478756e-cbe4-462d-a0d4-4517d9b4fa92","year":1996},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.788162Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:0a92053bd45282ff1f1708d0ace202e77381513b990694534bbe7011621ca5fb","observation_id":"fa217eca-372a-453f-9654-3ca5ecdb3d11","resolution":{"observed_at":"2026-08-07T04:22:38.771404Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.546076Z","title":"Header-size lower bounds for end-to-end communication in memoryless networks","venue":null,"work_id":"dd1e85bf-d527-4b3b-a161-6fb8da6bc4a0","year":null},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.792126Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:bd78de6a2cc5fcfafecdb615fac0184651cdb8308b4e3d2c5336b30e324e33c5","observation_id":"fd349127-93f7-40ea-ab61-d4dc33a26bc4","resolution":{"observed_at":"2026-08-07T04:22:39.549881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.534931Z","title":"Cr-precis: A deterministic summary structure for update data streams","venue":null,"work_id":"3f73b556-acdb-4343-87d4-05be80113e8c","year":2007},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.800718Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:785b5b7f31f72cc43e5b7fff7e565df8262d2c69db5b47e4795817fc1420b023","observation_id":"929148a3-5c6f-4bf1-a334-1cea37fb7c1d","resolution":{"observed_at":"2026-08-07T04:22:39.538672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8052.24807","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.697890Z","title":"Memory requirements for routing in distributed networks (extended abstract)","venue":null,"work_id":"641c86a2-778c-46ee-941c-5f4193ab3661","year":1996},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.804961Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:f07994034788bd5debcc980c44fc2589f47ecd7fd4dbd8bdaa3a70d3fe2b4acb","observation_id":"6b275804-cd61-4bf0-8ef0-7bf57ec27118","resolution":{"observed_at":"2026-08-07T04:22:38.703733Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.808599Z","title":"On the complexity of local distributed graph problems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.808599Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4c670805ecc14884f1a147f1cd3d4b364ac238b99f7cbaf19088a20749d78298","observation_id":"2c23e1d3-ceb1-4179-8495-c75e67413c42","resolution":{"observed_at":"2026-08-07T04:22:37.808599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.524688Z","title":"Distributed MST and routing in almost mixing time","venue":null,"work_id":"dcb0be92-9dab-4f60-a874-8d6504cc0bcb","year":2017},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.812092Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:8e369f16396c846d64b77fe517340cc33960845519125ddd826b917e1459a110","observation_id":"aecd8ac4-1667-4332-b78a-cc42ad32a948","resolution":{"observed_at":"2026-08-07T04:22:39.528401Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.514136Z","title":"New distributed algorithms in almost mixing time via transformations from parallel algorithms","venue":null,"work_id":"ce817278-dc30-4c73-aca1-33a06b18d73e","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.816299Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:caa846aedd9c566c42f77d3321432f2936fbe140f6f9b3464ae70c08f0661bd1","observation_id":"e59dcdeb-0a16-4f38-a45f-32af9e9fded8","resolution":{"observed_at":"2026-08-07T04:22:39.518024Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.819802Z","title":"Space-efficient online computation of quantile summaries","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.819802Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:9537462212f2fe879b705d1ec208f4119bcd31b693be4009ead93f429f2d5c8b","observation_id":"b59a9c89-d4d0-4c52-94ce-646558558431","resolution":{"observed_at":"2026-08-07T04:22:37.819802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.496028Z","title":"Stream order and order statistics: Quantile estimation in random-order streams","venue":null,"work_id":"9d0822dd-edd4-4ff8-a8dc-13d314e716df","year":2009},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.823562Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:3e3ee139f55d45e943397b1c78999c011343852d6c654687d137c38a79058063","observation_id":"32542fe5-ed72-4e2c-b8f7-e6b3d7636e0a","resolution":{"observed_at":"2026-08-07T04:22:39.499650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.485118Z","title":"Pingmesh: A large-scale system for data center network latency measurement and analysis","venue":null,"work_id":"cf969dfa-b7c0-4ee5-b152-a0703b4cb60d","year":2015},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.827246Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:391ba10e9dea1632fcad241bb60d7a1fd7f58289d7981c3f9cc73948c49e76e8","observation_id":"f5d4bb54-c8f2-439c-bd14-1c194fae2a9a","resolution":{"observed_at":"2026-08-07T04:22:39.488669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2204.14138","last_updated":"2024-11-01T16:57:54Z","snapshot_observed_at":"2026-08-21T02:48:38.247196Z","submitted_at":"2022-04-29T14:51:12Z","title":"FRANCIS: Fast Reaction Algorithms for Network Coordination In Switches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.14138","snapshot_observed_at":"2026-08-07T04:22:37.830859Z","title":"FRANCIS: fast reaction algorithms for network coordination in switches","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.830859Z"},"links":{"cited_paper":"/paper/2204.14138","citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:9ddcf7c87232d1293e6d06bfa5ea086443132de7b90554b2caa943ccdd0697c3","observation_id":"8747fcb2-4395-4e36-afa4-2aa97d0691bc","resolution":{"observed_at":"2026-08-07T04:22:37.830859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.472791Z","title":"B4 and after: managing hierarchy, partitioning, and asymmetry for availability and scale in google’s software-defined wan","venue":null,"work_id":"72191b5f-ae33-4e22-94e4-e3a405bf6417","year":2018},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.835588Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:e72b7cbc89bef9e0a104c5426cafad4041bc63c196e08223b3b5a842198cd8a7","observation_id":"4aaebcfa-cd6f-4ad5-b06a-87491ea5354f","resolution":{"observed_at":"2026-08-07T04:22:39.477470Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.352743Z","title":"Hucaby and D","venue":null,"work_id":"6ce83c44-520a-4c4d-84bb-11aeed46f65d","year":2004},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.839949Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:52e7ba910bf8779fcbd225de03d05003783d43f18c4c5cb84019ed904d5e1b78","observation_id":"56bccd49-a8fd-4873-b4d7-703ad61e9706","resolution":{"observed_at":"2026-08-07T04:22:39.464472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.340066Z","title":"Intel tofino programmable ethernet switch asic","venue":null,"work_id":"d7603e9a-91d5-4fc8-81f4-6aff1441b95a","year":2017},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.843684Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:c9ebcb58fef53f4be1eb07d5e80f0c9daab7ad164c684e34ea3f875490e666bc","observation_id":"e5a09e00-6a4b-4ede-b503-e8ab887755de","resolution":{"observed_at":"2026-08-07T04:22:39.344722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.326934Z","title":"P416 intel ® tofino™ native architecture – public version","venue":null,"work_id":"ebf58f6c-f117-405e-bb6e-ede3bd69ca76","year":2021},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.847517Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:930a27e381cfce0bd0556f2bc1cae513985282da242e8af04a420ac9c2b387b2","observation_id":"54c1e440-0fa6-4611-9acb-cf3e9c89c645","resolution":{"observed_at":"2026-08-07T04:22:39.331616Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.851485Z","title":"Triangle finding and listing in CONGEST networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.851485Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:2d7fef272265d83107a8649642ef72af1f468822e62f5b964f6f7c6fab152fc8","observation_id":"49237e9c-066e-4eae-9367-18277115f779","resolution":{"observed_at":"2026-08-07T04:22:37.851485Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.305410Z","title":"Approximating the permanent","venue":null,"work_id":"e0489db2-2c8e-4029-a81a-baa3a5c5bcab","year":1989},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.856300Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:05d6c4e0509c1a8c07d85e96cb2bfd5c704024c9b49546750bb00b2b47727c89","observation_id":"cb2f96c6-07a1-4a2c-a5b7-db128152b071","resolution":{"observed_at":"2026-08-07T04:22:39.310871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.860764Z","title":"Karloff, Siddharth Suri, and Sergei Vassilvitskii","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.860764Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:976c95e723e1b5313e1f34e7b7e2f913440a53357011b9d574b4c4a55f53ee71","observation_id":"96568d89-1808-4d56-a80b-458709a3aec7","resolution":{"observed_at":"2026-08-07T04:22:37.860764Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.292529Z","title":"On a cut-matching game for the sparsest cut problem","venue":null,"work_id":"a59386d5-e79a-4212-8cce-353262eb20b8","year":2007},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.864546Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:2642f1d597030e7431878709997fef0e3c06f596dfa44fbc41dbae4854896c0f","observation_id":"283ed5be-62fd-42e4-8592-c4eaa509de02","resolution":{"observed_at":"2026-08-07T04:22:39.296803Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8902.15389","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.544873Z","title":"Graph partitioning using single commodity flows","venue":null,"work_id":"e8688200-d5c9-46cf-a84c-073bc1aeb500","year":2009},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.868143Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:d2b74d1de424dacac40b8a3900b903bb192a3b966d3db284613a7f56970cf72a","observation_id":"71f89f44-bd08-4363-a0ba-565be46a51a6","resolution":{"observed_at":"2026-08-07T04:22:38.550347Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"4239.25019","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.476924Z","title":"Optimal deterministic routing and sorting on the congested clique","venue":null,"work_id":"574c7952-e8ed-482a-8100-289c2bdc6abd","year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.875267Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:f714555ec66d886b4b09a5ddadce8cbba770c3d763f5e5442aeb775a5021d1c9","observation_id":"f6f91465-1c66-40ca-8a47-91d362e2b4e1","resolution":{"observed_at":"2026-08-07T04:22:38.483317Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.879547Z","title":"Fast routing table construction using small messages: extended abstract","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.879547Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4eea738d3c693330a3b2eb8a855ae766e60c3a531a267e753dca6522c38770c4","observation_id":"31159612-38e3-4267-9ab9-c2091016ba65","resolution":{"observed_at":"2026-08-07T04:22:37.879547Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7386.27673","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.337805Z","title":"Fast partial distance estimation and applications","venue":null,"work_id":"dc7fc18f-6a83-44c7-a1ce-60ca08ff3ad6","year":2015},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.882999Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:2f45c4d437330a6729f9af376ea3015dae21c4bead9a232b577a6246129ea460","observation_id":"7a146832-97d6-4755-9523-5f173c02b877","resolution":{"observed_at":"2026-08-07T04:22:38.345287Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.887138Z","title":"Locality in distributed graph algorithms","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.887138Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:99081742c38de99ad0a4b09d87f906c396e29b32889504db024b06b64ffaf1f7","observation_id":"1dce959e-47c1-4c50-9b47-25c39f3bdaec","resolution":{"observed_at":"2026-08-07T04:22:37.887138Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.06106","last_updated":"2023-05-18T17:32:41Z","snapshot_observed_at":"2026-08-15T11:30:57.205768Z","submitted_at":"2020-09-13T22:54:25Z","title":"Space-Efficient Interior Point Method, with applications to Linear Programming and Maximum Weight Bipartite Matching","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.06106","snapshot_observed_at":"2026-08-07T04:22:37.891565Z","title":"Cliff Liu, Zhao Song, Hengjie Zhang, Lichen Zhang, and Tianyi Zhou","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.891565Z"},"links":{"cited_paper":"/paper/2009.06106","citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:61d3bcdb02adc1bc713d8f8ee84fe7aa66aff75403e3e9711dab72e769df0014","observation_id":"2ab65823-c411-452d-ab5b-6c8d5e105346","resolution":{"observed_at":"2026-08-07T04:22:37.891565Z","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":"10.1137/s0097539704441848","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Minimum-weight spanning tree construction in O(log log n) communication rounds","venue":"SIAM Journal on Computing","work_id":"7c7a39b8-a361-41cc-9d40-69d75a0ebecb","year":2025},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.895704Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:9afe61e75053ffc64030a096e802c7407ad0ef095ca9cc550024cfed1f703051","observation_id":"f1eac4c1-4c1d-4d48-b8d2-0f2f0f0179aa","resolution":{"observed_at":"2026-08-07T04:22:37.972396Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.280264Z","title":"Openflow: enabling innovation in campus networks.ACM SIGCOMM computer communication review, 38(2):69–74, 2008","venue":null,"work_id":"e35e3a1d-d751-4191-af9f-1b3c664915ea","year":2008},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.899526Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:428c0cbf2da0bede2e4f0de3e1e68747155cbf8de0e1bf09f4bbb3dbd82bfa96","observation_id":"fe95e2fc-5a82-47e9-b928-73da2dfd89c1","resolution":{"observed_at":"2026-08-07T04:22:39.284198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.268551Z","title":"Opendaylight: Towards a model-driven sdn controller architecture","venue":null,"work_id":"ae31f3ef-8224-4390-acca-6ee23dd07d6b","year":2014},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.903353Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:159cbb2f27b57ccf3fcbf30bab43a68b39d1f4223582b395c9d42b89d8278f9e","observation_id":"b7b92da2-3a01-453b-afa0-09f60a17b086","resolution":{"observed_at":"2026-08-07T04:22:39.272420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.257683Z","title":"Miller, Richard Peng, and Shen Chen Xu","venue":null,"work_id":"3a49a031-9969-4826-9af0-f46b7d3ec761","year":2013},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.907130Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:0358e5483c8d08bd6764c9d8ee95e589f6b21f060ce0c3b20ceacd5c88a1580f","observation_id":"35153438-3b5f-4b9e-aeac-884e511b7244","resolution":{"observed_at":"2026-08-07T04:22:39.261569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.247050Z","title":"Finding repeated elements","venue":null,"work_id":"43b299d2-0863-4068-9fc3-e32fdcafc207","year":1982},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.910815Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:484df08d4f08e2ae6eff527ac9392624b1142348fd9e11aea25baf6188ea83fe","observation_id":"8eb76261-2946-40de-b003-0203d18298c9","resolution":{"observed_at":"2026-08-07T04:22:39.250826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:37.915022Z","title":"Distributed Computing: A Locality-Sensitive Approach","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.915022Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4f42f6c30bf0922073a836b5d27d1c11f4eed0737e9f8e3596e98ef6e79c62b8","observation_id":"624bb3c9-5548-4e8a-aa3e-cf998e1d41a5","resolution":{"observed_at":"2026-08-07T04:22:37.915022Z","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":"5950.65953","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:38.257214Z","title":"A trade-off between space and efficiency for routing tables","venue":null,"work_id":"c1294b2c-671a-46f4-97eb-cb94e3b93915","year":1989},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.918948Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4f079a1c41cead7b00e907f0e869f0759e39050ab36957be665afbb1bce41148","observation_id":"23b604cd-badd-4d2e-856c-7e316b9ca92b","resolution":{"observed_at":"2026-08-07T04:22:38.264647Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.226690Z","title":"Computing cut-based hierar- chical decompositions in almost linear time","venue":null,"work_id":"77978c80-8a93-4b73-bce5-d08e5eae23df","year":2014},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.923579Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:90a11703cab896337ddc4ca38b1683d7b0fa675ce8601b1e3421262118108309","observation_id":"3e49d426-ba80-4e8d-a2fc-52a33a9729b1","resolution":{"observed_at":"2026-08-07T04:22:39.230389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.216215Z","title":"Counting cycles and finite dimensional Lp norms","venue":null,"work_id":"0bfb4300-6117-46ee-8044-70c5badd1fac","year":2002},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.927427Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:d3344ad71c9f95662458f5d7a8845f462808daab440a56d64d630c0d5e43d9e0","observation_id":"0c3ac1d9-7240-477d-b1a2-4f23f6d345a0","resolution":{"observed_at":"2026-08-07T04:22:39.219667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.204673Z","title":"Polylogarithmic-time deterministic net- work decomposition and distributed derandomization","venue":null,"work_id":"6b5c5f92-5a68-4a60-b344-02542f8c708c","year":2020},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.931021Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:dfc024f834730ed8776acdfc79afe3cb417afc3ba4f12cbc228b3ac518be7132","observation_id":"3660ed5d-a39e-4296-a89a-05ce38057972","resolution":{"observed_at":"2026-08-07T04:22:39.208559Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:22:39.192663Z","title":"with high probability","venue":null,"work_id":"dbbc7635-f7ae-43ca-978e-b3f90f634d62","year":2004},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.934592Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:a64f4afed8aa896bdcfccc5617bfc77a532117bca175a3bbff7866d510862960","observation_id":"878ca494-483c-4c8c-b81c-1e129b3d5cdf","resolution":{"observed_at":"2026-08-07T04:22:39.196840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.comnet.2005.09.025","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Computer Networks","work_id":"e63d1139-f612-4806-807b-ced3a1acd4f9","year":2005},"citing_paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-07T04:22:37.796738Z"},"links":{"citing_paper":"/paper/2506.11644"},"observation_digest":"sha256:4ea959cedc07e46f340226b2501a50f09d11f242a4123e6c7d25e9ed70e1367b","observation_id":"283f53b3-7247-4db1-9db3-05d81d27ef4c","resolution":{"observed_at":"2026-08-07T04:22:38.014703Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.11644","last_updated":"2025-06-13T10:18:36Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T04:01:49.811134Z","submitted_at":"2025-06-13T10:18:36Z","title":"Bounded Memory in Distributed Networks"},"reference_resolution":{"displayed":70,"state_counts":{"malformed_identifier":5,"metadata_mismatch":7,"parse_uncertain":0,"unresolved":11,"verified_exact":6,"verified_fuzzy":41},"total_outbound_references":70},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 70 of 70 outbound references and 0 inbound Pith citation observations for arXiv:2506.11644."}