{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JLG65CJPFKJNTO332AB6I4MIYP","short_pith_number":"pith:JLG65CJP","canonical_record":{"source":{"id":"1707.07699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T18:13:13Z","cross_cats_sorted":[],"title_canon_sha256":"43f7d0c1212eb749c3c055e74c66611cfa6824b07f1ae5d63e6640c7cc7f872e","abstract_canon_sha256":"e6b2deecf9603fb81a1f19fab5716a5f6884eb55b3a104af6c79ea029caac6ef"},"schema_version":"1.0"},"canonical_sha256":"4acdee892f2a92d9bb7bd003e47188c3f5fe1dbdca1ae8e6a9a52dc03bc95316","source":{"kind":"arxiv","id":"1707.07699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07699","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07699v1","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07699","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"JLG65CJPFKJN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLG65CJPFKJNTO33","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLG65CJP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JLG65CJPFKJNTO332AB6I4MIYP","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T18:13:13Z","cross_cats_sorted":[],"title_canon_sha256":"43f7d0c1212eb749c3c055e74c66611cfa6824b07f1ae5d63e6640c7cc7f872e","abstract_canon_sha256":"e6b2deecf9603fb81a1f19fab5716a5f6884eb55b3a104af6c79ea029caac6ef"},"schema_version":"1.0"},"canonical_sha256":"4acdee892f2a92d9bb7bd003e47188c3f5fe1dbdca1ae8e6a9a52dc03bc95316","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:30.674253Z","signature_b64":"vTOJzBL6WJmdt9xTg4flI7MFL+H8ialh6aGFFzqqj1e3Tukxgv6HAe/mYXq2UmHWXuXFjoJhSeHoh36n3G0+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4acdee892f2a92d9bb7bd003e47188c3f5fe1dbdca1ae8e6a9a52dc03bc95316","last_reissued_at":"2026-05-18T00:39:30.673706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:30.673706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07699","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-18T00:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qUIPnukurK54m71mfbltit0AGC1Oib5wDrYmOvf9wOSsrUJaxBGUgkjenqagu4Y0C9ykXhaPKL1nZK14KtMSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:24.666596Z"},"content_sha256":"85692ff50714538b4981a482b4150ff9dd4c3131a927248658aa28b0e009acde","schema_version":"1.0","event_id":"sha256:85692ff50714538b4981a482b4150ff9dd4c3131a927248658aa28b0e009acde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JLG65CJPFKJNTO332AB6I4MIYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Monitoring Partially Synchronous Distributed Systems using SMT Solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Eric Torng, Murat Demirbas, Sandeep Kulkarni, Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil","submitted_at":"2017-07-24T18:13:13Z","abstract_excerpt":"In this paper, we discuss the feasibility of monitoring partially synchronous distributed systems to detect latent bugs, i.e., errors caused by concurrency and race conditions among concurrent processes. We present a monitoring framework where we model both system constraints and latent bugs as Satisfiability Modulo Theories (SMT) formulas, and we detect the presence of latent bugs using an SMT solver. We demonstrate the feasibility of our framework using both synthetic applications where latent bugs occur at any time with random probability and an application involving exclusive access to a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07699","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-18T00:39:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5N88Y66FnRiiIygttTb575dhpkXHhN3jGs341EYeLP9k+uFVJ4pP6e/fPQduuThk8zBhExqXBLA+/nMZd5NCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:04:24.667253Z"},"content_sha256":"a0a5f7d49cbdd27191951171e4ffac76c10d99a9b0c68135998ff0d942a7023d","schema_version":"1.0","event_id":"sha256:a0a5f7d49cbdd27191951171e4ffac76c10d99a9b0c68135998ff0d942a7023d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLG65CJPFKJNTO332AB6I4MIYP/bundle.json","state_url":"https://pith.science/pith/JLG65CJPFKJNTO332AB6I4MIYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLG65CJPFKJNTO332AB6I4MIYP/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-30T12:04:24Z","links":{"resolver":"https://pith.science/pith/JLG65CJPFKJNTO332AB6I4MIYP","bundle":"https://pith.science/pith/JLG65CJPFKJNTO332AB6I4MIYP/bundle.json","state":"https://pith.science/pith/JLG65CJPFKJNTO332AB6I4MIYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLG65CJPFKJNTO332AB6I4MIYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JLG65CJPFKJNTO332AB6I4MIYP","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":"e6b2deecf9603fb81a1f19fab5716a5f6884eb55b3a104af6c79ea029caac6ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T18:13:13Z","title_canon_sha256":"43f7d0c1212eb749c3c055e74c66611cfa6824b07f1ae5d63e6640c7cc7f872e"},"schema_version":"1.0","source":{"id":"1707.07699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07699","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07699v1","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07699","created_at":"2026-05-18T00:39:30Z"},{"alias_kind":"pith_short_12","alias_value":"JLG65CJPFKJN","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLG65CJPFKJNTO33","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLG65CJP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:a0a5f7d49cbdd27191951171e4ffac76c10d99a9b0c68135998ff0d942a7023d","target":"graph","created_at":"2026-05-18T00:39:30Z","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 this paper, we discuss the feasibility of monitoring partially synchronous distributed systems to detect latent bugs, i.e., errors caused by concurrency and race conditions among concurrent processes. We present a monitoring framework where we model both system constraints and latent bugs as Satisfiability Modulo Theories (SMT) formulas, and we detect the presence of latent bugs using an SMT solver. We demonstrate the feasibility of our framework using both synthetic applications where latent bugs occur at any time with random probability and an application involving exclusive access to a s","authors_text":"Eric Torng, Murat Demirbas, Sandeep Kulkarni, Sorrachai Yingchareonthawornchai, Vidhya Tekken Valapil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T18:13:13Z","title":"Monitoring Partially Synchronous Distributed Systems using SMT Solvers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07699","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:85692ff50714538b4981a482b4150ff9dd4c3131a927248658aa28b0e009acde","target":"record","created_at":"2026-05-18T00:39:30Z","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":"e6b2deecf9603fb81a1f19fab5716a5f6884eb55b3a104af6c79ea029caac6ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-24T18:13:13Z","title_canon_sha256":"43f7d0c1212eb749c3c055e74c66611cfa6824b07f1ae5d63e6640c7cc7f872e"},"schema_version":"1.0","source":{"id":"1707.07699","kind":"arxiv","version":1}},"canonical_sha256":"4acdee892f2a92d9bb7bd003e47188c3f5fe1dbdca1ae8e6a9a52dc03bc95316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4acdee892f2a92d9bb7bd003e47188c3f5fe1dbdca1ae8e6a9a52dc03bc95316","first_computed_at":"2026-05-18T00:39:30.673706Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:30.673706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vTOJzBL6WJmdt9xTg4flI7MFL+H8ialh6aGFFzqqj1e3Tukxgv6HAe/mYXq2UmHWXuXFjoJhSeHoh36n3G0+Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:30.674253Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85692ff50714538b4981a482b4150ff9dd4c3131a927248658aa28b0e009acde","sha256:a0a5f7d49cbdd27191951171e4ffac76c10d99a9b0c68135998ff0d942a7023d"],"state_sha256":"438f044d4e74e6691671fecd64b9712012736e8d19ecb93a087a23dee0f9d71c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"izexSoqvAPy6b33DUUxBGmbSMZtkqs7I1YTNpOZGChZOxMYqVDCalanelBhbbGzEX4VDCxeip/jG4xz+kJ/JDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:04:24.670742Z","bundle_sha256":"3a84bce74430ba9ce63ebe496c225c9d488c06c94d4eb63bbf3bd9d72f5765ff"}}