{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z4MYFKADBS2FI255US474IUDTC","short_pith_number":"pith:Z4MYFKAD","canonical_record":{"source":{"id":"1807.03585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-10T12:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"1a9cf6dfc2120979fa9f442796729a5a5a2070426ef064f0e12873727c83cbbe","abstract_canon_sha256":"97d18717d0a88695f694c8f829182f990dfd63d2ea24c65ff140d7d5dd0dafae"},"schema_version":"1.0"},"canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","source":{"kind":"arxiv","id":"1807.03585","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03585","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03585v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03585","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z4MYFKADBS2F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4MYFKADBS2FI255","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4MYFKAD","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z4MYFKADBS2FI255US474IUDTC","target":"record","payload":{"canonical_record":{"source":{"id":"1807.03585","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-10T12:06:59Z","cross_cats_sorted":[],"title_canon_sha256":"1a9cf6dfc2120979fa9f442796729a5a5a2070426ef064f0e12873727c83cbbe","abstract_canon_sha256":"97d18717d0a88695f694c8f829182f990dfd63d2ea24c65ff140d7d5dd0dafae"},"schema_version":"1.0"},"canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:16.407682Z","signature_b64":"a0kyHUzyn6Zk3ShClYOc0FQrUuKyXoh+K3onGiC9fFfcQiLFbyW+23RQx/D9mMGOuZAqPjaeb9kGkq2je1EBBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","last_reissued_at":"2026-05-18T00:10:16.407175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:16.407175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.03585","source_version":2,"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-18T00:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1wve0mHcDD+xfgfgy3InvCRmCnIsZVTzGfLo0n6cmKIqkLwA0suVUQA5d0aLQtZztMftfEJMAY3jSyO5mCTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:26.865597Z"},"content_sha256":"52794bb639855067492e38676a5d8c24b9451693c699a847f26944c82a39d90f","schema_version":"1.0","event_id":"sha256:52794bb639855067492e38676a5d8c24b9451693c699a847f26944c82a39d90f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z4MYFKADBS2FI255US474IUDTC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kai Stadtmueller, Martin Sulzmann","submitted_at":"2018-07-10T12:06:59Z","abstract_excerpt":"Understanding the run-time behavior of concurrent programs is a challenging task. A popular approach is to establish a happens- before relation via vector clocks. Thus, we can identify bugs and per- formance bottlenecks, for example, by checking if two con icting events may happen concurrently. We employ a two-phase method to derive vector clock information for a wide range of concurrency features that includes all of the message-passing features in Go. The rst phase (instrumentation and tracing) yields a run-time trace that records all events related to message-passing concurrency that took p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03585","kind":"arxiv","version":2},"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-18T00:10:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nuJh+zdoEjT2Vggfy2VfeOUWykvpJneZI2pCeT1Dd8ofTfbM45YV6qPTJbayN3BnladmeOOOPi0MZH3yDa+0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:09:26.866461Z"},"content_sha256":"619cd1d48a3dcc37dc52c5f8edab5e0a93ac7dba274f67043aa9de2bada4e304","schema_version":"1.0","event_id":"sha256:619cd1d48a3dcc37dc52c5f8edab5e0a93ac7dba274f67043aa9de2bada4e304"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/bundle.json","state_url":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z4MYFKADBS2FI255US474IUDTC/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-05T21:09:26Z","links":{"resolver":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC","bundle":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/bundle.json","state":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z4MYFKADBS2FI255US474IUDTC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z4MYFKADBS2FI255US474IUDTC","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":"97d18717d0a88695f694c8f829182f990dfd63d2ea24c65ff140d7d5dd0dafae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-10T12:06:59Z","title_canon_sha256":"1a9cf6dfc2120979fa9f442796729a5a5a2070426ef064f0e12873727c83cbbe"},"schema_version":"1.0","source":{"id":"1807.03585","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.03585","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.03585v2","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03585","created_at":"2026-05-18T00:10:16Z"},{"alias_kind":"pith_short_12","alias_value":"Z4MYFKADBS2F","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z4MYFKADBS2FI255","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z4MYFKAD","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:619cd1d48a3dcc37dc52c5f8edab5e0a93ac7dba274f67043aa9de2bada4e304","target":"graph","created_at":"2026-05-18T00:10:16Z","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":"Understanding the run-time behavior of concurrent programs is a challenging task. A popular approach is to establish a happens- before relation via vector clocks. Thus, we can identify bugs and per- formance bottlenecks, for example, by checking if two con icting events may happen concurrently. We employ a two-phase method to derive vector clock information for a wide range of concurrency features that includes all of the message-passing features in Go. The rst phase (instrumentation and tracing) yields a run-time trace that records all events related to message-passing concurrency that took p","authors_text":"Kai Stadtmueller, Martin Sulzmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-10T12:06:59Z","title":"Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03585","kind":"arxiv","version":2},"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:52794bb639855067492e38676a5d8c24b9451693c699a847f26944c82a39d90f","target":"record","created_at":"2026-05-18T00:10:16Z","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":"97d18717d0a88695f694c8f829182f990dfd63d2ea24c65ff140d7d5dd0dafae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-07-10T12:06:59Z","title_canon_sha256":"1a9cf6dfc2120979fa9f442796729a5a5a2070426ef064f0e12873727c83cbbe"},"schema_version":"1.0","source":{"id":"1807.03585","kind":"arxiv","version":2}},"canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","first_computed_at":"2026-05-18T00:10:16.407175Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:16.407175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a0kyHUzyn6Zk3ShClYOc0FQrUuKyXoh+K3onGiC9fFfcQiLFbyW+23RQx/D9mMGOuZAqPjaeb9kGkq2je1EBBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:16.407682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.03585","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52794bb639855067492e38676a5d8c24b9451693c699a847f26944c82a39d90f","sha256:619cd1d48a3dcc37dc52c5f8edab5e0a93ac7dba274f67043aa9de2bada4e304"],"state_sha256":"3bd718dc3fcd3826afeb83098f5b462534ca719a427e5df90f0cfecd6b4660e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZfbw+xSwqxjYkuR1JWH4TLeCYluFCbiP4cN7ZDBpACCU7Uo4lxjXHHZcj5pEWFfBw0GPhwjZwdvkTp9256mAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:09:26.870021Z","bundle_sha256":"7438453a903ced5466efa84249f111d14c3a27ca45873815ba49759c22f6db8d"}}