{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TCEPCVAJNIBDOI55TK3U62JHPD","short_pith_number":"pith:TCEPCVAJ","canonical_record":{"source":{"id":"1506.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-20T09:18:49Z","cross_cats_sorted":["cs.GT","cs.SY"],"title_canon_sha256":"e7acefcc68ce9f06c8683d7e7b1754e4cc012b64c95b79bb08c4eb88bd7e4d50","abstract_canon_sha256":"7190cbe81973e7d3dd43e3d8ebba4093c57ea2e3ed197c03e0824d9f7283a08c"},"schema_version":"1.0"},"canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","source":{"kind":"arxiv","id":"1506.06215","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06215","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06215v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06215","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"TCEPCVAJNIBD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCEPCVAJNIBDOI55","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCEPCVAJ","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TCEPCVAJNIBDOI55TK3U62JHPD","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06215","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-20T09:18:49Z","cross_cats_sorted":["cs.GT","cs.SY"],"title_canon_sha256":"e7acefcc68ce9f06c8683d7e7b1754e4cc012b64c95b79bb08c4eb88bd7e4d50","abstract_canon_sha256":"7190cbe81973e7d3dd43e3d8ebba4093c57ea2e3ed197c03e0824d9f7283a08c"},"schema_version":"1.0"},"canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:45.817968Z","signature_b64":"MRs4wa2vZszNU0AaM22IXqsc29O9SM6Bu3TBxlxGQh4NQK4UE5AeE044oYZ+CL15FINgzfQyXjIzFPGveJp9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","last_reissued_at":"2026-05-18T01:41:45.817406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:45.817406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06215","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:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4bmp0ESHBq45TBjLMRP4fGqcHj7OIQ7IoBMNw9eXIxAMw+pWRVOIxXDTHu97g730h5ixA1Q41lw/hlMx+/ZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:51:13.389013Z"},"content_sha256":"c62f51c9a54feb110ae90985c32a3b0e28032b9d23c8c644cccebacdab5bb27a","schema_version":"1.0","event_id":"sha256:c62f51c9a54feb110ae90985c32a3b0e28032b9d23c8c644cccebacdab5bb27a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TCEPCVAJNIBDOI55TK3U62JHPD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive Selection of Ephemeral Relays in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.SY"],"primary_cat":"cs.NI","authors_text":"Anurag Kumar, Eitan Altman, K.P. Naveen","submitted_at":"2015-06-20T09:18:49Z","abstract_excerpt":"We consider a setting in which two nodes (referred to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally become available (e.g., wake up from a sleep state). Each relay, when it arrives, offers a (possibly different) \"reward\" to each forwarder. Each forwarder's objective is to minimize a combination of the delay incurred in choosing a relay and the reward offered by the chosen relay. As an example, we develop the reward structure for the specific problem of geographical forwarding over a network of sleep-wake cycling relays.\n  We study two variants of the g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06215","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:41:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VpnmEaHqpp58T6zMh1cDIHWYYwKDC6BD/KcAorw8bTCrMpSCY91Wqpyy/WFrlesy/q3Aar5CO9/abKwFOzFTCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:51:13.389675Z"},"content_sha256":"bbf05a277b10f576fb90a9173e3d21168241090a4dff23002931f5aac6adff59","schema_version":"1.0","event_id":"sha256:bbf05a277b10f576fb90a9173e3d21168241090a4dff23002931f5aac6adff59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/bundle.json","state_url":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TCEPCVAJNIBDOI55TK3U62JHPD/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-05-27T00:51:13Z","links":{"resolver":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD","bundle":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/bundle.json","state":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TCEPCVAJNIBDOI55TK3U62JHPD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TCEPCVAJNIBDOI55TK3U62JHPD","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":"7190cbe81973e7d3dd43e3d8ebba4093c57ea2e3ed197c03e0824d9f7283a08c","cross_cats_sorted":["cs.GT","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-20T09:18:49Z","title_canon_sha256":"e7acefcc68ce9f06c8683d7e7b1754e4cc012b64c95b79bb08c4eb88bd7e4d50"},"schema_version":"1.0","source":{"id":"1506.06215","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06215","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06215v1","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06215","created_at":"2026-05-18T01:41:45Z"},{"alias_kind":"pith_short_12","alias_value":"TCEPCVAJNIBD","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TCEPCVAJNIBDOI55","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TCEPCVAJ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:bbf05a277b10f576fb90a9173e3d21168241090a4dff23002931f5aac6adff59","target":"graph","created_at":"2026-05-18T01:41:45Z","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":"We consider a setting in which two nodes (referred to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally become available (e.g., wake up from a sleep state). Each relay, when it arrives, offers a (possibly different) \"reward\" to each forwarder. Each forwarder's objective is to minimize a combination of the delay incurred in choosing a relay and the reward offered by the chosen relay. As an example, we develop the reward structure for the specific problem of geographical forwarding over a network of sleep-wake cycling relays.\n  We study two variants of the g","authors_text":"Anurag Kumar, Eitan Altman, K.P. Naveen","cross_cats":["cs.GT","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-20T09:18:49Z","title":"Competitive Selection of Ephemeral Relays in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06215","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:c62f51c9a54feb110ae90985c32a3b0e28032b9d23c8c644cccebacdab5bb27a","target":"record","created_at":"2026-05-18T01:41:45Z","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":"7190cbe81973e7d3dd43e3d8ebba4093c57ea2e3ed197c03e0824d9f7283a08c","cross_cats_sorted":["cs.GT","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2015-06-20T09:18:49Z","title_canon_sha256":"e7acefcc68ce9f06c8683d7e7b1754e4cc012b64c95b79bb08c4eb88bd7e4d50"},"schema_version":"1.0","source":{"id":"1506.06215","kind":"arxiv","version":1}},"canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","first_computed_at":"2026-05-18T01:41:45.817406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:45.817406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRs4wa2vZszNU0AaM22IXqsc29O9SM6Bu3TBxlxGQh4NQK4UE5AeE044oYZ+CL15FINgzfQyXjIzFPGveJp9AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:45.817968Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06215","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62f51c9a54feb110ae90985c32a3b0e28032b9d23c8c644cccebacdab5bb27a","sha256:bbf05a277b10f576fb90a9173e3d21168241090a4dff23002931f5aac6adff59"],"state_sha256":"721a7920e54d3d015add95936c7567d5892829603101208e8b01b70f20025315"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bW29JUjK2AmPRyDDMzLJY/q66SzkgjqlwrFQ5QYfxWr1A8fXO67vMkX8MOOuUNiLPkUL1dnn8aG8nsg0axqEAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:51:13.392543Z","bundle_sha256":"bc63caf585aa2a6ab7a551d004f84dd1e73fdc44f8d7a2bd6daf60d62a8720b0"}}