{"as_of":"2026-08-09T17:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:94081e5a4184af93ee6211084ccb4e63739617adf29341cb56a055e75c39deb8","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T00:09:07.981665Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2605.29537/citation-record","integrity":"/paper/2605.29537/integrity","json":"/paper/2605.29537/citation-record.json","paper":"/paper/2605.29537"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:09:07.981665Z","title":"Johnson, and Changliu Liu","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:798f344fa3120c2332aa15aeb0cef6d500a478810be11d883286bf2fa4e03d39","observation_id":"c91ddcbd-2895-45c6-9595-28fc0e3a6353","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19985","last_updated":"2024-12-28T03:07:00Z","snapshot_observed_at":"2026-07-06T20:13:58.813488Z","submitted_at":"2024-12-28T03:07:00Z","title":"The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Results","version":1},"cited_work":{"arxiv_id":"2412.19985","doi":"10.48550/arxiv.2412.19985","metadata_source":"arxiv_reference","pith_arxiv_id":"2412.19985","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Johnson, and Haoze Wu","venue":null,"work_id":"f8173bef-04ee-4ce2-8403-d337e42ae2a1","year":2024},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"cited_paper":"/paper/2412.19985","citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:097b960c0b1a924a6a292d3139e14caa28a252407047ef014b653512d32d22f3","observation_id":"33d1aa0e-471d-42f0-906d-bc0f4b58978e","resolution":{"observed_at":"2026-06-29T00:12:49.986785Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:09:07.981665Z","title":"MIT Press, Cambridge, MA, USA, October","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:addfdaedd39846cca0257d55245eb116db5327105f40e1b168140cf027a176ec","observation_id":"9cbd86eb-6f12-4031-886c-23d8c6c4b3eb","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Succinct representations of graphs.Inf","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:64d13706d85e279ad28c8604a995e72c39f2d6ffea9b70c64f7bd11886925499","observation_id":"7b4123e5-4bcb-4e10-a3d6-32bcaac8b471","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.13630","last_updated":"2021-06-21T21:01:12Z","snapshot_observed_at":"2026-07-06T10:53:11.986981Z","submitted_at":"2021-03-25T06:57:11Z","title":"A Survey of Quantization Methods for Efficient Neural Network Inference","version":3},"cited_work":{"arxiv_id":"2103.13630","doi":"10.48550/arxiv.2103.13630","metadata_source":"arxiv_reference","pith_arxiv_id":"2103.13630","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"W., and Keutzer, K","venue":"arXiv (Cornell University)","work_id":"9743aced-b121-4707-b83f-a7bbe09f738c","year":2021},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"cited_paper":"/paper/2103.13630","citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:91fa766d095596ac2951a019b6cade2bcf4c601f7bea1e4c2a38092af9e01ca7","observation_id":"2ef426c2-1881-4425-84a0-1cb010ea3651","resolution":{"observed_at":"2026-06-29T00:12:49.989139Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T00:09:07.981665Z","title":"Henzinger, Mathias Lechner, and Ðor¯de Žikeli ´c","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:e417a299f66a632ec42aaa86e7505114e59e18899f4385bc2876c67b2816381a","observation_id":"046921bb-5899-4a28-a0ac-941eb09c747a","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"A survey of safety and trustwor- thiness of deep neural networks: Verification, testing, ad- versarial attack and defence, and interpretability.Comput","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:05fa933527385bc45a40cb1e2d53a0c47d4dc14ad89c178b5b2d2f184d5b049d","observation_id":"53cf61ca-e53d-42ff-ae88-c44480750cd7","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:a8b8283a36a2172bc07c4f1d5ec39712ad31950bd813980fb9935262a320c9b0","observation_id":"56ee41e7-4691-4584-8c8e-bfc4e4c45947","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Barrett, David L","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:daca2d4990795ca165c32126127c9c324d18ee592112e3b1246af7957390bfc1","observation_id":"ec059a73-11d0-4f85-8c00-10fdb5253cb6","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Barrett, David L","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:aa7fa4b26dd496fe8a275db2be1c0e759a5b39a964caf4e8796daafab5143567","observation_id":"e853ac1d-6514-400d-8820-2e40d72b8d04","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Combinatorial Optimization: Theory and Algorithms","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:86eb124e4cd59aae970dbd6b1f42fc9867d3ac0b1a59f34fb8e3b8c216e9d453","observation_id":"35b5d4e4-cf1d-4108-bb91-ea09ca53300e","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"2018 edi- tion,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:72084e27038104108ab555846b9536f51e7a54c8a36486dab1d2cf5b59cddc57","observation_id":"fe473226-3929-444d-8e33-7843273bbddd","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","resolver_source":null,"status":"parse_uncertain"},"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-06-29T00:09:07.981665Z","title":"Complexity of fixed-size bit-vector logics.Theory Comput","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:f415a89ee3eccb54bbb617d695e066159e7c027ae0d5381526e53ac0603790d9","observation_id":"c72a92f8-440b-4710-9945-07149612c1bf","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Reachability analysis of deep neural net- works with provable guarantees","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:eea4c13d1a67674f38a66c578b3e080dbff7ae6fc2b04e41c757cb9becfd67f1","observation_id":"3611d827-cf79-4842-8ec0-02c5a39ff9f0","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Reachability is NP-complete even for the simplest neu- ral networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:d537336e9e6df8d46c8d1213b10608813df876604115abb8c04eccc591956911","observation_id":"1a03d28c-7389-4a08-8736-590d94dd90f3","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"[Sälzer and Lange, 2022] Marco Sälzer and Martin Lange","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:0098e401295971bc0570515614b323ac9257cb4e50aa2dee7b9a48aaf8b91654","observation_id":"d36f777e-b358-48f1-be08-b22c33b1bdf1","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Verifying and interpreting neu- ral networks using finite automata","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:7c04a09c3eddbdf0622e3cb1c8891bc9b9f137891ea586920ffa2eb1b1f85ac5","observation_id":"06fc58f1-2e7e-448a-9ad1-1792feaf8b45","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"[Vaswaniet al., 2017 ] Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:89cf1241f62025695732a4fd7a44dde7d2814929517e97f5c5019bf45a601ded","observation_id":"e993271d-1166-4956-8ce3-ed6195cb6d9c","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"On the construction of automata from linear arithmetic constraints","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:da3e3999f96d006a511937be5d3bbb91559c23fd77b0daeea45bfd9ce10f371d","observation_id":"5d976ea0-73f4-4d08-9ebb-e37b47107483","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","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-06-29T00:09:07.981665Z","title":"Complexity of reachability problems in neural networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T00:09:07.981665Z"},"links":{"citing_paper":"/paper/2605.29537"},"observation_digest":"sha256:d69875ceae8788ea2b781fef9cf5d3a441781bea6d2dd2c9a3b7a6c8685bf830","observation_id":"183f1adb-bb1a-455c-9e18-2d23cf26ff13","resolution":{"observed_at":"2026-06-29T00:09:07.981665Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.29537","last_updated":"2026-05-28T07:52:29Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:52:29Z","title":"The Complexity of Verifying Feedforward Neural Networks in Quantised Settings"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":17,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":20},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2605.29537."}