{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EM6VK6FJRIWQBIKSZFU5F67ICV","short_pith_number":"pith:EM6VK6FJ","canonical_record":{"source":{"id":"1507.03754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T08:08:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25f013620dcd999c46f772464e4dbb9206f288bb8674eb5adeaa72d3acc6fd42","abstract_canon_sha256":"524184c03a10a8592ebba489bf53dc027ce9498a0011ebfc0b2a8e61ad6064d5"},"schema_version":"1.0"},"canonical_sha256":"233d5578a98a2d00a152c969d2fbe8156b82146c09e6b8f594be97db5c6dfcbe","source":{"kind":"arxiv","id":"1507.03754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03754","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03754v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03754","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"EM6VK6FJRIWQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EM6VK6FJRIWQBIKS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EM6VK6FJ","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EM6VK6FJRIWQBIKSZFU5F67ICV","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T08:08:22Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"25f013620dcd999c46f772464e4dbb9206f288bb8674eb5adeaa72d3acc6fd42","abstract_canon_sha256":"524184c03a10a8592ebba489bf53dc027ce9498a0011ebfc0b2a8e61ad6064d5"},"schema_version":"1.0"},"canonical_sha256":"233d5578a98a2d00a152c969d2fbe8156b82146c09e6b8f594be97db5c6dfcbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:57.416091Z","signature_b64":"t5osoYnji31Srf0US5Uvp8L6S/bjr2ltwE9VVYo0I2yKkZYIJJLe4QKkA9sYFR2GWaHNwbnpgOLLfI1iQLOPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233d5578a98a2d00a152c969d2fbe8156b82146c09e6b8f594be97db5c6dfcbe","last_reissued_at":"2026-05-18T01:36:57.415515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:57.415515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03754","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BD18x1D6geecQZ0G3GEliWriJyCxgYQwUSUMV5DTlZ4SmX2N3iDbySbS3OX/49aj1PxTpAAgb90uyNskE3acAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:16:58.502826Z"},"content_sha256":"7bc4f10381f99d65fb4a58a6b55951e07a32edb56cbb169adb05e0eaa2014ecf","schema_version":"1.0","event_id":"sha256:7bc4f10381f99d65fb4a58a6b55951e07a32edb56cbb169adb05e0eaa2014ecf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EM6VK6FJRIWQBIKSZFU5F67ICV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contention-based Geographic Forwarding Strategies for Wireless Sensors Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Carlos H.M. de Lima, Hirley Alves, Matti Latva-aho, Pedro H. J. Nardelli","submitted_at":"2015-07-14T08:08:22Z","abstract_excerpt":"This paper studies combined relay selection and opportunistic geographic routing strategies for autonomous wireless sensor networks where transmissions occur over multiple hops. The proposed solution is built upon three constituent parts: (i) relay selection algorithm, (ii) contention resolution mechanism, and (iii) geographic forwarding strategy. Using probability generating function and spatial point process as the theoretic background, we propose an auction-based algorithm for selecting the relay node that relies on the network topology as side-information. Our results show that geographic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03754","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-18T01:36:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Je7D+/nkVbtQVKqpbj88YIlsHIEDH/wCJFfuhh9biZyXJ9fdrFRkcpQ/d0BRn/MNOh0g3KAORBvhIEklATQsCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:16:58.503380Z"},"content_sha256":"555faad757bf6d6033a742400c6ef772346a265d0d802cd73044f7c698208cea","schema_version":"1.0","event_id":"sha256:555faad757bf6d6033a742400c6ef772346a265d0d802cd73044f7c698208cea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/bundle.json","state_url":"https://pith.science/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/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-08T23:16:58Z","links":{"resolver":"https://pith.science/pith/EM6VK6FJRIWQBIKSZFU5F67ICV","bundle":"https://pith.science/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/bundle.json","state":"https://pith.science/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EM6VK6FJRIWQBIKSZFU5F67ICV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EM6VK6FJRIWQBIKSZFU5F67ICV","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":"524184c03a10a8592ebba489bf53dc027ce9498a0011ebfc0b2a8e61ad6064d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T08:08:22Z","title_canon_sha256":"25f013620dcd999c46f772464e4dbb9206f288bb8674eb5adeaa72d3acc6fd42"},"schema_version":"1.0","source":{"id":"1507.03754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03754","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03754v1","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03754","created_at":"2026-05-18T01:36:57Z"},{"alias_kind":"pith_short_12","alias_value":"EM6VK6FJRIWQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EM6VK6FJRIWQBIKS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EM6VK6FJ","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:555faad757bf6d6033a742400c6ef772346a265d0d802cd73044f7c698208cea","target":"graph","created_at":"2026-05-18T01:36:57Z","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":"This paper studies combined relay selection and opportunistic geographic routing strategies for autonomous wireless sensor networks where transmissions occur over multiple hops. The proposed solution is built upon three constituent parts: (i) relay selection algorithm, (ii) contention resolution mechanism, and (iii) geographic forwarding strategy. Using probability generating function and spatial point process as the theoretic background, we propose an auction-based algorithm for selecting the relay node that relies on the network topology as side-information. Our results show that geographic ","authors_text":"Carlos H.M. de Lima, Hirley Alves, Matti Latva-aho, Pedro H. J. Nardelli","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T08:08:22Z","title":"Contention-based Geographic Forwarding Strategies for Wireless Sensors Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03754","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:7bc4f10381f99d65fb4a58a6b55951e07a32edb56cbb169adb05e0eaa2014ecf","target":"record","created_at":"2026-05-18T01:36:57Z","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":"524184c03a10a8592ebba489bf53dc027ce9498a0011ebfc0b2a8e61ad6064d5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-07-14T08:08:22Z","title_canon_sha256":"25f013620dcd999c46f772464e4dbb9206f288bb8674eb5adeaa72d3acc6fd42"},"schema_version":"1.0","source":{"id":"1507.03754","kind":"arxiv","version":1}},"canonical_sha256":"233d5578a98a2d00a152c969d2fbe8156b82146c09e6b8f594be97db5c6dfcbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"233d5578a98a2d00a152c969d2fbe8156b82146c09e6b8f594be97db5c6dfcbe","first_computed_at":"2026-05-18T01:36:57.415515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:57.415515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t5osoYnji31Srf0US5Uvp8L6S/bjr2ltwE9VVYo0I2yKkZYIJJLe4QKkA9sYFR2GWaHNwbnpgOLLfI1iQLOPBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:57.416091Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bc4f10381f99d65fb4a58a6b55951e07a32edb56cbb169adb05e0eaa2014ecf","sha256:555faad757bf6d6033a742400c6ef772346a265d0d802cd73044f7c698208cea"],"state_sha256":"083e49d2a2ce64ec82c826c64e1dd6fdf98f08c6d0bccb5bfbb27d1deab6dd63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BmNvkOlJXnFsznb6a0teflKIkJzXV0q5R3x13urwSLdLYrSuM2oNFGczDgG3oBoo40nHOBT1vnlfAMXEiMGgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:16:58.505924Z","bundle_sha256":"2066dd1f2f8b4af861aaff07cda38ac9c7c4ecce5b5e554e1748e7c96297c2f2"}}