Pith. sign in

Paper Citation Record · LEDGER

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2603.20819 v2

Coverage vector

measured 21 of 21 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-13T21:12:12.385080Z

measured 21 of 21 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

21 of 21 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved21
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 37d811cc-79f4-48f5-a178-308aeb8a1236 · outbound

This paper cites Near optimal finite time identification of arbitrary linear dynamical systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Near optimal finite time identification of arbitrary linear dynamical systems,

Reference 1

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:5fec6fcde8be348960b33bf38cbb72ee698d07a2cb778cd48779e9ddc1e3638c

Observation 5b0fd7e6-1017-415c-892d-afe3c38e0575 · outbound

This paper cites Non-asymptotic identification of lti systems from a single trajectory,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Non-asymptotic identification of lti systems from a single trajectory,

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:a55712e850da203acc646c75d0dc2bdc0834245c84ac52ccb2e1f925eb8eaf91

Observation 3bf95f1f-2040-43d7-ac67-a581be5ccb2e · outbound

This paper cites System identification under bounded noise: Optimal rates beyond least squares,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises System identification under bounded noise: Optimal rates beyond least squares,

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:1e1679728d369822812f743402012a0ab3635a7a383aab0e8ca104cc0b43a0e7

Observation 0fc70172-74d5-4ad1-bec6-62f78a954a64 · outbound

This paper cites Learning without mixing: Towards a sharp analysis of linear system identification,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Learning without mixing: Towards a sharp analysis of linear system identification,

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:4e4ae8111ac36e86cea1e0be0b7f7e101373e8f678ef8f468d4224261da31103

Observation 7341c82f-8033-4bec-862c-e5441f5d3d4c · outbound

This paper cites Naive exploration is optimal for online lqr,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Naive exploration is optimal for online lqr,

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:f54c89cc733dac34d5793619b5a9efa3b14e878ff0383c5da48a9c1cf8928bb5

Observation d497a4b5-041f-4453-89d7-524bf7376567 · outbound

This paper cites Convergence properties of the membership set,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Convergence properties of the membership set,

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:cc63a9805ac39b0bdbc3fff81d169b5bca17274919438dd7ec72c5b1e6c16a17

Observation 912ff845-3d5b-4d4e-a423-e6ba88d2bf5c · outbound

This paper cites The size of the membership-set in a probabilistic framework,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises The size of the membership-set in a probabilistic framework,

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:2f287081a53c2c5112c3ecfbd120a7f31111fececda629e556c41613f60e55b7

Observation 0ad30cbd-2ac8-41fa-9d15-502207b9cbec · outbound

This paper cites Set membership identification of nonlinear systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Set membership identification of nonlinear systems,

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:f2eff3a9e64dfd595ab4557bc0299f3ab6ff1cd2da61451e188e3babddbab3a1

Observation ee545ff4-0b73-4c7c-8233-a803a1014fe3 · outbound

This paper cites On the sample complexity of set membership estimation for linear systems with disturbances bounded by convex sets,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises On the sample complexity of set membership estimation for linear systems with disturbances bounded by convex sets,

Reference 9

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:62c40c61f480e8b77801c6c1e82438ac5c0e80fc9f301597f212f578ed03e810

Observation 4393ff63-9b15-4601-ab64-0557d5c5c657 · outbound

This paper cites CLOSURE: Fast Quantification of Pose Uncertainty Sets.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises CLOSURE: Fast Quantification of Pose Uncertainty Sets

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:bdf0bf990e35d098029141d8117b5a14220e5fe0ade9a23967d01f2520024545

Observation 0f2c6354-a0a6-4b51-a749-a0479c8f58fd · outbound

This paper cites Set membership identification of linear systems with guaranteed simulation accuracy,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Set membership identification of linear systems with guaranteed simulation accuracy,

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:13e5ec90eccf3ec4916d97237a52e383b5da22a4f20d0c88361d86579eeb549f

Observation c7509b00-4d0d-42bf-ae7c-cf8bfee890fb · outbound

This paper cites Online learning of stabilizing controllers using noisy input-output data and prior knowledge,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Online learning of stabilizing controllers using noisy input-output data and prior knowledge,

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:8101eac376ad6da29c676f444f1d6325b10ac5d5acb65aac1b23a90c3b02a63c

Observation db790af7-540f-4a35-87c0-b8a5f24dcde3 · outbound

This paper cites Online adversarial stabilization of unknown networked systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Online adversarial stabilization of unknown networked systems,

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:14e5662725afed64f5d939120e1d90db798a51bc9134d1000f8fc3dbd78f1e94

Observation df5330ee-056a-4881-93d6-69dfa88a0ade · outbound

This paper cites Dual adaptive mpc using an exact set-membership reformulation,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Dual adaptive mpc using an exact set-membership reformulation,

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:0829969cfb90afa683650e41a2ebf24c0adb64cf8fb1ddaa5bf025bf8fe4b226

Observation efc11c8c-5bc9-4ce3-acd1-f90e71c531d2 · outbound

This paper cites Learning the uncertainty sets of linear control systems via set membership: a non-asymptotic analysis,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Learning the uncertainty sets of linear control systems via set membership: a non-asymptotic analysis,

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:c4adbf6dd10c07d58cf4606cb11be278e48aa95522e872f1c6f3f9bcc8db000b

Observation 11ad6d38-932f-448a-9c3f-524bfbca5590 · outbound

This paper cites Finite sample identification of bilinear dynamical systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Finite sample identification of bilinear dynamical systems,

Reference 16

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:49dd5973cc2a815597e24a061d1f83d7f102e0385822f672e047ac2398cc97f9

Observation 9d1ecd97-bc5d-4eed-9d28-e5eb4ec68abe · outbound

This paper cites Bilinear model predictive control of a hvac system using sequential quadratic programming,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Bilinear model predictive control of a hvac system using sequential quadratic programming,

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:266e202add2de6c52cab30e554f295b5af782d48eaabdd6cd81210cc59fd34d6

Observation cd38090b-d954-4899-812f-971267736157 · outbound

This paper cites Finite sample identification of partially observed bilinear dynamical systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Finite sample identification of partially observed bilinear dynamical systems,

Reference 18

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:68553fb6e38bcd05f748b6da771c4b3fe8df74ff67df32c651828d96bef8af85

Observation 3fad3c33-dfac-431d-9476-ae20489c4297 · outbound

This paper cites Mean square stability conditions for discrete stochastic bilinear systems,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Mean square stability conditions for discrete stochastic bilinear systems,

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:de7875a3d8b77006dccdbca4042bbcafbf433e7bf23a558317bf5e84660883e0

Observation 6cc9c8cc-0101-48aa-90f4-bc5412b81a38 · outbound

This paper cites Identification of analytic nonlinear dynamical systems with non-asymptotic guarantees,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Identification of analytic nonlinear dynamical systems with non-asymptotic guarantees,

Reference 20

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:0accfc8d731a6f1d4f53546755de16881aea732b0ce7897ad3fd7213ea318cad

Observation 1d73a033-dfbe-46f5-b703-354788c1e9e8 · outbound

This paper cites Moments, concentration, and entropy of log-concave distributions,.

Achieving $\widetilde{O}(1/\epsilon)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises Moments, concentration, and entropy of log-concave distributions,

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-13T21:12:12.385080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-13T21:12:12.385080Z digest=sha256:b3fe044de93037039b7d3c2716a0e38a077022c1ecc4da0828a859344e54dd45

Pith citing papers

No inbound Pith citation observations are available.