{"as_of":"2026-08-05T04:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:34384cc5344feeb4a369fdf64887e5ffae02b263ac4e79ca1c59ebd0484fdfb3","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T19:10:30.262134Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T15:18:54.854103Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.09703","snapshot_observed_at":"2026-08-02T15:18:54.854103Z","title":"Cayley graph optimization for scalable multi-agent communication topologies,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18244","last_updated":"2026-04-29T13:14:00Z","snapshot_observed_at":"2026-08-02T15:18:52.304452Z","submitted_at":"2026-04-29T13:14:00Z","title":"Accelerating Heterogeneous Agent Collaboration in Dynamic Edge Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T15:18:54.854103Z"},"links":{"cited_paper":"/paper/2604.09703","citing_paper":"/paper/2607.18244"},"observation_digest":"sha256:920d4a427a5e881294bce53e1faee91b5da9437db6cf7b9f485c0dfea5c802e5","observation_id":"06f30eeb-0850-4efe-9284-d4738d474640","resolution":{"observed_at":"2026-08-02T15:18:54.854103Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2604.09703/citation-record","integrity":"/paper/2604.09703/integrity","json":"/paper/2604.09703/citation-record.json","paper":"/paper/2604.09703"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"When UA V swarm meets edge-cloud computing: The QoS perspective","venue":null,"work_id":"064d0db8-5358-4a6b-893d-1cac49da9b7d","year":2019},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:fab0b9c8b5ff8834a774ba8b250858e671a614e1925421002b2aed1549d7005d","observation_id":"d48de942-70ee-4062-bff2-c986654ac654","resolution":{"observed_at":"2026-05-16T08:22:36.858047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"A theory of semantic communication","venue":null,"work_id":"81ec7bad-626f-41c7-a40c-fa439bd1c7f3","year":2024},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:47dd7f28ac1b87d75b4c1e9151f470f05d764a2c2d6e83d5ae61905e04266568","observation_id":"ef1fed9d-55c2-4a01-9992-45a4dde3c4a4","resolution":{"observed_at":"2026-05-16T08:22:36.828797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Consensus and coop- eration in networked multi-agent systems","venue":null,"work_id":"1a479b05-208f-4043-acae-b03f302be2cf","year":2007},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:65e2c4503d036d953a7494ef44ae4060974342185cb483bec2f5dba2740c27b2","observation_id":"e7b9edef-1670-4dfd-8c9c-26f12b5b0a86","resolution":{"observed_at":"2026-05-16T08:22:36.822901Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Exponential topology-enabled scalable communication in multi-agent reinforcement learning","venue":null,"work_id":"0a39efe2-480a-4ab2-89bf-d500d11eb716","year":2025},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:61768280f0f3f43cf4115331505d631f38d4de2b07cbbeff60cee45d02c60abb","observation_id":"cb16eb2a-d78b-4aef-b298-760d1b705de8","resolution":{"observed_at":"2026-05-16T08:22:36.826187Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Federated edge learning with misaligned over-the-air computation","venue":null,"work_id":"b9b91858-3599-4255-8bcc-7c4a3d059f17","year":2021},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:3980946bdf842e2b947a25d6e3f74478b5e72a31d8cabaa4342b65bf094f950c","observation_id":"482a2f51-e567-4fa5-9954-4da6933e051e","resolution":{"observed_at":"2026-05-16T08:22:36.852276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Tarmac: Targeted multi-agent communication","venue":null,"work_id":"70d94983-3fc3-496c-820d-bed39902bcf4","year":2019},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:29448353f3258259f4681d67b7ce09510deef0ec5487bfcdf2e75f7c3cb65d31","observation_id":"d88a2d37-03fa-4cbb-9c5a-1e7857a33ba8","resolution":{"observed_at":"2026-05-16T08:22:36.849577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning multiagent communication with backpropagation","venue":null,"work_id":"19b791cf-38bb-44a5-ab37-7a700c4e01af","year":2016},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:82e1ae0aa786be8bf30e7f5cadb9c712871b606744049c72b9e7f61ee7ca8d71","observation_id":"ef488e5b-f5f8-451c-a0d3-34f677190346","resolution":{"observed_at":"2026-05-16T08:22:36.832116Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning to communicate with deep multi-agent reinforcement learning","venue":null,"work_id":"948ec0ce-77f4-413b-b934-a935dc5c9f11","year":2016},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:95c952a2534b310402674f8e0caf6f243ae3049ebe68237f6e74e1d6bae84b03","observation_id":"b357888f-9333-4e72-b0a9-d55170d83963","resolution":{"observed_at":"2026-05-16T08:22:36.838597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Learning attentional communication for multi- agent cooperation","venue":null,"work_id":"8645abcb-44ad-4da0-9dd2-d5d2338c4b0d","year":2018},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:8e38db7e18e6dcdac68df89832d3917f6c27a2ddbae5c3d62ab5089810dbab2f","observation_id":"55203263-85d6-4e31-abe3-023acd050398","resolution":{"observed_at":"2026-05-16T08:22:36.835270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Godsil and G","venue":null,"work_id":"6e34e4f7-ecf5-4848-b6a7-0929e10460e0","year":2013},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:3d6ce9a7684ce68eaf09f0c18b0822f47623076bd6aa20f034084ab775e1b9e0","observation_id":"47a9f6c4-8a58-4ac2-bc44-279181a79705","resolution":{"observed_at":"2026-05-16T08:22:36.846440Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Moore graphs and beyond: A survey of the degree/diameter problem","venue":null,"work_id":"3c458405-b36e-42e3-9030-39137d436c20","year":2012},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:4f92250af347201b12e7491b6da9ccdcd742051283fefdee834b88d888c6c8f4","observation_id":"33d9d2d2-38a9-406a-bda8-9f46433cd2d6","resolution":{"observed_at":"2026-05-16T08:22:36.843678Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Ireland and M","venue":null,"work_id":"bbd0a856-25cb-4023-b55c-6c8b406bb559","year":1990},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:7d74e9db7f4a2b7f1d080eddf26ac03441ffffab3b99dc48138ca6c8e8eeb148","observation_id":"485103be-9953-4943-9a0a-ae332aa78b2b","resolution":{"observed_at":"2026-05-16T08:22:36.855017Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+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-06-05T21:23:00.469572Z","title":"Tao and V","venue":null,"work_id":"3bd86336-f619-4a90-9ff3-6ca5c207efa1","year":2006},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:680c78327245709ed3fafc3580fd37b1acac5aae738b282840c8221185db33ac","observation_id":"ab1b7c82-d55b-4d8b-9bcd-e1501400b06d","resolution":{"observed_at":"2026-05-16T08:22:36.841178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1707.06347","last_updated":"2017-08-28T09:20:06Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-07-20T02:32:33Z","title":"Proximal Policy Optimization Algorithms","version":2},"cited_work":{"arxiv_id":"1707.06347","doi":"10.1016/j.artint.2010.12.005","metadata_source":"pith","pith_arxiv_id":"1707.06347","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Proximal Policy Optimization Algorithms","venue":"cs.LG","work_id":"240c67fe-d14d-4520-91c1-38a4e272ca19","year":2017},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"cited_paper":"/paper/1707.06347","citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:ebf0ec8e8eb68dcc1509c5e9e5ac27dbca149f5f2ca745c7dcbbca2bcc4ffbe2","observation_id":"3a10788e-3327-4bae-a4e9-cc81afcdc2a8","resolution":{"observed_at":"2026-05-10T23:25:51.125438Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1506.02438","last_updated":"2018-10-20T18:55:07Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2015-06-08T11:12:48Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","version":6},"cited_work":{"arxiv_id":"1506.02438","doi":"10.48550/arxiv.1506.02438","metadata_source":"pith","pith_arxiv_id":"1506.02438","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"High-Dimensional Continuous Control Using Generalized Advantage Estimation","venue":"cs.LG","work_id":"38e3ca94-96f0-4b19-a355-0754931af8be","year":2015},"citing_paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T19:10:30.262134Z"},"links":{"cited_paper":"/paper/1506.02438","citing_paper":"/paper/2604.09703"},"observation_digest":"sha256:fbc8c55d48ff03891da1886b1de488d70aad5bf494570af38669af46d5cb0eea","observation_id":"076f81fd-33bb-463d-95ac-13983c744b7f","resolution":{"observed_at":"2026-05-11T04:19:28.133246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.09703","last_updated":"2026-04-07T13:43:09Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-04T20:27:43.316217Z","submitted_at":"2026-04-07T13:43:09Z","title":"Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":13},"total_outbound_references":15},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 1 inbound Pith citation observation for arXiv:2604.09703."}