{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CD2JKVAPXFNY7A5THXPEECGGLF","short_pith_number":"pith:CD2JKVAP","schema_version":"1.0","canonical_sha256":"10f495540fb95b8f83b33dde4208c65955d7cc2d531436d0646080a56ed9e448","source":{"kind":"arxiv","id":"1608.08330","version":2},"attestation_state":"computed","paper":{"title":"Static Trace-Based Deadlock Analysis for Synchronous Mini-Go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kai Stadtm\\\"uller, Martin Sulzmann, Peter Thiemann","submitted_at":"2016-08-30T05:18:07Z","abstract_excerpt":"We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check for deadlock-freedom. The approach is implemented and evaluated with a series of examples."},"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":"1608.08330","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-08-30T05:18:07Z","cross_cats_sorted":[],"title_canon_sha256":"850ba1c796548d19c58feaeac9abbde933de8d41a92b1b232081fbd277192254","abstract_canon_sha256":"2ec75186104a3d3debabc951c9945f6aa1680d316ac22cdbd3b43550bb38c3b4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:24.015918Z","signature_b64":"0LDK25nD6EnyN04sLFcm0N7xGDK3r1rb0CG8utSr6K4Tk1Th0PLuVwgYjhXC9LtA3caECmCUPttxVSzhL/3YBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10f495540fb95b8f83b33dde4208c65955d7cc2d531436d0646080a56ed9e448","last_reissued_at":"2026-05-18T01:06:24.015520Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:24.015520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Static Trace-Based Deadlock Analysis for Synchronous Mini-Go","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kai Stadtm\\\"uller, Martin Sulzmann, Peter Thiemann","submitted_at":"2016-08-30T05:18:07Z","abstract_excerpt":"We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check for deadlock-freedom. The approach is implemented and evaluated with a series of examples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08330","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":"1608.08330","created_at":"2026-05-18T01:06:24.015580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08330v2","created_at":"2026-05-18T01:06:24.015580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08330","created_at":"2026-05-18T01:06:24.015580+00:00"},{"alias_kind":"pith_short_12","alias_value":"CD2JKVAPXFNY","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CD2JKVAPXFNY7A5T","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CD2JKVAP","created_at":"2026-05-18T12:30:09.641336+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/CD2JKVAPXFNY7A5THXPEECGGLF","json":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF.json","graph_json":"https://pith.science/api/pith-number/CD2JKVAPXFNY7A5THXPEECGGLF/graph.json","events_json":"https://pith.science/api/pith-number/CD2JKVAPXFNY7A5THXPEECGGLF/events.json","paper":"https://pith.science/paper/CD2JKVAP"},"agent_actions":{"view_html":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF","download_json":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF.json","view_paper":"https://pith.science/paper/CD2JKVAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08330&json=true","fetch_graph":"https://pith.science/api/pith-number/CD2JKVAPXFNY7A5THXPEECGGLF/graph.json","fetch_events":"https://pith.science/api/pith-number/CD2JKVAPXFNY7A5THXPEECGGLF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF/action/storage_attestation","attest_author":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF/action/author_attestation","sign_citation":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF/action/citation_signature","submit_replication":"https://pith.science/pith/CD2JKVAPXFNY7A5THXPEECGGLF/action/replication_record"}},"created_at":"2026-05-18T01:06:24.015580+00:00","updated_at":"2026-05-18T01:06:24.015580+00:00"}