{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PTL6D5RLORR6VV3M6BYOCULEUN","short_pith_number":"pith:PTL6D5RL","schema_version":"1.0","canonical_sha256":"7cd7e1f62b7463ead76cf070e15164a35bba0d15a888255d6c6b488c15786bd8","source":{"kind":"arxiv","id":"1711.03272","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.03272","created_at":"2026-05-18T00:30:56.733136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03272v1","created_at":"2026-05-18T00:30:56.733136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03272","created_at":"2026-05-18T00:30:56.733136+00:00"},{"alias_kind":"pith_short_12","alias_value":"PTL6D5RLORR6","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PTL6D5RLORR6VV3M","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PTL6D5RL","created_at":"2026-05-18T12:31:37.085036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN","json":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN.json","graph_json":"https://pith.science/api/pith-number/PTL6D5RLORR6VV3M6BYOCULEUN/graph.json","events_json":"https://pith.science/api/pith-number/PTL6D5RLORR6VV3M6BYOCULEUN/events.json","paper":"https://pith.science/paper/PTL6D5RL"},"agent_actions":{"view_html":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN","download_json":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN.json","view_paper":"https://pith.science/paper/PTL6D5RL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03272&json=true","fetch_graph":"https://pith.science/api/pith-number/PTL6D5RLORR6VV3M6BYOCULEUN/graph.json","fetch_events":"https://pith.science/api/pith-number/PTL6D5RLORR6VV3M6BYOCULEUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/action/storage_attestation","attest_author":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/action/author_attestation","sign_citation":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/action/citation_signature","submit_replication":"https://pith.science/pith/PTL6D5RLORR6VV3M6BYOCULEUN/action/replication_record"}},"created_at":"2026-05-18T00:30:56.733136+00:00","updated_at":"2026-05-18T00:30:56.733136+00:00"}