{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KMHYMIYMWP272Z5ZDETAZFVAUU","short_pith_number":"pith:KMHYMIYM","canonical_record":{"source":{"id":"1406.6755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-06-26T02:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"e829ba6977f680b241ece47a9538b96bcd5bede8b75438c12fc44f7a7f382b54","abstract_canon_sha256":"92e0c4a42340244647f23c9469485d6849b95f6a8ff3fe3dd1eb71b8ff483f0f"},"schema_version":"1.0"},"canonical_sha256":"530f86230cb3f5fd67b919260c96a0a5059bb5773db6f88f73e9752292e04293","source":{"kind":"arxiv","id":"1406.6755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6755","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6755v2","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6755","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"KMHYMIYMWP27","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KMHYMIYMWP272Z5Z","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KMHYMIYM","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KMHYMIYMWP272Z5ZDETAZFVAUU","target":"record","payload":{"canonical_record":{"source":{"id":"1406.6755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-06-26T02:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"e829ba6977f680b241ece47a9538b96bcd5bede8b75438c12fc44f7a7f382b54","abstract_canon_sha256":"92e0c4a42340244647f23c9469485d6849b95f6a8ff3fe3dd1eb71b8ff483f0f"},"schema_version":"1.0"},"canonical_sha256":"530f86230cb3f5fd67b919260c96a0a5059bb5773db6f88f73e9752292e04293","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:23.178388Z","signature_b64":"ROpz+pHf+cq0nFQj744/XcSbnlgaV93Uygqx40nllt9D2rLBOZqb8CXT+r/VoziyEWJjN1Tkf+bUVdGPka6BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"530f86230cb3f5fd67b919260c96a0a5059bb5773db6f88f73e9752292e04293","last_reissued_at":"2026-05-18T01:06:23.177743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:23.177743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.6755","source_version":2,"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V4DQL1UTdUHfDlgsSSiS+4Bo7yMLSd9xIcxvaO5FgkXM4nV34wFJlTR8oLtjR6LPY6ZQhtCbx4P5qmxoDzNpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:49:25.768582Z"},"content_sha256":"049fef8f2b52bba95882e89e0bdc6be937cfd0892cf33398a7003451ffdaa5a3","schema_version":"1.0","event_id":"sha256:049fef8f2b52bba95882e89e0bdc6be937cfd0892cf33398a7003451ffdaa5a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KMHYMIYMWP272Z5ZDETAZFVAUU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"and Tam\\'as Terlaky, Yunfei Song, Zolt\\'an Horv\\'ath","submitted_at":"2014-06-26T02:55:52Z","abstract_excerpt":"Steplength thresholds for invariance preserving of three types of discretization methods on a polyhedron are considered. For Taylor approximation type discretization methods we prove that a valid steplength threshold can be obtained by finding the first positive zeros of a finite number of polynomial functions. Further, a simple and efficient algorithm is proposed to numerically compute the steplength threshold. For rational function type discretization methods we derive a valid steplength threshold for invariance preserving, which can be computed by using an analogous algorithm as in the firs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6755","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":""},"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-18T01:06:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Myvi+fp0XXB16HhVuO1MmTDOA4XulFikfVrD1OG/oIB0dhGJoPF2wRFq/rj/Xa450UwQnntj+00J7Y1sL2BLAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T16:49:25.769291Z"},"content_sha256":"1d40e26290c638cbb7d1804c2382ce3242196d35d388d6a38d65f1c2fa6e0e00","schema_version":"1.0","event_id":"sha256:1d40e26290c638cbb7d1804c2382ce3242196d35d388d6a38d65f1c2fa6e0e00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/bundle.json","state_url":"https://pith.science/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/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-05-29T16:49:25Z","links":{"resolver":"https://pith.science/pith/KMHYMIYMWP272Z5ZDETAZFVAUU","bundle":"https://pith.science/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/bundle.json","state":"https://pith.science/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMHYMIYMWP272Z5ZDETAZFVAUU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KMHYMIYMWP272Z5ZDETAZFVAUU","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":"92e0c4a42340244647f23c9469485d6849b95f6a8ff3fe3dd1eb71b8ff483f0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-06-26T02:55:52Z","title_canon_sha256":"e829ba6977f680b241ece47a9538b96bcd5bede8b75438c12fc44f7a7f382b54"},"schema_version":"1.0","source":{"id":"1406.6755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.6755","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"arxiv_version","alias_value":"1406.6755v2","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6755","created_at":"2026-05-18T01:06:23Z"},{"alias_kind":"pith_short_12","alias_value":"KMHYMIYMWP27","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KMHYMIYMWP272Z5Z","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KMHYMIYM","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:1d40e26290c638cbb7d1804c2382ce3242196d35d388d6a38d65f1c2fa6e0e00","target":"graph","created_at":"2026-05-18T01:06:23Z","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":"Steplength thresholds for invariance preserving of three types of discretization methods on a polyhedron are considered. For Taylor approximation type discretization methods we prove that a valid steplength threshold can be obtained by finding the first positive zeros of a finite number of polynomial functions. Further, a simple and efficient algorithm is proposed to numerically compute the steplength threshold. For rational function type discretization methods we derive a valid steplength threshold for invariance preserving, which can be computed by using an analogous algorithm as in the firs","authors_text":"and Tam\\'as Terlaky, Yunfei Song, Zolt\\'an Horv\\'ath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-06-26T02:55:52Z","title":"Steplength Thresholds for Invariance Preserving of Discretization Methods of Dynamical Systems on a Polyhedron"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6755","kind":"arxiv","version":2},"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:049fef8f2b52bba95882e89e0bdc6be937cfd0892cf33398a7003451ffdaa5a3","target":"record","created_at":"2026-05-18T01:06:23Z","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":"92e0c4a42340244647f23c9469485d6849b95f6a8ff3fe3dd1eb71b8ff483f0f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2014-06-26T02:55:52Z","title_canon_sha256":"e829ba6977f680b241ece47a9538b96bcd5bede8b75438c12fc44f7a7f382b54"},"schema_version":"1.0","source":{"id":"1406.6755","kind":"arxiv","version":2}},"canonical_sha256":"530f86230cb3f5fd67b919260c96a0a5059bb5773db6f88f73e9752292e04293","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"530f86230cb3f5fd67b919260c96a0a5059bb5773db6f88f73e9752292e04293","first_computed_at":"2026-05-18T01:06:23.177743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:23.177743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ROpz+pHf+cq0nFQj744/XcSbnlgaV93Uygqx40nllt9D2rLBOZqb8CXT+r/VoziyEWJjN1Tkf+bUVdGPka6BAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:23.178388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.6755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:049fef8f2b52bba95882e89e0bdc6be937cfd0892cf33398a7003451ffdaa5a3","sha256:1d40e26290c638cbb7d1804c2382ce3242196d35d388d6a38d65f1c2fa6e0e00"],"state_sha256":"c0097c800b15ce1bf8071f1ff5c61c5e53582aac607122f23b50f7e9cb33f230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ia4ji0o2ThgubKSotdveveT7gYZkZkeBq/hRv0XPIMmuch7HHiPp0SNG0IstJCqL2P1Qga6/DkjyOqd1wQ0bBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T16:49:25.773161Z","bundle_sha256":"df5f5dc2d83074cc10f5ae41547b7670a669912355e5ba26227ef9c987093368"}}