{"as_of":"2026-08-08T16:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1178ab528ebd93a05143077337408079a6d80945cdbaefd6addeddd0c7e5c186","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:35:49.102437Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2607.20811/citation-record","integrity":"/paper/2607.20811/integrity","json":"/paper/2607.20811/citation-record.json","paper":"/paper/2607.20811"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:44.671068Z","title":"Training neural networks is er-complete","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:44.671068Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:eb03af5616d1df5d8e0d3a62efb2b5cc2389255e646e9152478e69fc847de273","observation_id":"ae072385-bf2d-4022-81c3-aae877a395e3","resolution":{"observed_at":"2026-08-01T09:35:44.671068Z","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-01T09:35:44.744802Z","title":"Understanding deep neural networks with rectified linear units","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:44.744802Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:92e79c1b1f3a4ff98c3a2f9ebfcd918c6f7b525cbc802c2cf13be40f7d5875b3","observation_id":"9a7b369c-0452-40b9-a678-0425e9a4ea23","resolution":{"observed_at":"2026-08-01T09:35:44.744802Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.01368","last_updated":"2024-03-22T09:42:26Z","snapshot_observed_at":"2026-08-05T14:05:45.020098Z","submitted_at":"2022-04-04T10:28:11Z","title":"Training Fully Connected Neural Networks is $\\exists\\mathbb{R}$-Complete","version":3},"cited_work":{"arxiv_id":"2204.01368","doi":"10.48550/arxiv.2204.01368","metadata_source":"pith","pith_arxiv_id":"2204.01368","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Training Fully Connected Neural Networks is $\\exists\\mathbb{R}$-Complete","venue":"cs.CC","work_id":"b3f16ff7-0c64-4994-83b7-b4560e0c2cdd","year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:44.822462Z"},"links":{"cited_paper":"/paper/2204.01368","citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:2e1e1dff8893254b4f5d78a1e8b2d168fa8153440dbecdefc45afc256f394a61","observation_id":"a5113a64-3800-4161-bcbb-b48149bebd35","resolution":{"observed_at":"2026-08-01T09:39:30.122621Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:44.891836Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:44.891836Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d131adc1ef0b77f62892574bc16141b4708e5ae4649d7b67698a7e27753212c9","observation_id":"b1804776-8c3a-4201-ab33-ca25f0c07767","resolution":{"observed_at":"2026-08-01T09:35:44.891836Z","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-01T09:35:44.961318Z","title":"S., and Lan, G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:44.961318Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d70d9fa640d1dbf969242b6d510cf742ae24e58b34b66e2849d3010db2c9ce1a","observation_id":"3da4d9c2-c82e-4cb5-9998-35ceca3ccf70","resolution":{"observed_at":"2026-08-01T09:35:44.961318Z","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-01T09:35:45.135060Z","title":"Parameterized algorithms for milps with small treedepth","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.135060Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:60011fc200b79b15c71e1b9ccd613db8cfd7dc2bf9131cc1e0a125e68220be49","observation_id":"3ef63f07-bdc6-433e-88f6-5af906e1c719","resolution":{"observed_at":"2026-08-01T09:35:45.135060Z","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-01T09:35:45.360102Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.360102Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:39ad06bafb70102af4810d23a97cc9b3ce917a2097a96ce36293f08a438b2e9b","observation_id":"480a02d8-f08c-4cc8-8aef-323c7aacad8e","resolution":{"observed_at":"2026-08-01T09:35:45.360102Z","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-01T09:35:45.529971Z","title":"On the expressive power of deep learning: A tensor analysis","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.529971Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:60302969faf49c3ad3888ff675a6c5a3a4e49fa510fb2869f6b7afb2a3a6c600","observation_id":"75edbd21-070d-483c-934e-afe434664c76","resolution":{"observed_at":"2026-08-01T09:35:45.529971Z","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-01T09:35:45.679063Z","title":"The monadic second-order logic of graphs","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.679063Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d2e551117cde548e39a1234f6b3b74b835b59c3745f0bbfe522974917e16d5b9","observation_id":"3b43a22b-b8cb-4fc3-ba09-175058cc9e2e","resolution":{"observed_at":"2026-08-01T09:35:45.679063Z","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-01T09:35:45.733699Z","title":"and Engelfriet, J","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.733699Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:b1af48f1bc470a1ca86ae788b34ba9c87208e7a87b9e0699fffe4953ab5163f3","observation_id":"5c6969fb-fd1f-43c7-863c-60110f08b09a","resolution":{"observed_at":"2026-08-01T09:35:45.733699Z","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-01T09:35:45.758560Z","title":"and Pillow, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.758560Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:7b7fd01906299e942cbf20800d264bc5ba546fbb24bf6c7a859c951c32787c38","observation_id":"18021a30-f25e-41fe-b2d3-aedd9272902b","resolution":{"observed_at":"2026-08-01T09:35:45.758560Z","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-01T09:35:45.796911Z","title":"V., Panolan, F., and Simonov, K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.796911Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:166afa2ebb9e19c8bd7a8857f67bb272120596cf4726a860ed3ef888d12df633","observation_id":"656f7ed1-64c5-43af-88f6-a0d9de52e056","resolution":{"observed_at":"2026-08-01T09:35:45.796911Z","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-01T09:35:45.845867Z","title":"S., Wang, G., and Xie, Y","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.845867Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d4ad8dd4b1083e58ad6de75c20922907ef179a9dc5246acadffc81325ce92a02","observation_id":"fe6d5c87-db88-4788-8cf3-24386f73cd04","resolution":{"observed_at":"2026-08-01T09:35:45.845867Z","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-01T09:35:45.900512Z","title":"Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.900512Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:5cc3d53f8fc1fc3f771cebc1f4d339d55bf32f2a8f973860fafc38bc92a41a5b","observation_id":"4755f18d-95a8-4fce-9a07-bd224bf62701","resolution":{"observed_at":"2026-08-01T09:35:45.900512Z","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-01T09:35:45.946572Z","title":"Constructing arrangements of lines and hyperplanes with applications","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:45.946572Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:66ee51a95be1ee112f169e21ce0f52b0a4a41bf43e64015300717dec1d73dc57","observation_id":"d1a6e25c-ad50-4ea2-aa91-ff24a400748c","resolution":{"observed_at":"2026-08-01T09:35:45.946572Z","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-01T09:35:46.048434Z","title":"and Shamir, O","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.048434Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:925a43ee299ba0b1d91981a88d3d4c1b1c83bda4ac9df6e59e7f568759f1607e","observation_id":"bc3e5329-187c-4102-85f4-0b420e566392","resolution":{"observed_at":"2026-08-01T09:35:46.048434Z","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-01T09:35:46.129051Z","title":"and Tardos, \\'E","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.129051Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d58cced4ffaa7e79f3fe2f56261982d2d523100f5c42c76283791c04bdcd7ea4","observation_id":"cae4065b-fe21-4187-8783-0c568d9009b8","resolution":{"observed_at":"2026-08-01T09:35:46.129051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.17045","last_updated":"2024-01-18T12:10:03Z","snapshot_observed_at":"2026-08-05T21:02:53.757400Z","submitted_at":"2023-03-29T22:16:52Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension","version":2},"cited_work":{"arxiv_id":"2303.17045","doi":"10.48550/arxiv.2303.17045","metadata_source":"pith","pith_arxiv_id":"2303.17045","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Training Neural Networks is NP-Hard in Fixed Dimension","venue":"cs.CC","work_id":"d1d866dc-4695-42e7-9969-ce05dbf980a2","year":2023},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.192253Z"},"links":{"cited_paper":"/paper/2303.17045","citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:95b40e71fc548427afa1f1bfba043fbca66d1d96f461beeb7c24bfac0804543a","observation_id":"9e1cf20e-0e31-4d07-b46c-ce032c4ecc1b","resolution":{"observed_at":"2026-08-01T09:39:29.936815Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.1.13547","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"The computational complexity of relu network training parameterized by data dimensionality","venue":"Journal of Artificial Intelligence Research","work_id":"466174f6-069f-40f0-adf6-535ce47c8f54","year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.352762Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:0d2c6347201b8857c09261b9e9ce64d93e5bdb60778d62f5f775cfd9c176e293","observation_id":"f1acd42a-e94d-4f8d-a476-d9fbc60af31a","resolution":{"observed_at":"2026-08-01T09:39:29.878872Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:46.405167Z","title":"and Korchemna, V","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.405167Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:d96dc9caae3d7a043c10a46f6a0ecc9cf055afcb820524e241fbdda70aa6f1e1","observation_id":"705f7b99-ef02-49c1-894a-fbe7158826f5","resolution":{"observed_at":"2026-08-01T09:35:46.405167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/a12120248","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Ordyniak, S","venue":"Algorithms","work_id":"2d6ecabe-9909-499d-acd2-cea20646d09f","year":2019},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.459957Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:6975be7216901ee84ecdeb91c2e6eebb1f91fa8baf8bf2670c67a0b4b2651a92","observation_id":"c7a817af-650e-4131-a92a-3d079a6482ff","resolution":{"observed_at":"2026-08-01T09:39:29.770625Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:46.612873Z","title":"A., Ordyniak, S., and Szeider, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.612873Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:cd20d44e63a47bbc29a1d236ecd25ccb397e26cb4033e72cd3fd4968805120a5","observation_id":"b4c396ab-91b4-4d3a-96e0-60c88380339c","resolution":{"observed_at":"2026-08-01T09:35:46.612873Z","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-01T09:35:46.710339Z","title":"The complexity of k-means clustering when little is known","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.710339Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:a59863b762e089063d8d7b5a50cb16fe58f045563fab601ccadab1c90907ccab","observation_id":"900d8007-06af-488a-9596-bca29e2cbddb","resolution":{"observed_at":"2026-08-01T09:35:46.710339Z","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-01T09:35:46.809384Z","title":"Adaptive convolutional relus","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.809384Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:219bf26b6961e98b64e25203f33b5fb370962e8cc19b5944b6aadedbcb47158f","observation_id":"fe29e983-90b3-426f-9a6e-f1157de25846","resolution":{"observed_at":"2026-08-01T09:35:46.809384Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2021.22","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"R., Manurangsi, P., and Reichman, D","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"90859f50-7133-48d3-8d7b-42cd998786d9","year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:46.931077Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:227980c578de4aa22b560a50ea7ecc4fd31bc1fbb201bbe29d2543b79885b417","observation_id":"2f653c03-a5db-4878-9a46-1af6add504b8","resolution":{"observed_at":"2026-08-01T09:39:29.607970Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:47.042086Z","title":"Deep Learning","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.042086Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:45bea3390fe2b152c90c29c913a2ceccaef035f66a3829b02f22023152321cea","observation_id":"e07b97f3-78fb-420d-afda-d175dc927743","resolution":{"observed_at":"2026-08-01T09:35:47.042086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.1.13138","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Komusiewicz, C","venue":"Journal of Artificial Intelligence Research","work_id":"79706e8d-f138-4da2-b664-32629d52bd86","year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.137185Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:577b8286e9cee2b35c8021df3aeb35642ea8bc5bbfc1f2e2c7fa8976536ceb60","observation_id":"d3c7f9ea-bdd0-4e72-99c4-1811a6e3442a","resolution":{"observed_at":"2026-08-01T09:39:29.513206Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:47.221090Z","title":"Lower bounds on the depth of integral relu neural networks via lattice polytopes","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.221090Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:655fb93ab74faf27569a4f775b120d005a522e2ae82ee5ba7f0bc1f295a17c9b","observation_id":"9a6ab800-bbfe-46a5-8871-4ab2960af4ac","resolution":{"observed_at":"2026-08-01T09:35:47.221090Z","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-01T09:35:47.345694Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.345694Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:603ea3328741b4b823ffdf187a349be75edbc8dd3afc89c365dd96a65430a889","observation_id":"dfda9128-44ff-4ba1-bacc-c189080a7ab5","resolution":{"observed_at":"2026-08-01T09:35:47.345694Z","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-01T09:35:47.502337Z","title":"and Telle, J","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.502337Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:1b571d0d9dec46e16c3c3862da2474d797eadbfa920f588a624d0dfdd73dad1f","observation_id":"43952d8f-6335-419c-9e34-5b293ce59705","resolution":{"observed_at":"2026-08-01T09:35:47.502337Z","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-01T09:35:47.634767Z","title":"Facets of neural network complexity","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.634767Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:7993238565bda2d0cffc40e98e6fa30ad97ba95e27fb638cd4e0689b06789bbf","observation_id":"4eef7658-988a-4fbe-8fee-caa41cf34414","resolution":{"observed_at":"2026-08-01T09:35:47.634767Z","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-01T09:35:47.714472Z","title":"D., and Skutella, M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.714472Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:ced42818b6f46767a0f437ed8537be4fc8410c1f38d25279253972ae13337e58","observation_id":"e3e501e4-a5a7-4703-b3ba-26773c5fcbaf","resolution":{"observed_at":"2026-08-01T09:35:47.714472Z","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-01T09:35:47.800479Z","title":"Minkowski's convex body theorem and integer programming","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.800479Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:61ab0f88c841be2dd17742bf14b95f0ef66a1221750314f79e11299e07a0f8df","observation_id":"d0aaf823-3505-4180-9df6-41984607d513","resolution":{"observed_at":"2026-08-01T09:35:47.800479Z","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-01T09:35:47.904841Z","title":"K., Tarasov, S","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.904841Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:012dff1ce8fee0e82f5ca768ebf1399281d077fa926d7ebe0dc203aa03277f3f","observation_id":"c4ded68b-c582-4b82-acd4-d9ac6674d37b","resolution":{"observed_at":"2026-08-01T09:35:47.904841Z","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-01T09:35:47.979090Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:47.979090Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:c5e8f699af037b983fc80b5f28b611744af8c6432b4913453ee1b7e15b607958","observation_id":"03f5ef15-b65d-497f-aff9-dcb1484abc3d","resolution":{"observed_at":"2026-08-01T09:35:47.979090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s0097539793256041","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bounds for the computational power and learning complexity of analog neural nets","venue":"SIAM Journal on Computing","work_id":"e69fe78a-730c-451f-b5eb-b2c3e5a6e1be","year":1997},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.083374Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:8ed8182077c1bb26ac53b3e15850d0c0fdde147dbf3c696a3cc7cbd1c0f4c4bd","observation_id":"c336b640-c0c0-41f0-bb18-c8652bb8ff48","resolution":{"observed_at":"2026-08-01T09:39:29.415440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf02187916","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"On the complexity of polyhedral separability","venue":"Discrete & Computational Geometry","work_id":"57a73dd4-923c-4f0d-b496-4653565de935","year":1988},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.160265Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:63837b88aa9b9ba33bcfe3085f1da258e1e4e1baa402f39e2e74fde2f83b8b1a","observation_id":"3243a6ec-b3c9-40f5-a02a-b403b793954a","resolution":{"observed_at":"2026-08-01T09:39:29.323061Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.3744","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"and Szeider, S","venue":"Journal of Artificial Intelligence Research","work_id":"e663a47a-bc81-4863-b461-3097834c9150","year":2013},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.238500Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:0f2c8e7b7c812f97fb7845b827df19268b415a5bc3f039ab464abeb0e3e8e3ba","observation_id":"7d82307d-7546-49fe-a36a-c45e09d986e7","resolution":{"observed_at":"2026-08-01T09:39:29.228674Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:35:48.346077Z","title":"Methods for quadratic programming: A survey","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.346077Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:5408b7182e4797bf681c7156b50879448c2d85a3c4b39a32938c4e2fdb67a55f","observation_id":"01aba5b3-3e2e-4e9b-8fe1-7aebbdd43301","resolution":{"observed_at":"2026-08-01T09:35:48.346077Z","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-01T09:35:48.416660Z","title":"Effect of activation functions on the training of overparametrized neural nets","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.416660Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:dce3515b25e550f36129fe606907d5f95d51bfafcd57153a558cea4b8b0ab549","observation_id":"b6b55dd7-7753-43e7-b2a0-cf7ed512a0bb","resolution":{"observed_at":"2026-08-01T09:35:48.416660Z","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-01T09:35:48.487342Z","title":"and Seymour, P","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.487342Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:394d5c0a8aadc28295f88f8dfc73e586f240d6612a061312a9588ef14bf20b0a","observation_id":"2d5ab93a-6bf5-4841-b0d9-cd83d854558b","resolution":{"observed_at":"2026-08-01T09:35:48.487342Z","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-01T09:35:48.576881Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.576881Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:19cc05490426b749d9c24cb4a9c033073b8cc80a2f64ba52d282b8d0ec786fcd","observation_id":"b3e70175-5237-42b9-af1d-ca92db7e7bf9","resolution":{"observed_at":"2026-08-01T09:35:48.576881Z","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-01T09:35:48.693789Z","title":"V., Golovach, P","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.693789Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:67b1cafa96a5b9f8684cc688ada73ce046ed845cbdfb20b8ad5532b867a12d1e","observation_id":"38d9412d-39d0-4a0a-9e1b-ff79edcf279e","resolution":{"observed_at":"2026-08-01T09:35:48.693789Z","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-01T09:35:48.815497Z","title":"A Decision Method for Elementary Algebra and Geometry: Prepared for Publication with the Assistance of J.C.C","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.815497Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:4a1c4ec9c56275a329894db9cefd52d71014a109f64809bca9ddcb4694e28a0f","observation_id":"03f7b3f6-1432-403a-a419-85b94d07578d","resolution":{"observed_at":"2026-08-01T09:35:48.815497Z","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-01T09:35:48.987955Z","title":"benefits of depth in neural networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:48.987955Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:0990e6ba1a09445dd23a44a60bbb5b50eab4d2bd8bbf9e5811b7b8e02a87cac7","observation_id":"e1eb2a05-3616-4c0e-a8ce-4427b8372417","resolution":{"observed_at":"2026-08-01T09:35:48.987955Z","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-01T09:35:49.102437Z","title":"and Reinsel, G","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T09:35:49.102437Z"},"links":{"citing_paper":"/paper/2607.20811"},"observation_digest":"sha256:2035178bbd8729631a7aa77a5fa83d4918b1fc1ff352cb276da7fd97188ad224","observation_id":"828f7e53-c310-44c0-8d12-2f8d99fc01fc","resolution":{"observed_at":"2026-08-01T09:35:49.102437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.20811","last_updated":"2026-07-23T00:44:44Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T14:19:14.794713Z","submitted_at":"2026-07-23T00:44:44Z","title":"New Complexity-Theoretic Frontiers of Tractability for Neural Network Training"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":37,"verified_exact":9,"verified_fuzzy":0},"total_outbound_references":46},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.20811."}