{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DUBFND2KE36PZHB256JIEDHUBN","short_pith_number":"pith:DUBFND2K","canonical_record":{"source":{"id":"1802.08469","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-23T10:17:50Z","cross_cats_sorted":["cs.DC","cs.FL"],"title_canon_sha256":"5cf0a410cffa2c1acdb34eb1b20550220e94c66b371cb0c4ce892996438ce10e","abstract_canon_sha256":"22e062ae1f706d4c241722e2bea7f17635fa0f39bb7cbf1fcb1ba91758208a1a"},"schema_version":"1.0"},"canonical_sha256":"1d02568f4a26fcfc9c3aef92820cf40b458f328315140220486a0b833cc16735","source":{"kind":"arxiv","id":"1802.08469","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08469","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08469v1","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08469","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"DUBFND2KE36P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUBFND2KE36PZHB2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUBFND2K","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DUBFND2KE36PZHB256JIEDHUBN","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08469","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-23T10:17:50Z","cross_cats_sorted":["cs.DC","cs.FL"],"title_canon_sha256":"5cf0a410cffa2c1acdb34eb1b20550220e94c66b371cb0c4ce892996438ce10e","abstract_canon_sha256":"22e062ae1f706d4c241722e2bea7f17635fa0f39bb7cbf1fcb1ba91758208a1a"},"schema_version":"1.0"},"canonical_sha256":"1d02568f4a26fcfc9c3aef92820cf40b458f328315140220486a0b833cc16735","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:43.663109Z","signature_b64":"RStWf/k+zot0+itWqFwTLh3Z08S+kBEEA6jD1XIVB8/81apP+3Tcjplus7F9KTpCAcbYkpjrxmYMdR9doOTNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d02568f4a26fcfc9c3aef92820cf40b458f328315140220486a0b833cc16735","last_reissued_at":"2026-05-18T00:22:43.662567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:43.662567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08469","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:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5H9Nf3x2WWm+4NFE4hvNnpnHbMZzrbxy8B0bmiAJWNFiZqYkw8Y3sjBZxWBxg7VqBAaBmgXh/tlU98aOm7NXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:44.254239Z"},"content_sha256":"6e38e1858f8c4a1bc266a6e6a2f465c85d8fd5f601f9c367b8091dd936221f32","schema_version":"1.0","event_id":"sha256:6e38e1858f8c4a1bc266a6e6a2f465c85d8fd5f601f9c367b8091dd936221f32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DUBFND2KE36PZHB256JIEDHUBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized verification of synchronization in constrained reconfigurable broadcast networks","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC","cs.FL"],"primary_cat":"cs.LO","authors_text":"A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey","submitted_at":"2018-02-23T10:17:50Z","abstract_excerpt":"Reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some (evolving) communication topology. The parameterized verification of such models aims at checking whether a given property holds irrespective of the initial configuration (number of agents, initial states and initial communication topology). We focus here on the synchronization property, asking whether all agents converge to a set of target states after some execution. This problem is known to be decidable in polynomia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08469","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:22:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNUN2MON4YyBXtAOXP1mOCZ5cClBgXUX2ZeUJl4N32MqfSJSSoVigC8Fx4mc/6Um+S7ouDVOlC+HqRsvf6BDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:17:44.255043Z"},"content_sha256":"33132c7a711415faa2978ea983b5ce249e1a38dd956acf2b1d52e2bf5e4483a3","schema_version":"1.0","event_id":"sha256:33132c7a711415faa2978ea983b5ce249e1a38dd956acf2b1d52e2bf5e4483a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUBFND2KE36PZHB256JIEDHUBN/bundle.json","state_url":"https://pith.science/pith/DUBFND2KE36PZHB256JIEDHUBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUBFND2KE36PZHB256JIEDHUBN/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-31T01:17:44Z","links":{"resolver":"https://pith.science/pith/DUBFND2KE36PZHB256JIEDHUBN","bundle":"https://pith.science/pith/DUBFND2KE36PZHB256JIEDHUBN/bundle.json","state":"https://pith.science/pith/DUBFND2KE36PZHB256JIEDHUBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUBFND2KE36PZHB256JIEDHUBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DUBFND2KE36PZHB256JIEDHUBN","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":"22e062ae1f706d4c241722e2bea7f17635fa0f39bb7cbf1fcb1ba91758208a1a","cross_cats_sorted":["cs.DC","cs.FL"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-23T10:17:50Z","title_canon_sha256":"5cf0a410cffa2c1acdb34eb1b20550220e94c66b371cb0c4ce892996438ce10e"},"schema_version":"1.0","source":{"id":"1802.08469","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08469","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08469v1","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08469","created_at":"2026-05-18T00:22:43Z"},{"alias_kind":"pith_short_12","alias_value":"DUBFND2KE36P","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DUBFND2KE36PZHB2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DUBFND2K","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:33132c7a711415faa2978ea983b5ce249e1a38dd956acf2b1d52e2bf5e4483a3","target":"graph","created_at":"2026-05-18T00:22:43Z","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":"Reconfigurable broadcast networks provide a convenient formalism for modelling and reasoning about networks of mobile agents broadcasting messages to other agents following some (evolving) communication topology. The parameterized verification of such models aims at checking whether a given property holds irrespective of the initial configuration (number of agents, initial states and initial communication topology). We focus here on the synchronization property, asking whether all agents converge to a set of target states after some execution. This problem is known to be decidable in polynomia","authors_text":"A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey","cross_cats":["cs.DC","cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-23T10:17:50Z","title":"Parameterized verification of synchronization in constrained reconfigurable broadcast networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08469","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:6e38e1858f8c4a1bc266a6e6a2f465c85d8fd5f601f9c367b8091dd936221f32","target":"record","created_at":"2026-05-18T00:22:43Z","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":"22e062ae1f706d4c241722e2bea7f17635fa0f39bb7cbf1fcb1ba91758208a1a","cross_cats_sorted":["cs.DC","cs.FL"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LO","submitted_at":"2018-02-23T10:17:50Z","title_canon_sha256":"5cf0a410cffa2c1acdb34eb1b20550220e94c66b371cb0c4ce892996438ce10e"},"schema_version":"1.0","source":{"id":"1802.08469","kind":"arxiv","version":1}},"canonical_sha256":"1d02568f4a26fcfc9c3aef92820cf40b458f328315140220486a0b833cc16735","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d02568f4a26fcfc9c3aef92820cf40b458f328315140220486a0b833cc16735","first_computed_at":"2026-05-18T00:22:43.662567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:43.662567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RStWf/k+zot0+itWqFwTLh3Z08S+kBEEA6jD1XIVB8/81apP+3Tcjplus7F9KTpCAcbYkpjrxmYMdR9doOTNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:43.663109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08469","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e38e1858f8c4a1bc266a6e6a2f465c85d8fd5f601f9c367b8091dd936221f32","sha256:33132c7a711415faa2978ea983b5ce249e1a38dd956acf2b1d52e2bf5e4483a3"],"state_sha256":"0decd9eab1836053192b1606cc09dbe6be37e323be466c07e99854e8320278d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"INATeB9XT9DIP9m5T+f5SmNjVZMIrFone6wVIhmu7sCbdlrndN5fmK8q3sSCMXc9TqtImhbeDwJxQG7cXQgICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:17:44.258565Z","bundle_sha256":"f29de692270a1003a7b26ae2e99101c8b884848bb75fc52ff309194459396a02"}}