{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XBBUB5CIWDB2RIOTUEUWY4U4R2","short_pith_number":"pith:XBBUB5CI","canonical_record":{"source":{"id":"1805.01690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-04T09:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"7c78ffa88ec7d0b7a6cf6dc7be949496b0aa60ad75a60e50bcd4a09bfe05a1c9","abstract_canon_sha256":"de187e48cd0e59bd1291acfa413990ed8f492b242697ad3f854e50054c0960f7"},"schema_version":"1.0"},"canonical_sha256":"b84340f448b0c3a8a1d3a1296c729c8eb303e7c2b8e32012fdb11d21eaad5f9f","source":{"kind":"arxiv","id":"1805.01690","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01690","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01690v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01690","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"XBBUB5CIWDB2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBBUB5CIWDB2RIOT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBBUB5CI","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XBBUB5CIWDB2RIOTUEUWY4U4R2","target":"record","payload":{"canonical_record":{"source":{"id":"1805.01690","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-04T09:58:16Z","cross_cats_sorted":[],"title_canon_sha256":"7c78ffa88ec7d0b7a6cf6dc7be949496b0aa60ad75a60e50bcd4a09bfe05a1c9","abstract_canon_sha256":"de187e48cd0e59bd1291acfa413990ed8f492b242697ad3f854e50054c0960f7"},"schema_version":"1.0"},"canonical_sha256":"b84340f448b0c3a8a1d3a1296c729c8eb303e7c2b8e32012fdb11d21eaad5f9f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:47.049432Z","signature_b64":"NXM9SOWv04hvSTdbeXK0dnsuWKRMSrLyDrmL1Xf0C6HlBVSHWz8sAg0AOz3PAxm672EggKMYi0LdkE80Bv1eDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b84340f448b0c3a8a1d3a1296c729c8eb303e7c2b8e32012fdb11d21eaad5f9f","last_reissued_at":"2026-05-18T00:16:47.048736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:47.048736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.01690","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:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nz6YVUrxZMLv+9noTAAY3mCv+AyFYw7pOv2ElFa4luLIW++O5VteJjXYyO1H2WFZRsWdXzoaRA18fKt5uf35Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:53.860282Z"},"content_sha256":"5691b794cc7e8b6dd0207166007aa128f205c456551d7c313aa8ae92d0d90726","schema_version":"1.0","event_id":"sha256:5691b794cc7e8b6dd0207166007aa128f205c456551d7c313aa8ae92d0d90726"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XBBUB5CIWDB2RIOTUEUWY4U4R2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Distributed Routing Algorithm for Internet-wide Geocast","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernd Meijerink, Geert Heijenk, Mitra Baratchi","submitted_at":"2018-05-04T09:58:16Z","abstract_excerpt":"Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01690","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:16:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rrXx+KRz+9Z4tJ7IVq2Hm3J2v9HzHHex3eyzrpDNnR54Ihny8hjsTd9VXDXQoPrIkneZtWc8QybtB7E/L6zDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:04:53.860658Z"},"content_sha256":"798a0063e531686188fe8afbbbd930c9f2a4a8db947f8bb0bd329c72fa7d4fab","schema_version":"1.0","event_id":"sha256:798a0063e531686188fe8afbbbd930c9f2a4a8db947f8bb0bd329c72fa7d4fab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/bundle.json","state_url":"https://pith.science/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/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-21T23:04:53Z","links":{"resolver":"https://pith.science/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2","bundle":"https://pith.science/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/bundle.json","state":"https://pith.science/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBBUB5CIWDB2RIOTUEUWY4U4R2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XBBUB5CIWDB2RIOTUEUWY4U4R2","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":"de187e48cd0e59bd1291acfa413990ed8f492b242697ad3f854e50054c0960f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-04T09:58:16Z","title_canon_sha256":"7c78ffa88ec7d0b7a6cf6dc7be949496b0aa60ad75a60e50bcd4a09bfe05a1c9"},"schema_version":"1.0","source":{"id":"1805.01690","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.01690","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"arxiv_version","alias_value":"1805.01690v1","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01690","created_at":"2026-05-18T00:16:47Z"},{"alias_kind":"pith_short_12","alias_value":"XBBUB5CIWDB2","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBBUB5CIWDB2RIOT","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBBUB5CI","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:798a0063e531686188fe8afbbbd930c9f2a4a8db947f8bb0bd329c72fa7d4fab","target":"graph","created_at":"2026-05-18T00:16: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":"Geocast is the concept of sending data packets to nodes in a specified geographical area instead of nodes with a specific address. To route geocast messages to their destination we need a geographic routing algorithm that can route packets efficiently to the devices inside the destination area. Our goal is to design an algorithm that can deliver shortest path tree like forwarding while relying purely on distributed data without central knowledge. In this paper, we present two algorithms for geographic routing. One based purely on distance vector data, and one more complicated algorithm based o","authors_text":"Bernd Meijerink, Geert Heijenk, Mitra Baratchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-04T09:58:16Z","title":"A Distributed Routing Algorithm for Internet-wide Geocast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01690","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:5691b794cc7e8b6dd0207166007aa128f205c456551d7c313aa8ae92d0d90726","target":"record","created_at":"2026-05-18T00:16: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":"de187e48cd0e59bd1291acfa413990ed8f492b242697ad3f854e50054c0960f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-05-04T09:58:16Z","title_canon_sha256":"7c78ffa88ec7d0b7a6cf6dc7be949496b0aa60ad75a60e50bcd4a09bfe05a1c9"},"schema_version":"1.0","source":{"id":"1805.01690","kind":"arxiv","version":1}},"canonical_sha256":"b84340f448b0c3a8a1d3a1296c729c8eb303e7c2b8e32012fdb11d21eaad5f9f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b84340f448b0c3a8a1d3a1296c729c8eb303e7c2b8e32012fdb11d21eaad5f9f","first_computed_at":"2026-05-18T00:16:47.048736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:47.048736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NXM9SOWv04hvSTdbeXK0dnsuWKRMSrLyDrmL1Xf0C6HlBVSHWz8sAg0AOz3PAxm672EggKMYi0LdkE80Bv1eDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:47.049432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.01690","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5691b794cc7e8b6dd0207166007aa128f205c456551d7c313aa8ae92d0d90726","sha256:798a0063e531686188fe8afbbbd930c9f2a4a8db947f8bb0bd329c72fa7d4fab"],"state_sha256":"5913138f1de5b5ddf4790b0f9145e736dd8c2c0f7d67c9048b2498716c22b9e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDkd+uHH3vHideREK1uSXHuT/sRh5VDRLhRonY5iYXjLUIS11B0+I5EuH+RklFWLJHTWqh9gYvklnmGTy9PnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:04:53.862766Z","bundle_sha256":"ef74b60289ccf0346705adaf66819c99faa4f33e46f700c09e2f4e1562dc0f82"}}