{"as_of":"2026-08-12T13:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:96e1529012bbaf4e9319bb21d47815a1afb32b95d27175b214577c9d788ad4a0","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-10T17:46:09.959155Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2604.07264/citation-record","integrity":"/paper/2604.07264/integrity","json":"/paper/2604.07264/citation-record.json","paper":"/paper/2604.07264"},"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":"Intent-based networking—concepts and definitions","venue":null,"work_id":"e27d4463-e97d-4f8c-89c3-1a391c08a571","year":2022},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:c1c688dbdfa385088b02bcc3905475a9aa8e43c91f4908effbd5c03f361abe01","observation_id":"c78cde0f-5db9-4951-bb1a-335e336b3e15","resolution":{"observed_at":"2026-05-17T09:09:20.417510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Delay is not an option: Low latency routing in space","venue":null,"work_id":"9a5eef39-cdce-490c-a9dc-487e08ed1d6a","year":2018},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:c0363a55ec3566c4774478be81fecf6184b2efba6987497f92a88eb501d1b48d","observation_id":"6ddc0eb8-f206-454d-8b5f-ac03df6c5268","resolution":{"observed_at":"2026-05-17T09:09:20.424004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Toward a unified routing framework for delay-tolerant networking","venue":null,"work_id":"42495311-e63e-4b36-b86b-56f970099417","year":2008},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:ca920860e81fac00a7fede074e6341e8c4104ea876275b9654b3fe7f44c47ac2","observation_id":"78d993f7-0c8a-4eae-8c8e-263510bb9d9a","resolution":{"observed_at":"2026-05-17T09:09:20.420427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Deep reinforcement learning for LEO satellite network routing","venue":null,"work_id":"cff82334-0420-4c66-ac04-1d8b1215748c","year":2022},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:6be0bb274ef554576135cec0b0c751a66c27728966f64de715c3bf1b4de14701","observation_id":"f9a576d8-6ef5-49c6-a4a4-ac3bd0c50bc7","resolution":{"observed_at":"2026-05-17T09:09:20.439493Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Multi-agent DRL for distributed routing in LEO satellite networks","venue":null,"work_id":"00cfee4c-40a7-48ae-aa9f-7ceb129b29e4","year":2023},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:7b6150f70f747f5abc00f4bfabc1a09ec2dbf250914090962ece89357d8ca69f","observation_id":"e6e46177-134d-4c29-a063-6a06dc700cb9","resolution":{"observed_at":"2026-05-17T09:09:20.427582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"RouteNet: A graph neural network for network modeling and optimization in SDN","venue":null,"work_id":"93f40d3d-e4a0-4fd2-a67f-b0404c4e39d8","year":2020},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:9d2114935b632fcc04f676795338a1b04ef521c55bb21c96ec7a8a81e13efa49","observation_id":"86b18040-edea-413e-b8ce-c607b37ad28c","resolution":{"observed_at":"2026-05-17T09:09:20.442199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Graph neural networks for link scheduling in wireless networks","venue":null,"work_id":"3d524723-cd66-4c1b-893b-e888d6d93e7e","year":2021},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:15ac87637defe61dc00236b263ce33c44b21fb5d4b1f13891372e0ca3a2ec8f2","observation_id":"e86b4fcc-ea36-4598-8c9e-9e972d342a1b","resolution":{"observed_at":"2026-05-17T09:09:20.445076Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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 and generating distributed routing protocols using graph-based deep learning","venue":null,"work_id":"0335426b-1c62-4be0-ac90-71f86ea6a980","year":2018},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:b5dbe86c41d053bc01c390278e6fc16ee9729354e6355a4b749002c8e045d480","observation_id":"878885d3-9b41-4b30-9d45-1ceb0f4aa199","resolution":{"observed_at":"2026-05-17T09:09:20.436496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"RouteNet-Erlang: A graph neural network for network performance evaluation","venue":null,"work_id":"430adc6e-1973-402e-9e27-7a734382b691","year":2022},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:8b1424a446cbedbcee4fca7723259dad2914cd46e781af2d810c9a1cf8f034f9","observation_id":"e134b18e-aa1a-4a63-9418-a544dd9e572e","resolution":{"observed_at":"2026-05-17T09:09:20.450996Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Graph attention networks","venue":null,"work_id":"36e5b75d-f3d2-4918-af0d-ce1e9302d54f","year":2018},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:f84ee5bbd524635053b6de227c2ad313eddfc41ba2846809bd5936591ea3efeb","observation_id":"c5f29b06-da1d-489c-8e68-83d47180d78a","resolution":{"observed_at":"2026-05-17T09:09:20.430620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"An intent-based network virtualization platform for SDN","venue":null,"work_id":"952e7e69-3b82-4a6e-bd43-9672dc9d6862","year":2016},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:a5fdb37fffd394fa618a57873888947f5b107777f08993392b2a8b4cb5dd4eee","observation_id":"7ed1804d-7639-4a4b-9415-766766dc4155","resolution":{"observed_at":"2026-05-17T09:09:20.433528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Refining network intents for self-driving networks","venue":null,"work_id":"a9d6234f-af81-41cd-9ddb-125856d12b77","year":2018},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:c0cf69cafbb5adec503e8bd014fabfc423052a95e2f3df9d200cbfd93368a5bb","observation_id":"c1952010-551a-48d1-aa33-aa3f3c75f44c","resolution":{"observed_at":"2026-05-17T09:09:20.453713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"P4I/O: Intent-based networking with P4","venue":null,"work_id":"92e9126d-41bf-42ea-9324-56f27b226640","year":2019},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:8f458d53340c9542f8b158dca99213db171f60069acb84cbfd1adf0e550e7b63","observation_id":"d2c8ccca-fbd4-46d1-8c7b-98d180c67ac4","resolution":{"observed_at":"2026-05-17T09:09:20.448038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"NILE: A natural language interface for networking environments","venue":null,"work_id":"ef2708ff-b1ee-41fd-a326-39a471df74d0","year":2021},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:0c53c66d7bb5f6e0832c16d268cd220c8f4afb60755c1abc23a9760c021d55a3","observation_id":"91669735-e5b7-4254-9385-b4a936e324c5","resolution":{"observed_at":"2026-05-17T09:09:20.471946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.17474","last_updated":"2023-11-29T09:31:13Z","snapshot_observed_at":"2026-08-09T01:08:46.239494Z","submitted_at":"2023-11-29T09:31:13Z","title":"Large Language Models for Networking: Applications, Enabling Techniques, and Challenges","version":1},"cited_work":{"arxiv_id":"2311.17474","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.17474","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Large language models for networking: Applications, enabling techniques, and challenges","venue":null,"work_id":"b7996b67-cc58-4c2f-b654-5b6d603a1b55","year":2023},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"cited_paper":"/paper/2311.17474","citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:7699fadde15d928c24026401e0e29d93f245dbd9cd2c57b318c23787033be204","observation_id":"6d780b1a-e244-4744-b297-77a02ad4903d","resolution":{"observed_at":"2026-05-11T06:11:01.057806Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"LLM-based intent translation for network configuration","venue":null,"work_id":"0f547cf7-768b-4951-a9d1-881330d2c54e","year":2024},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:8477d6327b052727c2af881bbc91ff1aaabc1cde1ff0aaa7d14e22d59e21f883","observation_id":"f85bf940-5f3c-42e2-bcab-79dca9e0e96b","resolution":{"observed_at":"2026-05-17T09:09:20.475633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"NetLLM: Adapting large language models for networking","venue":null,"work_id":"ed456224-aea8-4864-9f9f-5d490b3eaee7","year":2024},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:6c5dceea7f4ae529d5111ea92f7ed2dcba41743d7b8db27c1a2b778e7c1993e7","observation_id":"0fb129c3-df78-4417-b8ad-c7e3a309a60e","resolution":{"observed_at":"2026-05-17T09:09:20.463735Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"LLM-powered network operations: A survey","venue":null,"work_id":"cb00d1ae-b640-48cc-b626-08a75f4b1772","year":2024},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:019d31eecccac3231635c3585f62eeec5a5488671973f98c40792e6459ae1abe","observation_id":"38d0e8e2-24b9-4595-9555-a8eab0902123","resolution":{"observed_at":"2026-05-17T09:09:20.460178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"LLM-assisted network configuration verification","venue":null,"work_id":"5255f4a4-247f-4ad9-8685-cc6083c26699","year":2024},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:f42c7e8452652cd982a38eaa44ec853ac558766fb5bc2cda0efc79a6117323ba","observation_id":"85e6415c-e727-4ba6-b97a-8eb80223c06c","resolution":{"observed_at":"2026-05-17T09:09:20.467322Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Large language models for network anomaly detection","venue":null,"work_id":"6d4f5585-99f1-4465-ab3c-f22f00ec983e","year":2024},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:1bb1affa73d796c8448b0b3a8eb213f919bb3571f03b0bb15f196283c3abd893","observation_id":"86c9414d-d4fc-4360-a8c0-07ae9e5bd473","resolution":{"observed_at":"2026-05-17T09:09:20.479359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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":"Translating network policies with large language models","venue":null,"work_id":"c60753ee-f8f8-49c8-a56e-5c4eca4f0799","year":2023},"citing_paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:09.959155Z"},"links":{"citing_paper":"/paper/2604.07264"},"observation_digest":"sha256:c0fee08f19aa8a9b165778c946a7dca6037c3b1a2896c84bd0bcfeeb6cf31ce9","observation_id":"2e7ece5e-7ae2-4a03-b5b5-f6382c0c8fa8","resolution":{"observed_at":"2026-05-17T09:09:20.456814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2604.07264","last_updated":"2026-04-08T16:29:25Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-07T01:22:14.262370Z","submitted_at":"2026-04-08T16:29:25Z","title":"Validated Intent Compilation for Constrained Routing in LEO Mega-Constellations"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":20},"total_outbound_references":21},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2604.07264."}