{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WZRVBZGLJYW64JWYEQVB2BZPPD","short_pith_number":"pith:WZRVBZGL","canonical_record":{"source":{"id":"1112.2155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-09T17:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"48507dade6617282fec167d4b66ba8e0f0b8c50484b9ee88e3453c821939a753","abstract_canon_sha256":"6237e9909f2a41c0d749fda9aa77a8463e5c1d9b6d16aeb1b667d803f97b343f"},"schema_version":"1.0"},"canonical_sha256":"b66350e4cb4e2dee26d8242a1d072f78e9e1755dff8b938d02da6f88f2122105","source":{"kind":"arxiv","id":"1112.2155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2155","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2155v1","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2155","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZRVBZGLJYW6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WZRVBZGLJYW64JWY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WZRVBZGL","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WZRVBZGLJYW64JWYEQVB2BZPPD","target":"record","payload":{"canonical_record":{"source":{"id":"1112.2155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-09T17:27:51Z","cross_cats_sorted":[],"title_canon_sha256":"48507dade6617282fec167d4b66ba8e0f0b8c50484b9ee88e3453c821939a753","abstract_canon_sha256":"6237e9909f2a41c0d749fda9aa77a8463e5c1d9b6d16aeb1b667d803f97b343f"},"schema_version":"1.0"},"canonical_sha256":"b66350e4cb4e2dee26d8242a1d072f78e9e1755dff8b938d02da6f88f2122105","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:06:35.156839Z","signature_b64":"n4t8buu4Dr4dqW3s9fEfz6cvNGbXLV6mnocKbXQ2RhELDL01Ka2RwqNUU+dtQhsj8+gSllsDXfOwHpw/2IcXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b66350e4cb4e2dee26d8242a1d072f78e9e1755dff8b938d02da6f88f2122105","last_reissued_at":"2026-05-18T04:06:35.156246Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:06:35.156246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.2155","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-18T04:06:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"isyLlL51UPCRZQ4rqwThRyuTyl2VWCClsexhU7rhEmzBGZKmE39mGfE4a2DqKfKcQAR0Sq+vHhmCubsJfC+5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:37:20.527158Z"},"content_sha256":"2ff71c92d685f03a0680952735b6e15e6946a9548ff8d93157ff9e456b6ca7c5","schema_version":"1.0","event_id":"sha256:2ff71c92d685f03a0680952735b6e15e6946a9548ff8d93157ff9e456b6ca7c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WZRVBZGLJYW64JWYEQVB2BZPPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Concurrency Control Method Based on Commitment Ordering in Mobile Databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmad Baraani-Dastjerdi, Ali Karami","submitted_at":"2011-12-09T17:27:51Z","abstract_excerpt":"Disconnection of mobile clients from server, in an unclear time and for an unknown duration, due to mobility of mobile clients, is the most important challenges for concurrency control in mobile database with client-server model. Applying pessimistic common classic methods of concurrency control (like 2pl) in mobile database leads to long duration blocking and increasing waiting time of transactions. Because of high rate of aborting transactions, optimistic methods aren`t appropriate in mobile database. In this article, OPCOT concurrency control algorithm is introduced based on optimistic conc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2155","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-18T04:06:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"91HSHwwgysNtxNKQQ+VrPf75Hp4bVevS0dE+H+07WyfKbNVVjyQn4y/8350np+QbDnjh7UU/VOfDWeyL7yreBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T13:37:20.527521Z"},"content_sha256":"c2ae375f6d1da7d8c1299525ffbe0986b63c6244c4097ab4dc392f5be7b5a9a8","schema_version":"1.0","event_id":"sha256:c2ae375f6d1da7d8c1299525ffbe0986b63c6244c4097ab4dc392f5be7b5a9a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/bundle.json","state_url":"https://pith.science/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/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-20T13:37:20Z","links":{"resolver":"https://pith.science/pith/WZRVBZGLJYW64JWYEQVB2BZPPD","bundle":"https://pith.science/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/bundle.json","state":"https://pith.science/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZRVBZGLJYW64JWYEQVB2BZPPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WZRVBZGLJYW64JWYEQVB2BZPPD","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":"6237e9909f2a41c0d749fda9aa77a8463e5c1d9b6d16aeb1b667d803f97b343f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-09T17:27:51Z","title_canon_sha256":"48507dade6617282fec167d4b66ba8e0f0b8c50484b9ee88e3453c821939a753"},"schema_version":"1.0","source":{"id":"1112.2155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.2155","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1112.2155v1","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2155","created_at":"2026-05-18T04:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"WZRVBZGLJYW6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WZRVBZGLJYW64JWY","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WZRVBZGL","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:c2ae375f6d1da7d8c1299525ffbe0986b63c6244c4097ab4dc392f5be7b5a9a8","target":"graph","created_at":"2026-05-18T04:06:35Z","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":"Disconnection of mobile clients from server, in an unclear time and for an unknown duration, due to mobility of mobile clients, is the most important challenges for concurrency control in mobile database with client-server model. Applying pessimistic common classic methods of concurrency control (like 2pl) in mobile database leads to long duration blocking and increasing waiting time of transactions. Because of high rate of aborting transactions, optimistic methods aren`t appropriate in mobile database. In this article, OPCOT concurrency control algorithm is introduced based on optimistic conc","authors_text":"Ahmad Baraani-Dastjerdi, Ali Karami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-09T17:27:51Z","title":"A Concurrency Control Method Based on Commitment Ordering in Mobile Databases"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2155","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:2ff71c92d685f03a0680952735b6e15e6946a9548ff8d93157ff9e456b6ca7c5","target":"record","created_at":"2026-05-18T04:06:35Z","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":"6237e9909f2a41c0d749fda9aa77a8463e5c1d9b6d16aeb1b667d803f97b343f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-09T17:27:51Z","title_canon_sha256":"48507dade6617282fec167d4b66ba8e0f0b8c50484b9ee88e3453c821939a753"},"schema_version":"1.0","source":{"id":"1112.2155","kind":"arxiv","version":1}},"canonical_sha256":"b66350e4cb4e2dee26d8242a1d072f78e9e1755dff8b938d02da6f88f2122105","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b66350e4cb4e2dee26d8242a1d072f78e9e1755dff8b938d02da6f88f2122105","first_computed_at":"2026-05-18T04:06:35.156246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:06:35.156246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n4t8buu4Dr4dqW3s9fEfz6cvNGbXLV6mnocKbXQ2RhELDL01Ka2RwqNUU+dtQhsj8+gSllsDXfOwHpw/2IcXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:06:35.156839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.2155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ff71c92d685f03a0680952735b6e15e6946a9548ff8d93157ff9e456b6ca7c5","sha256:c2ae375f6d1da7d8c1299525ffbe0986b63c6244c4097ab4dc392f5be7b5a9a8"],"state_sha256":"2c894bd20ff7fee8d364db74255b25fdde73aac155c6fefacbeee39d5e7cc698"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WBa0hpSdmvAVwWNp0GxwKyd0AO1qBLFmcCspH9TdctDF83IdqVCDLN+hXAmyA2za6brHuVOcPt2rtjw0avlaAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T13:37:20.529578Z","bundle_sha256":"ba29bccd013ae0ef74a4994e6d32ce7f2359154069c7951f1abdf3fab3f6e1c9"}}