{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CZB5GL3XJAFMH3QA6ES5Z46OVE","short_pith_number":"pith:CZB5GL3X","canonical_record":{"source":{"id":"0903.3126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-03-18T10:56:11Z","cross_cats_sorted":[],"title_canon_sha256":"fe4b280ef7381e5ce528a9d8439e5f44b2a0ff3b553faa9dcf9ede45411eaa64","abstract_canon_sha256":"be15e63c4be2f94d78b8fb1c95ca889078930176c7e44c80d074a831c2b96d0d"},"schema_version":"1.0"},"canonical_sha256":"1643d32f77480ac3ee00f125dcf3cea912b51af62364ee83adf4b464cc0142fa","source":{"kind":"arxiv","id":"0903.3126","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.3126","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0903.3126v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3126","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"CZB5GL3XJAFM","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CZB5GL3XJAFMH3QA","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CZB5GL3X","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CZB5GL3XJAFMH3QA6ES5Z46OVE","target":"record","payload":{"canonical_record":{"source":{"id":"0903.3126","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-03-18T10:56:11Z","cross_cats_sorted":[],"title_canon_sha256":"fe4b280ef7381e5ce528a9d8439e5f44b2a0ff3b553faa9dcf9ede45411eaa64","abstract_canon_sha256":"be15e63c4be2f94d78b8fb1c95ca889078930176c7e44c80d074a831c2b96d0d"},"schema_version":"1.0"},"canonical_sha256":"1643d32f77480ac3ee00f125dcf3cea912b51af62364ee83adf4b464cc0142fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.484619Z","signature_b64":"R2yV+rG9qWWrHCfmKtKZeK52+fLRZANeT4SLSbq7yJzA7MnmZ+sgZ9dVJIVU6Q9d7fBkSfcyxEhWOtaYSq0fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1643d32f77480ac3ee00f125dcf3cea912b51af62364ee83adf4b464cc0142fa","last_reissued_at":"2026-05-18T01:37:40.484014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.484014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0903.3126","source_version":2,"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:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpKarluh1qnpBsr9yij9QSFZotQpuZGaCU8rNvjqZmkOH9ZBYRzwfpf6aHZq84RB3JUUaPW6TEIzT69CktQrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:56:41.198279Z"},"content_sha256":"63a9078c81d2f14d77ffa9664a6983dec415fe3f9c73da7e9e118562f8a377b0","schema_version":"1.0","event_id":"sha256:63a9078c81d2f14d77ffa9664a6983dec415fe3f9c73da7e9e118562f8a377b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CZB5GL3XJAFMH3QA6ES5Z46OVE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu, Yan Jurski","submitted_at":"2009-03-18T10:56:11Z","abstract_excerpt":"We propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some potentially infinite data domain such as integers, reals, etc. Furthermore, we define a logic, called CML (colored markings logic), for the description of CPN configurations. CML is a first-order logic over tokens allowing to reason about their locations and their colors. Both CPNs and CML are parametrized"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3126","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"},"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:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbILNJU1j4JD06ngjtkB3EBXemuyPsXya5ihvgDxdqD6E2HCVRMJO665/WM8X3QtQMoZI/V+auTPEGrrxsmKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:56:41.198998Z"},"content_sha256":"b40ee514d1ec3a66351c26803a5ba01808983963ce9d5cea1d599af3a865c3a2","schema_version":"1.0","event_id":"sha256:b40ee514d1ec3a66351c26803a5ba01808983963ce9d5cea1d599af3a865c3a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/bundle.json","state_url":"https://pith.science/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/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-25T16:56:41Z","links":{"resolver":"https://pith.science/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE","bundle":"https://pith.science/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/bundle.json","state":"https://pith.science/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZB5GL3XJAFMH3QA6ES5Z46OVE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CZB5GL3XJAFMH3QA6ES5Z46OVE","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":"be15e63c4be2f94d78b8fb1c95ca889078930176c7e44c80d074a831c2b96d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-03-18T10:56:11Z","title_canon_sha256":"fe4b280ef7381e5ce528a9d8439e5f44b2a0ff3b553faa9dcf9ede45411eaa64"},"schema_version":"1.0","source":{"id":"0903.3126","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0903.3126","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0903.3126v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0903.3126","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"CZB5GL3XJAFM","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CZB5GL3XJAFMH3QA","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CZB5GL3X","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:b40ee514d1ec3a66351c26803a5ba01808983963ce9d5cea1d599af3a865c3a2","target":"graph","created_at":"2026-05-18T01:37:40Z","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 propose a framework for reasoning about unbounded dynamic networks of infinite-state processes. We propose Constrained Petri Nets (CPN) as generic models for these networks. They can be seen as Petri nets where tokens (representing occurrences of processes) are colored by values over some potentially infinite data domain such as integers, reals, etc. Furthermore, we define a logic, called CML (colored markings logic), for the description of CPN configurations. CML is a first-order logic over tokens allowing to reason about their locations and their colors. Both CPNs and CML are parametrized","authors_text":"Ahmed Bouajjani, Cezara Dragoi, Constantin Enea, Mihaela Sighireanu, Yan Jurski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-03-18T10:56:11Z","title":"A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0903.3126","kind":"arxiv","version":2},"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:63a9078c81d2f14d77ffa9664a6983dec415fe3f9c73da7e9e118562f8a377b0","target":"record","created_at":"2026-05-18T01:37:40Z","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":"be15e63c4be2f94d78b8fb1c95ca889078930176c7e44c80d074a831c2b96d0d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-03-18T10:56:11Z","title_canon_sha256":"fe4b280ef7381e5ce528a9d8439e5f44b2a0ff3b553faa9dcf9ede45411eaa64"},"schema_version":"1.0","source":{"id":"0903.3126","kind":"arxiv","version":2}},"canonical_sha256":"1643d32f77480ac3ee00f125dcf3cea912b51af62364ee83adf4b464cc0142fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1643d32f77480ac3ee00f125dcf3cea912b51af62364ee83adf4b464cc0142fa","first_computed_at":"2026-05-18T01:37:40.484014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:40.484014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R2yV+rG9qWWrHCfmKtKZeK52+fLRZANeT4SLSbq7yJzA7MnmZ+sgZ9dVJIVU6Q9d7fBkSfcyxEhWOtaYSq0fBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:40.484619Z","signed_message":"canonical_sha256_bytes"},"source_id":"0903.3126","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63a9078c81d2f14d77ffa9664a6983dec415fe3f9c73da7e9e118562f8a377b0","sha256:b40ee514d1ec3a66351c26803a5ba01808983963ce9d5cea1d599af3a865c3a2"],"state_sha256":"86dcb74f19a1a459f43e7593bc6836244f18c356cca92a3302dab94563115c99"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tn315227bEUYWpGuvYGHEe4iHMj12KzH9wIVqWGS+2iSrwbCef9EI3seEyTqsWhpzVj+p/NoIJvcknQ264w7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:56:41.202784Z","bundle_sha256":"1117f13483e4bb1c8a89ca98f3d682ca28185e2b1598a15b50b1f8539c4b187a"}}