{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NQGBKO73XOT2KT2LHP4T3X4LTO","short_pith_number":"pith:NQGBKO73","canonical_record":{"source":{"id":"1503.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-05T23:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"23b083f76ad85aa4909fa612e360362bb7410f267e71ef9770a77ae74bbce4b3","abstract_canon_sha256":"2eede52a35cbf540337fe000d47da3c2150dcd72b9b2b524f99a2410d9b446d5"},"schema_version":"1.0"},"canonical_sha256":"6c0c153bfbbba7a54f4b3bf93ddf8b9b93203ea3477124f3d2545c61cd475ebf","source":{"kind":"arxiv","id":"1503.01818","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01818","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01818v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01818","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"NQGBKO73XOT2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQGBKO73XOT2KT2L","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQGBKO73","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NQGBKO73XOT2KT2LHP4T3X4LTO","target":"record","payload":{"canonical_record":{"source":{"id":"1503.01818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-05T23:56:45Z","cross_cats_sorted":[],"title_canon_sha256":"23b083f76ad85aa4909fa612e360362bb7410f267e71ef9770a77ae74bbce4b3","abstract_canon_sha256":"2eede52a35cbf540337fe000d47da3c2150dcd72b9b2b524f99a2410d9b446d5"},"schema_version":"1.0"},"canonical_sha256":"6c0c153bfbbba7a54f4b3bf93ddf8b9b93203ea3477124f3d2545c61cd475ebf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:27.477377Z","signature_b64":"ElA9JD/uqOj/UeMoFZ4eQG3TwS17bN+6u4h6s3anX+UX323dyHMXjEP66NbjgASeiWkhcKfl0er6qHfiNbk/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c0c153bfbbba7a54f4b3bf93ddf8b9b93203ea3477124f3d2545c61cd475ebf","last_reissued_at":"2026-05-18T02:25:27.476993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:27.476993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.01818","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ns0yBk8sYPkY7PKhaWkNBSOHb12FKG0DR+BIIL0+Qve31d6hz9oPePRoYVHDo3je5vYqXyV4jzyE0MrcOoanDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:28:19.917497Z"},"content_sha256":"c348a33d44a6bf6916023f4d94b6b2305c52c46c00bf77945b0f265dbd0d004c","schema_version":"1.0","event_id":"sha256:c348a33d44a6bf6916023f4d94b6b2305c52c46c00bf77945b0f265dbd0d004c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NQGBKO73XOT2KT2LHP4T3X4LTO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stability of Discrete time Recurrent Neural Networks and Nonlinear optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jayant Singh, Nikita Barabanov","submitted_at":"2015-03-05T23:56:45Z","abstract_excerpt":"We consider the method of Reduction of Dissipativity Domain to prove global Lyapunov stability of Discrete Time Recurrent Neural Networks. The standard and advanced criteria for Absolute Stability of these essentially nonlinear systems produce rather weak results. The method mentioned above is proved to be more powerful. It involves a multi-step procedure with maximization of special nonconvex functions over polytopes on every step. We derive conditions which guarantee an existence of at most one point of local maximum for such functions over every hyperplane. This nontrivial result is valid f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01818","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:25:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ROtP8J5JWNlokLHmF/FYK7sU2kSBjASNsChre5vrSdEHbOfa4qUgIes6+Qio0dG4RcBYdR9oFquJECK9DVKKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:28:19.917841Z"},"content_sha256":"be00d6cac8553befcfef13fa82ff805178e814faee3bc6f30a03e0c6078aee4f","schema_version":"1.0","event_id":"sha256:be00d6cac8553befcfef13fa82ff805178e814faee3bc6f30a03e0c6078aee4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/bundle.json","state_url":"https://pith.science/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T07:28:19Z","links":{"resolver":"https://pith.science/pith/NQGBKO73XOT2KT2LHP4T3X4LTO","bundle":"https://pith.science/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/bundle.json","state":"https://pith.science/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQGBKO73XOT2KT2LHP4T3X4LTO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NQGBKO73XOT2KT2LHP4T3X4LTO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2eede52a35cbf540337fe000d47da3c2150dcd72b9b2b524f99a2410d9b446d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-05T23:56:45Z","title_canon_sha256":"23b083f76ad85aa4909fa612e360362bb7410f267e71ef9770a77ae74bbce4b3"},"schema_version":"1.0","source":{"id":"1503.01818","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.01818","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"arxiv_version","alias_value":"1503.01818v1","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01818","created_at":"2026-05-18T02:25:27Z"},{"alias_kind":"pith_short_12","alias_value":"NQGBKO73XOT2","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"NQGBKO73XOT2KT2L","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"NQGBKO73","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:be00d6cac8553befcfef13fa82ff805178e814faee3bc6f30a03e0c6078aee4f","target":"graph","created_at":"2026-05-18T02:25:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We consider the method of Reduction of Dissipativity Domain to prove global Lyapunov stability of Discrete Time Recurrent Neural Networks. The standard and advanced criteria for Absolute Stability of these essentially nonlinear systems produce rather weak results. The method mentioned above is proved to be more powerful. It involves a multi-step procedure with maximization of special nonconvex functions over polytopes on every step. We derive conditions which guarantee an existence of at most one point of local maximum for such functions over every hyperplane. This nontrivial result is valid f","authors_text":"Jayant Singh, Nikita Barabanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-05T23:56:45Z","title":"Stability of Discrete time Recurrent Neural Networks and Nonlinear optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01818","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c348a33d44a6bf6916023f4d94b6b2305c52c46c00bf77945b0f265dbd0d004c","target":"record","created_at":"2026-05-18T02:25:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2eede52a35cbf540337fe000d47da3c2150dcd72b9b2b524f99a2410d9b446d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-05T23:56:45Z","title_canon_sha256":"23b083f76ad85aa4909fa612e360362bb7410f267e71ef9770a77ae74bbce4b3"},"schema_version":"1.0","source":{"id":"1503.01818","kind":"arxiv","version":1}},"canonical_sha256":"6c0c153bfbbba7a54f4b3bf93ddf8b9b93203ea3477124f3d2545c61cd475ebf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c0c153bfbbba7a54f4b3bf93ddf8b9b93203ea3477124f3d2545c61cd475ebf","first_computed_at":"2026-05-18T02:25:27.476993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:27.476993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ElA9JD/uqOj/UeMoFZ4eQG3TwS17bN+6u4h6s3anX+UX323dyHMXjEP66NbjgASeiWkhcKfl0er6qHfiNbk/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:27.477377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.01818","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c348a33d44a6bf6916023f4d94b6b2305c52c46c00bf77945b0f265dbd0d004c","sha256:be00d6cac8553befcfef13fa82ff805178e814faee3bc6f30a03e0c6078aee4f"],"state_sha256":"011da450f7ab75b4f6ceda7afbb14da25306b5c509d33e70c14d827d57fa152a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XN0TbulGJKIhmtkp/wozWcr41YgrRvXwE6IZtme8iNVRb+Y5zkj5vUFG6hIQC0jlVCkpsnAolqq2xYUV2jLXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:28:19.919720Z","bundle_sha256":"8f5c20f07cb38d3988d969cb5175044939345bd746fd2b180e5d0933ab0a6ee0"}}