{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:DYIGJ6UX6XC3HVWW5RFZXZOIVT","short_pith_number":"pith:DYIGJ6UX","canonical_record":{"source":{"id":"1410.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-02T20:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"ec2c787ac6f04afb8937db68f2d26d6f06b5c53905a402dc365a4fbb20190516","abstract_canon_sha256":"8be9f0ce428cd9f80c0b4bf924a37cf2243e1615edb843da417f8e65dfbdc406"},"schema_version":"1.0"},"canonical_sha256":"1e1064fa97f5c5b3d6d6ec4b9be5c8acd6a7a45d088d23575fc7ffea01e6f9a1","source":{"kind":"arxiv","id":"1410.0706","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0706","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0706v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0706","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"DYIGJ6UX6XC3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DYIGJ6UX6XC3HVWW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DYIGJ6UX","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:DYIGJ6UX6XC3HVWW5RFZXZOIVT","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0706","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-02T20:41:41Z","cross_cats_sorted":[],"title_canon_sha256":"ec2c787ac6f04afb8937db68f2d26d6f06b5c53905a402dc365a4fbb20190516","abstract_canon_sha256":"8be9f0ce428cd9f80c0b4bf924a37cf2243e1615edb843da417f8e65dfbdc406"},"schema_version":"1.0"},"canonical_sha256":"1e1064fa97f5c5b3d6d6ec4b9be5c8acd6a7a45d088d23575fc7ffea01e6f9a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:09.820479Z","signature_b64":"+0osL4o3Co2aRjZ5d7Lq/hvh5zn4TGqtRKt555haToumZxiRGbdro3l+xn6JutI6REqLpaFmxfFXFHHmq465Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e1064fa97f5c5b3d6d6ec4b9be5c8acd6a7a45d088d23575fc7ffea01e6f9a1","last_reissued_at":"2026-05-18T02:41:09.820064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:09.820064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0706","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bcX+tzGfAdFZL0wwaiBcmh/glf4hIlzukjZkvkx4mN4MDD5CgRFwuVLr1oiAdapofSlV4mbDNpY2/RNG1CzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:27:26.248388Z"},"content_sha256":"1a834c8232253823c73cd647753bde069146545a08b3978ef7bc6ad172fa754f","schema_version":"1.0","event_id":"sha256:1a834c8232253823c73cd647753bde069146545a08b3978ef7bc6ad172fa754f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:DYIGJ6UX6XC3HVWW5RFZXZOIVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BRVST: Efficient and Content-Expressive Information Matching Overlay in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Xin Wang, Ying Li","submitted_at":"2014-10-02T20:41:41Z","abstract_excerpt":"Efficient and flexible information matching over wireless networks has become increasingly important and challenging with the popularity of smart devices and the growth of social-network-based applications. Some existing approaches designed for wired networks are not applicable to wireless networks, due to their overwhelming control overheads. In this paper, we propose a reliable and scalable binary range vector summary tree (BRVST) infrastructure for flexible information expression support, effective content matching and timely information dissemination over the dynamic wireless network. A no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0706","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-18T02:41:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSaraOca8VcidgagawHVGzONiRWTk+Ul0n/75PmkQDQSxo7wBqqUhKK/o5ceiZIA46oxGsVprVmLv7hrR/tLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T12:27:26.248734Z"},"content_sha256":"fbf81471c889ad84578a880ac136036995957cd90e8724c6b84203fbeedcffce","schema_version":"1.0","event_id":"sha256:fbf81471c889ad84578a880ac136036995957cd90e8724c6b84203fbeedcffce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/bundle.json","state_url":"https://pith.science/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/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-25T12:27:26Z","links":{"resolver":"https://pith.science/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT","bundle":"https://pith.science/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/bundle.json","state":"https://pith.science/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYIGJ6UX6XC3HVWW5RFZXZOIVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:DYIGJ6UX6XC3HVWW5RFZXZOIVT","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":"8be9f0ce428cd9f80c0b4bf924a37cf2243e1615edb843da417f8e65dfbdc406","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-02T20:41:41Z","title_canon_sha256":"ec2c787ac6f04afb8937db68f2d26d6f06b5c53905a402dc365a4fbb20190516"},"schema_version":"1.0","source":{"id":"1410.0706","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0706","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0706v1","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0706","created_at":"2026-05-18T02:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"DYIGJ6UX6XC3","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"DYIGJ6UX6XC3HVWW","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"DYIGJ6UX","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:fbf81471c889ad84578a880ac136036995957cd90e8724c6b84203fbeedcffce","target":"graph","created_at":"2026-05-18T02:41:09Z","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":"Efficient and flexible information matching over wireless networks has become increasingly important and challenging with the popularity of smart devices and the growth of social-network-based applications. Some existing approaches designed for wired networks are not applicable to wireless networks, due to their overwhelming control overheads. In this paper, we propose a reliable and scalable binary range vector summary tree (BRVST) infrastructure for flexible information expression support, effective content matching and timely information dissemination over the dynamic wireless network. A no","authors_text":"Xin Wang, Ying Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-02T20:41:41Z","title":"BRVST: Efficient and Content-Expressive Information Matching Overlay in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0706","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:1a834c8232253823c73cd647753bde069146545a08b3978ef7bc6ad172fa754f","target":"record","created_at":"2026-05-18T02:41:09Z","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":"8be9f0ce428cd9f80c0b4bf924a37cf2243e1615edb843da417f8e65dfbdc406","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-10-02T20:41:41Z","title_canon_sha256":"ec2c787ac6f04afb8937db68f2d26d6f06b5c53905a402dc365a4fbb20190516"},"schema_version":"1.0","source":{"id":"1410.0706","kind":"arxiv","version":1}},"canonical_sha256":"1e1064fa97f5c5b3d6d6ec4b9be5c8acd6a7a45d088d23575fc7ffea01e6f9a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e1064fa97f5c5b3d6d6ec4b9be5c8acd6a7a45d088d23575fc7ffea01e6f9a1","first_computed_at":"2026-05-18T02:41:09.820064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:09.820064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+0osL4o3Co2aRjZ5d7Lq/hvh5zn4TGqtRKt555haToumZxiRGbdro3l+xn6JutI6REqLpaFmxfFXFHHmq465Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:09.820479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0706","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a834c8232253823c73cd647753bde069146545a08b3978ef7bc6ad172fa754f","sha256:fbf81471c889ad84578a880ac136036995957cd90e8724c6b84203fbeedcffce"],"state_sha256":"a37afb509e85f8cfd29bd354150864a8734d28d353b6aad1ea5c81dc57b1d89c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z40n430yxNyqNpT8QLcR5bJTU1khQ8Xm6cLuEdUlu8aj8bAKSHaHq3lIkAl1CXZPKilX6MzbY0OLY+Jqu10bAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T12:27:26.250679Z","bundle_sha256":"4584a50418d45fa5f50ed83c3ac6f963c02c5813457726bb067a2b84046fef33"}}