{"as_of":"2026-08-17T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18c79d83a03a48890f40e59f0b528011a3e8dcccb16e2f8756d5a7bd1cdaefc5","coverage":[{"denominator":90,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":90,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:31:18.971618Z","state":"measured"},{"denominator":90,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":90,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.09068/citation-record","integrity":"/paper/1908.09068/integrity","json":"/paper/1908.09068/citation-record.json","paper":"/paper/1908.09068"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:31:18.507649Z","title":"Making middleboxes someone else’s problem: Netw ork processing as a cloud service,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.507649Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:d20f0f7c94b9643234bd43d9139f5f1282b9b39146d9658a2ea3498dfb109914","observation_id":"a6d94a08-7a74-4880-938f-815f52f94546","resolution":{"observed_at":"2026-08-14T11:31:18.507649Z","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-14T11:31:18.513189Z","title":"CrystalNet: Faithfully emulating large production networks,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.513189Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:eee2263273af0ba60deb041bacfa5c52df27cb8420d1484515cbb31f6a71ed6c","observation_id":"48d4a921-9ec0-46b6-a400-2cff35467621","resolution":{"observed_at":"2026-08-14T11:31:18.513189Z","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-14T11:31:18.518530Z","title":"A quantitative study of firewall configuration e rrors,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.518530Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:5fc10442f7b96f7ece0a704ea2fc4de06f995bf3b7884bf9634e8951aae603b3","observation_id":"47e2f94d-84fe-407d-beae-a9ae5b1171cb","resolution":{"observed_at":"2026-08-14T11:31:18.518530Z","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-14T11:31:18.523776Z","title":"Taxonomy of conflicts in networ k security policies,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.523776Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:4c9f299a4c7eaf610613f08f0cd44a367fb42bcb05c2d49faef10d777168d03e","observation_id":"b1aba0a8-6561-45d3-b37f-0f72cc5f2e1b","resolution":{"observed_at":"2026-08-14T11:31:18.523776Z","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-14T11:31:18.530253Z","title":"Trends in firewall configuration errors: Measur ing the holes in swiss cheese,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.530253Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:8ad4874123ba1181b5ce5fd3615cbb2b599cf994fef97bc161739ae8d52ebcc6","observation_id":"e28ffaa2-d35d-430f-9b1a-24bf1362eb20","resolution":{"observed_at":"2026-08-14T11:31:18.530253Z","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-14T11:31:18.535503Z","title":"A general approach to network con- figuration analysis,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.535503Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:af9581fe8b7323ac0281530f999be86f0d2fb565bf4ae9ac49459ee1acb61b32","observation_id":"6ca88c59-901a-4061-b762-847d9fcb3aed","resolution":{"observed_at":"2026-08-14T11:31:18.535503Z","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-14T11:31:18.541227Z","title":"Fast control plane analysis using an abstract representation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.541227Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:297564a2640c5f9fb2bd3e7a7d64f0b1d9333574380a263add8dc246bec4b03a","observation_id":"9085c112-a1d6-4bc7-a582-4e09a3d20806","resolution":{"observed_at":"2026-08-14T11:31:18.541227Z","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-14T11:31:18.546398Z","title":"Efficient network reachability a nalysis using a succinct control plane representation,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.546398Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:f13cada40364a0efc62e87ab963d365da55c2cd21f486f0f49663583c5f067c3","observation_id":"aa66a3d9-0277-4bee-a0a4-72e8c6a6e13a","resolution":{"observed_at":"2026-08-14T11:31:18.546398Z","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-14T11:31:18.551603Z","title":"A genera l approach to network configuration verification,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.551603Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:5167d49ee999838eb3155c77e327a851b2413ddff64e128ba31101661f145f68","observation_id":"f56ed78a-89c1-485b-80d4-0c721af6cd59","resolution":{"observed_at":"2026-08-14T11:31:18.551603Z","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-14T11:31:18.556769Z","title":"Debugging the data plane with Anteater,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.556769Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:63dde1201dd3a0bf72b99c69b5d89af4737d3b85f61abcd84786c1eed4883c56","observation_id":"9a9beb6d-49d2-4aeb-9f4f-b8802425f81a","resolution":{"observed_at":"2026-08-14T11:31:18.556769Z","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-14T11:31:20.484374Z","title":"Header space analysis: Static checking for networks,","venue":null,"work_id":"997802b8-c142-47e7-aecd-e92e2a4ff66d","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.562234Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:f96aa1eb80597e7990826da7bec57b5a395aa6f57246f6b5e941eb83da78a4c5","observation_id":"22d1a607-0c14-4ea7-ade7-7c25e176f612","resolution":{"observed_at":"2026-08-14T11:31:20.489833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.465992Z","title":"Real time network policy checking using header sp ace analysis,","venue":null,"work_id":"d2102009-d6dd-434e-bc73-92cc29f04857","year":2013},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.567934Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:94352d014bb42fa62095d253987f254cc73e3459742f9e1edb93fb70aa41e503","observation_id":"df9f6bdc-2ec1-420f-a612-8809ed7d644c","resolution":{"observed_at":"2026-08-14T11:31:20.471190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.449827Z","title":"V eriflow system analysis and optimization ,","venue":null,"work_id":"364eba0f-a8d5-4fae-8ff4-4022dbf205c4","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.572997Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:55fdd98f4a7593bc3b0e1ea3681aca5eac6737d38cd3326a5d74f03c66fc8fc6","observation_id":"c0931d5b-8ae5-4ef4-ae5d-5a2a55bd7fcd","resolution":{"observed_at":"2026-08-14T11:31:20.454822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.433837Z","title":"Delta-net: Real -time network verification using atoms,","venue":null,"work_id":"8463ddb1-e2bb-401c-92e9-a79c4beb5233","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.577933Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:ca318fe9610c02beaa55b2ef61a82f5dc02b6ff85c0985dcae55e215f0039b31","observation_id":"0a9e903c-0501-4418-a1bf-18ca3bd1cbdf","resolution":{"observed_at":"2026-08-14T11:31:20.439263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.415830Z","title":"Reachability analysis for AWS-based networks,","venue":null,"work_id":"bce4ac01-b9fa-4c7d-81c5-92cecee56695","year":2019},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.583615Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:f08071f18b052fe07babc4699bf88bcdae349b7c2d94ddc2892db9920e5e6863","observation_id":"c1e77d08-76e7-4b7d-993b-01ba0bc1bac2","resolution":{"observed_at":"2026-08-14T11:31:20.421467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.399935Z","title":"On static reachability analysis of IP networks,","venue":null,"work_id":"2758b538-3f7d-4780-a83b-9077e8f4a6db","year":2005},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.588818Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:2a4ad7c0c7b8b5c92a94d5debb9b2c300f7874e87a967dc032838b68d5bfe6e5","observation_id":"0fb05e36-e6d6-4456-a08c-a1ba667be944","resolution":{"observed_at":"2026-08-14T11:31:20.405039Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.384129Z","title":"Model checking firewall policy configura- tions,","venue":null,"work_id":"923b849c-81ca-407f-9683-8aca37a7ae75","year":2009},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.593680Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:3b3776a09ef99e0fda6d56efc42547bac7478305041ecd61b58991e4a978dcac","observation_id":"8b25816a-5f5e-4e51-9c12-40e497d37e12","resolution":{"observed_at":"2026-08-14T11:31:20.389362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.367656Z","title":"The Margrave tool for firewall analysis,","venue":null,"work_id":"80bc51c3-f28a-4dc8-9aae-f31337fcaf29","year":2010},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.598614Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:448bb5d00d64cfbca3f1d68682982290ad0b4c247da709ff2fd872375ef69b94","observation_id":"cf2e0191-ea28-489f-a0b2-b2f5f12505c6","resolution":{"observed_at":"2026-08-14T11:31:20.372664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.351731Z","title":"FlowChecker: Configuration analysis and verification of federated OpenFlow infrastructures,","venue":null,"work_id":"4072b1b5-0754-4a9f-b079-304678d1cfeb","year":2010},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.603750Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:f346ca3fd9c34eca47f5f70ad2528e3bf7b586dd6c4e3f7dd325385bb617eeb7","observation_id":"c4595bcc-9d69-46f8-9e2d-b5beb0638453","resolution":{"observed_at":"2026-08-14T11:31:20.356819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.335403Z","title":"Model checking invariant security properties in OpenFlow,","venue":null,"work_id":"8e1ae36a-3eb6-40ae-b0ff-794949dfb6f9","year":2013},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.608856Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:31afd6d73ebc64223525ec224e67827f4954046727e321be95a148a18dac1f8a","observation_id":"35330b49-ab06-43ec-b6f3-1664e8c18374","resolution":{"observed_at":"2026-08-14T11:31:20.340327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.319767Z","title":"V erificat ion and synthesis of firewalls using sat and qbf,","venue":null,"work_id":"adc123c6-cccb-4d9d-8627-30b322314ccb","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.613849Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b881a004e9442caa5115f637bc96768e8d912271e3b7a8f524601e392bad0d83","observation_id":"d26bc74a-4a71-4767-9e92-2a8f1b6bc148","resolution":{"observed_at":"2026-08-14T11:31:20.324511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.284292Z","title":"V eriCon: Towards verifying controller programs in software-defined networks,","venue":null,"work_id":"348b2f13-7b94-4cdc-be26-f9c636060466","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.625311Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:c3f38dc9f83b08ce54016160927f26fc6f3408e598ec0a2eaa21b678f02dc673","observation_id":"3d94267e-e0f9-4b4a-bf20-e85effd84206","resolution":{"observed_at":"2026-08-14T11:31:20.289827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.266505Z","title":"Detect ion and prevention of firewall-rule conflicts on software-defined ne tworking,","venue":null,"work_id":"fc8f2d70-3d2a-4f2e-9a2c-d6e3995a9f69","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.629965Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:adc1852fed83bd9bc2f4753fe2a626fb8f4d9beca68ff932b043958702afb3ae","observation_id":"3e37f30e-dee3-444f-b3ca-c1053bfd9ffd","resolution":{"observed_at":"2026-08-14T11:31:20.272765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.249364Z","title":"Checking beliefs in dynamic networks,","venue":null,"work_id":"7fdb1d3b-59e8-42bf-aa7e-d6a7039d4d0c","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.634672Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:05a47d56076e1f3a08dae69b563404f45dbc7b1b047b88f5566053b4a56483cd","observation_id":"7b8f5fbc-756a-4013-84d2-4a79ab1f81e8","resolution":{"observed_at":"2026-08-14T11:31:20.254627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.233400Z","title":"FLOWGUARD: Buildi ng robust firewalls for software-defined networks,","venue":null,"work_id":"638437fa-8b82-4af8-bbc0-203c52ed92b7","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.639499Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:1f849c24c547ea87e077b437f9b76a097bc9347e8dff08e8037f233673f23a99","observation_id":"f065a4e9-1cdd-4d01-9c59-4a7d3d4a1758","resolution":{"observed_at":"2026-08-14T11:31:20.238525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.216866Z","title":"Real-time verification of network properties using atomic predicates,","venue":null,"work_id":"bfeae741-b47a-4306-b32d-61986f2f08dd","year":2013},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.644294Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b801293f9712a542c2284f9605c2eb989be0fa70bf2be1c4c078ede4686d852d","observation_id":"12ee8b16-a49c-4b04-b035-09d4110b40d1","resolution":{"observed_at":"2026-08-14T11:31:20.222262Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.200460Z","title":"ddNF: An efficient data structure for header spaces,","venue":null,"work_id":"ee9051bd-22ab-4e63-994b-8f93b42bf530","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.649194Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:f1d695b5e5727c9915c4184f514f56af2021bb88937c8c400a31b0d4dcd95038","observation_id":"3140529e-329d-4b09-8cde-2232ce102955","resolution":{"observed_at":"2026-08-14T11:31:20.205757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.183653Z","title":"V erification of switching network properti es using satisfi- ability,","venue":null,"work_id":"89d2c095-027e-450d-b5fd-25df79119bde","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.654114Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:3d5bc2d0d6054a45486112a5e382ceb4e7768017fff65810c4c950b797d3d049","observation_id":"b2b665b9-1aa3-4ab5-8a1f-8c07dbddcf73","resolution":{"observed_at":"2026-08-14T11:31:20.189153Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.167003Z","title":"V eriFlow: V erifying network-wide invariants in real time,","venue":null,"work_id":"e939aa3e-bd0f-4438-953c-5f464385890c","year":2013},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.659677Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:d9a492ad7cb037583fec4e60d93a545c1726ead222162bc3c0fecc533a723a5e","observation_id":"b3e2eecf-0d8a-4557-b130-05d16be9a4de","resolution":{"observed_at":"2026-08-14T11:31:20.172233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.149292Z","title":"Graph-based algorithms for boolean func tion manipula- tion,","venue":null,"work_id":"e82dc2de-daad-4ea6-8827-ad1b5a8d30d4","year":1986},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.665090Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:ebf9911bddb89bd09d844bf64f5834c7a186d695693484c89a51758565acd26c","observation_id":"ec1313ad-7e48-404a-a7fa-5fdda204f8ca","resolution":{"observed_at":"2026-08-14T11:31:20.154655Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.133386Z","title":null,"venue":null,"work_id":"a1438618-d421-4c53-82ac-38e65dd27f2f","year":2009},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.670676Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:3e67e4aea80b5f972c9dc4208b872eeccabcef1da41bbda89f6289d3f185e9d2","observation_id":"cf3ee16d-0011-4e53-8030-129784686f05","resolution":{"observed_at":"2026-08-14T11:31:20.138297Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.116833Z","title":"V erified iptables firewall analysis,","venue":null,"work_id":"87640f42-4c3a-4ef1-844a-a7d8368c05e4","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.676733Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:cdfa4b90e77d05cf1b5f80dc38f33f1d6f45e76b221eda039b89dcb7ce62f96f","observation_id":"3a5cd3f1-f1aa-4249-a857-f4bcb0355b87","resolution":{"observed_at":"2026-08-14T11:31:20.122761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.101024Z","title":null,"venue":null,"work_id":"ae5133bf-5402-49bf-ab53-c318254fc7f1","year":2002},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.681657Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:e2e834f6a962bce2ada0b5330a19ccaa9f8488311c6060be7c298664133f4156","observation_id":"36cf6948-f150-43e0-bed8-cb658a121780","resolution":{"observed_at":"2026-08-14T11:31:20.106057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.083181Z","title":"An incremental algorithm to construct a lattice of set interse ctions,","venue":null,"work_id":"bd7ac9e5-b66a-4675-866f-13318fcdd94d","year":2009},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.686739Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:c1e59a204f3476319c2e12a4a14ea69065785bd3c7258a20b5c41965ca91966b","observation_id":"96bd6666-6207-4b9b-a767-dd421eaf7dfe","resolution":{"observed_at":"2026-08-14T11:31:20.089530Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.064639Z","title":"Instruction latencies, throughputs and micro - operation breakdowns for intel, amd and via cpus,","venue":null,"work_id":"c3d6b462-7f8d-4415-b041-8fb08df757ab","year":null},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.691981Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b18b64151552b5fe8a15a4cae76ba3c91d21519023f058a24fdd3bfc11906155","observation_id":"01950387-4314-48fa-bd18-56502505b0f7","resolution":{"observed_at":"2026-08-14T11:31:20.070144Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.047757Z","title":"Ca cheflow: Dependency-aware rule-caching for software-defined netwo rks,","venue":null,"work_id":"9e632179-f93c-488f-abf5-763e8fc280f7","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.697927Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:00d75b4098588c4280421cc67d3d036db098f55386a7e8c4e17ba5273a0291a5","observation_id":"b01bfea1-e27f-414b-8f25-69bf217e8b40","resolution":{"observed_at":"2026-08-14T11:31:20.053367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.031229Z","title":"Cardigan: Sdn distributed ro uting fabric going live at an internet exchange,","venue":null,"work_id":"8d79e7ee-f69e-4525-8cc8-a6c02bd2459f","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.703390Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:4c77a8706faab71ed68f606c7f1dbc67f91f86109d1f0d14cda09a0c920b4706","observation_id":"b345042f-a77e-42c1-9177-e1d7f4c31db1","resolution":{"observed_at":"2026-08-14T11:31:20.036610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.011703Z","title":null,"venue":null,"work_id":"778d95ef-e50b-4b81-b0cf-f890bacc90e7","year":null},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.708126Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:30c7254c5b2027cb79fda84abf0344fe2c9245323b70f21294c7c3a6f63f6feb","observation_id":"6afc1f4c-bf41-488f-9900-a9ba24a3b36d","resolution":{"observed_at":"2026-08-14T11:31:20.018260Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.993343Z","title":"Z3: An efficient SMT solver,","venue":null,"work_id":"e8fe692b-a7a8-4c35-bb5e-b58a31d213ab","year":2008},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.713519Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:1dfa1070cd0f6cc0a24c395baa3e525095f817eb48810e4235d9c6227b8c4cb6","observation_id":"24d49e94-0653-4159-a1ff-e59a1804eb3a","resolution":{"observed_at":"2026-08-14T11:31:19.999048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.975853Z","title":"The SMT-LIB St andard: V ersion 2.6,","venue":null,"work_id":"16da96b7-117c-4f62-b804-e86ecafede0e","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.718817Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:7d2f1831e5d3c9e007c799aa4cd293fb1c916660a8cb5cb9760bf10edb75e9dd","observation_id":"0683c7cd-62fd-489c-922c-36ada7e72935","resolution":{"observed_at":"2026-08-14T11:31:19.981546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.956062Z","title":"Khurshid and B","venue":null,"work_id":"674d0543-4aae-4442-9912-40caf08dd2b3","year":2019},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.724242Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:4809612cea7f88fedea3ea45d3ceca86626509b3509d30552711352b884ebbaf","observation_id":"58e2c80b-c236-46b7-8854-1fb1d9d6b525","resolution":{"observed_at":"2026-08-14T11:31:19.961015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.938537Z","title":"Lessons from building static analysis tools at google,","venue":null,"work_id":"5b40dbbb-8413-4700-9c8b-cb3027915f7e","year":2018},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.729386Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:645331e0ae5538a9c09d8047fa8dcaf72ae2508adf6869f3e0ac785741a1be10","observation_id":"a34d2b99-4885-44bb-9ce9-f4382b1ba2c1","resolution":{"observed_at":"2026-08-14T11:31:19.943857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.918473Z","title":"Pr edicting network futures with plankton,","venue":null,"work_id":"9d328fc1-a845-45ef-a15b-3143d71f673e","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.734895Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:9546e4556c89dc7250087e814d94c0b73534af4670adbb6671cff2704d90f738","observation_id":"0f2ee336-4bb9-4a5e-b94d-28eb0546b9e8","resolution":{"observed_at":"2026-08-14T11:31:19.924703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.896025Z","title":"An analysis of BGP converge nce properties,","venue":null,"work_id":"7b30db2a-a750-4b63-9df8-3072fc3d0e4b","year":1999},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.740002Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:578fc8c5d2c785f3df191752a09d9443bc30bdc993dad41ce1fdbd1a6ad500f5","observation_id":"eb90752f-7c88-4fc9-b0ca-d236f00a36cc","resolution":{"observed_at":"2026-08-14T11:31:19.901939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.865334Z","title":"Detecting BGP configu ration faults with static analysis,","venue":null,"work_id":"6aae947f-f64b-4994-b8a4-c5931568294a","year":2005},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.744874Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:af8acd45efc4a232b2e4492e8412bb157bc0fa55c271e3c446e1d017e5e5d308","observation_id":"3a39e307-aa08-45ac-a3d1-7e8aa24c7d93","resolution":{"observed_at":"2026-08-14T11:31:19.872197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.837423Z","title":"Modeling the routing of an auto nomous system with C-BGP,","venue":null,"work_id":"0aef14c1-ce08-4b69-a181-25395ac8a5cc","year":2005},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.750142Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:97576dc0a091c61a0e2794c7e1090a4ba727cc7434e34b4ded6c6ac02dff73ec","observation_id":"137a0586-0dfc-4b72-b258-2c78bef824da","resolution":{"observed_at":"2026-08-14T11:31:19.843521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.818244Z","title":"FSR: Formal analysis and implem entation toolkit for safe interdomain routing,","venue":null,"work_id":"d1e274ee-3c03-4fe7-b446-5944036db4d3","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.755054Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:8402cd9cdb68e16911d23c8925dd4de1a299a79388b5bd82cc1929ed248e38c4","observation_id":"e3e046c2-7ebe-460e-8023-ba149d79a5fd","resolution":{"observed_at":"2026-08-14T11:31:19.824738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.796326Z","title":"Formal semantics and automated verification fo r the border gateway protocol,","venue":null,"work_id":"7cffbd47-e839-43ef-83ff-b122bd9fdbe1","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.760117Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:061601bcdaf4f80bbe6302f60573ce83697c164b67fe7be8b1a1318e4e1c5161","observation_id":"76f64e49-f630-4b13-935f-fc115d7c3489","resolution":{"observed_at":"2026-08-14T11:31:19.802199Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.775138Z","title":"Efficient network reachability analysis usin g a succinct control plane representation,","venue":null,"work_id":"1425a251-a670-469a-a633-94cc9e225ce9","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.765052Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:8e8f9c5c8183df7bc72c29f9f1bfb257aebdc9ff4b3476d0ec274743583451e5","observation_id":"fa922c9f-29b9-4a57-80ae-56906613fbe6","resolution":{"observed_at":"2026-08-14T11:31:19.781490Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.756023Z","title":"Plankton: Scalable network configuration verification thr ough model checking,","venue":null,"work_id":"84e61124-9c45-4dc8-a016-f4a19c11577c","year":2020},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.770234Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:702d1329d44f0336a6bfebc570b43e9ea10911f22a8c7c5ae3ec976002644222","observation_id":"c572ab07-c9eb-4076-b9c1-99a6392996d7","resolution":{"observed_at":"2026-08-14T11:31:19.762601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.733680Z","title":"Detecting and re solving policy misconfigurations in access-control systems,","venue":null,"work_id":"6eda6656-2c9d-422a-a7ef-ad7414f4ab23","year":2011},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.775585Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:0c773036be202d07e50af0edf1fb9112521dd6f07308a4850000416fb918c71e","observation_id":"92af9850-5c51-439b-9c55-0320f8285eba","resolution":{"observed_at":"2026-08-14T11:31:19.739664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.713000Z","title":"Automatic error finding in access-control policies,","venue":null,"work_id":"0e37735e-26f3-4dc2-b830-6a8af0cda469","year":2011},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.780821Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:fed134d56576f87ad039f58ad5be599302e4b53227453c7f09310496b9763867","observation_id":"02249010-0f61-4550-8844-73a843e803e7","resolution":{"observed_at":"2026-08-14T11:31:19.719893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.693004Z","title":"FIREMAN: A toolkit for firewall modeling and analysis,","venue":null,"work_id":"ec2b9374-1203-46c6-aa1f-b7fb259e3620","year":2006},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.785657Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:dc7b7cfa13fb5d3ecc4ad5c90b10b7acb3daa7ae910cc6a82152913725af173c","observation_id":"a09f04fb-cbc1-4f99-b026-ad18f0197024","resolution":{"observed_at":"2026-08-14T11:31:19.700539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.669354Z","title":"A NICE way to test openflow applications,","venue":null,"work_id":"cbb007e2-3aff-4f2d-9eb0-6f6b0cd6818d","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.790643Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b7f0be3a92722de35d7f2066f0cd87d35ecb07540a77f325ec09de25b74c5ff6","observation_id":"a30e92e8-0389-42c3-8728-c68d7133f568","resolution":{"observed_at":"2026-08-14T11:31:19.677481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.649983Z","title":"Correct by construction netwo rks using stepwise refinement","venue":null,"work_id":"4936e81a-6198-417f-a6fa-39544a9aa874","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.795858Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:ebe2648a51f21b78082114281e6fe8176b79d7ebc473142330b468c807bfae81","observation_id":"7a99ec20-78da-4eef-a37e-39002ef56ef2","resolution":{"observed_at":"2026-08-14T11:31:19.655773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.630216Z","title":"Auto matic test packet generation,","venue":null,"work_id":"bba4662f-7e7b-488b-be61-6c7a2d66e42e","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.801570Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:a6a72200d6e58eb70801b510863176f20f22b223dcd4212ae060d097bc873386","observation_id":"43c132a3-fb37-4445-937a-47dfccca6e10","resolution":{"observed_at":"2026-08-14T11:31:19.636450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.611891Z","title":"Towards test-driven software defined networking,","venue":null,"work_id":"7cf1cbf9-1068-4504-a7af-576186ce37b8","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.806684Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:48a878f038d8bc169fad0fd4c5cee3c2f53d37bb9f78713458ff0faa0f6087d6","observation_id":"5f0d234a-256b-4f9a-a294-afab57c798d8","resolution":{"observed_at":"2026-08-14T11:31:19.618094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.590313Z","title":"Cha os monkey: Increasing sdn reliability through systematic network des truction,","venue":null,"work_id":"deddd1f1-5c87-4cad-a6dc-c42272552f13","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.811676Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:c241ae15dc8f75857fd0d775fa67c009c07893bc57952a06d70192dbd5cd77fe","observation_id":"2e2f663f-775b-4105-9821-24797ba2c748","resolution":{"observed_at":"2026-08-14T11:31:19.596139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.572129Z","title":"BU ZZ: Testing context-dependent policies in stateful networks,","venue":null,"work_id":"59cfc9f4-d561-4c15-8151-fa4196829dc0","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.816751Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:607d3e7700fb17a2064cacaef21ae6a9e37868ef55685ce87db00e99c07cfa4b","observation_id":"ec64f57b-5213-448c-a8d0-6a4dad908351","resolution":{"observed_at":"2026-08-14T11:31:19.577471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.555547Z","title":"An assertion language for debugging SDN applications,","venue":null,"work_id":"1b809423-07d0-4486-9d42-f1ecfc3a4fad","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.821465Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:fbc38f230fd91b6187b1a3ed8725862c68eb8c60b040d6746c31c8a3194cb783","observation_id":"0d6c66db-549e-4c0e-815a-be51d5f4849b","resolution":{"observed_at":"2026-08-14T11:31:19.561085Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.534941Z","title":"Troubleshooting blackbox SDN control softwar e with minimal causal sequences,","venue":null,"work_id":"537a0ca9-b2e7-4b80-915e-de5d00a4189e","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.826128Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:0821a564278faba0090bc408cc3faa3953da8213ccd3e15e207c6b5d43abdb2e","observation_id":"d28c3805-4a02-44ea-a3d3-9490767bd4b9","resolution":{"observed_at":"2026-08-14T11:31:19.542844Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.516076Z","title":"Stati c differential program analysis for software-defined networks,","venue":null,"work_id":"5aee9538-52db-4fbb-af62-c7b05f132260","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.830792Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:1940ce2fc07d24f6347fd2f0a2c17026343e081ef109d7e549b525ec14248aa6","observation_id":"8146085d-3a37-42c8-aafc-5125597ea4a9","resolution":{"observed_at":"2026-08-14T11:31:19.521662Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.496326Z","title":"SDNRacer: Detecting concurrency violations in software- defined net- works,","venue":null,"work_id":"37666a73-6e12-4bf6-be37-670919c3596f","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.835617Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b9992ada5393c222bbb1aeb8d93110076e5f6437f179197adf879822ed0f1267","observation_id":"f1fed88e-be17-4dc3-9303-9683c173d8ce","resolution":{"observed_at":"2026-08-14T11:31:19.502953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.475684Z","title":"BigB ug: Practical concurrency analysis for SDN,","venue":null,"work_id":"bca828a2-b92c-42ef-a5a0-c6043bc4e042","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.840425Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:155b2882fc0ace813b416cb5299b7d2495678d2ed215e968a8f570d98b799d2a","observation_id":"b4d69902-2c7a-40a8-bc08-62a923c17ab2","resolution":{"observed_at":"2026-08-14T11:31:19.482225Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.456676Z","title":"Optimizing Horn solvers for network repair,","venue":null,"work_id":"b587cb50-b5b5-4db6-95df-3b0e6ac608f9","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.845429Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:37c4fd02d85bf8092b0cd8bf9cad7e55b518b56e91c5ffc71259028a2b36134b","observation_id":"d4f49fa5-77de-4b15-b9da-582e444e7f24","resolution":{"observed_at":"2026-08-14T11:31:19.462359Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.435237Z","title":"Automat- ically repairing network control planes using an abstract r epresentation,","venue":null,"work_id":"30e65971-81fa-4621-b52b-33770c972a1b","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.850113Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:e0a23192b4c611548348d20cc63b775d8f322a7beacd0d6ed647621f283e28e6","observation_id":"330e13d0-1468-4447-ba6a-d0c867d198b5","resolution":{"observed_at":"2026-08-14T11:31:19.442056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.415098Z","title":"Auto mated bug removal for software-defined networks","venue":null,"work_id":"dd0c5d04-e70f-4a24-838c-ab823c66c0ed","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.855258Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:71e8bed8f8f10c28c975fb065a38d59dc3ea9ea646f101a8da5fc8a2443d4f60","observation_id":"bcde173e-78f4-4ded-a76f-0401449068fe","resolution":{"observed_at":"2026-08-14T11:31:19.421296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.391387Z","title":"Don’t mind the gap: Bridging network-wide objectives and d evice-level configurations,","venue":null,"work_id":"8269b126-bd4d-49f8-a037-071d9bf9540a","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.860207Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:1eed1d96298d627020360c1bdcbc4ceedd228d59d3cfbcf31765dda15a903924","observation_id":"0fa11fed-da0b-414d-be43-685dfa5d2581","resolution":{"observed_at":"2026-08-14T11:31:19.398586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.372354Z","title":"Network-wide configuration synthesis,","venue":null,"work_id":"25de9e6a-36bb-4791-a6fd-79e3f8e303c3","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.864962Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:713184f656fb06f4334810b18244a85d29fa9abb70a651292feb2b512ea53274","observation_id":"9f0b2254-9b1a-49d2-beb2-a65950cd0091","resolution":{"observed_at":"2026-08-14T11:31:19.378294Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.349498Z","title":"Net2Text: Query-Guided Summarization of Network Forwarding Behavio rs,","venue":null,"work_id":"fed31e00-f986-4594-9c49-6f907af36dee","year":2018},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.871005Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:1b7920f350856c133ce93161ca692c7b6c03f7cc03cbeaec6dc6bd7e000c3cb1","observation_id":"096c536d-6a65-4c5f-9ba4-3d9e456d1206","resolution":{"observed_at":"2026-08-14T11:31:19.355917Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.331100Z","title":"Frenetic: A network programming la nguage,","venue":null,"work_id":"dd8f92bc-dca9-4724-bff5-73d1ded3e4bc","year":2011},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.875737Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:d4b1590df6af991dfe04daa7992e51c8563d5197e3393019cf24fd1dbe678efa","observation_id":"f32a8c61-1368-4e69-872b-b2e399ed7021","resolution":{"observed_at":"2026-08-14T11:31:19.336174Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.313088Z","title":"Concurre nt NetCore: From policies to pipelines,","venue":null,"work_id":"748b2c7e-f895-4be9-b3b6-90f1a2d762c6","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.880770Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:ce69632f08a3d94d1afc3d20c45099179e52bf0ad0794e6b25a7f7d24bc9d275","observation_id":"d2fa9ebc-4e94-4af3-8bdd-98566228847e","resolution":{"observed_at":"2026-08-14T11:31:19.318935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.295707Z","title":"NetKA T: Semantic foundatio ns for networks,","venue":null,"work_id":"043d0e3d-dac9-45b1-abaa-7addad07d92a","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.885580Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:06201a296df994970ea90e2e3d7deb72619887dfff274c1ee7003b07ae3079a7","observation_id":"c64ae06f-7aeb-4d56-a1bf-f0a8aabe6e00","resolution":{"observed_at":"2026-08-14T11:31:19.300955Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.277016Z","title":"Kinetic: V erifiable dynamic network control","venue":null,"work_id":"9dd80b5e-1b17-4df4-b5d8-8b0f7c46ccf5","year":2015},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.890359Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:40d9b40ab71289d6812eec7b511d53d8f1bf6fcf8b81d076709ffefc301e94a8","observation_id":"3a2f9d9f-fe78-4ac9-92b2-d4927f035cd0","resolution":{"observed_at":"2026-08-14T11:31:19.283015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.01468","last_updated":"2018-04-04T15:29:31Z","snapshot_observed_at":"2026-08-14T19:29:19.278702Z","submitted_at":"2018-04-04T15:29:31Z","title":"P4K: A Formal Semantics of P4 and Applications","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.01468","snapshot_observed_at":"2026-08-14T11:31:18.895713Z","title":"P4K: a formal semantics of P4 and applications,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.895713Z"},"links":{"cited_paper":"/paper/1804.01468","citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:863896a6c34a64e90384ba696a90a96f88c374da3ec55265507791603767393d","observation_id":"8a61a9de-1bcb-4bd8-8cda-f593fb754294","resolution":{"observed_at":"2026-08-14T11:31:18.895713Z","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-14T11:31:19.258146Z","title":"Abstractions for network update,","venue":null,"work_id":"3445ab26-012d-4bef-a37c-d7a045ed8f16","year":2012},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.901261Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:4d4d454c542762ae6dfcc38a8959cad980f225bc2a81883e58a82daaed9725f6","observation_id":"74b20d5a-334a-4454-a356-ba2c64bbe14c","resolution":{"observed_at":"2026-08-14T11:31:19.264263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.239997Z","title":"HotSwap: Correct and efficient controller upgrades for software-defi ned networks,","venue":null,"work_id":"9d58eb92-2327-467c-931b-2264b2357a0e","year":2013},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.906380Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:cc063a357ef7b3160f805d4630d12e341a27b0eaffd301bc64faed7b0e2e141c","observation_id":"c64d0894-f92b-4128-9f58-626e1c6b3a44","resolution":{"observed_at":"2026-08-14T11:31:19.245900Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.220180Z","title":"Safe update of hybrid SDN networks,","venue":null,"work_id":"aef9452b-1ea1-4e97-a2e8-171130e3186d","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.912182Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:a9d4c13a023f40aaec33ff16e553c9519b4c42fd43def2432b06053633e11bcf","observation_id":"6be25406-ab0a-44da-b24f-9d0a3b50d4b3","resolution":{"observed_at":"2026-08-14T11:31:19.227386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.203547Z","title":"Decentralized c onsistent updates in SDN,","venue":null,"work_id":"8b742bc8-19d1-4cab-90a6-afcbdc6e45fc","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.916841Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:0a83f947bae040038a6515a8c4434ac661dd2462ef47536ce4e16b721ee4dca3","observation_id":"eb1d8227-2b16-42bb-b14c-e6ccb729d477","resolution":{"observed_at":"2026-08-14T11:31:19.208628Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.185853Z","title":"Libra: Divide and conquer to verify forwardi ng tables in huge networks,","venue":null,"work_id":"9e210356-57ee-448b-a2c8-d804db968222","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.921762Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:ea792e4e63b1dfdb1c683402dad2a62ab89f13f0570f152ded63ae3c4c8a72af","observation_id":"546cdebf-d129-4495-bd4e-e41c316ce004","resolution":{"observed_at":"2026-08-14T11:31:19.191739Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.165598Z","title":"Network configuration in a box: towards end-to-end verification of ne twork reachability and security,","venue":null,"work_id":"a6f7345f-7a84-4550-9dbf-2985560de171","year":2009},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.926520Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b40b55ea1da47c19ef8e79b495cc9f3ffdb4c7a26981998c2ebbb888a59ae337","observation_id":"b5dad5ac-e0cb-42b3-9990-6710f47464e2","resolution":{"observed_at":"2026-08-14T11:31:19.172349Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:20.302970Z","title":"A utomated analysis and debugging of network connectivity policies,","venue":null,"work_id":"8aa13a91-b933-422d-968e-bc628195bf36","year":2014},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.931390Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:067cbaa1b3e6d661cf5a156e1ba586b54d606978e60bf82330149121e9c15ce8","observation_id":"9d43e24e-15fd-439c-b15d-cf8ebffd37d3","resolution":{"observed_at":"2026-08-14T11:31:20.308107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.148669Z","title":"Scaling network verification using symmetry and surge ry,","venue":null,"work_id":"e4228c63-b744-404a-accf-126e61f2c898","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.936536Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:af52b7aeaccdf3c9a537d41a388c3ec254b56306dd551faaa46bec9795d8eff6","observation_id":"46bf5e7e-870b-439b-bb22-d24424ae427f","resolution":{"observed_at":"2026-08-14T11:31:19.154407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.132249Z","title":"Contro l plane compression,","venue":null,"work_id":"7e9275fe-8e82-45b3-b8ca-7b7901d75be5","year":2018},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.941320Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:de173be1b5145bfadf9d500d66b31f7f4e8a2b5c0efb450e1f4bcc8a6e20d5a7","observation_id":"40200da7-11c4-4f0a-a308-1a12d79cd714","resolution":{"observed_at":"2026-08-14T11:31:19.137475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.113798Z","title":"Use of BGP for r outing in large-scale data centers,","venue":null,"work_id":"fb89ab2b-aab7-49ce-ac94-53d642f66060","year":2016},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.945989Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:7fa25528e8b50c01d9bc8f0e9fb256ebf028e23ffd3dca614e55dd49c6d8cfb3","observation_id":"22a960b1-635f-4b5a-900d-c53a697ad55d","resolution":{"observed_at":"2026-08-14T11:31:19.119354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.094908Z","title":"APPENDIX A WORST -CASE COMPLEXITY Here we prove results about the theoretical worst-case complexity of #PEC’s underlying model counting method","venue":null,"work_id":"c614d521-0e41-4140-b1a7-ff9f7da74440","year":2017},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.950894Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:b9f69f32dc88ed01d2fabd8221a9d15da1fed6b46f3680f5526c22f3de192cf7","observation_id":"f6b47739-1465-4b21-87a2-3db443043764","resolution":{"observed_at":"2026-08-14T11:31:19.101285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.078110Z","title":null,"venue":null,"work_id":"44b75a08-74ad-42f3-bff9-18272c1ab24c","year":null},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.956262Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:a56b46b7a0268fa7d1becd66286bfbe3d372fabe8f2496afed54b32bcef80a1d","observation_id":"0ce3f225-177c-4a17-8435-7bb10b9404a9","resolution":{"observed_at":"2026-08-14T11:31:19.083455Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.061757Z","title":null,"venue":null,"work_id":"f054e64c-d344-4f98-8c83-c6ed9b45dc1a","year":null},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.961484Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:54715c7930e669e91662fe64482caece6cde4286ed5a81ae51ef676bb2ac12d8","observation_id":"0a67e78e-0743-41d2-b565-f62a32f6d36e","resolution":{"observed_at":"2026-08-14T11:31:19.066842Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.044793Z","title":null,"venue":null,"work_id":"b2d90c1c-4547-4944-b835-9b5915eba390","year":null},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.966807Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:a78fbe4222fecf4b68e4982c999acf788669dd81350145b7fcba3a20ccbcf77a","observation_id":"22b9d494-628f-4e58-a7cd-734fd45dee9e","resolution":{"observed_at":"2026-08-14T11:31:19.050018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T11:31:19.026632Z","title":null,"venue":null,"work_id":"10fc047b-c801-4b96-a0ec-15e7a78e5d0f","year":1958},"citing_paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-14T11:31:18.971618Z"},"links":{"citing_paper":"/paper/1908.09068"},"observation_digest":"sha256:32a2c47521666991881977ab2e6def636290f3edaea6187062d541679271fce1","observation_id":"22ad8cd2-8d97-4bbb-944c-abe5a2a12721","resolution":{"observed_at":"2026-08-14T11:31:19.032757Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09068","last_updated":"2019-08-24T01:31:57Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-14T11:20:40.363856Z","submitted_at":"2019-08-24T01:31:57Z","title":"A Precise and Expressive Lattice-theoretical Framework for Efficient Network Verification"},"reference_resolution":{"displayed":90,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":72},"total_outbound_references":90},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 90 of 90 outbound references and 0 inbound Pith citation observations for arXiv:1908.09068."}