{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NLVLCI5FYBDP7CTG6SUNUIVSST","short_pith_number":"pith:NLVLCI5F","canonical_record":{"source":{"id":"1808.02144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-06T22:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"8bd4d32bf8e6df8798053f81fc17bd2188bbe6d0eba8743705b528e98a469694","abstract_canon_sha256":"a6afc9f2dcf5d9cf3f3d3febd16652a122e5dbc6464cc074a59d7d84a324752f"},"schema_version":"1.0"},"canonical_sha256":"6aeab123a5c046ff8a66f4a8da22b294c70776ed09ea2beecd866fb3ef566474","source":{"kind":"arxiv","id":"1808.02144","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02144","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02144v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02144","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"NLVLCI5FYBDP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLVLCI5FYBDP7CTG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLVLCI5F","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NLVLCI5FYBDP7CTG6SUNUIVSST","target":"record","payload":{"canonical_record":{"source":{"id":"1808.02144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-06T22:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"8bd4d32bf8e6df8798053f81fc17bd2188bbe6d0eba8743705b528e98a469694","abstract_canon_sha256":"a6afc9f2dcf5d9cf3f3d3febd16652a122e5dbc6464cc074a59d7d84a324752f"},"schema_version":"1.0"},"canonical_sha256":"6aeab123a5c046ff8a66f4a8da22b294c70776ed09ea2beecd866fb3ef566474","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:47.479690Z","signature_b64":"9gZWD/A6+8KXLfE4Sl+waSDWCiVLE/roe7yxJS6T1VYCASuuNX1IB32YXVINdCzdWglJQ5KMpW1MvCBHGiGdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6aeab123a5c046ff8a66f4a8da22b294c70776ed09ea2beecd866fb3ef566474","last_reissued_at":"2026-05-18T00:08:47.479115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:47.479115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.02144","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-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/OgVhaB7ENXcL0lQyHGaWO7oLGmIyer3Z6Z8IXW3D0KAZUfSjZ6+SjP+BryeZ/k/hogFExyJBghGkwRbjffAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:42:40.375033Z"},"content_sha256":"74ddb834588abb028566314281979d0fd4036d6be03e35d54de042de6fcc5957","schema_version":"1.0","event_id":"sha256:74ddb834588abb028566314281979d0fd4036d6be03e35d54de042de6fcc5957"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NLVLCI5FYBDP7CTG6SUNUIVSST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Routing in Wireless Networks with Interferences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Pawel Garncarek, Tomasz Jurdzinski, Vicent Cholvi","submitted_at":"2018-08-06T22:50:48Z","abstract_excerpt":"We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes of adversaries: balanced and unbalanced. We demonstrate that, for each routing algorithm and an unbalanced adversary, the algorithm is unstable against this adversary in some networks. We develop a routing algorithm that has bounded packet latency against each balanced adversary."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02144","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-18T00:08:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbAuVHV5cAkcfl9SG4i5yrp01jRo2zzHiUyT59u1Vr2TzGsgclIjeOeVpiqDhsb0+56Ofubuw7pt2liST7ujCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T13:42:40.375404Z"},"content_sha256":"3ef142dbd511278f1a89dc69407ef25c7eb90b3c9851d6473b526f5f6be54330","schema_version":"1.0","event_id":"sha256:3ef142dbd511278f1a89dc69407ef25c7eb90b3c9851d6473b526f5f6be54330"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/bundle.json","state_url":"https://pith.science/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/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-23T13:42:40Z","links":{"resolver":"https://pith.science/pith/NLVLCI5FYBDP7CTG6SUNUIVSST","bundle":"https://pith.science/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/bundle.json","state":"https://pith.science/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLVLCI5FYBDP7CTG6SUNUIVSST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NLVLCI5FYBDP7CTG6SUNUIVSST","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":"a6afc9f2dcf5d9cf3f3d3febd16652a122e5dbc6464cc074a59d7d84a324752f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-06T22:50:48Z","title_canon_sha256":"8bd4d32bf8e6df8798053f81fc17bd2188bbe6d0eba8743705b528e98a469694"},"schema_version":"1.0","source":{"id":"1808.02144","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02144","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02144v1","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02144","created_at":"2026-05-18T00:08:47Z"},{"alias_kind":"pith_short_12","alias_value":"NLVLCI5FYBDP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLVLCI5FYBDP7CTG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLVLCI5F","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:3ef142dbd511278f1a89dc69407ef25c7eb90b3c9851d6473b526f5f6be54330","target":"graph","created_at":"2026-05-18T00:08:47Z","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":"We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes of adversaries: balanced and unbalanced. We demonstrate that, for each routing algorithm and an unbalanced adversary, the algorithm is unstable against this adversary in some networks. We develop a routing algorithm that has bounded packet latency against each balanced adversary.","authors_text":"Bogdan S. Chlebus, Dariusz R. Kowalski, Pawel Garncarek, Tomasz Jurdzinski, Vicent Cholvi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-06T22:50:48Z","title":"Routing in Wireless Networks with Interferences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02144","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:74ddb834588abb028566314281979d0fd4036d6be03e35d54de042de6fcc5957","target":"record","created_at":"2026-05-18T00:08:47Z","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":"a6afc9f2dcf5d9cf3f3d3febd16652a122e5dbc6464cc074a59d7d84a324752f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-08-06T22:50:48Z","title_canon_sha256":"8bd4d32bf8e6df8798053f81fc17bd2188bbe6d0eba8743705b528e98a469694"},"schema_version":"1.0","source":{"id":"1808.02144","kind":"arxiv","version":1}},"canonical_sha256":"6aeab123a5c046ff8a66f4a8da22b294c70776ed09ea2beecd866fb3ef566474","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6aeab123a5c046ff8a66f4a8da22b294c70776ed09ea2beecd866fb3ef566474","first_computed_at":"2026-05-18T00:08:47.479115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:47.479115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9gZWD/A6+8KXLfE4Sl+waSDWCiVLE/roe7yxJS6T1VYCASuuNX1IB32YXVINdCzdWglJQ5KMpW1MvCBHGiGdCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:47.479690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02144","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ddb834588abb028566314281979d0fd4036d6be03e35d54de042de6fcc5957","sha256:3ef142dbd511278f1a89dc69407ef25c7eb90b3c9851d6473b526f5f6be54330"],"state_sha256":"27bda32f442a0d8daa0a730c9dca76a87d17db09716b9185fb3c433100855782"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJBROyI1BjWV5f6NQ5QUPbtNh5MzJ/NT9141Je+Ft+JBk/vH3DrjtUs69m8+F6uYME/1cguOxSluveqzoUqLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T13:42:40.377458Z","bundle_sha256":"41315f1fcf5accb7a7c11d0006ad559a8661a28db83a285800f2317185873697"}}