{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CYN7YOWXP5PMXPZCKGHNA5BGH7","short_pith_number":"pith:CYN7YOWX","canonical_record":{"source":{"id":"1007.4764","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-27T16:11:01Z","cross_cats_sorted":[],"title_canon_sha256":"a2e77dcefea48af9cbe34147d3d7530a57400f2976dc07ab7fe799845c6b860b","abstract_canon_sha256":"d466598ffaf844b95d7c94d1f3b36ff67ddf11cbfd158a9d34268ac056f59cb0"},"schema_version":"1.0"},"canonical_sha256":"161bfc3ad77f5ecbbf22518ed074263ff58eea9af34cbf73d57e0623c40a4cf9","source":{"kind":"arxiv","id":"1007.4764","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4764","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4764v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4764","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"CYN7YOWXP5PM","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CYN7YOWXP5PMXPZC","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CYN7YOWX","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CYN7YOWXP5PMXPZCKGHNA5BGH7","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4764","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-27T16:11:01Z","cross_cats_sorted":[],"title_canon_sha256":"a2e77dcefea48af9cbe34147d3d7530a57400f2976dc07ab7fe799845c6b860b","abstract_canon_sha256":"d466598ffaf844b95d7c94d1f3b36ff67ddf11cbfd158a9d34268ac056f59cb0"},"schema_version":"1.0"},"canonical_sha256":"161bfc3ad77f5ecbbf22518ed074263ff58eea9af34cbf73d57e0623c40a4cf9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.928936Z","signature_b64":"4SMR+AYse0BbhlopbuuujfpOz+2WQ3FqRypdWvK3FeyA+ht2MjTq+ypd46moDLNxpppcFdgKxnWSradsKr4IBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"161bfc3ad77f5ecbbf22518ed074263ff58eea9af34cbf73d57e0623c40a4cf9","last_reissued_at":"2026-05-18T01:37:39.928278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.928278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4764","source_version":3,"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gxwIHNDpQIoYNZDSkQdDqjS6oRFIokZJRSoDIYAdmsdWtC8CQaKejoH8zYfMt/adZLqzQJK+byfyI5c9k44IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:38:12.280182Z"},"content_sha256":"1afe0a13795ba41567f3c186e6e28dac8c1e7ff7eca63d14ac12bc2d74d7cf0e","schema_version":"1.0","event_id":"sha256:1afe0a13795ba41567f3c186e6e28dac8c1e7ff7eca63d14ac12bc2d74d7cf0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CYN7YOWXP5PMXPZCKGHNA5BGH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Propositional Dynamic Logic for Message-Passing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Benedikt Bollig (LSV, CNRS), Dietrich Kuske (Institut f\\\"ur Informatik, ENS Cachan, Ingmar Meinecke (Institut f\\\"ur Informatik, Universit\\\"at Leipzig)","submitted_at":"2010-07-27T16:11:01Z","abstract_excerpt":"We examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4764","kind":"arxiv","version":3},"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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Av/R7JOTpXk/E/swg8b4Dr7GmWFOwiN75PTKa5vqzUpwktnlEhtPFEeTZAFTkWHJKtgdnhJqDR7Qu6a/Yuk1Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:38:12.280875Z"},"content_sha256":"1a6305b2d51152bbb3a4aef05918207f42daa4c1d252bd2d7718cbd3755b3201","schema_version":"1.0","event_id":"sha256:1a6305b2d51152bbb3a4aef05918207f42daa4c1d252bd2d7718cbd3755b3201"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/bundle.json","state_url":"https://pith.science/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/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-04T13:38:12Z","links":{"resolver":"https://pith.science/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7","bundle":"https://pith.science/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/bundle.json","state":"https://pith.science/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CYN7YOWXP5PMXPZCKGHNA5BGH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CYN7YOWXP5PMXPZCKGHNA5BGH7","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":"d466598ffaf844b95d7c94d1f3b36ff67ddf11cbfd158a9d34268ac056f59cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-27T16:11:01Z","title_canon_sha256":"a2e77dcefea48af9cbe34147d3d7530a57400f2976dc07ab7fe799845c6b860b"},"schema_version":"1.0","source":{"id":"1007.4764","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4764","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4764v3","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4764","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"CYN7YOWXP5PM","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CYN7YOWXP5PMXPZC","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CYN7YOWX","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:1a6305b2d51152bbb3a4aef05918207f42daa4c1d252bd2d7718cbd3755b3201","target":"graph","created_at":"2026-05-18T01:37:39Z","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 examine a bidirectional propositional dynamic logic (PDL) for finite and infinite message sequence charts (MSCs) extending LTL and TLC-. By this kind of multi-modal logic we can express properties both in the entire future and in the past of an event. Path expressions strengthen the classical until operator of temporal logic. For every formula defining an MSC language, we construct a communicating finite-state machine (CFM) accepting the same language. The CFM obtained has size exponential in the size of the formula. This synthesis problem is solved in full generality, i.e., also for MSCs w","authors_text":"Benedikt Bollig (LSV, CNRS), Dietrich Kuske (Institut f\\\"ur Informatik, ENS Cachan, Ingmar Meinecke (Institut f\\\"ur Informatik, Universit\\\"at Leipzig)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-27T16:11:01Z","title":"Propositional Dynamic Logic for Message-Passing Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4764","kind":"arxiv","version":3},"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:1afe0a13795ba41567f3c186e6e28dac8c1e7ff7eca63d14ac12bc2d74d7cf0e","target":"record","created_at":"2026-05-18T01:37:39Z","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":"d466598ffaf844b95d7c94d1f3b36ff67ddf11cbfd158a9d34268ac056f59cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2010-07-27T16:11:01Z","title_canon_sha256":"a2e77dcefea48af9cbe34147d3d7530a57400f2976dc07ab7fe799845c6b860b"},"schema_version":"1.0","source":{"id":"1007.4764","kind":"arxiv","version":3}},"canonical_sha256":"161bfc3ad77f5ecbbf22518ed074263ff58eea9af34cbf73d57e0623c40a4cf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"161bfc3ad77f5ecbbf22518ed074263ff58eea9af34cbf73d57e0623c40a4cf9","first_computed_at":"2026-05-18T01:37:39.928278Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.928278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4SMR+AYse0BbhlopbuuujfpOz+2WQ3FqRypdWvK3FeyA+ht2MjTq+ypd46moDLNxpppcFdgKxnWSradsKr4IBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.928936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4764","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1afe0a13795ba41567f3c186e6e28dac8c1e7ff7eca63d14ac12bc2d74d7cf0e","sha256:1a6305b2d51152bbb3a4aef05918207f42daa4c1d252bd2d7718cbd3755b3201"],"state_sha256":"7890d94f1270b958a832e044b2b77f81e0ab118a11072457f59b32dc8a8c45c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FbbD7vfVI+214/hGxaRYgw+MtlNL6y8GsVq1p2NcDIEEsjIBpOcdFK4WW+48dDhVkkQg8uGI9ZRWNzwSYz9hDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:38:12.285099Z","bundle_sha256":"3b095fa27c920ad60d1607aaf95358b2631947dcac4278ae2fa8a81dee3389d5"}}