{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:XWBME63OBNCQOHHLH4IBS4HGJT","short_pith_number":"pith:XWBME63O","canonical_record":{"source":{"id":"1905.00707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-02T12:50:03Z","cross_cats_sorted":[],"title_canon_sha256":"e9870e23c97ae554b906fdb6899d286455fdccedb143d98b41167ba279e95830","abstract_canon_sha256":"2dd81f1950f95e1d83f53324b78899ec1cfa88666d46faa39520147e78fabd7e"},"schema_version":"1.0"},"canonical_sha256":"bd82c27b6e0b45071ceb3f101970e64cd227815b4aef4f59c4a345abedfefcb9","source":{"kind":"arxiv","id":"1905.00707","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00707","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00707v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00707","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"XWBME63OBNCQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XWBME63OBNCQOHHL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XWBME63O","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:XWBME63OBNCQOHHLH4IBS4HGJT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.00707","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-02T12:50:03Z","cross_cats_sorted":[],"title_canon_sha256":"e9870e23c97ae554b906fdb6899d286455fdccedb143d98b41167ba279e95830","abstract_canon_sha256":"2dd81f1950f95e1d83f53324b78899ec1cfa88666d46faa39520147e78fabd7e"},"schema_version":"1.0"},"canonical_sha256":"bd82c27b6e0b45071ceb3f101970e64cd227815b4aef4f59c4a345abedfefcb9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:09.556499Z","signature_b64":"6LgROJkVmwzKehW8K0lA2j+x69a9OYHx3SJZJoFqNI77kJG1x9xK5xvIqWRiuhJI7z3n9Bls17LyzKBOJlHZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd82c27b6e0b45071ceb3f101970e64cd227815b4aef4f59c4a345abedfefcb9","last_reissued_at":"2026-05-17T23:47:09.555854Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:09.555854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.00707","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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NfvsjnUAuwEIJ1EU4Ien6CbjyYnawfhUk8o+hH8W+DFOlea2BvpkviRVpTWw/+lSIhmAwc+KtaKu9jxOAdNLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:56:24.320578Z"},"content_sha256":"25233c39c4b0212cbc553a35eabf60b947a5309259e6db0f9c27938aeb5a591e","schema_version":"1.0","event_id":"sha256:25233c39c4b0212cbc553a35eabf60b947a5309259e6db0f9c27938aeb5a591e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:XWBME63OBNCQOHHLH4IBS4HGJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Chattering-Free Implementation of Continuous Terminal Algorithm with Implicit Euler Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Guohua Jiao, Shanhai Jin, Shyam Kamal, Wei Chen, Xiaogang Xiong","submitted_at":"2019-05-02T12:50:03Z","abstract_excerpt":"This paper proposes an efficient implementation for a continuous terminal algorithm (CTA). Although CTA is a continuous version of the famous twisting algorithm (TA), the conventional implementations of this CTA still suffer from chattering, especially when the gains and the time-step sizes are selected very large. The proposed implementation is based on an implicit Euler method and it totally suppresses the chattering. The proposed implementation is compared with the conventional explicit Euler implementation through simulations. It shows that the proposed implementation is very efficient and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00707","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-17T23:47:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oFIjzuTjfy5KsTYS7dWz+2uJFbmM/POoAV3GAmeGh2vcA6AymZyJt+maSPM4x3/oAmvk0zDF7aZWjzw2HmGeCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T08:56:24.321255Z"},"content_sha256":"dd9307304752666b27de2b6f4cb1f9ae75d1f094b64e4329cf97d34e99fd0af7","schema_version":"1.0","event_id":"sha256:dd9307304752666b27de2b6f4cb1f9ae75d1f094b64e4329cf97d34e99fd0af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XWBME63OBNCQOHHLH4IBS4HGJT/bundle.json","state_url":"https://pith.science/pith/XWBME63OBNCQOHHLH4IBS4HGJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XWBME63OBNCQOHHLH4IBS4HGJT/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-06T08:56:24Z","links":{"resolver":"https://pith.science/pith/XWBME63OBNCQOHHLH4IBS4HGJT","bundle":"https://pith.science/pith/XWBME63OBNCQOHHLH4IBS4HGJT/bundle.json","state":"https://pith.science/pith/XWBME63OBNCQOHHLH4IBS4HGJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XWBME63OBNCQOHHLH4IBS4HGJT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:XWBME63OBNCQOHHLH4IBS4HGJT","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":"2dd81f1950f95e1d83f53324b78899ec1cfa88666d46faa39520147e78fabd7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-02T12:50:03Z","title_canon_sha256":"e9870e23c97ae554b906fdb6899d286455fdccedb143d98b41167ba279e95830"},"schema_version":"1.0","source":{"id":"1905.00707","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.00707","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"arxiv_version","alias_value":"1905.00707v1","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.00707","created_at":"2026-05-17T23:47:09Z"},{"alias_kind":"pith_short_12","alias_value":"XWBME63OBNCQ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"XWBME63OBNCQOHHL","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"XWBME63O","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:dd9307304752666b27de2b6f4cb1f9ae75d1f094b64e4329cf97d34e99fd0af7","target":"graph","created_at":"2026-05-17T23:47:09Z","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":"This paper proposes an efficient implementation for a continuous terminal algorithm (CTA). Although CTA is a continuous version of the famous twisting algorithm (TA), the conventional implementations of this CTA still suffer from chattering, especially when the gains and the time-step sizes are selected very large. The proposed implementation is based on an implicit Euler method and it totally suppresses the chattering. The proposed implementation is compared with the conventional explicit Euler implementation through simulations. It shows that the proposed implementation is very efficient and","authors_text":"Guohua Jiao, Shanhai Jin, Shyam Kamal, Wei Chen, Xiaogang Xiong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-02T12:50:03Z","title":"Chattering-Free Implementation of Continuous Terminal Algorithm with Implicit Euler Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.00707","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:25233c39c4b0212cbc553a35eabf60b947a5309259e6db0f9c27938aeb5a591e","target":"record","created_at":"2026-05-17T23:47:09Z","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":"2dd81f1950f95e1d83f53324b78899ec1cfa88666d46faa39520147e78fabd7e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-05-02T12:50:03Z","title_canon_sha256":"e9870e23c97ae554b906fdb6899d286455fdccedb143d98b41167ba279e95830"},"schema_version":"1.0","source":{"id":"1905.00707","kind":"arxiv","version":1}},"canonical_sha256":"bd82c27b6e0b45071ceb3f101970e64cd227815b4aef4f59c4a345abedfefcb9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd82c27b6e0b45071ceb3f101970e64cd227815b4aef4f59c4a345abedfefcb9","first_computed_at":"2026-05-17T23:47:09.555854Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:09.555854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LgROJkVmwzKehW8K0lA2j+x69a9OYHx3SJZJoFqNI77kJG1x9xK5xvIqWRiuhJI7z3n9Bls17LyzKBOJlHZCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:09.556499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.00707","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25233c39c4b0212cbc553a35eabf60b947a5309259e6db0f9c27938aeb5a591e","sha256:dd9307304752666b27de2b6f4cb1f9ae75d1f094b64e4329cf97d34e99fd0af7"],"state_sha256":"e54662595d99ebfc28778016b69d025ef21a2f7777d304b048d5604f5ff7e066"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FVaIsq3oZ83L2GP4rsK6lH6N0nyilRaxpe+h8zZplKgDIUB1uthwP6W/j2C13MbojmFWZxU/D8aWe2/woGGBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T08:56:24.324788Z","bundle_sha256":"50e6ea094dca57a74851cd5ba985ba923d2bca29a75e9de0b1650ae24ec78a72"}}