{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZF3YWXWW5O7QGDSN3XGMCQQOFL","short_pith_number":"pith:ZF3YWXWW","schema_version":"1.0","canonical_sha256":"c9778b5ed6ebbf030e4dddccc1420e2ac77ffd0379fcc40f31e60b1b9dfc719f","source":{"kind":"arxiv","id":"1407.7468","version":1},"attestation_state":"computed","paper":{"title":"Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Divjyot Sethi, Muralidhar Talupur, Sharad Malik","submitted_at":"2014-07-28T16:51:38Z","abstract_excerpt":"We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a p"},"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":"1407.7468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-07-28T16:51:38Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ddfeadcf8462bb87f7454d9d8e22055945b93f430ab881d87b5f3c0b15cfbe93","abstract_canon_sha256":"bca7d5faefc732fcedf0ac8e704c95247848141c3cc2137acd496a6202d9ced3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:23.095975Z","signature_b64":"LaG49+QVJURggSKa1Pp2vUnmVh113A2rxzz5Ui4ObRr325hMh+EpE1TbDbUa2s8UTt0YuSZYdyyrpQluoFeFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9778b5ed6ebbf030e4dddccc1420e2ac77ffd0379fcc40f31e60b1b9dfc719f","last_reissued_at":"2026-05-18T02:46:23.095558Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:23.095558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Divjyot Sethi, Muralidhar Talupur, Sharad Malik","submitted_at":"2014-07-28T16:51:38Z","abstract_excerpt":"We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7468","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":"1407.7468","created_at":"2026-05-18T02:46:23.095617+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7468v1","created_at":"2026-05-18T02:46:23.095617+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7468","created_at":"2026-05-18T02:46:23.095617+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZF3YWXWW5O7Q","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZF3YWXWW5O7QGDSN","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZF3YWXWW","created_at":"2026-05-18T12:28:59.999130+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/ZF3YWXWW5O7QGDSN3XGMCQQOFL","json":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL.json","graph_json":"https://pith.science/api/pith-number/ZF3YWXWW5O7QGDSN3XGMCQQOFL/graph.json","events_json":"https://pith.science/api/pith-number/ZF3YWXWW5O7QGDSN3XGMCQQOFL/events.json","paper":"https://pith.science/paper/ZF3YWXWW"},"agent_actions":{"view_html":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL","download_json":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL.json","view_paper":"https://pith.science/paper/ZF3YWXWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7468&json=true","fetch_graph":"https://pith.science/api/pith-number/ZF3YWXWW5O7QGDSN3XGMCQQOFL/graph.json","fetch_events":"https://pith.science/api/pith-number/ZF3YWXWW5O7QGDSN3XGMCQQOFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL/action/storage_attestation","attest_author":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL/action/author_attestation","sign_citation":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL/action/citation_signature","submit_replication":"https://pith.science/pith/ZF3YWXWW5O7QGDSN3XGMCQQOFL/action/replication_record"}},"created_at":"2026-05-18T02:46:23.095617+00:00","updated_at":"2026-05-18T02:46:23.095617+00:00"}