{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:N77TUAJLZ7FBQB7QS4KIDY5ISI","short_pith_number":"pith:N77TUAJL","schema_version":"1.0","canonical_sha256":"6fff3a012bcfca1807f0971481e3a8920718667d97b0174ccfa187ae74fdc7cb","source":{"kind":"arxiv","id":"1703.06570","version":1},"attestation_state":"computed","paper":{"title":"Modelling, Verification, and Comparative Performance Analysis of the B.A.T.M.A.N. Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SE"],"primary_cat":"cs.LO","authors_text":"Ansgar Fehnker (University of Twente), Kaylash Chaudhary (University of the South Pacific), Vinay Mehta (University of the South Pacific)","submitted_at":"2017-03-20T02:47:32Z","abstract_excerpt":"This paper considers on a network routing protocol known as Better Approach to Mobile Ad hoc Networks (B.A.T.M.A.N.). The protocol serves two aims: first, to discover all bidirectional links, and second, to identify the best-next-hop for every other node in the network. A key element is that each node will flood the network at regular intervals with so-called originator messages.\n  This paper describes in detail a formalisation of the B.A.T.M.A.N. protocol. This exercise revealed several ambiguities and inconsistencies in the RFC. We developed two models. The first implements, if possible, a l"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.06570","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-20T02:47:32Z","cross_cats_sorted":["cs.NI","cs.SE"],"title_canon_sha256":"72f9cdb16da4130e5eb8b3b2252c77bc327ec14c191940876a7dabd495703521","abstract_canon_sha256":"8523cdc0c2ff2aa49586d02625fe02441b9ab13229a343465a8dcaebf89085a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:22.443866Z","signature_b64":"PKGT6uJutVAyLwS3Ilt0uEqLf41u0ECMLkArP9hNE/5FGuj/VbEO/0S5ujb9xPnV7DChjyxcMMgKJ9jZH6eEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fff3a012bcfca1807f0971481e3a8920718667d97b0174ccfa187ae74fdc7cb","last_reissued_at":"2026-05-18T00:48:22.443342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:22.443342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modelling, Verification, and Comparative Performance Analysis of the B.A.T.M.A.N. Protocol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","cs.SE"],"primary_cat":"cs.LO","authors_text":"Ansgar Fehnker (University of Twente), Kaylash Chaudhary (University of the South Pacific), Vinay Mehta (University of the South Pacific)","submitted_at":"2017-03-20T02:47:32Z","abstract_excerpt":"This paper considers on a network routing protocol known as Better Approach to Mobile Ad hoc Networks (B.A.T.M.A.N.). The protocol serves two aims: first, to discover all bidirectional links, and second, to identify the best-next-hop for every other node in the network. A key element is that each node will flood the network at regular intervals with so-called originator messages.\n  This paper describes in detail a formalisation of the B.A.T.M.A.N. protocol. This exercise revealed several ambiguities and inconsistencies in the RFC. We developed two models. The first implements, if possible, a l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06570","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.06570","created_at":"2026-05-18T00:48:22.443433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.06570v1","created_at":"2026-05-18T00:48:22.443433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06570","created_at":"2026-05-18T00:48:22.443433+00:00"},{"alias_kind":"pith_short_12","alias_value":"N77TUAJLZ7FB","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"N77TUAJLZ7FBQB7Q","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"N77TUAJL","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI","json":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI.json","graph_json":"https://pith.science/api/pith-number/N77TUAJLZ7FBQB7QS4KIDY5ISI/graph.json","events_json":"https://pith.science/api/pith-number/N77TUAJLZ7FBQB7QS4KIDY5ISI/events.json","paper":"https://pith.science/paper/N77TUAJL"},"agent_actions":{"view_html":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI","download_json":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI.json","view_paper":"https://pith.science/paper/N77TUAJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.06570&json=true","fetch_graph":"https://pith.science/api/pith-number/N77TUAJLZ7FBQB7QS4KIDY5ISI/graph.json","fetch_events":"https://pith.science/api/pith-number/N77TUAJLZ7FBQB7QS4KIDY5ISI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI/action/storage_attestation","attest_author":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI/action/author_attestation","sign_citation":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI/action/citation_signature","submit_replication":"https://pith.science/pith/N77TUAJLZ7FBQB7QS4KIDY5ISI/action/replication_record"}},"created_at":"2026-05-18T00:48:22.443433+00:00","updated_at":"2026-05-18T00:48:22.443433+00:00"}