{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:I44LZQE22GP7TK26I4XKGDHOQX","short_pith_number":"pith:I44LZQE2","canonical_record":{"source":{"id":"2305.05718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-05-09T19:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"e716c762808e679b94776d4a69be0b130005ea8aed730fc9f76f2411a33814cd","abstract_canon_sha256":"8f0e3491c732a03740753870dc34eb21b75ed7ef6538b9237d98c43c4eb055ab"},"schema_version":"1.0"},"canonical_sha256":"4738bcc09ad19ff9ab5e472ea30cee85f9c7dfd736501128376cccf30db73f78","source":{"kind":"arxiv","id":"2305.05718","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05718","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05718v1","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05718","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"I44LZQE22GP7","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"I44LZQE22GP7TK26","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"I44LZQE2","created_at":"2026-07-05T06:08:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:I44LZQE22GP7TK26I4XKGDHOQX","target":"record","payload":{"canonical_record":{"source":{"id":"2305.05718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-05-09T19:00:20Z","cross_cats_sorted":[],"title_canon_sha256":"e716c762808e679b94776d4a69be0b130005ea8aed730fc9f76f2411a33814cd","abstract_canon_sha256":"8f0e3491c732a03740753870dc34eb21b75ed7ef6538b9237d98c43c4eb055ab"},"schema_version":"1.0"},"canonical_sha256":"4738bcc09ad19ff9ab5e472ea30cee85f9c7dfd736501128376cccf30db73f78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:44.534834Z","signature_b64":"/Nhdaxc1V10SGLmiPBgxtsSF1DzO3LaAYKUkojL9Tyse7Qa3Qo4OY/qT/6FrlGzMtJjoBJqSfLjCHWZkQOv9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4738bcc09ad19ff9ab5e472ea30cee85f9c7dfd736501128376cccf30db73f78","last_reissued_at":"2026-07-05T06:08:44.534363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:44.534363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.05718","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-07-05T06:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrM/7oPRtojlpxUfapERHthwUrzzQSKp+RR1MYn4xMXcUFRdeZ7nM94iQ7Bmv/SFOWv9UYKvv7aoPTI3CDtfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:37:05.708791Z"},"content_sha256":"b4d7d0b7c916c31702ebd856d241f26692a0fa5e0ac47432c911f7e059dc1d6e","schema_version":"1.0","event_id":"sha256:b4d7d0b7c916c31702ebd856d241f26692a0fa5e0ac47432c911f7e059dc1d6e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:I44LZQE22GP7TK26I4XKGDHOQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"QF-Geo: Capacity Aware Geographic Routing using Bounded Regions of Wireless Meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Anish Arora, Kenneth W. Parker, Yung-Fu Chen","submitted_at":"2023-05-09T19:00:20Z","abstract_excerpt":"Routing in wireless meshes must detour around holes. Extant routing protocols often underperform in minimally connected networks where holes are larger and more frequent. Minimal density networks are common in practice due to deployment cost constraints, mobility dynamics, and/or adversarial jamming. Protocols that use global search to determine optimal paths incur search overhead that limits scaling. Conversely, protocols that use local search tend to find approximately optimal paths at higher densities due to the existence of geometrically direct routes but underperform as the connectivity l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.05718/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4tmoXmiXXB3l8hFzDVTJTmfW50+H9RY/WblY48l+QMW3SuhZ+qepIvQ3LDetUeZgPCXpzL1/CK5iL3Cb0fsiBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T01:37:05.709318Z"},"content_sha256":"be04b67002048f8e41fe0fa4bdc78ea396aa31b741fee9856c1845c0dfcc6668","schema_version":"1.0","event_id":"sha256:be04b67002048f8e41fe0fa4bdc78ea396aa31b741fee9856c1845c0dfcc6668"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I44LZQE22GP7TK26I4XKGDHOQX/bundle.json","state_url":"https://pith.science/pith/I44LZQE22GP7TK26I4XKGDHOQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I44LZQE22GP7TK26I4XKGDHOQX/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-08-10T01:37:05Z","links":{"resolver":"https://pith.science/pith/I44LZQE22GP7TK26I4XKGDHOQX","bundle":"https://pith.science/pith/I44LZQE22GP7TK26I4XKGDHOQX/bundle.json","state":"https://pith.science/pith/I44LZQE22GP7TK26I4XKGDHOQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I44LZQE22GP7TK26I4XKGDHOQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:I44LZQE22GP7TK26I4XKGDHOQX","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":"8f0e3491c732a03740753870dc34eb21b75ed7ef6538b9237d98c43c4eb055ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-05-09T19:00:20Z","title_canon_sha256":"e716c762808e679b94776d4a69be0b130005ea8aed730fc9f76f2411a33814cd"},"schema_version":"1.0","source":{"id":"2305.05718","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.05718","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"2305.05718v1","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.05718","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"I44LZQE22GP7","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_16","alias_value":"I44LZQE22GP7TK26","created_at":"2026-07-05T06:08:44Z"},{"alias_kind":"pith_short_8","alias_value":"I44LZQE2","created_at":"2026-07-05T06:08:44Z"}],"graph_snapshots":[{"event_id":"sha256:be04b67002048f8e41fe0fa4bdc78ea396aa31b741fee9856c1845c0dfcc6668","target":"graph","created_at":"2026-07-05T06:08:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.05718/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Routing in wireless meshes must detour around holes. Extant routing protocols often underperform in minimally connected networks where holes are larger and more frequent. Minimal density networks are common in practice due to deployment cost constraints, mobility dynamics, and/or adversarial jamming. Protocols that use global search to determine optimal paths incur search overhead that limits scaling. Conversely, protocols that use local search tend to find approximately optimal paths at higher densities due to the existence of geometrically direct routes but underperform as the connectivity l","authors_text":"Anish Arora, Kenneth W. Parker, Yung-Fu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-05-09T19:00:20Z","title":"QF-Geo: Capacity Aware Geographic Routing using Bounded Regions of Wireless Meshes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.05718","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:b4d7d0b7c916c31702ebd856d241f26692a0fa5e0ac47432c911f7e059dc1d6e","target":"record","created_at":"2026-07-05T06:08:44Z","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":"8f0e3491c732a03740753870dc34eb21b75ed7ef6538b9237d98c43c4eb055ab","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2023-05-09T19:00:20Z","title_canon_sha256":"e716c762808e679b94776d4a69be0b130005ea8aed730fc9f76f2411a33814cd"},"schema_version":"1.0","source":{"id":"2305.05718","kind":"arxiv","version":1}},"canonical_sha256":"4738bcc09ad19ff9ab5e472ea30cee85f9c7dfd736501128376cccf30db73f78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4738bcc09ad19ff9ab5e472ea30cee85f9c7dfd736501128376cccf30db73f78","first_computed_at":"2026-07-05T06:08:44.534363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:08:44.534363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/Nhdaxc1V10SGLmiPBgxtsSF1DzO3LaAYKUkojL9Tyse7Qa3Qo4OY/qT/6FrlGzMtJjoBJqSfLjCHWZkQOv9Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:08:44.534834Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.05718","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4d7d0b7c916c31702ebd856d241f26692a0fa5e0ac47432c911f7e059dc1d6e","sha256:be04b67002048f8e41fe0fa4bdc78ea396aa31b741fee9856c1845c0dfcc6668"],"state_sha256":"32eaada13b3ec338ec3ab6dbbe0508729c194b65709c92df1fff234ca35bb0e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oSzprOg6iUHvEMihzec21/ywAiO0me1zCeYOlmDWqRcrkwvJI6Jsr8w4z0bFpRT/mbHnFhGg7Sb0fd/XZddgAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T01:37:05.713849Z","bundle_sha256":"fdf59903e926e781334f231bac61256799a3a17f3315675452b99296a8a9cc40"}}