{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SKI3IGLJQO353FI3SQYG4ZHLV6","short_pith_number":"pith:SKI3IGLJ","canonical_record":{"source":{"id":"1711.03826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-10T14:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"07d29ffc93cabc5ab5ce65727dbda4439ee18c55f8aa6c26364042d638eee865","abstract_canon_sha256":"f6dbef0e32b6edaf3ea3b191113ad4b692da21d59dbd2990e986661c53f26d6a"},"schema_version":"1.0"},"canonical_sha256":"9291b4196983b7dd951b94306e64ebaf8813fd2a0a15d493d177019c662bf724","source":{"kind":"arxiv","id":"1711.03826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03826","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03826v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03826","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"SKI3IGLJQO35","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SKI3IGLJQO353FI3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SKI3IGLJ","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SKI3IGLJQO353FI3SQYG4ZHLV6","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-10T14:11:04Z","cross_cats_sorted":[],"title_canon_sha256":"07d29ffc93cabc5ab5ce65727dbda4439ee18c55f8aa6c26364042d638eee865","abstract_canon_sha256":"f6dbef0e32b6edaf3ea3b191113ad4b692da21d59dbd2990e986661c53f26d6a"},"schema_version":"1.0"},"canonical_sha256":"9291b4196983b7dd951b94306e64ebaf8813fd2a0a15d493d177019c662bf724","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.351709Z","signature_b64":"tqN9NC7NA3hJ7nti+h5wiesUHCQvivFFbIHnR4Z4v8iUovox4dxzWjtRhH5aiMTNag+vnEILd2nJoT49s/feCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9291b4196983b7dd951b94306e64ebaf8813fd2a0a15d493d177019c662bf724","last_reissued_at":"2026-05-18T00:30:51.350820Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.350820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03826","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-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xZQUSMRM6ssTTEZ8lCEvzDFTlyHgb8zQKSqsKt1Z5N073to0rGQwnqAjQz95OSt/7j/uf8K9CqzO3JKe7OmVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T06:49:08.827019Z"},"content_sha256":"982791abe2107725660926256ac5496e78b5b23a842c296aa37de5924eaac824","schema_version":"1.0","event_id":"sha256:982791abe2107725660926256ac5496e78b5b23a842c296aa37de5924eaac824"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SKI3IGLJQO353FI3SQYG4ZHLV6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking Markov Population Models by Stochastic Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Laura Nenzi, Luca Bortolussi, Roberta Lanciani","submitted_at":"2017-11-10T14:11:04Z","abstract_excerpt":"Many complex systems can be described by population models, in which a pool of agents interacts and produces complex collective behaviours. We consider the problem of verifying formal properties of the underlying mathematical representation of these models, which is a Continuous Time Markov Chain, often with a huge state space. To circumvent the state space explosion, we rely on stochastic approximation techniques, which replace the large model by a simpler one, guaranteed to be probabilistically consistent. We show how to efficiently and accurately verify properties of random individual agent"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03826","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-18T00:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VEeNgySSKF1tYxxghqKUTWLQRNFfeVN2ueZqKnlOCTkoXQmlBiNsZ2q8AS4yHtGvmqXtqq1cqHbmWhxY6bldDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T06:49:08.827377Z"},"content_sha256":"dff6d25a2414dbff8ca50f4169cce51831767b2e768c6be89cf8f7a2db29009e","schema_version":"1.0","event_id":"sha256:dff6d25a2414dbff8ca50f4169cce51831767b2e768c6be89cf8f7a2db29009e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/bundle.json","state_url":"https://pith.science/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/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-26T06:49:08Z","links":{"resolver":"https://pith.science/pith/SKI3IGLJQO353FI3SQYG4ZHLV6","bundle":"https://pith.science/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/bundle.json","state":"https://pith.science/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKI3IGLJQO353FI3SQYG4ZHLV6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SKI3IGLJQO353FI3SQYG4ZHLV6","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":"f6dbef0e32b6edaf3ea3b191113ad4b692da21d59dbd2990e986661c53f26d6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-10T14:11:04Z","title_canon_sha256":"07d29ffc93cabc5ab5ce65727dbda4439ee18c55f8aa6c26364042d638eee865"},"schema_version":"1.0","source":{"id":"1711.03826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03826","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03826v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03826","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"SKI3IGLJQO35","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SKI3IGLJQO353FI3","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SKI3IGLJ","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:dff6d25a2414dbff8ca50f4169cce51831767b2e768c6be89cf8f7a2db29009e","target":"graph","created_at":"2026-05-18T00:30:51Z","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":"Many complex systems can be described by population models, in which a pool of agents interacts and produces complex collective behaviours. We consider the problem of verifying formal properties of the underlying mathematical representation of these models, which is a Continuous Time Markov Chain, often with a huge state space. To circumvent the state space explosion, we rely on stochastic approximation techniques, which replace the large model by a simpler one, guaranteed to be probabilistically consistent. We show how to efficiently and accurately verify properties of random individual agent","authors_text":"Laura Nenzi, Luca Bortolussi, Roberta Lanciani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-10T14:11:04Z","title":"Model Checking Markov Population Models by Stochastic Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03826","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:982791abe2107725660926256ac5496e78b5b23a842c296aa37de5924eaac824","target":"record","created_at":"2026-05-18T00:30:51Z","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":"f6dbef0e32b6edaf3ea3b191113ad4b692da21d59dbd2990e986661c53f26d6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-10T14:11:04Z","title_canon_sha256":"07d29ffc93cabc5ab5ce65727dbda4439ee18c55f8aa6c26364042d638eee865"},"schema_version":"1.0","source":{"id":"1711.03826","kind":"arxiv","version":1}},"canonical_sha256":"9291b4196983b7dd951b94306e64ebaf8813fd2a0a15d493d177019c662bf724","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9291b4196983b7dd951b94306e64ebaf8813fd2a0a15d493d177019c662bf724","first_computed_at":"2026-05-18T00:30:51.350820Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:51.350820Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tqN9NC7NA3hJ7nti+h5wiesUHCQvivFFbIHnR4Z4v8iUovox4dxzWjtRhH5aiMTNag+vnEILd2nJoT49s/feCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:51.351709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:982791abe2107725660926256ac5496e78b5b23a842c296aa37de5924eaac824","sha256:dff6d25a2414dbff8ca50f4169cce51831767b2e768c6be89cf8f7a2db29009e"],"state_sha256":"658833d7749fd888bedeadfbdfd5099aaf5305078a4f2df3df50040d0961ca22"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"15xuhgak2axtLaD1/L6b/Fdfyw0s2JRw4kZOuCAuh9GtlirbpHnPGe0/U5oYZU2OUg9cW7V6OMATCFAxG6i6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T06:49:08.829292Z","bundle_sha256":"5d40d09d527c7b50fba089e086e2b29cf25b5c3d503ac0c973c057bcea03abac"}}