{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KIKYDCZPIOZQ6UOOFAZOL4RR52","short_pith_number":"pith:KIKYDCZP","schema_version":"1.0","canonical_sha256":"5215818b2f43b30f51ce2832e5f231ee94cd9a7da3d6307ece438d67a8b4b3c8","source":{"kind":"arxiv","id":"1810.10807","version":2},"attestation_state":"computed","paper":{"title":"Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Roland Meyer, Sebastian Wolff","submitted_at":"2018-10-25T09:42:27Z","abstract_excerpt":"Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last decade. Nevertheless, human-driven techniques remain cumbersome and notoriously difficult while automated approaches suffer from limited applicability. The main obstacle for automation is the complexity of concurrent data structures. This is particularly true in the absence of garbage collection. The intricacy of lock-free memory management paired with the complexity of concurrent data structures makes automated veri"},"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":"1810.10807","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-10-25T09:42:27Z","cross_cats_sorted":[],"title_canon_sha256":"16f48ef49a7ef491af959e7533c90fec20af2c1322fcd14f8272fa46e88f53c5","abstract_canon_sha256":"2e640e55b30aca64c776010ea18fa6bebb43b703c0b2da0d95d332d24e6712bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:14.512946Z","signature_b64":"OpHMReTuWmrhPS43KQ/bZp6UkdlVDJzonMycoh7T9ftOl+8sWS2pRZFu2vjCHmjdszptqYCvS5VPhLj3HS4oDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5215818b2f43b30f51ce2832e5f231ee94cd9a7da3d6307ece438d67a8b4b3c8","last_reissued_at":"2026-05-18T00:01:14.512306Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:14.512306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Roland Meyer, Sebastian Wolff","submitted_at":"2018-10-25T09:42:27Z","abstract_excerpt":"Verification of concurrent data structures is one of the most challenging tasks in software verification. The topic has received considerable attention over the course of the last decade. Nevertheless, human-driven techniques remain cumbersome and notoriously difficult while automated approaches suffer from limited applicability. The main obstacle for automation is the complexity of concurrent data structures. This is particularly true in the absence of garbage collection. The intricacy of lock-free memory management paired with the complexity of concurrent data structures makes automated veri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10807","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.10807","created_at":"2026-05-18T00:01:14.512432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10807v2","created_at":"2026-05-18T00:01:14.512432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10807","created_at":"2026-05-18T00:01:14.512432+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIKYDCZPIOZQ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIKYDCZPIOZQ6UOO","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIKYDCZP","created_at":"2026-05-18T12:32:33.847187+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/KIKYDCZPIOZQ6UOOFAZOL4RR52","json":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52.json","graph_json":"https://pith.science/api/pith-number/KIKYDCZPIOZQ6UOOFAZOL4RR52/graph.json","events_json":"https://pith.science/api/pith-number/KIKYDCZPIOZQ6UOOFAZOL4RR52/events.json","paper":"https://pith.science/paper/KIKYDCZP"},"agent_actions":{"view_html":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52","download_json":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52.json","view_paper":"https://pith.science/paper/KIKYDCZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10807&json=true","fetch_graph":"https://pith.science/api/pith-number/KIKYDCZPIOZQ6UOOFAZOL4RR52/graph.json","fetch_events":"https://pith.science/api/pith-number/KIKYDCZPIOZQ6UOOFAZOL4RR52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52/action/storage_attestation","attest_author":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52/action/author_attestation","sign_citation":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52/action/citation_signature","submit_replication":"https://pith.science/pith/KIKYDCZPIOZQ6UOOFAZOL4RR52/action/replication_record"}},"created_at":"2026-05-18T00:01:14.512432+00:00","updated_at":"2026-05-18T00:01:14.512432+00:00"}