{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z4MYFKADBS2FI255US474IUDTC","short_pith_number":"pith:Z4MYFKAD","schema_version":"1.0","canonical_sha256":"cf1982a8030cb4546bbda4b9fe228398a1c3b94024e4ebeeed56dc24c9a32cc9","source":{"kind":"arxiv","id":"1807.03585","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.03585","created_at":"2026-05-18T00:10:16.407252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03585v2","created_at":"2026-05-18T00:10:16.407252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03585","created_at":"2026-05-18T00:10:16.407252+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z4MYFKADBS2F","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z4MYFKADBS2FI255","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z4MYFKAD","created_at":"2026-05-18T12:33:04.347982+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/Z4MYFKADBS2FI255US474IUDTC","json":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC.json","graph_json":"https://pith.science/api/pith-number/Z4MYFKADBS2FI255US474IUDTC/graph.json","events_json":"https://pith.science/api/pith-number/Z4MYFKADBS2FI255US474IUDTC/events.json","paper":"https://pith.science/paper/Z4MYFKAD"},"agent_actions":{"view_html":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC","download_json":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC.json","view_paper":"https://pith.science/paper/Z4MYFKAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03585&json=true","fetch_graph":"https://pith.science/api/pith-number/Z4MYFKADBS2FI255US474IUDTC/graph.json","fetch_events":"https://pith.science/api/pith-number/Z4MYFKADBS2FI255US474IUDTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/action/storage_attestation","attest_author":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/action/author_attestation","sign_citation":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/action/citation_signature","submit_replication":"https://pith.science/pith/Z4MYFKADBS2FI255US474IUDTC/action/replication_record"}},"created_at":"2026-05-18T00:10:16.407252+00:00","updated_at":"2026-05-18T00:10:16.407252+00:00"}