{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CMJVZNW2JV6UON7ITEH2YNALKH","short_pith_number":"pith:CMJVZNW2","schema_version":"1.0","canonical_sha256":"13135cb6da4d7d4737e8990fac340b51c4b7f76c473b77f71fd86eaba54220b7","source":{"kind":"arxiv","id":"2502.18885","version":3},"attestation_state":"computed","paper":{"title":"Compositional Verification of Concurrency Using Past-Time Temporal Epistemic Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hamed Nemati, Mads Dam","submitted_at":"2025-02-26T07:01:19Z","abstract_excerpt":"Shared-memory concurrency is notoriously difficult to reason about because each thread executes under interference from other threads. At the same time, many correctness arguments for classical algorithms are fundamentally epistemic: a thread enters a critical region only when, from its local view, it can rule out that another thread is concurrently in that region. We make such arguments explicit by introducing a past-time temporal epistemic logic interpreted over interleaving executions with perfect recall over local histories. Past-time operators support \"since\"-style reasoning, while episte"},"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":"2502.18885","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-26T07:01:19Z","cross_cats_sorted":[],"title_canon_sha256":"12dfa273571b25753e2f9019f9227e9868c9c593ed982229eb8e88703f5b406f","abstract_canon_sha256":"7f467f5844521987fce684ce85036798903c4bee62b71672bfe1758caf7ec028"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:14:56.622807Z","signature_b64":"VbAbu9q3Pu92W8gkJd2HLQ7OhqELw5Gp+VuFruZ5rtY3xYj5ZC0zF2fK/gBcmsJhhiemK3qpyyQoiWcS+RFMBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13135cb6da4d7d4737e8990fac340b51c4b7f76c473b77f71fd86eaba54220b7","last_reissued_at":"2026-06-24T01:14:56.622371Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:14:56.622371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compositional Verification of Concurrency Using Past-Time Temporal Epistemic Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Hamed Nemati, Mads Dam","submitted_at":"2025-02-26T07:01:19Z","abstract_excerpt":"Shared-memory concurrency is notoriously difficult to reason about because each thread executes under interference from other threads. At the same time, many correctness arguments for classical algorithms are fundamentally epistemic: a thread enters a critical region only when, from its local view, it can rule out that another thread is concurrently in that region. We make such arguments explicit by introducing a past-time temporal epistemic logic interpreted over interleaving executions with perfect recall over local histories. Past-time operators support \"since\"-style reasoning, while episte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.18885","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.18885/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2502.18885","created_at":"2026-06-24T01:14:56.622429+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.18885v3","created_at":"2026-06-24T01:14:56.622429+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.18885","created_at":"2026-06-24T01:14:56.622429+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMJVZNW2JV6U","created_at":"2026-06-24T01:14:56.622429+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMJVZNW2JV6UON7I","created_at":"2026-06-24T01:14:56.622429+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMJVZNW2","created_at":"2026-06-24T01:14:56.622429+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/CMJVZNW2JV6UON7ITEH2YNALKH","json":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH.json","graph_json":"https://pith.science/api/pith-number/CMJVZNW2JV6UON7ITEH2YNALKH/graph.json","events_json":"https://pith.science/api/pith-number/CMJVZNW2JV6UON7ITEH2YNALKH/events.json","paper":"https://pith.science/paper/CMJVZNW2"},"agent_actions":{"view_html":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH","download_json":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH.json","view_paper":"https://pith.science/paper/CMJVZNW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.18885&json=true","fetch_graph":"https://pith.science/api/pith-number/CMJVZNW2JV6UON7ITEH2YNALKH/graph.json","fetch_events":"https://pith.science/api/pith-number/CMJVZNW2JV6UON7ITEH2YNALKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH/action/storage_attestation","attest_author":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH/action/author_attestation","sign_citation":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH/action/citation_signature","submit_replication":"https://pith.science/pith/CMJVZNW2JV6UON7ITEH2YNALKH/action/replication_record"}},"created_at":"2026-06-24T01:14:56.622429+00:00","updated_at":"2026-06-24T01:14:56.622429+00:00"}