{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ILZD2VRWLLTVRJDDIW73WAFT4X","short_pith_number":"pith:ILZD2VRW","canonical_record":{"source":{"id":"1009.2837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-15T05:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e37005f2ef9370dca931c6594441c097b6b54fbd9747c22dd0ac29d2bc23edf","abstract_canon_sha256":"21474d22a08d894455665da37a38809eef6356e7bfeb4c8eff1d06cf6627317c"},"schema_version":"1.0"},"canonical_sha256":"42f23d56365ae758a46345bfbb00b3e5fd749841545eda706515b6da4d8078e2","source":{"kind":"arxiv","id":"1009.2837","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2837","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2837v2","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2837","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"ILZD2VRWLLTV","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILZD2VRWLLTVRJDD","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILZD2VRW","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ILZD2VRWLLTVRJDDIW73WAFT4X","target":"record","payload":{"canonical_record":{"source":{"id":"1009.2837","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-15T05:01:22Z","cross_cats_sorted":[],"title_canon_sha256":"8e37005f2ef9370dca931c6594441c097b6b54fbd9747c22dd0ac29d2bc23edf","abstract_canon_sha256":"21474d22a08d894455665da37a38809eef6356e7bfeb4c8eff1d06cf6627317c"},"schema_version":"1.0"},"canonical_sha256":"42f23d56365ae758a46345bfbb00b3e5fd749841545eda706515b6da4d8078e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:26.200014Z","signature_b64":"gnQVvFH5pXtB6Ax6LrbgpEqiBDCabeVKG2p/519gzvqJsAgGVw0BYjZEnLVbjSCXfiPvJ1B/2a+UUArf0JQ7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f23d56365ae758a46345bfbb00b3e5fd749841545eda706515b6da4d8078e2","last_reissued_at":"2026-05-18T02:55:26.199435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:26.199435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.2837","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-18T02:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxXoch19vwAHFE/tg7RTbBSnwmAuF/45DncqHLK+iJ+ok9pQ/b3uP4zcgjO8DnrUczX07p/roV7yKe6YVuz4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:20:45.219928Z"},"content_sha256":"4ff57559e3a183f02972ed374126d090172d5e9d5b44e8968e519debca576260","schema_version":"1.0","event_id":"sha256:4ff57559e3a183f02972ed374126d090172d5e9d5b44e8968e519debca576260"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ILZD2VRWLLTVRJDDIW73WAFT4X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence order of a numerical scheme for sweeping process","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Frederic Bernicot (LMJL), Juliette Venel (LAMAV)","submitted_at":"2010-09-15T05:01:22Z","abstract_excerpt":"In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to compactness arguments. Here we establish that this algorithm is of order 1/2 . The considered sweeping process involves a set-valued map given by a finite number of inequality constraints. The proof rests on a metric qualification condition between the sets associated to each constraint."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2837","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-18T02:55:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFsF6GRJOlw+uVTfF4MD/I9/siPWHF2JvbMVG/Gbf3WFMNZtfNCohJLdcFg3ho0sb/uocYxmXSRpAxRiwCJbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:20:45.220570Z"},"content_sha256":"9dcb485b4b483ce5a2ec457708d46571f871dd5dfdaff9e489b9bfff81bd12f2","schema_version":"1.0","event_id":"sha256:9dcb485b4b483ce5a2ec457708d46571f871dd5dfdaff9e489b9bfff81bd12f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/bundle.json","state_url":"https://pith.science/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/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-04T22:20:45Z","links":{"resolver":"https://pith.science/pith/ILZD2VRWLLTVRJDDIW73WAFT4X","bundle":"https://pith.science/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/bundle.json","state":"https://pith.science/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILZD2VRWLLTVRJDDIW73WAFT4X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ILZD2VRWLLTVRJDDIW73WAFT4X","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":"21474d22a08d894455665da37a38809eef6356e7bfeb4c8eff1d06cf6627317c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-15T05:01:22Z","title_canon_sha256":"8e37005f2ef9370dca931c6594441c097b6b54fbd9747c22dd0ac29d2bc23edf"},"schema_version":"1.0","source":{"id":"1009.2837","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.2837","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"arxiv_version","alias_value":"1009.2837v2","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.2837","created_at":"2026-05-18T02:55:26Z"},{"alias_kind":"pith_short_12","alias_value":"ILZD2VRWLLTV","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"ILZD2VRWLLTVRJDD","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"ILZD2VRW","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:9dcb485b4b483ce5a2ec457708d46571f871dd5dfdaff9e489b9bfff81bd12f2","target":"graph","created_at":"2026-05-18T02:55:26Z","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":"In a previous paper, an implementable algorithm was introduced to compute discrete solutions of sweeping processes (i.e. specific first order differential inclusions). The convergence of this numerical scheme was proved thanks to compactness arguments. Here we establish that this algorithm is of order 1/2 . The considered sweeping process involves a set-valued map given by a finite number of inequality constraints. The proof rests on a metric qualification condition between the sets associated to each constraint.","authors_text":"Frederic Bernicot (LMJL), Juliette Venel (LAMAV)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-15T05:01:22Z","title":"Convergence order of a numerical scheme for sweeping process"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.2837","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:4ff57559e3a183f02972ed374126d090172d5e9d5b44e8968e519debca576260","target":"record","created_at":"2026-05-18T02:55:26Z","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":"21474d22a08d894455665da37a38809eef6356e7bfeb4c8eff1d06cf6627317c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2010-09-15T05:01:22Z","title_canon_sha256":"8e37005f2ef9370dca931c6594441c097b6b54fbd9747c22dd0ac29d2bc23edf"},"schema_version":"1.0","source":{"id":"1009.2837","kind":"arxiv","version":2}},"canonical_sha256":"42f23d56365ae758a46345bfbb00b3e5fd749841545eda706515b6da4d8078e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42f23d56365ae758a46345bfbb00b3e5fd749841545eda706515b6da4d8078e2","first_computed_at":"2026-05-18T02:55:26.199435Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:26.199435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gnQVvFH5pXtB6Ax6LrbgpEqiBDCabeVKG2p/519gzvqJsAgGVw0BYjZEnLVbjSCXfiPvJ1B/2a+UUArf0JQ7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:26.200014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.2837","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff57559e3a183f02972ed374126d090172d5e9d5b44e8968e519debca576260","sha256:9dcb485b4b483ce5a2ec457708d46571f871dd5dfdaff9e489b9bfff81bd12f2"],"state_sha256":"75e4013afc4467ab2b8e766785b799e1af9163988e8c579e539f608838e8cf9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/HDlWkmewbIXJT2U4sure6n7295EGXmEcm/amNkMhDYAjnntNYfpoyt+9eNICbbphgyRAYIwOTtz4qbHYORAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:20:45.223720Z","bundle_sha256":"7c02ffa8ff7226ef646e6d65286223418ba381a9d939f88b24abdeb13eeec2b9"}}