{"as_of":"2026-08-08T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80c108ad8c35411e164ed3177a4402e35594547e136340ebe4eaa435d7a238e1","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T21:12:12.385080Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-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/2603.20819/citation-record","integrity":"/paper/2603.20819/integrity","json":"/paper/2603.20819/citation-record.json","paper":"/paper/2603.20819"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T21:12:12.385080Z","title":"Near optimal finite time identification of arbitrary linear dynamical systems,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:5fec6fcde8be348960b33bf38cbb72ee698d07a2cb778cd48779e9ddc1e3638c","observation_id":"37d811cc-79f4-48f5-a178-308aeb8a1236","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Non-asymptotic identification of lti systems from a single trajectory,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:a55712e850da203acc646c75d0dc2bdc0834245c84ac52ccb2e1f925eb8eaf91","observation_id":"5b0fd7e6-1017-415c-892d-afe3c38e0575","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"System identification under bounded noise: Optimal rates beyond least squares,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:1e1679728d369822812f743402012a0ab3635a7a383aab0e8ca104cc0b43a0e7","observation_id":"3bf95f1f-2040-43d7-ac67-a581be5ccb2e","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Learning without mixing: Towards a sharp analysis of linear system identification,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:4e4ae8111ac36e86cea1e0be0b7f7e101373e8f678ef8f468d4224261da31103","observation_id":"0fc70172-74d5-4ad1-bec6-62f78a954a64","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Naive exploration is optimal for online lqr,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:f54c89cc733dac34d5793619b5a9efa3b14e878ff0383c5da48a9c1cf8928bb5","observation_id":"7341c82f-8033-4bec-862c-e5441f5d3d4c","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Convergence properties of the membership set,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:cc63a9805ac39b0bdbc3fff81d169b5bca17274919438dd7ec72c5b1e6c16a17","observation_id":"d497a4b5-041f-4453-89d7-524bf7376567","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"The size of the membership-set in a probabilistic framework,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:2f287081a53c2c5112c3ecfbd120a7f31111fececda629e556c41613f60e55b7","observation_id":"912ff845-3d5b-4d4e-a423-e6ba88d2bf5c","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Set membership identification of nonlinear systems,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:f2eff3a9e64dfd595ab4557bc0299f3ab6ff1cd2da61451e188e3babddbab3a1","observation_id":"0ad30cbd-2ac8-41fa-9d15-502207b9cbec","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"On the sample complexity of set membership estimation for linear systems with disturbances bounded by convex sets,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:62c40c61f480e8b77801c6c1e82438ac5c0e80fc9f301597f212f578ed03e810","observation_id":"ee545ff4-0b73-4c7c-8233-a803a1014fe3","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.09990","last_updated":"2024-08-05T04:02:29Z","snapshot_observed_at":"2026-07-06T17:45:02.270647Z","submitted_at":"2024-03-15T03:20:10Z","title":"CLOSURE: Fast Quantification of Pose Uncertainty Sets","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.09990","snapshot_observed_at":"2026-07-13T21:12:12.385080Z","title":"Closure: Fast quantification of pose uncertainty sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"cited_paper":"/paper/2403.09990","citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:bdf0bf990e35d098029141d8117b5a14220e5fe0ade9a23967d01f2520024545","observation_id":"4393ff63-9b15-4601-ab64-0557d5c5c657","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Set membership identification of linear systems with guaranteed simulation accuracy,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:13e5ec90eccf3ec4916d97237a52e383b5da22a4f20d0c88361d86579eeb549f","observation_id":"0f2c6354-a0a6-4b51-a749-a0479c8f58fd","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Online learning of stabilizing controllers using noisy input-output data and prior knowledge,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:8101eac376ad6da29c676f444f1d6325b10ac5d5acb65aac1b23a90c3b02a63c","observation_id":"c7509b00-4d0d-42bf-ae7c-cf8bfee890fb","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Online adversarial stabilization of unknown networked systems,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:14e5662725afed64f5d939120e1d90db798a51bc9134d1000f8fc3dbd78f1e94","observation_id":"db790af7-540f-4a35-87c0-b8a5f24dcde3","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Dual adaptive mpc using an exact set-membership reformulation,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:0829969cfb90afa683650e41a2ebf24c0adb64cf8fb1ddaa5bf025bf8fe4b226","observation_id":"df5330ee-056a-4881-93d6-69dfa88a0ade","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Learning the uncertainty sets of linear control systems via set membership: a non-asymptotic analysis,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:c4adbf6dd10c07d58cf4606cb11be278e48aa95522e872f1c6f3f9bcc8db000b","observation_id":"efc11c8c-5bc9-4ce3-acd1-f90e71c531d2","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Finite sample identification of bilinear dynamical systems,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:49dd5973cc2a815597e24a061d1f83d7f102e0385822f672e047ac2398cc97f9","observation_id":"11ad6d38-932f-448a-9c3f-524bfbca5590","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Bilinear model predictive control of a hvac system using sequential quadratic programming,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:266e202add2de6c52cab30e554f295b5af782d48eaabdd6cd81210cc59fd34d6","observation_id":"9d1ecd97-bc5d-4eed-9d28-e5eb4ec68abe","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Finite sample identification of partially observed bilinear dynamical systems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:68553fb6e38bcd05f748b6da771c4b3fe8df74ff67df32c651828d96bef8af85","observation_id":"cd38090b-d954-4899-812f-971267736157","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Mean square stability conditions for discrete stochastic bilinear systems,","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:de7875a3d8b77006dccdbca4042bbcafbf433e7bf23a558317bf5e84660883e0","observation_id":"3fad3c33-dfac-431d-9476-ae20489c4297","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Identification of analytic nonlinear dynamical systems with non-asymptotic guarantees,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:0accfc8d731a6f1d4f53546755de16881aea732b0ce7897ad3fd7213ea318cad","observation_id":"6cc9c8cc-0101-48aa-90f4-bc5412b81a38","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","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-07-13T21:12:12.385080Z","title":"Moments, concentration, and entropy of log-concave distributions,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T21:12:12.385080Z"},"links":{"citing_paper":"/paper/2603.20819"},"observation_digest":"sha256:b3fe044de93037039b7d3c2716a0e38a077022c1ecc4da0828a859344e54dd45","observation_id":"1d73a033-dfbe-46f5-b703-354788c1e9e8","resolution":{"observed_at":"2026-07-13T21:12:12.385080Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.20819","last_updated":"2026-06-21T17:38:32Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-03T07:42:41.563150Z","submitted_at":"2026-03-21T13:40:01Z","title":"Achieving $\\widetilde{O}(1/\\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2603.20819."}