{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PTL6D5RLORR6VV3M6BYOCULEUN","short_pith_number":"pith:PTL6D5RL","canonical_record":{"source":{"id":"1711.03272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-09T06:45:24Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"43d04c51a1977fa16cf18e6c675ac611db1caf4d2df69e0c8418295b089ace6c","abstract_canon_sha256":"2d68571950422322d57eea35d5173f5ff2482abba9fc4724581f65f69ad08bcc"},"schema_version":"1.0"},"canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","source":{"kind":"arxiv","id":"1711.03272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03272","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03272v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03272","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"PTL6D5RLORR6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTL6D5RLORR6VV3M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTL6D5RL","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PTL6D5RLORR6VV3M6BYOCULEUN","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-09T06:45:24Z","cross_cats_sorted":["cs.DS","cs.PL"],"title_canon_sha256":"43d04c51a1977fa16cf18e6c675ac611db1caf4d2df69e0c8418295b089ace6c","abstract_canon_sha256":"2d68571950422322d57eea35d5173f5ff2482abba9fc4724581f65f69ad08bcc"},"schema_version":"1.0"},"canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:56.733753Z","signature_b64":"v5qvPA3arq7EMS9GNAO7aCzdS+E3gAPAtcrvkJT6UKChBPN++e2P4g6VxB54QQfCCFhWk3fV1HhD27nL7nAdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","last_reissued_at":"2026-05-18T00:30:56.733041Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:56.733041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03272","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:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VK9FbE2Vt2xX9SR+bnhW729GBCgtuytt+fGQRMFGNf73/TW528j1xODvL45X4ElIC9TyAVZCRDxvm+atdX+BDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:31.022022Z"},"content_sha256":"57dfaf2ad14eb5e7a7eca5b999fecdc8fb5709c26e01542111b6692100084463","schema_version":"1.0","event_id":"sha256:57dfaf2ad14eb5e7a7eca5b999fecdc8fb5709c26e01542111b6692100084463"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PTL6D5RLORR6VV3M6BYOCULEUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.PL"],"primary_cat":"cs.LO","authors_text":"Dennis Shasha, Siddharth Krishna, Thomas Wies","submitted_at":"2017-11-09T06:45:24Z","abstract_excerpt":"Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data structure abstractions that work well in the sequential setting are much harder to reason about in a concurrent setting due to complex sharing and overlays. To solve this problem, we propose a novel approach to abstracting regions in the heap by encoding the data structure invariant into a local condition on each individual node. This condition may depend on a quantity associated with the node that is computed as a fixpoi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03272","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:30:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2GmJJbF4xgefZVzqjknHSGd9pBfomxSS9Otfo8AdQDQBEFAouH9NhMSlS0n4AawbfsgStdPmI+ihg1pyx1S4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T08:52:31.022692Z"},"content_sha256":"2997a57c7d5cc28af469ced3cd378da3d62c3f04fc07b344ea728a1ceaef8046","schema_version":"1.0","event_id":"sha256:2997a57c7d5cc28af469ced3cd378da3d62c3f04fc07b344ea728a1ceaef8046"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/bundle.json","state_url":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PTL6D5RLORR6VV3M6BYOCULEUN/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-25T08:52:31Z","links":{"resolver":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN","bundle":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/bundle.json","state":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PTL6D5RLORR6VV3M6BYOCULEUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PTL6D5RLORR6VV3M6BYOCULEUN","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":"2d68571950422322d57eea35d5173f5ff2482abba9fc4724581f65f69ad08bcc","cross_cats_sorted":["cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-09T06:45:24Z","title_canon_sha256":"43d04c51a1977fa16cf18e6c675ac611db1caf4d2df69e0c8418295b089ace6c"},"schema_version":"1.0","source":{"id":"1711.03272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03272","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03272v1","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03272","created_at":"2026-05-18T00:30:56Z"},{"alias_kind":"pith_short_12","alias_value":"PTL6D5RLORR6","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PTL6D5RLORR6VV3M","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PTL6D5RL","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:2997a57c7d5cc28af469ced3cd378da3d62c3f04fc07b344ea728a1ceaef8046","target":"graph","created_at":"2026-05-18T00:30:56Z","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":"Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data structure abstractions that work well in the sequential setting are much harder to reason about in a concurrent setting due to complex sharing and overlays. To solve this problem, we propose a novel approach to abstracting regions in the heap by encoding the data structure invariant into a local condition on each individual node. This condition may depend on a quantity associated with the node that is computed as a fixpoi","authors_text":"Dennis Shasha, Siddharth Krishna, Thomas Wies","cross_cats":["cs.DS","cs.PL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-09T06:45:24Z","title":"Go with the Flow: Compositional Abstractions for Concurrent Data Structures (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03272","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:57dfaf2ad14eb5e7a7eca5b999fecdc8fb5709c26e01542111b6692100084463","target":"record","created_at":"2026-05-18T00:30:56Z","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":"2d68571950422322d57eea35d5173f5ff2482abba9fc4724581f65f69ad08bcc","cross_cats_sorted":["cs.DS","cs.PL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-09T06:45:24Z","title_canon_sha256":"43d04c51a1977fa16cf18e6c675ac611db1caf4d2df69e0c8418295b089ace6c"},"schema_version":"1.0","source":{"id":"1711.03272","kind":"arxiv","version":1}},"canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","first_computed_at":"2026-05-18T00:30:56.733041Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:56.733041Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v5qvPA3arq7EMS9GNAO7aCzdS+E3gAPAtcrvkJT6UKChBPN++e2P4g6VxB54QQfCCFhWk3fV1HhD27nL7nAdBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:56.733753Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57dfaf2ad14eb5e7a7eca5b999fecdc8fb5709c26e01542111b6692100084463","sha256:2997a57c7d5cc28af469ced3cd378da3d62c3f04fc07b344ea728a1ceaef8046"],"state_sha256":"1511cc6ddd7dc0b5052325343c29c500a179ef8f283e2a5fc8777ca21b6dcf15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNG4AvVBrrkwgse4sURi2Lthdhpv8yPtv4+JIjGpLQl//90eTRj00yaVgWozBCPJrQiFWx/f49QQyuf4ttFWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T08:52:31.026296Z","bundle_sha256":"a687743d0a22c06c81724d6c15685b7da751b446d0255c28bc3a711fcadf84f9"}}