{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7TJPWUOAI5BX5NHCL5UMV35LGU","short_pith_number":"pith:7TJPWUOA","schema_version":"1.0","canonical_sha256":"fcd2fb51c047437eb4e25f68caefab351d781268d369def449754abdc1faf9a3","source":{"kind":"arxiv","id":"2411.16990","version":1},"attestation_state":"computed","paper":{"title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Barry E. Mullins, Christopher B. Mayer, Christopher James Augeri, Gregory J. Brault, Rusty O. Baldwin","submitted_at":"2024-11-25T23:36:24Z","abstract_excerpt":"A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms. We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.16990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2024-11-25T23:36:24Z","cross_cats_sorted":["cs.DM","cs.DS","cs.NI","math.IT"],"title_canon_sha256":"3bccb9b15a647d207b4d809c006134bed04f07228542afbfbae3f66588f5dc07","abstract_canon_sha256":"513e274e7dacbfd94f247e91adbad193b37b3ebd6c9421e20b7c09b71920e866"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:25.654956Z","signature_b64":"v7sfckXWXwKPlExrgfgCuokIOKmPqiWzt242OHKqtMT7lPKf8qyR5Nk7wT4grXZEDyHt9zVnoBcbK5wUPdexAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcd2fb51c047437eb4e25f68caefab351d781268d369def449754abdc1faf9a3","last_reissued_at":"2026-07-05T09:40:25.654511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:25.654511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enabling Skip Graphs to Process K-Dimensional Range Queries in a Mobile Sensor Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Barry E. Mullins, Christopher B. Mayer, Christopher James Augeri, Gregory J. Brault, Rusty O. Baldwin","submitted_at":"2024-11-25T23:36:24Z","abstract_excerpt":"A skip graph is a resilient application-layer routing structure that supports range queries of distributed k-dimensional data. By sorting deterministic keys into groups based on locally computed random membership vectors, nodes in a standard skip graph can optimize range query performance in mobile networks such as unmanned aerial vehicle swarms. We propose a skip graph extension that inverts the key and membership vector roles and bases group membership on deterministic vectors derived from the z-ordering of k-dimensional data and sorting within groups is based on locally computed random keys"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16990","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/2411.16990/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.16990","created_at":"2026-07-05T09:40:25.654565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16990v1","created_at":"2026-07-05T09:40:25.654565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16990","created_at":"2026-07-05T09:40:25.654565+00:00"},{"alias_kind":"pith_short_12","alias_value":"7TJPWUOAI5BX","created_at":"2026-07-05T09:40:25.654565+00:00"},{"alias_kind":"pith_short_16","alias_value":"7TJPWUOAI5BX5NHC","created_at":"2026-07-05T09:40:25.654565+00:00"},{"alias_kind":"pith_short_8","alias_value":"7TJPWUOA","created_at":"2026-07-05T09:40:25.654565+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU","json":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU.json","graph_json":"https://pith.science/api/pith-number/7TJPWUOAI5BX5NHCL5UMV35LGU/graph.json","events_json":"https://pith.science/api/pith-number/7TJPWUOAI5BX5NHCL5UMV35LGU/events.json","paper":"https://pith.science/paper/7TJPWUOA"},"agent_actions":{"view_html":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU","download_json":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU.json","view_paper":"https://pith.science/paper/7TJPWUOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16990&json=true","fetch_graph":"https://pith.science/api/pith-number/7TJPWUOAI5BX5NHCL5UMV35LGU/graph.json","fetch_events":"https://pith.science/api/pith-number/7TJPWUOAI5BX5NHCL5UMV35LGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU/action/storage_attestation","attest_author":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU/action/author_attestation","sign_citation":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU/action/citation_signature","submit_replication":"https://pith.science/pith/7TJPWUOAI5BX5NHCL5UMV35LGU/action/replication_record"}},"created_at":"2026-07-05T09:40:25.654565+00:00","updated_at":"2026-07-05T09:40:25.654565+00:00"}