{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R57REH2RLR7HNM45BETJ3QC6H5","short_pith_number":"pith:R57REH2R","schema_version":"1.0","canonical_sha256":"8f7f121f515c7e76b39d09269dc05e3f5aafee5185166afc7c7ccc62c68f972e","source":{"kind":"arxiv","id":"1410.0306","version":1},"attestation_state":"computed","paper":{"title":"Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aleksandar Nanevski, Anindya Banerjee, Ilya Sergey","submitted_at":"2014-10-01T17:51:55Z","abstract_excerpt":"We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that allows us to treat histories just like heaps in separation logic. For example, both are subject to the same assertion logic and inference rules (e.g., the frame rule). Moreover, the notion of ownership tr"},"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":"1410.0306","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-10-01T17:51:55Z","cross_cats_sorted":[],"title_canon_sha256":"1092b154a5141445833493ae0594cdf28ccb28ab8fe7fa6c97d7d0c6590782e7","abstract_canon_sha256":"7740de43e5a4813fa5efcadf8891b52790d68635c9c9fd0e0d984526380c4139"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.594689Z","signature_b64":"Tih/+CoVMYCs3IGFcOVSJpam4j4zlaag+YshjO0sYG1O9r3sLwnTjU5wjmOuboQ9RYDWJAQGVGytZVdboZuUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7f121f515c7e76b39d09269dc05e3f5aafee5185166afc7c7ccc62c68f972e","last_reissued_at":"2026-05-18T02:41:17.594217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.594217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Aleksandar Nanevski, Anindya Banerjee, Ilya Sergey","submitted_at":"2014-10-01T17:51:55Z","abstract_excerpt":"We present a lightweight approach to Hoare-style specifications for fine-grained concurrency, based on a notion of time-stamped histories that abstractly capture atomic changes in the program state. Our key observation is that histories form a partial commutative monoid, a structure fundamental for representation of concurrent resources. This insight provides us with a unifying mechanism that allows us to treat histories just like heaps in separation logic. For example, both are subject to the same assertion logic and inference rules (e.g., the frame rule). Moreover, the notion of ownership tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0306","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":"1410.0306","created_at":"2026-05-18T02:41:17.594284+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0306v1","created_at":"2026-05-18T02:41:17.594284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0306","created_at":"2026-05-18T02:41:17.594284+00:00"},{"alias_kind":"pith_short_12","alias_value":"R57REH2RLR7H","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R57REH2RLR7HNM45","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R57REH2R","created_at":"2026-05-18T12:28:46.137349+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/R57REH2RLR7HNM45BETJ3QC6H5","json":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5.json","graph_json":"https://pith.science/api/pith-number/R57REH2RLR7HNM45BETJ3QC6H5/graph.json","events_json":"https://pith.science/api/pith-number/R57REH2RLR7HNM45BETJ3QC6H5/events.json","paper":"https://pith.science/paper/R57REH2R"},"agent_actions":{"view_html":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5","download_json":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5.json","view_paper":"https://pith.science/paper/R57REH2R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0306&json=true","fetch_graph":"https://pith.science/api/pith-number/R57REH2RLR7HNM45BETJ3QC6H5/graph.json","fetch_events":"https://pith.science/api/pith-number/R57REH2RLR7HNM45BETJ3QC6H5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5/action/storage_attestation","attest_author":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5/action/author_attestation","sign_citation":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5/action/citation_signature","submit_replication":"https://pith.science/pith/R57REH2RLR7HNM45BETJ3QC6H5/action/replication_record"}},"created_at":"2026-05-18T02:41:17.594284+00:00","updated_at":"2026-05-18T02:41:17.594284+00:00"}