{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ESDKJ44PATQMETWDAT5L3VFSYV","short_pith_number":"pith:ESDKJ44P","canonical_record":{"source":{"id":"1802.02951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-08T16:29:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"891faae7f5b49d1fca24bc8b28c4427c7b6ed49aadb648b0fb8868ca17855339","abstract_canon_sha256":"9c36fe4a24396af6127c076a70d20e03480193e002a5b516ba22324237591a4d"},"schema_version":"1.0"},"canonical_sha256":"2486a4f38f04e0c24ec304fabdd4b2c56d71c61909101344dd922e8700f99715","source":{"kind":"arxiv","id":"1802.02951","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02951","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02951v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02951","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"ESDKJ44PATQM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ESDKJ44PATQMETWD","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ESDKJ44P","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ESDKJ44PATQMETWDAT5L3VFSYV","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02951","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-08T16:29:43Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"891faae7f5b49d1fca24bc8b28c4427c7b6ed49aadb648b0fb8868ca17855339","abstract_canon_sha256":"9c36fe4a24396af6127c076a70d20e03480193e002a5b516ba22324237591a4d"},"schema_version":"1.0"},"canonical_sha256":"2486a4f38f04e0c24ec304fabdd4b2c56d71c61909101344dd922e8700f99715","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:13.433911Z","signature_b64":"tdbQRwbzfvcU19Q1rZwydylYmaP+5z16if2lBo9my+q38TEBtMr+aZpjcBcwqdGWOf/lBere0sVZv7D7qCDPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2486a4f38f04e0c24ec304fabdd4b2c56d71c61909101344dd922e8700f99715","last_reissued_at":"2026-05-18T00:00:13.433396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:13.433396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02951","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-18T00:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lzdimabut8lF110dWwaTJFUjWMHOmYcrF9IrvrsdVkfGZSoOYxv1QDaWOJ75NyHCPFNMDqn1VMD2xSi7ETz4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:26:37.820976Z"},"content_sha256":"f40be0725104a6cd6424b82d03e85ad44ddd2feeda0acca334ffcf0a7163449b","schema_version":"1.0","event_id":"sha256:f40be0725104a6cd6424b82d03e85ad44ddd2feeda0acca334ffcf0a7163449b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ESDKJ44PATQMETWDAT5L3VFSYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Separation Logic for Concurrent Randomized Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Joseph Tassarotti, Robert Harper","submitted_at":"2018-02-08T16:29:43Z","abstract_excerpt":"We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate Polaris, we verify a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list. All of our results have been mechanized in Coq."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02951","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-18T00:00:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iS1Qezo0IUuaUXDmAxxhMZ3IalX7a5ISeoiX6koDfFIYjmAhjfWqiBd7+MjMD8rStmBW+Iz2ZD88BCEErsBxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:26:37.821332Z"},"content_sha256":"052cb658500ec6b600c88d95e8b47d509cc8ee0188f38d9015f2343f8f894b0d","schema_version":"1.0","event_id":"sha256:052cb658500ec6b600c88d95e8b47d509cc8ee0188f38d9015f2343f8f894b0d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESDKJ44PATQMETWDAT5L3VFSYV/bundle.json","state_url":"https://pith.science/pith/ESDKJ44PATQMETWDAT5L3VFSYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESDKJ44PATQMETWDAT5L3VFSYV/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-08T23:26:37Z","links":{"resolver":"https://pith.science/pith/ESDKJ44PATQMETWDAT5L3VFSYV","bundle":"https://pith.science/pith/ESDKJ44PATQMETWDAT5L3VFSYV/bundle.json","state":"https://pith.science/pith/ESDKJ44PATQMETWDAT5L3VFSYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESDKJ44PATQMETWDAT5L3VFSYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ESDKJ44PATQMETWDAT5L3VFSYV","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":"9c36fe4a24396af6127c076a70d20e03480193e002a5b516ba22324237591a4d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-08T16:29:43Z","title_canon_sha256":"891faae7f5b49d1fca24bc8b28c4427c7b6ed49aadb648b0fb8868ca17855339"},"schema_version":"1.0","source":{"id":"1802.02951","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02951","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02951v2","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02951","created_at":"2026-05-18T00:00:13Z"},{"alias_kind":"pith_short_12","alias_value":"ESDKJ44PATQM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"ESDKJ44PATQMETWD","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"ESDKJ44P","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:052cb658500ec6b600c88d95e8b47d509cc8ee0188f38d9015f2343f8f894b0d","target":"graph","created_at":"2026-05-18T00:00:13Z","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":"We present Polaris, a concurrent separation logic with support for probabilistic reasoning. As part of our logic, we extend the idea of coupling, which underlies recent work on probabilistic relational logics, to the setting of programs with both probabilistic and non-deterministic choice. To demonstrate Polaris, we verify a variant of a randomized concurrent counter algorithm and a two-level concurrent skip list. All of our results have been mechanized in Coq.","authors_text":"Joseph Tassarotti, Robert Harper","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-08T16:29:43Z","title":"A Separation Logic for Concurrent Randomized Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02951","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:f40be0725104a6cd6424b82d03e85ad44ddd2feeda0acca334ffcf0a7163449b","target":"record","created_at":"2026-05-18T00:00:13Z","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":"9c36fe4a24396af6127c076a70d20e03480193e002a5b516ba22324237591a4d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-08T16:29:43Z","title_canon_sha256":"891faae7f5b49d1fca24bc8b28c4427c7b6ed49aadb648b0fb8868ca17855339"},"schema_version":"1.0","source":{"id":"1802.02951","kind":"arxiv","version":2}},"canonical_sha256":"2486a4f38f04e0c24ec304fabdd4b2c56d71c61909101344dd922e8700f99715","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2486a4f38f04e0c24ec304fabdd4b2c56d71c61909101344dd922e8700f99715","first_computed_at":"2026-05-18T00:00:13.433396Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:13.433396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tdbQRwbzfvcU19Q1rZwydylYmaP+5z16if2lBo9my+q38TEBtMr+aZpjcBcwqdGWOf/lBere0sVZv7D7qCDPAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:13.433911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02951","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f40be0725104a6cd6424b82d03e85ad44ddd2feeda0acca334ffcf0a7163449b","sha256:052cb658500ec6b600c88d95e8b47d509cc8ee0188f38d9015f2343f8f894b0d"],"state_sha256":"9483f958675ea2a6b97f8edca0899193c911cec19d37b514606bf0d5bac0c501"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Urp0GZRnfXAkahmQZ9NSeDGuCFsbHM/gQVy8Rc9XboeKl0YoPvcH2VSqQ/BlpVAOeCRYt0l6k4965PDKNmXRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:26:37.823185Z","bundle_sha256":"7ffc5474aa49539a4330c16036a2e072c22f59f81988f121b5c892ccb26f3e77"}}