{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:LJY6AQBVXEUGV4D2JZKWA6B64R","short_pith_number":"pith:LJY6AQBV","canonical_record":{"source":{"id":"1402.2698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"06b814aaf861ba0ec3c71730017bab7dd701ec75241872fda3b4b3520b8ed84f","abstract_canon_sha256":"46fb854977accb5396715bf1fbffe5650368f92350146d1116fa54b747ea51f7"},"schema_version":"1.0"},"canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","source":{"kind":"arxiv","id":"1402.2698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2698","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2698v1","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2698","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"pith_short_12","alias_value":"LJY6AQBVXEUG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LJY6AQBVXEUGV4D2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LJY6AQBV","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:LJY6AQBVXEUGV4D2JZKWA6B64R","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","cross_cats_sorted":["cs.DC","cs.DS"],"title_canon_sha256":"06b814aaf861ba0ec3c71730017bab7dd701ec75241872fda3b4b3520b8ed84f","abstract_canon_sha256":"46fb854977accb5396715bf1fbffe5650368f92350146d1116fa54b747ea51f7"},"schema_version":"1.0"},"canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:08.195218Z","signature_b64":"uVlGdIkbAHg+zP2pNyhTvWZx4MZkP7jejRBLs4eCQRGZJEF5d52EaBmhbBi7FFPXs+lSFjjlGJC4x039HZm2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","last_reissued_at":"2026-05-18T02:59:08.194505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:08.194505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2698","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-18T02:59:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ng2BLKgoYZcSrO7s678qYCyrCzM3gQK0GujNcZvduqudVFqq6hfHRVQ3jxUJjhViiifa/eV8REfB+1CtEwcRDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:43:04.303015Z"},"content_sha256":"fc9bb1450999d6c9da866244625a2f1104b22f288b2575b3440cc12594293b46","schema_version":"1.0","event_id":"sha256:fc9bb1450999d6c9da866244625a2f1104b22f288b2575b3440cc12594293b46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:LJY6AQBVXEUGV4D2JZKWA6B64R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS"],"primary_cat":"cs.LO","authors_text":"Mateus de Oliveira Oliveira","submitted_at":"2014-02-11T23:50:39Z","abstract_excerpt":"In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and assume that behavioral specifications are given via monadic second order logic. A c-partial-order is a partial order whose Hasse diagram can be covered by c paths. For a finite set T of transitions, we let P(c,T,\\phi) denote the set of all T-labelled c-partial-orders satisfying \\phi. If N=(P,T) is a p/t-net we let P(N,c) denote the set of all c-partially-order"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2698","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-18T02:59:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RS1mtcRIX3lDTzv6vS36eB+AFB/PKKZMNBtatjI0N1bi7e8KzpSvuZyQOKciHAaQW+llwR3vyT51WwFijnQ4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T03:43:04.303740Z"},"content_sha256":"e0feb73a8a81a5549a1826e25e1e3f42e6c26af86d27cafcfeb452f55ea0d0c3","schema_version":"1.0","event_id":"sha256:e0feb73a8a81a5549a1826e25e1e3f42e6c26af86d27cafcfeb452f55ea0d0c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/bundle.json","state_url":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/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-25T03:43:04Z","links":{"resolver":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R","bundle":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/bundle.json","state":"https://pith.science/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJY6AQBVXEUGV4D2JZKWA6B64R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:LJY6AQBVXEUGV4D2JZKWA6B64R","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":"46fb854977accb5396715bf1fbffe5650368f92350146d1116fa54b747ea51f7","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","title_canon_sha256":"06b814aaf861ba0ec3c71730017bab7dd701ec75241872fda3b4b3520b8ed84f"},"schema_version":"1.0","source":{"id":"1402.2698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2698","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2698v1","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2698","created_at":"2026-05-18T02:59:08Z"},{"alias_kind":"pith_short_12","alias_value":"LJY6AQBVXEUG","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"LJY6AQBVXEUGV4D2","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"LJY6AQBV","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e0feb73a8a81a5549a1826e25e1e3f42e6c26af86d27cafcfeb452f55ea0d0c3","target":"graph","created_at":"2026-05-18T02:59:08Z","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":"In this work we provide algorithmic solutions to five fundamental problems concerning the verification, synthesis and correction of concurrent systems that can be modeled by bounded p/t-nets. We express concurrency via partial orders and assume that behavioral specifications are given via monadic second order logic. A c-partial-order is a partial order whose Hasse diagram can be covered by c paths. For a finite set T of transitions, we let P(c,T,\\phi) denote the set of all T-labelled c-partial-orders satisfying \\phi. If N=(P,T) is a p/t-net we let P(N,c) denote the set of all c-partially-order","authors_text":"Mateus de Oliveira Oliveira","cross_cats":["cs.DC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","title":"Automated Verification, Synthesis and Correction of Concurrent Systems via MSO Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2698","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:fc9bb1450999d6c9da866244625a2f1104b22f288b2575b3440cc12594293b46","target":"record","created_at":"2026-05-18T02:59:08Z","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":"46fb854977accb5396715bf1fbffe5650368f92350146d1116fa54b747ea51f7","cross_cats_sorted":["cs.DC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-02-11T23:50:39Z","title_canon_sha256":"06b814aaf861ba0ec3c71730017bab7dd701ec75241872fda3b4b3520b8ed84f"},"schema_version":"1.0","source":{"id":"1402.2698","kind":"arxiv","version":1}},"canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a71e04035b9286af07a4e5560783ee45706eeb902d9faedf8e0c0e7c0635ea5","first_computed_at":"2026-05-18T02:59:08.194505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:08.194505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uVlGdIkbAHg+zP2pNyhTvWZx4MZkP7jejRBLs4eCQRGZJEF5d52EaBmhbBi7FFPXs+lSFjjlGJC4x039HZm2Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:08.195218Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc9bb1450999d6c9da866244625a2f1104b22f288b2575b3440cc12594293b46","sha256:e0feb73a8a81a5549a1826e25e1e3f42e6c26af86d27cafcfeb452f55ea0d0c3"],"state_sha256":"c54750bde08e03657979e6f05e46bb69b3a038a70706b3a872f06257c7f6452b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zB27Oq35hXQuDPm2qqH8emc+yB7b/33GjqAi1bTNstof3iaGTFokxHD5avko+Ap6G8XRbzXQbUU1fiT6b/YiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T03:43:04.307421Z","bundle_sha256":"0d4028d01bbfc85b14b53a203495a1676a104b0b78acb2e9531e68bd665d789c"}}