{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5UC6LYKZH3D32LOAVEBZ4YSV2N","short_pith_number":"pith:5UC6LYKZ","schema_version":"1.0","canonical_sha256":"ed05e5e1593ec7bd2dc0a9039e6255d36c06705f8ae523e3fe79818d4c9fea1d","source":{"kind":"arxiv","id":"1505.06459","version":1},"attestation_state":"computed","paper":{"title":"A Proof of Correctness for the Tardis Cache Coherence Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Muralidaran Vijayaraghavan, Srinivas Devadas, Xiangyao Yu","submitted_at":"2015-05-24T17:33:56Z","abstract_excerpt":"We prove the correctness of a recently-proposed cache coherence protocol, Tardis, which is simple, yet scalable to high processor counts, because it only requires O(logN) storage per cacheline for an N-processor system. We prove that Tardis follows the sequential consistency model and is both deadlock- and livelock-free. Our proof is based on simple and intuitive invariants of the system and thus applies to any system scale and many variants of Tardis."},"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":"1505.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-05-24T17:33:56Z","cross_cats_sorted":[],"title_canon_sha256":"ad5c98e910aa1e8bc6571af3c321351f600b211563c583ae9c8f0675f54c96ca","abstract_canon_sha256":"134ccfcf93cdbcd6f8a802341e0fac4774c1917272351c8aea33949c9c7b39a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:45.684771Z","signature_b64":"UZDT+RNOpjJBkIeXz9P0VolZEtkp4O0AWbN6XWvT8V2hLtmVjoKSI/nrRo17t0ab2DsiRd2gWBGCtiU3tdvPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed05e5e1593ec7bd2dc0a9039e6255d36c06705f8ae523e3fe79818d4c9fea1d","last_reissued_at":"2026-05-18T02:03:45.684045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:45.684045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Proof of Correctness for the Tardis Cache Coherence Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Muralidaran Vijayaraghavan, Srinivas Devadas, Xiangyao Yu","submitted_at":"2015-05-24T17:33:56Z","abstract_excerpt":"We prove the correctness of a recently-proposed cache coherence protocol, Tardis, which is simple, yet scalable to high processor counts, because it only requires O(logN) storage per cacheline for an N-processor system. We prove that Tardis follows the sequential consistency model and is both deadlock- and livelock-free. Our proof is based on simple and intuitive invariants of the system and thus applies to any system scale and many variants of Tardis."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06459","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":"1505.06459","created_at":"2026-05-18T02:03:45.684152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06459v1","created_at":"2026-05-18T02:03:45.684152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06459","created_at":"2026-05-18T02:03:45.684152+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UC6LYKZH3D3","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UC6LYKZH3D32LOA","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UC6LYKZ","created_at":"2026-05-18T12:29:07.941421+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/5UC6LYKZH3D32LOAVEBZ4YSV2N","json":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N.json","graph_json":"https://pith.science/api/pith-number/5UC6LYKZH3D32LOAVEBZ4YSV2N/graph.json","events_json":"https://pith.science/api/pith-number/5UC6LYKZH3D32LOAVEBZ4YSV2N/events.json","paper":"https://pith.science/paper/5UC6LYKZ"},"agent_actions":{"view_html":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N","download_json":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N.json","view_paper":"https://pith.science/paper/5UC6LYKZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06459&json=true","fetch_graph":"https://pith.science/api/pith-number/5UC6LYKZH3D32LOAVEBZ4YSV2N/graph.json","fetch_events":"https://pith.science/api/pith-number/5UC6LYKZH3D32LOAVEBZ4YSV2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N/action/storage_attestation","attest_author":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N/action/author_attestation","sign_citation":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N/action/citation_signature","submit_replication":"https://pith.science/pith/5UC6LYKZH3D32LOAVEBZ4YSV2N/action/replication_record"}},"created_at":"2026-05-18T02:03:45.684152+00:00","updated_at":"2026-05-18T02:03:45.684152+00:00"}