{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WR6WW2V5GHI5QULRSHVWBLA4GI","short_pith_number":"pith:WR6WW2V5","canonical_record":{"source":{"id":"1409.7580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-26T14:11:03Z","cross_cats_sorted":["cs.AI","cs.NI"],"title_canon_sha256":"f01cb77a9acc6aec152067137707521c0ca6c63193d720e0648ea5cd73071f30","abstract_canon_sha256":"012ad6e7aa97c0c03d2a13f65b2e474cbda378fd1b3883c6c831b54b8bbb8e39"},"schema_version":"1.0"},"canonical_sha256":"b47d6b6abd31d1d8517191eb60ac1c320167706e0450a6fd66d0833f3827f0c5","source":{"kind":"arxiv","id":"1409.7580","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7580","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7580v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7580","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"WR6WW2V5GHI5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WR6WW2V5GHI5QULR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WR6WW2V5","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WR6WW2V5GHI5QULRSHVWBLA4GI","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7580","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-26T14:11:03Z","cross_cats_sorted":["cs.AI","cs.NI"],"title_canon_sha256":"f01cb77a9acc6aec152067137707521c0ca6c63193d720e0648ea5cd73071f30","abstract_canon_sha256":"012ad6e7aa97c0c03d2a13f65b2e474cbda378fd1b3883c6c831b54b8bbb8e39"},"schema_version":"1.0"},"canonical_sha256":"b47d6b6abd31d1d8517191eb60ac1c320167706e0450a6fd66d0833f3827f0c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:52.365381Z","signature_b64":"zDUwnRlf/GxquO+H1wy3nFfhd4FgHl9cc342mQVjkJ5sKKiCG2ANlYAM2VScAdl5pS1zEPsQJ0pzfoD2qz1hAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b47d6b6abd31d1d8517191eb60ac1c320167706e0450a6fd66d0833f3827f0c5","last_reissued_at":"2026-05-18T02:41:52.364905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:52.364905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7580","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9u9MZ2WSgAAKGKxMxSU6TOjwPmKzgYxhFmW2A9Tno5ECqWkSF7rlZ4md3tzNALVTuxFVv2osrkL807hxSqeIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:24.068352Z"},"content_sha256":"c109e3e47c032ea7862c2e6b4a74764e0719c7f751417ac2c7cc98f7960156b6","schema_version":"1.0","event_id":"sha256:c109e3e47c032ea7862c2e6b4a74764e0719c7f751417ac2c7cc98f7960156b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WR6WW2V5GHI5QULRSHVWBLA4GI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gradient-based Taxis Algorithms for Network Robotics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NI"],"primary_cat":"cs.RO","authors_text":"Christian Blum, Verena V. Hafner","submitted_at":"2014-09-26T14:11:03Z","abstract_excerpt":"Finding the physical location of a specific network node is a prototypical task for navigation inside a wireless network. In this paper, we consider in depth the implications of wireless communication as a measurement input of gradient-based taxis algorithms. We discuss how gradients can be measured and determine the errors of this estimation. We then introduce a gradient-based taxis algorithm as an example of a family of gradient-based, convergent algorithms and discuss its convergence in the context of network robotics. We also conduct an exemplary experiment to show how to overcome some of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7580","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-18T02:41:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hdB5wp701uqIkgGVFOTiHMxTK2qIeOPFUdiaQKDoB0ESjbbUyNP6Nhr77rs+CS4UT1drK/PwpSuW+ETmoazVDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:56:24.068707Z"},"content_sha256":"d51fd7bb1b4bfd44599fe1ad4fc79b88a6f8a0e59905aca8e0e7274c56f8775e","schema_version":"1.0","event_id":"sha256:d51fd7bb1b4bfd44599fe1ad4fc79b88a6f8a0e59905aca8e0e7274c56f8775e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/bundle.json","state_url":"https://pith.science/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/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-11T12:56:24Z","links":{"resolver":"https://pith.science/pith/WR6WW2V5GHI5QULRSHVWBLA4GI","bundle":"https://pith.science/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/bundle.json","state":"https://pith.science/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WR6WW2V5GHI5QULRSHVWBLA4GI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WR6WW2V5GHI5QULRSHVWBLA4GI","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":"012ad6e7aa97c0c03d2a13f65b2e474cbda378fd1b3883c6c831b54b8bbb8e39","cross_cats_sorted":["cs.AI","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-26T14:11:03Z","title_canon_sha256":"f01cb77a9acc6aec152067137707521c0ca6c63193d720e0648ea5cd73071f30"},"schema_version":"1.0","source":{"id":"1409.7580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7580","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7580v1","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7580","created_at":"2026-05-18T02:41:52Z"},{"alias_kind":"pith_short_12","alias_value":"WR6WW2V5GHI5","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WR6WW2V5GHI5QULR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WR6WW2V5","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:d51fd7bb1b4bfd44599fe1ad4fc79b88a6f8a0e59905aca8e0e7274c56f8775e","target":"graph","created_at":"2026-05-18T02:41:52Z","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":"Finding the physical location of a specific network node is a prototypical task for navigation inside a wireless network. In this paper, we consider in depth the implications of wireless communication as a measurement input of gradient-based taxis algorithms. We discuss how gradients can be measured and determine the errors of this estimation. We then introduce a gradient-based taxis algorithm as an example of a family of gradient-based, convergent algorithms and discuss its convergence in the context of network robotics. We also conduct an exemplary experiment to show how to overcome some of ","authors_text":"Christian Blum, Verena V. Hafner","cross_cats":["cs.AI","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-26T14:11:03Z","title":"Gradient-based Taxis Algorithms for Network Robotics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7580","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:c109e3e47c032ea7862c2e6b4a74764e0719c7f751417ac2c7cc98f7960156b6","target":"record","created_at":"2026-05-18T02:41:52Z","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":"012ad6e7aa97c0c03d2a13f65b2e474cbda378fd1b3883c6c831b54b8bbb8e39","cross_cats_sorted":["cs.AI","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2014-09-26T14:11:03Z","title_canon_sha256":"f01cb77a9acc6aec152067137707521c0ca6c63193d720e0648ea5cd73071f30"},"schema_version":"1.0","source":{"id":"1409.7580","kind":"arxiv","version":1}},"canonical_sha256":"b47d6b6abd31d1d8517191eb60ac1c320167706e0450a6fd66d0833f3827f0c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b47d6b6abd31d1d8517191eb60ac1c320167706e0450a6fd66d0833f3827f0c5","first_computed_at":"2026-05-18T02:41:52.364905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:52.364905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zDUwnRlf/GxquO+H1wy3nFfhd4FgHl9cc342mQVjkJ5sKKiCG2ANlYAM2VScAdl5pS1zEPsQJ0pzfoD2qz1hAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:52.365381Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c109e3e47c032ea7862c2e6b4a74764e0719c7f751417ac2c7cc98f7960156b6","sha256:d51fd7bb1b4bfd44599fe1ad4fc79b88a6f8a0e59905aca8e0e7274c56f8775e"],"state_sha256":"1dca87251b8de466af1cdff5581b2f3240e9aa9ce1cd6f5da6bf4575f87b1bf3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OfuzFKDFTygBEfoe78M2V/QKY/w0RJoE6QkhljVcnZGiG/uK/HltC3mdyA+aLFX/Jrkr4S2siRbVA1r0svmeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:56:24.071503Z","bundle_sha256":"1c18b4162fbecc14af4f7e9b818c517389eb054f96f9ffd8129a870970d0eade"}}