{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:QJWCVLZ4OHCHW7BOPMVEYGPJH7","short_pith_number":"pith:QJWCVLZ4","schema_version":"1.0","canonical_sha256":"826c2aaf3c71c47b7c2e7b2a4c19e93fe881b555669715cf24533c56d55724ea","source":{"kind":"arxiv","id":"2411.18318","version":2},"attestation_state":"computed","paper":{"title":"Scaled Relative Graph Analysis of Lur'e Systems and the Generalized Circle Criterion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Amritam Das, Julius P.J. Krebbekx, Roland T\\'oth","submitted_at":"2024-11-27T13:15:50Z","abstract_excerpt":"Scaled Relative Graphs (SRGs) provide a novel graphical frequency-domain method for the analysis of nonlinear systems. However, we show that the current SRG analysis suffers from a pitfall that limit its applicability in analyzing practical nonlinear systems. We overcome this pitfall by modifying the SRG of a linear time invariant operator, combining the SRG with the Nyquist criterion, and apply our result to Lur'e systems. We thereby obtain a generalization of the celebrated circle criterion, which deals with a broader class of nonlinearities, and provides (incremental) $L_2$-gain performance"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.18318","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2024-11-27T13:15:50Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"091058e951195e35124c09ab90f62fff99a762826fbaddbe9ceb93af4c75886b","abstract_canon_sha256":"87f0992891b19a242ee459f5bdd1e2c1fb65d39c4e16b9bb7caf48b59427f65a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:47:33.958095Z","signature_b64":"9jujPGMs/MaHHzLNC9mN1D7ctw1fZnKab/ES0JcWSYLIMzeP4QZJzwWobltmpzoClwDBCNrE/bFOQOKp/phPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"826c2aaf3c71c47b7c2e7b2a4c19e93fe881b555669715cf24533c56d55724ea","last_reissued_at":"2026-07-05T10:47:33.957627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:47:33.957627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaled Relative Graph Analysis of Lur'e Systems and the Generalized Circle Criterion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Amritam Das, Julius P.J. Krebbekx, Roland T\\'oth","submitted_at":"2024-11-27T13:15:50Z","abstract_excerpt":"Scaled Relative Graphs (SRGs) provide a novel graphical frequency-domain method for the analysis of nonlinear systems. However, we show that the current SRG analysis suffers from a pitfall that limit its applicability in analyzing practical nonlinear systems. We overcome this pitfall by modifying the SRG of a linear time invariant operator, combining the SRG with the Nyquist criterion, and apply our result to Lur'e systems. We thereby obtain a generalization of the celebrated circle criterion, which deals with a broader class of nonlinearities, and provides (incremental) $L_2$-gain performance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18318","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.18318/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.18318","created_at":"2026-07-05T10:47:33.957684+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18318v2","created_at":"2026-07-05T10:47:33.957684+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18318","created_at":"2026-07-05T10:47:33.957684+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJWCVLZ4OHCH","created_at":"2026-07-05T10:47:33.957684+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJWCVLZ4OHCHW7BO","created_at":"2026-07-05T10:47:33.957684+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJWCVLZ4","created_at":"2026-07-05T10:47:33.957684+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2511.08420","citing_title":"Computable Characterisations of Scaled Relative Graphs of Closed Operators","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7","json":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7.json","graph_json":"https://pith.science/api/pith-number/QJWCVLZ4OHCHW7BOPMVEYGPJH7/graph.json","events_json":"https://pith.science/api/pith-number/QJWCVLZ4OHCHW7BOPMVEYGPJH7/events.json","paper":"https://pith.science/paper/QJWCVLZ4"},"agent_actions":{"view_html":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7","download_json":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7.json","view_paper":"https://pith.science/paper/QJWCVLZ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18318&json=true","fetch_graph":"https://pith.science/api/pith-number/QJWCVLZ4OHCHW7BOPMVEYGPJH7/graph.json","fetch_events":"https://pith.science/api/pith-number/QJWCVLZ4OHCHW7BOPMVEYGPJH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7/action/storage_attestation","attest_author":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7/action/author_attestation","sign_citation":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7/action/citation_signature","submit_replication":"https://pith.science/pith/QJWCVLZ4OHCHW7BOPMVEYGPJH7/action/replication_record"}},"created_at":"2026-07-05T10:47:33.957684+00:00","updated_at":"2026-07-05T10:47:33.957684+00:00"}