{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X7ZEPD72JSNHJ4ZZFGHIP7EHHD","short_pith_number":"pith:X7ZEPD72","schema_version":"1.0","canonical_sha256":"bff2478ffa4c9a74f339298e87fc8738da78056a2fbe026185d0bc528507891e","source":{"kind":"arxiv","id":"1708.07049","version":1},"attestation_state":"computed","paper":{"title":"Coverage characteristics of self-repelling random walks in mobile ad-hoc networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Masahiro Nakagawa, Vinod Kulathumani","submitted_at":"2017-08-23T15:26:53Z","abstract_excerpt":"A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed for two dimensional lattices and these walks have been shown to exhibit a remarkable uniformity with which they visit nodes in a graph. In this paper, we extend this analysis to self-repelling random walks on mobile networks in which the underlying graph itself is temporally evolving. Using network simulations in ns-3, we characterize the number of times each"},"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":"1708.07049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2017-08-23T15:26:53Z","cross_cats_sorted":[],"title_canon_sha256":"6f6ae74f8d4adf01e07272f8078cb4439a522bd4b5691af56956041652831c46","abstract_canon_sha256":"44d565200b0a9e21163e99e9ea647cc273f0c0b2ca1dc7b9875461a02860cb4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:48.520169Z","signature_b64":"dgSFoRqWmrF6U0Pi5nwDj1fHeJDzIrU6TmlFpoimGKxaHaL2qRY+MFHlBnMdE3PkfMPj+5J+OAVJ/LD3ZWf7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bff2478ffa4c9a74f339298e87fc8738da78056a2fbe026185d0bc528507891e","last_reissued_at":"2026-05-18T00:36:48.519724Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:48.519724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coverage characteristics of self-repelling random walks in mobile ad-hoc networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Masahiro Nakagawa, Vinod Kulathumani","submitted_at":"2017-08-23T15:26:53Z","abstract_excerpt":"A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed for two dimensional lattices and these walks have been shown to exhibit a remarkable uniformity with which they visit nodes in a graph. In this paper, we extend this analysis to self-repelling random walks on mobile networks in which the underlying graph itself is temporally evolving. Using network simulations in ns-3, we characterize the number of times each"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07049","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":"1708.07049","created_at":"2026-05-18T00:36:48.519792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07049v1","created_at":"2026-05-18T00:36:48.519792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07049","created_at":"2026-05-18T00:36:48.519792+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7ZEPD72JSNH","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7ZEPD72JSNHJ4ZZ","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7ZEPD72","created_at":"2026-05-18T12:31:53.515858+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/X7ZEPD72JSNHJ4ZZFGHIP7EHHD","json":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD.json","graph_json":"https://pith.science/api/pith-number/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/graph.json","events_json":"https://pith.science/api/pith-number/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/events.json","paper":"https://pith.science/paper/X7ZEPD72"},"agent_actions":{"view_html":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD","download_json":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD.json","view_paper":"https://pith.science/paper/X7ZEPD72","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07049&json=true","fetch_graph":"https://pith.science/api/pith-number/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/graph.json","fetch_events":"https://pith.science/api/pith-number/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/action/storage_attestation","attest_author":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/action/author_attestation","sign_citation":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/action/citation_signature","submit_replication":"https://pith.science/pith/X7ZEPD72JSNHJ4ZZFGHIP7EHHD/action/replication_record"}},"created_at":"2026-05-18T00:36:48.519792+00:00","updated_at":"2026-05-18T00:36:48.519792+00:00"}