{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5UEH2OSTJPW7PPP6H3F54XCCJY","short_pith_number":"pith:5UEH2OST","schema_version":"1.0","canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","source":{"kind":"arxiv","id":"1901.06545","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Vector Clock Algorithm for Multithreaded Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Vijay Garg, Xiong Zheng","submitted_at":"2019-01-19T16:08:08Z","abstract_excerpt":"Tracking causality (or happened-before relation) between events is useful for many applications such as debugging and recovery from failures. Consider a concurrent system with $n$ threads and $m$ objects. For such systems, either a vector clock of size $n$ is used with one component per thread or a vector clock of size $m$ is used with one component per object. A natural question is whether one can use a vector clock of size strictly less than the minimum of $m$ and $n$ to timestamp events. We give an algorithm in this paper that uses a hybrid of thread and object components. Our algorithm is "},"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":"1901.06545","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-19T16:08:08Z","cross_cats_sorted":[],"title_canon_sha256":"65e147a538d35b7e04955579231430a0b7d55e9763112cb2702dd98cb59b2862","abstract_canon_sha256":"41ae9c4f6053487b440471daaca746235f56809954fef2d9b3a4db30fe134b65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:49.908016Z","signature_b64":"B1e/KMhTQMQQjX8iuVzyUmulO2EE5M6zqcTDCOl35PvyXYuQdaT3quTmiIaTeNq0gJ8otLMJMzef6R6BQBR9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","last_reissued_at":"2026-05-17T23:55:49.907250Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:49.907250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Vector Clock Algorithm for Multithreaded Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Vijay Garg, Xiong Zheng","submitted_at":"2019-01-19T16:08:08Z","abstract_excerpt":"Tracking causality (or happened-before relation) between events is useful for many applications such as debugging and recovery from failures. Consider a concurrent system with $n$ threads and $m$ objects. For such systems, either a vector clock of size $n$ is used with one component per thread or a vector clock of size $m$ is used with one component per object. A natural question is whether one can use a vector clock of size strictly less than the minimum of $m$ and $n$ to timestamp events. We give an algorithm in this paper that uses a hybrid of thread and object components. Our algorithm is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06545","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":"1901.06545","created_at":"2026-05-17T23:55:49.907387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.06545v1","created_at":"2026-05-17T23:55:49.907387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06545","created_at":"2026-05-17T23:55:49.907387+00:00"},{"alias_kind":"pith_short_12","alias_value":"5UEH2OSTJPW7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5UEH2OSTJPW7PPP6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5UEH2OST","created_at":"2026-05-18T12:33:10.108867+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/5UEH2OSTJPW7PPP6H3F54XCCJY","json":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY.json","graph_json":"https://pith.science/api/pith-number/5UEH2OSTJPW7PPP6H3F54XCCJY/graph.json","events_json":"https://pith.science/api/pith-number/5UEH2OSTJPW7PPP6H3F54XCCJY/events.json","paper":"https://pith.science/paper/5UEH2OST"},"agent_actions":{"view_html":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY","download_json":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY.json","view_paper":"https://pith.science/paper/5UEH2OST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.06545&json=true","fetch_graph":"https://pith.science/api/pith-number/5UEH2OSTJPW7PPP6H3F54XCCJY/graph.json","fetch_events":"https://pith.science/api/pith-number/5UEH2OSTJPW7PPP6H3F54XCCJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/action/storage_attestation","attest_author":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/action/author_attestation","sign_citation":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/action/citation_signature","submit_replication":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/action/replication_record"}},"created_at":"2026-05-17T23:55:49.907387+00:00","updated_at":"2026-05-17T23:55:49.907387+00:00"}