{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LHINUEE72B44GOQMK43T7ZK6P3","short_pith_number":"pith:LHINUEE7","canonical_record":{"source":{"id":"1907.02834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-05T13:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"6c0bd9ef13b8486bcef0ce47b443f6d8a171b182d17b50f4a79ec92e9fdf29f3","abstract_canon_sha256":"aa4596566a08ed20be9adb9fb3f33a700e244b1be7e124395a4b9a489bdb5423"},"schema_version":"1.0"},"canonical_sha256":"59d0da109fd079c33a0c57373fe55e7ee2261edba2759cf01d35e4b025745a43","source":{"kind":"arxiv","id":"1907.02834","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02834","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02834v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02834","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"LHINUEE72B44","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LHINUEE72B44GOQM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LHINUEE7","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LHINUEE72B44GOQMK43T7ZK6P3","target":"record","payload":{"canonical_record":{"source":{"id":"1907.02834","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-05T13:57:55Z","cross_cats_sorted":[],"title_canon_sha256":"6c0bd9ef13b8486bcef0ce47b443f6d8a171b182d17b50f4a79ec92e9fdf29f3","abstract_canon_sha256":"aa4596566a08ed20be9adb9fb3f33a700e244b1be7e124395a4b9a489bdb5423"},"schema_version":"1.0"},"canonical_sha256":"59d0da109fd079c33a0c57373fe55e7ee2261edba2759cf01d35e4b025745a43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:22.936433Z","signature_b64":"n1ixkP83gb8RUkjwt9UB3fhT/2XzYPqoQyc+7CzC/+zAAnzS72yZz8LbzMCJk8HQHYC6XtnTkSNSNP9RtqmhAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d0da109fd079c33a0c57373fe55e7ee2261edba2759cf01d35e4b025745a43","last_reissued_at":"2026-05-17T23:41:22.935770Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:22.935770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.02834","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:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b+QQrocvy67mIr9/ijAUuIIONjDYjq7Jcxzb8JMlOpg4ryLN7Cs2EaL/FLlERXUeWivgFPUdY46gzg4wPJtXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:49:55.068807Z"},"content_sha256":"8aaf2292cea87ff05e756a1bc50ab91eadca2a8de94391350cb0355ab64220b3","schema_version":"1.0","event_id":"sha256:8aaf2292cea87ff05e756a1bc50ab91eadca2a8de94391350cb0355ab64220b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LHINUEE72B44GOQMK43T7ZK6P3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Adrien Pommellet, Tayssir Touili","submitted_at":"2019-07-05T13:57:55Z","abstract_excerpt":"We present in this paper a generic framework for the analysis of multi-threaded programs with recursive procedure calls, synchronisation by rendez-vous between parallel threads, and dynamic creation of new threads. To this end, we consider a model called Synchronized Dynamic Pushdown Networks (SDPNs) that can be seen as a network of pushdown processes executing synchronized transitions, spawning new pushdown processes, and performing internal pushdown actions. The reachability problem for this model is unfortunately undecidable. Therefore, we tackle this problem by introducing an abstraction f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02834","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:41:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Uup24o8i3pvoRjovwDZEeHCGEh3KvdurHvGFbbU/SK++t28SBZDGEUWuKeo3C5TdO0OA8heha4GzCSYzT84Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:49:55.069524Z"},"content_sha256":"a1e0858659ec29750e06c6500013faf901d7028c3abffe3be46b76c0f40aff0c","schema_version":"1.0","event_id":"sha256:a1e0858659ec29750e06c6500013faf901d7028c3abffe3be46b76c0f40aff0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHINUEE72B44GOQMK43T7ZK6P3/bundle.json","state_url":"https://pith.science/pith/LHINUEE72B44GOQMK43T7ZK6P3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHINUEE72B44GOQMK43T7ZK6P3/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-05-26T04:49:55Z","links":{"resolver":"https://pith.science/pith/LHINUEE72B44GOQMK43T7ZK6P3","bundle":"https://pith.science/pith/LHINUEE72B44GOQMK43T7ZK6P3/bundle.json","state":"https://pith.science/pith/LHINUEE72B44GOQMK43T7ZK6P3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHINUEE72B44GOQMK43T7ZK6P3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LHINUEE72B44GOQMK43T7ZK6P3","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":"aa4596566a08ed20be9adb9fb3f33a700e244b1be7e124395a4b9a489bdb5423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-05T13:57:55Z","title_canon_sha256":"6c0bd9ef13b8486bcef0ce47b443f6d8a171b182d17b50f4a79ec92e9fdf29f3"},"schema_version":"1.0","source":{"id":"1907.02834","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.02834","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"arxiv_version","alias_value":"1907.02834v1","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.02834","created_at":"2026-05-17T23:41:22Z"},{"alias_kind":"pith_short_12","alias_value":"LHINUEE72B44","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LHINUEE72B44GOQM","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LHINUEE7","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:a1e0858659ec29750e06c6500013faf901d7028c3abffe3be46b76c0f40aff0c","target":"graph","created_at":"2026-05-17T23:41:22Z","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":"We present in this paper a generic framework for the analysis of multi-threaded programs with recursive procedure calls, synchronisation by rendez-vous between parallel threads, and dynamic creation of new threads. To this end, we consider a model called Synchronized Dynamic Pushdown Networks (SDPNs) that can be seen as a network of pushdown processes executing synchronized transitions, spawning new pushdown processes, and performing internal pushdown actions. The reachability problem for this model is unfortunately undecidable. Therefore, we tackle this problem by introducing an abstraction f","authors_text":"Adrien Pommellet, Tayssir Touili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-05T13:57:55Z","title":"Static Analysis of Multithreaded Recursive Programs Communicating via Rendez-vous"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.02834","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:8aaf2292cea87ff05e756a1bc50ab91eadca2a8de94391350cb0355ab64220b3","target":"record","created_at":"2026-05-17T23:41:22Z","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":"aa4596566a08ed20be9adb9fb3f33a700e244b1be7e124395a4b9a489bdb5423","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2019-07-05T13:57:55Z","title_canon_sha256":"6c0bd9ef13b8486bcef0ce47b443f6d8a171b182d17b50f4a79ec92e9fdf29f3"},"schema_version":"1.0","source":{"id":"1907.02834","kind":"arxiv","version":1}},"canonical_sha256":"59d0da109fd079c33a0c57373fe55e7ee2261edba2759cf01d35e4b025745a43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59d0da109fd079c33a0c57373fe55e7ee2261edba2759cf01d35e4b025745a43","first_computed_at":"2026-05-17T23:41:22.935770Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:22.935770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n1ixkP83gb8RUkjwt9UB3fhT/2XzYPqoQyc+7CzC/+zAAnzS72yZz8LbzMCJk8HQHYC6XtnTkSNSNP9RtqmhAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:22.936433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.02834","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8aaf2292cea87ff05e756a1bc50ab91eadca2a8de94391350cb0355ab64220b3","sha256:a1e0858659ec29750e06c6500013faf901d7028c3abffe3be46b76c0f40aff0c"],"state_sha256":"0c9a20e3da20aea723f489b04fe53f842d4c7e881ce0e777ef175f9d4344e4cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JhEz+U5E8lC0uiTjzfuqmpVmYXXuhn3256ETfDVOPi5tc8GZSpJ2ofn24WAIt+1x+dGUaR06LpGfc8UVjzpEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:49:55.073161Z","bundle_sha256":"77f826b322326c3b19d5d310ee35957e2d29cdca270faeb2edda167c38ad6dc6"}}