{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:P6PSHR5FRQOQKUEFIUQ63SRONG","short_pith_number":"pith:P6PSHR5F","canonical_record":{"source":{"id":"1108.1864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-09T06:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"3a0c0c8ca571c68fe61daa476741a937ac4e6b4956283b6e45957ccbeb8487cf","abstract_canon_sha256":"f982317585c7294ac26414f071655a0d67df2d2b21bbaffa1a87588ca0d22cd9"},"schema_version":"1.0"},"canonical_sha256":"7f9f23c7a58c1d0550854521edca2e69bd2a1af07570baf683775543f933c4db","source":{"kind":"arxiv","id":"1108.1864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1864","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1864v1","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1864","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"P6PSHR5FRQOQ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P6PSHR5FRQOQKUEF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P6PSHR5F","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:P6PSHR5FRQOQKUEFIUQ63SRONG","target":"record","payload":{"canonical_record":{"source":{"id":"1108.1864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-09T06:38:39Z","cross_cats_sorted":[],"title_canon_sha256":"3a0c0c8ca571c68fe61daa476741a937ac4e6b4956283b6e45957ccbeb8487cf","abstract_canon_sha256":"f982317585c7294ac26414f071655a0d67df2d2b21bbaffa1a87588ca0d22cd9"},"schema_version":"1.0"},"canonical_sha256":"7f9f23c7a58c1d0550854521edca2e69bd2a1af07570baf683775543f933c4db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:58.929865Z","signature_b64":"mVcA9Li1XbTIRiy8q0bY+gK4/vlZyZhE/nBpHrDKk2vUzYejDvLBdKM4IhENep2NvSLrIxYTQWJ0j1uTWt1eAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9f23c7a58c1d0550854521edca2e69bd2a1af07570baf683775543f933c4db","last_reissued_at":"2026-05-18T04:15:58.929241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:58.929241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.1864","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-18T04:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ErYiHfMFExDDIaGyWxlK/2qcy9KSC413ZjK+bkrCXsJtbIXwHV9JqBx/7fhgG3VpBEtE4c9oX8uJzKg4n8+iDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:21:28.928337Z"},"content_sha256":"a59faa3efac1b1920fda65c06fee4bbb656ead18c34fa5d153be6d73298ca9f2","schema_version":"1.0","event_id":"sha256:a59faa3efac1b1920fda65c06fee4bbb656ead18c34fa5d153be6d73298ca9f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:P6PSHR5FRQOQKUEFIUQ63SRONG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Verification of Safety Properties in Ad Hoc Network Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Arnaud Sangnier, Gianluigi Zavattaro, Giorgio Delzanno","submitted_at":"2011-08-09T06:38:39Z","abstract_excerpt":"We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1864","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-18T04:15:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTrtpU5GSnvyoC1BL14+OoWo6GMBgKNwcjF/euF0+WQWaCqLi9Z0IzVyw4FkdQudU2n0Q6pBKm//KMGBWPgCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:21:28.929015Z"},"content_sha256":"ca2f4a02ab88d6cb7a17e059c9a1740babe20863f03d152ddf908d3f1b59a679","schema_version":"1.0","event_id":"sha256:ca2f4a02ab88d6cb7a17e059c9a1740babe20863f03d152ddf908d3f1b59a679"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/bundle.json","state_url":"https://pith.science/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/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-09T06:21:28Z","links":{"resolver":"https://pith.science/pith/P6PSHR5FRQOQKUEFIUQ63SRONG","bundle":"https://pith.science/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/bundle.json","state":"https://pith.science/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6PSHR5FRQOQKUEFIUQ63SRONG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P6PSHR5FRQOQKUEFIUQ63SRONG","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":"f982317585c7294ac26414f071655a0d67df2d2b21bbaffa1a87588ca0d22cd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-09T06:38:39Z","title_canon_sha256":"3a0c0c8ca571c68fe61daa476741a937ac4e6b4956283b6e45957ccbeb8487cf"},"schema_version":"1.0","source":{"id":"1108.1864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.1864","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"arxiv_version","alias_value":"1108.1864v1","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.1864","created_at":"2026-05-18T04:15:58Z"},{"alias_kind":"pith_short_12","alias_value":"P6PSHR5FRQOQ","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P6PSHR5FRQOQKUEF","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P6PSHR5F","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:ca2f4a02ab88d6cb7a17e059c9a1740babe20863f03d152ddf908d3f1b59a679","target":"graph","created_at":"2026-05-18T04:15:58Z","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 summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communication topology of a network is represented as a graph. Nodes represent states of individual processes. Adjacent nodes represent single-hop neighbors. Processes are finite state automata that communicate via selective broadcast messages. Reception of a broadcast is restricted to single-hop neighbors. For this model we consider a decision problem that can be expressed as the verification of the existence of an initial to","authors_text":"Arnaud Sangnier, Gianluigi Zavattaro, Giorgio Delzanno","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-09T06:38:39Z","title":"Parameterized Verification of Safety Properties in Ad Hoc Network Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.1864","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:a59faa3efac1b1920fda65c06fee4bbb656ead18c34fa5d153be6d73298ca9f2","target":"record","created_at":"2026-05-18T04:15:58Z","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":"f982317585c7294ac26414f071655a0d67df2d2b21bbaffa1a87588ca0d22cd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-08-09T06:38:39Z","title_canon_sha256":"3a0c0c8ca571c68fe61daa476741a937ac4e6b4956283b6e45957ccbeb8487cf"},"schema_version":"1.0","source":{"id":"1108.1864","kind":"arxiv","version":1}},"canonical_sha256":"7f9f23c7a58c1d0550854521edca2e69bd2a1af07570baf683775543f933c4db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f9f23c7a58c1d0550854521edca2e69bd2a1af07570baf683775543f933c4db","first_computed_at":"2026-05-18T04:15:58.929241Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:58.929241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mVcA9Li1XbTIRiy8q0bY+gK4/vlZyZhE/nBpHrDKk2vUzYejDvLBdKM4IhENep2NvSLrIxYTQWJ0j1uTWt1eAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:58.929865Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.1864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a59faa3efac1b1920fda65c06fee4bbb656ead18c34fa5d153be6d73298ca9f2","sha256:ca2f4a02ab88d6cb7a17e059c9a1740babe20863f03d152ddf908d3f1b59a679"],"state_sha256":"9b9c6d45e32b6ead8a69997c936cd6ad745c05b11c42dc81116b75c437d32545"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+y6nKtr+5GpOt69+mCl3f4mi26Xp5uk0u+XFjBR5j/ZNZE+974nYR4VQO5zdiZ1cua9mWGsnwvlb8skGLmdrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:21:28.932888Z","bundle_sha256":"2b2315fafbea02f4bfa1814740f9aff044c6aab7f81ae8b1d8cfb62100f1004c"}}