{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RAU7UNDSQAIEEKARIC4J7XPIJH","short_pith_number":"pith:RAU7UNDS","schema_version":"1.0","canonical_sha256":"8829fa3472801042281140b89fdde849e541c59b92c4d171d0ee2956b23ea16b","source":{"kind":"arxiv","id":"1605.04292","version":5},"attestation_state":"computed","paper":{"title":"Efficiently making (almost) any concurrency control mechanism serializable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alan Fekete, Ippokratis Pandis, Ryan Johnson, Tianzheng Wang","submitted_at":"2016-05-13T19:14:52Z","abstract_excerpt":"Concurrency control (CC) algorithms must trade off strictness for performance. Serializable CC schemes generally pay higher cost to prevent anomalies, both in runtime overhead and in efforts wasted by aborting transactions. We propose the serial safety net (SSN), a serializability-enforcing certifier which can be applied with minimal overhead on top of various CC schemes that offer higher performance but admit anomalies, such as snapshot isolation and read committed. The underlying CC retains control of scheduling and transactional accesses, while SSN tracks the resulting dependencies. At comm"},"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":"1605.04292","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-05-13T19:14:52Z","cross_cats_sorted":[],"title_canon_sha256":"78feae6967e785840adef1f7cb1b3f764214abcf72fa423e8d1e660e4248b6cc","abstract_canon_sha256":"7ad6d31c4ac5e0554e300d6297ef64813da17c8106941c33c2c08b701204a4bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:13.790816Z","signature_b64":"ycXX8TjLOaIXLs3nNjPOWtHZwEHyfIS4QRC6SNBGPTV6CfnsFM5ZQvMjMSENWdOjCxVYbHv3qZHZ0BxHswuPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8829fa3472801042281140b89fdde849e541c59b92c4d171d0ee2956b23ea16b","last_reissued_at":"2026-05-18T00:44:13.790402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:13.790402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficiently making (almost) any concurrency control mechanism serializable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alan Fekete, Ippokratis Pandis, Ryan Johnson, Tianzheng Wang","submitted_at":"2016-05-13T19:14:52Z","abstract_excerpt":"Concurrency control (CC) algorithms must trade off strictness for performance. Serializable CC schemes generally pay higher cost to prevent anomalies, both in runtime overhead and in efforts wasted by aborting transactions. We propose the serial safety net (SSN), a serializability-enforcing certifier which can be applied with minimal overhead on top of various CC schemes that offer higher performance but admit anomalies, such as snapshot isolation and read committed. The underlying CC retains control of scheduling and transactional accesses, while SSN tracks the resulting dependencies. At comm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04292","kind":"arxiv","version":5},"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":"1605.04292","created_at":"2026-05-18T00:44:13.790463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04292v5","created_at":"2026-05-18T00:44:13.790463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04292","created_at":"2026-05-18T00:44:13.790463+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAU7UNDSQAIE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAU7UNDSQAIEEKAR","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAU7UNDS","created_at":"2026-05-18T12:30:41.710351+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/RAU7UNDSQAIEEKARIC4J7XPIJH","json":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH.json","graph_json":"https://pith.science/api/pith-number/RAU7UNDSQAIEEKARIC4J7XPIJH/graph.json","events_json":"https://pith.science/api/pith-number/RAU7UNDSQAIEEKARIC4J7XPIJH/events.json","paper":"https://pith.science/paper/RAU7UNDS"},"agent_actions":{"view_html":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH","download_json":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH.json","view_paper":"https://pith.science/paper/RAU7UNDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04292&json=true","fetch_graph":"https://pith.science/api/pith-number/RAU7UNDSQAIEEKARIC4J7XPIJH/graph.json","fetch_events":"https://pith.science/api/pith-number/RAU7UNDSQAIEEKARIC4J7XPIJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH/action/storage_attestation","attest_author":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH/action/author_attestation","sign_citation":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH/action/citation_signature","submit_replication":"https://pith.science/pith/RAU7UNDSQAIEEKARIC4J7XPIJH/action/replication_record"}},"created_at":"2026-05-18T00:44:13.790463+00:00","updated_at":"2026-05-18T00:44:13.790463+00:00"}