{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:R3SQP4EQ6V4ZXNDHVZI22Z3ESE","short_pith_number":"pith:R3SQP4EQ","canonical_record":{"source":{"id":"1810.05453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-12T11:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"172a500db278b663c45d12b2f36f3f328334ac270afc33d27f5a30440fc7988c","abstract_canon_sha256":"e36f29ebfaac8f5876c662feb3402b7996b54acdf92180378a25c4878a614a80"},"schema_version":"1.0"},"canonical_sha256":"8ee507f090f5799bb467ae51ad67649138aa2c41db0b1c23309eaad4716180af","source":{"kind":"arxiv","id":"1810.05453","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05453","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05453v3","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05453","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"R3SQP4EQ6V4Z","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3SQP4EQ6V4ZXNDH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3SQP4EQ","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:R3SQP4EQ6V4ZXNDHVZI22Z3ESE","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05453","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-12T11:29:05Z","cross_cats_sorted":[],"title_canon_sha256":"172a500db278b663c45d12b2f36f3f328334ac270afc33d27f5a30440fc7988c","abstract_canon_sha256":"e36f29ebfaac8f5876c662feb3402b7996b54acdf92180378a25c4878a614a80"},"schema_version":"1.0"},"canonical_sha256":"8ee507f090f5799bb467ae51ad67649138aa2c41db0b1c23309eaad4716180af","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:55.317247Z","signature_b64":"lHQXDiU3hr+sUmQiRY0Ff9uNRAolQSsGzI7eLsf2+igMlbvPfuC/euDoVZdojqlmcZvTk4KutSnsgzmLXueCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee507f090f5799bb467ae51ad67649138aa2c41db0b1c23309eaad4716180af","last_reissued_at":"2026-05-17T23:48:55.316601Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:55.316601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05453","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-17T23:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V9YCT9TqFRxnfBLBhvwdRVFPDAluswWFrKiymHokpmG0H+hW2FA4y+R7JCVJ1c2uqT2KUyBXlxDGKh1ocZ4iCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:54:06.070613Z"},"content_sha256":"6fe918e6a7e508624dba9c50e61553e138539504386950c0e99c625a0a533ae8","schema_version":"1.0","event_id":"sha256:6fe918e6a7e508624dba9c50e61553e138539504386950c0e99c625a0a533ae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:R3SQP4EQ6V4ZXNDHVZI22Z3ESE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Scheideler, Christina Kolb, Jannik Castenow","submitted_at":"2018-10-12T11:29:05Z","abstract_excerpt":"In this work, we present a new approach for competitive geometric routing in wireless ad hoc networks. In general, it is well-known that any online routing strategy performs very poor in the worst case. The main difficulty are uncovered regions within the wireless ad hoc network, which we denote as radio holes. Complex shapes of radio holes, for example zig-zag-shapes, make local geometric routing even more difficult, i.e., forwarded messages in direction to the destination might get stuck in a dead end or are routed along very long detours, when there is no knowledge about the ad hoc network."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05453","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-17T23:48:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+mYufC6pLt3CDhtVwrkc/zl6RIpljQ6/kDhyDd4ewLc6J+AUIXVBEl2VArDcTiu+P/YQ0bE4TXGQUjSNPBaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:54:06.070962Z"},"content_sha256":"98970aeafa439b19afce315e373107ab25a56f8a189a0786af8c5ddd6df0e34b","schema_version":"1.0","event_id":"sha256:98970aeafa439b19afce315e373107ab25a56f8a189a0786af8c5ddd6df0e34b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/bundle.json","state_url":"https://pith.science/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/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-28T13:54:06Z","links":{"resolver":"https://pith.science/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE","bundle":"https://pith.science/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/bundle.json","state":"https://pith.science/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3SQP4EQ6V4ZXNDHVZI22Z3ESE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:R3SQP4EQ6V4ZXNDHVZI22Z3ESE","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":"e36f29ebfaac8f5876c662feb3402b7996b54acdf92180378a25c4878a614a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-12T11:29:05Z","title_canon_sha256":"172a500db278b663c45d12b2f36f3f328334ac270afc33d27f5a30440fc7988c"},"schema_version":"1.0","source":{"id":"1810.05453","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05453","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05453v3","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05453","created_at":"2026-05-17T23:48:55Z"},{"alias_kind":"pith_short_12","alias_value":"R3SQP4EQ6V4Z","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"R3SQP4EQ6V4ZXNDH","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"R3SQP4EQ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:98970aeafa439b19afce315e373107ab25a56f8a189a0786af8c5ddd6df0e34b","target":"graph","created_at":"2026-05-17T23:48:55Z","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":"In this work, we present a new approach for competitive geometric routing in wireless ad hoc networks. In general, it is well-known that any online routing strategy performs very poor in the worst case. The main difficulty are uncovered regions within the wireless ad hoc network, which we denote as radio holes. Complex shapes of radio holes, for example zig-zag-shapes, make local geometric routing even more difficult, i.e., forwarded messages in direction to the destination might get stuck in a dead end or are routed along very long detours, when there is no knowledge about the ad hoc network.","authors_text":"Christian Scheideler, Christina Kolb, Jannik Castenow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-12T11:29:05Z","title":"A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05453","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:6fe918e6a7e508624dba9c50e61553e138539504386950c0e99c625a0a533ae8","target":"record","created_at":"2026-05-17T23:48:55Z","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":"e36f29ebfaac8f5876c662feb3402b7996b54acdf92180378a25c4878a614a80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-12T11:29:05Z","title_canon_sha256":"172a500db278b663c45d12b2f36f3f328334ac270afc33d27f5a30440fc7988c"},"schema_version":"1.0","source":{"id":"1810.05453","kind":"arxiv","version":3}},"canonical_sha256":"8ee507f090f5799bb467ae51ad67649138aa2c41db0b1c23309eaad4716180af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ee507f090f5799bb467ae51ad67649138aa2c41db0b1c23309eaad4716180af","first_computed_at":"2026-05-17T23:48:55.316601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:55.316601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lHQXDiU3hr+sUmQiRY0Ff9uNRAolQSsGzI7eLsf2+igMlbvPfuC/euDoVZdojqlmcZvTk4KutSnsgzmLXueCAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:55.317247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05453","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fe918e6a7e508624dba9c50e61553e138539504386950c0e99c625a0a533ae8","sha256:98970aeafa439b19afce315e373107ab25a56f8a189a0786af8c5ddd6df0e34b"],"state_sha256":"cdfd817237bb64ee0b578e2f4bc70945fd110abe4e6dbf4fd323ad4fb3aa1590"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Nxp9/lNprryiXTTuetFy5Uj9/lL/iw+SRDuEG4FPsuNr+u7rhqHnBshBAg68anJwQRGD7hLQwhQ4cCWZRScCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:54:06.073086Z","bundle_sha256":"ac32775a843be2822c2903cdc8c6b6dd402747ebecc811fc1bcf55be85143ee7"}}