{"as_of":"2026-08-17T22:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a66c19c083971f20dedf5cd306b0572e0bb18da99f182203953c76196c8dc975","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-17T06:30:58.91139+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-15T09:06:57.026613Z","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:89208c481e007593913c7921cd8fa94fdd0f4819232f67337e4a6efe991373df","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-15T09:06:57.026613Z","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:1b125fd1de1c534ef7dde998fc31020f918d607eaf1fdf923bed7a3673317fd4","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-15T09:06:57.026613Z","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:46f74a6a280009aa868bafcdc1fde0e65ff8dc7f72ac1a7005131a88f724f833","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-15T09:06:57.026613Z","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:0553683e6a21be73a816bde67c49fd0a15cd8a3ec0816dc14e1f34566097e379","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-15T09:06:57.026613Z","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:cb6536528cd33024d031b43259a4e41e2c0ed721b47811bd1bfa99bc69cd1ac2","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-15T09:06:57.026613Z","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:64ff18e1d1b620e529cfc22e8a6765473f7d37f559ada66b202e1ed0c7b6eaf2","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-15T09:06:57.026613Z","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:8c9f7bb48f74563b8ffa889f0cad5ecee153ff9f1098001424aab65d493f1044","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-15T09:06:57.026613Z","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:cc6ed663c5fa17bcbcd06749d696031bb6313461b4ba377265de651082efac89","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-15T09:06:57.026613Z","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:635d9d7634fb92e9d35d6a6c3e0753d6d4bb1665d1d72ca7242b66934048df38","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-08-16T14:09:36.521434Z","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-15T09:06:57.026613Z","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:1b7c52a21ee9ea4df0da34ec3ecae93cb82148ed20cb20dc4c280e351bad9c42","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-15T09:06:57.026613Z","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:1dd17e922ea8d3663c8dad822c7557cb652973c8ac944dde92a485172aca9e25","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-15T09:06:57.026613Z","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:088a909bb7cf6b71e7f1fe8807ce7d4d3145f969ad91b53a45f1b6ca9522b736","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-15T09:06:57.026613Z","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:7f0ab7585c9c9a79e56727fde6fe509247ccd9c971024a3d8df4e8c489d1c670","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-15T09:06:57.026613Z","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:b4b2e2c481331d2ae319f05b4d180941f9e48221e6c72db299ca4241a610b9f0","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-15T09:06:57.026613Z","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:230d4e2d69e5bc81d3c0df96d32f72c8ab8308b1a2b7ad89e1e5754f2e7cd183","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-15T09:06:57.026613Z","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:1e0152ed299626e2031ac39fd30dda6ec7bb790235cfdd2bb42e87f24f975db6","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-15T09:06:57.026613Z","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:3f5063c45062e4775f61015bd41086d1b57977410a8086a0acf581590b9a8e0c","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-15T09:06:57.026613Z","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:882178df1b0d37f09165e6bfebc1f4a85345a72dabd6154e3d073f3190b064fe","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-15T09:06:57.026613Z","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:e6b053496f87e1927c326e8aa21465c5cc6ec9220709ac30486f785538efd163","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-15T09:06:57.026613Z","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:7306819b775886a44403288f1869baa403ecefefb02a351a888592c3fde1d526","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-15T09:06:57.026613Z","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:cee4e0b8d43c4a543add84bbf887b82c1c5838d14de822279f148e5c2f16f8c8","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-15T09:06:57.026613Z","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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2603.20819."}