{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5UEH2OSTJPW7PPP6H3F54XCCJY","short_pith_number":"pith:5UEH2OST","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"},"canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","source":{"kind":"arxiv","id":"1901.06545","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06545","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06545v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06545","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"5UEH2OSTJPW7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UEH2OSTJPW7PPP6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UEH2OST","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5UEH2OSTJPW7PPP6H3F54XCCJY","target":"record","payload":{"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"},"canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","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"},"source_kind":"arxiv","source_id":"1901.06545","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMGhzpfySYeOvRkYJJ863qeG2GlOAVi1Q89+rD9a3Fnts6j/+Sy+G83aMwIROJC7MvL9jP1H8UkVAHpU8gqNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:26:50.063210Z"},"content_sha256":"d4fe236d3c5eae9f114f61ce1bf5ae3da66c3a6851f7bd09f2edff8ab00d2ea0","schema_version":"1.0","event_id":"sha256:d4fe236d3c5eae9f114f61ce1bf5ae3da66c3a6851f7bd09f2edff8ab00d2ea0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5UEH2OSTJPW7PPP6H3F54XCCJY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:55:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBKqPI+YsSKXZwKpiAVRCAASo/xZNcgJhajPkFzhZdSdI/BNf1nkbycLdGwYOnFhtRiOLhI4imILdDOFil7VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T01:26:50.063560Z"},"content_sha256":"4ede504e02d3c4254db251ed43ea29dc861f55d5bd9324045ee6ee1e364a7af8","schema_version":"1.0","event_id":"sha256:4ede504e02d3c4254db251ed43ea29dc861f55d5bd9324045ee6ee1e364a7af8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/bundle.json","state_url":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T01:26:50Z","links":{"resolver":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY","bundle":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/bundle.json","state":"https://pith.science/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UEH2OSTJPW7PPP6H3F54XCCJY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5UEH2OSTJPW7PPP6H3F54XCCJY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41ae9c4f6053487b440471daaca746235f56809954fef2d9b3a4db30fe134b65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-19T16:08:08Z","title_canon_sha256":"65e147a538d35b7e04955579231430a0b7d55e9763112cb2702dd98cb59b2862"},"schema_version":"1.0","source":{"id":"1901.06545","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.06545","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"arxiv_version","alias_value":"1901.06545v1","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.06545","created_at":"2026-05-17T23:55:49Z"},{"alias_kind":"pith_short_12","alias_value":"5UEH2OSTJPW7","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5UEH2OSTJPW7PPP6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5UEH2OST","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:4ede504e02d3c4254db251ed43ea29dc861f55d5bd9324045ee6ee1e364a7af8","target":"graph","created_at":"2026-05-17T23:55:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Vijay Garg, Xiong Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-19T16:08:08Z","title":"An Optimal Vector Clock Algorithm for Multithreaded Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.06545","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d4fe236d3c5eae9f114f61ce1bf5ae3da66c3a6851f7bd09f2edff8ab00d2ea0","target":"record","created_at":"2026-05-17T23:55:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41ae9c4f6053487b440471daaca746235f56809954fef2d9b3a4db30fe134b65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-19T16:08:08Z","title_canon_sha256":"65e147a538d35b7e04955579231430a0b7d55e9763112cb2702dd98cb59b2862"},"schema_version":"1.0","source":{"id":"1901.06545","kind":"arxiv","version":1}},"canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed087d3a534bedf7bdfe3ecbde5c424e24dda38f1044fff381436048fd0291c0","first_computed_at":"2026-05-17T23:55:49.907250Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:49.907250Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B1e/KMhTQMQQjX8iuVzyUmulO2EE5M6zqcTDCOl35PvyXYuQdaT3quTmiIaTeNq0gJ8otLMJMzef6R6BQBR9DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:49.908016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.06545","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4fe236d3c5eae9f114f61ce1bf5ae3da66c3a6851f7bd09f2edff8ab00d2ea0","sha256:4ede504e02d3c4254db251ed43ea29dc861f55d5bd9324045ee6ee1e364a7af8"],"state_sha256":"e5abee936f79c864d616fdc49917e4d45d60a2581d1c15c890333c5c797cd77d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i4CTYxvH8hYn1ZF+gXf89fm/AxGCWrWDroo3LgVW5RWa8y4yuNTxJ+PgNn+Xa2eG+HzJYXn1aYDGwi81NgNGDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T01:26:50.065382Z","bundle_sha256":"490d9a622ff7e76cfc4e1f3fe8bf8921e7c668e47eba008df585155efda30e67"}}