{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N42AFZ7MXWVOLVMV4CU6BTMYMI","short_pith_number":"pith:N42AFZ7M","canonical_record":{"source":{"id":"1305.7410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-31T14:25:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"18ba3d0d4087653fedf25f0a2caf3be7c77bca18b1fb4449d2b494dafd38e05c","abstract_canon_sha256":"d1c49b780be3d35437eb111e01d1f790062820097266fdc298bae03e88b44d6d"},"schema_version":"1.0"},"canonical_sha256":"6f3402e7ecbdaae5d595e0a9e0cd986221cadf45976acde677ad5acfdf6a852a","source":{"kind":"arxiv","id":"1305.7410","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7410","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7410v3","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7410","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"N42AFZ7MXWVO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N42AFZ7MXWVOLVMV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N42AFZ7M","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N42AFZ7MXWVOLVMV4CU6BTMYMI","target":"record","payload":{"canonical_record":{"source":{"id":"1305.7410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-31T14:25:50Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"18ba3d0d4087653fedf25f0a2caf3be7c77bca18b1fb4449d2b494dafd38e05c","abstract_canon_sha256":"d1c49b780be3d35437eb111e01d1f790062820097266fdc298bae03e88b44d6d"},"schema_version":"1.0"},"canonical_sha256":"6f3402e7ecbdaae5d595e0a9e0cd986221cadf45976acde677ad5acfdf6a852a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:23.436464Z","signature_b64":"UPT3ha5C5pebOQS7z+X8/q7YwUb85X3Zhf+yn5bSA4KGhx69ykKrBIz5pn/O6k+JYhzhGLUAtbJwvTy6nhwzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f3402e7ecbdaae5d595e0a9e0cd986221cadf45976acde677ad5acfdf6a852a","last_reissued_at":"2026-05-18T02:44:23.435877Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:23.435877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.7410","source_version":3,"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jEyeFbcEzXjkd8cG8H+cIZ/q4lTMa3NNpMwXlh4R2sL4ijztOuz1FrIanOhP4iEuPtWezizc5BEb7tzxfY1vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:13:15.315964Z"},"content_sha256":"3825302ae02fa9b7d31e6dbbc0774f63423a84e2b5ee54822856c0e7d0a50ee0","schema_version":"1.0","event_id":"sha256:3825302ae02fa9b7d31e6dbbc0774f63423a84e2b5ee54822856c0e7d0a50ee0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N42AFZ7MXWVOLVMV4CU6BTMYMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.NI","authors_text":"Daqiang Zhang, Feng Xie, Ping Yin, Rongbo Zhu, Yinxue Ma, Zhe Chen","submitted_at":"2013-05-31T14:25:50Z","abstract_excerpt":"This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. However, it cannot prove the correctness over all cases. The latter one can provide a complete proof based on abstractions of unbounded network. However, it usually needs user interv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7410","kind":"arxiv","version":3},"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:44:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CdTieyQ0CEib8tcAlYA5RKU5xMuzBmMZz/mVKf1sh8J+iRk9Wf+6DuYTYOdYLhZ2W6zGmO4zXlcqYC384aRIBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:13:15.316654Z"},"content_sha256":"3127d55ba49dc83b6e92594a59173573d1dccedb4ca849ae69b3861787796942","schema_version":"1.0","event_id":"sha256:3127d55ba49dc83b6e92594a59173573d1dccedb4ca849ae69b3861787796942"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/bundle.json","state_url":"https://pith.science/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/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-25T19:13:15Z","links":{"resolver":"https://pith.science/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI","bundle":"https://pith.science/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/bundle.json","state":"https://pith.science/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N42AFZ7MXWVOLVMV4CU6BTMYMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N42AFZ7MXWVOLVMV4CU6BTMYMI","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":"d1c49b780be3d35437eb111e01d1f790062820097266fdc298bae03e88b44d6d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-31T14:25:50Z","title_canon_sha256":"18ba3d0d4087653fedf25f0a2caf3be7c77bca18b1fb4449d2b494dafd38e05c"},"schema_version":"1.0","source":{"id":"1305.7410","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.7410","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.7410v3","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.7410","created_at":"2026-05-18T02:44:23Z"},{"alias_kind":"pith_short_12","alias_value":"N42AFZ7MXWVO","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N42AFZ7MXWVOLVMV","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N42AFZ7M","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:3127d55ba49dc83b6e92594a59173573d1dccedb4ca849ae69b3861787796942","target":"graph","created_at":"2026-05-18T02:44:23Z","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":"This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. However, it cannot prove the correctness over all cases. The latter one can provide a complete proof based on abstractions of unbounded network. However, it usually needs user interv","authors_text":"Daqiang Zhang, Feng Xie, Ping Yin, Rongbo Zhu, Yinxue Ma, Zhe Chen","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-31T14:25:50Z","title":"A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.7410","kind":"arxiv","version":3},"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:3825302ae02fa9b7d31e6dbbc0774f63423a84e2b5ee54822856c0e7d0a50ee0","target":"record","created_at":"2026-05-18T02:44:23Z","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":"d1c49b780be3d35437eb111e01d1f790062820097266fdc298bae03e88b44d6d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-05-31T14:25:50Z","title_canon_sha256":"18ba3d0d4087653fedf25f0a2caf3be7c77bca18b1fb4449d2b494dafd38e05c"},"schema_version":"1.0","source":{"id":"1305.7410","kind":"arxiv","version":3}},"canonical_sha256":"6f3402e7ecbdaae5d595e0a9e0cd986221cadf45976acde677ad5acfdf6a852a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f3402e7ecbdaae5d595e0a9e0cd986221cadf45976acde677ad5acfdf6a852a","first_computed_at":"2026-05-18T02:44:23.435877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:23.435877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UPT3ha5C5pebOQS7z+X8/q7YwUb85X3Zhf+yn5bSA4KGhx69ykKrBIz5pn/O6k+JYhzhGLUAtbJwvTy6nhwzDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:23.436464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.7410","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3825302ae02fa9b7d31e6dbbc0774f63423a84e2b5ee54822856c0e7d0a50ee0","sha256:3127d55ba49dc83b6e92594a59173573d1dccedb4ca849ae69b3861787796942"],"state_sha256":"89ada05b70e388b8c1b149210448f5bb043c7c5f8efb2a4af3596516a63d1982"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDAUcRZjAsY9corv5fFPBX0fofH5IzDXhIbTZOokNyquBVpOeqwNGjQb40ar6KS78HEpbtGS0hYOW7ZpSSSnDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:13:15.320484Z","bundle_sha256":"d46abf063b3a3397a00fe3b3e96ed38937486335c53b836c20acc8c10522b49a"}}