{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TCEPCVAJNIBDOI55TK3U62JHPD","short_pith_number":"pith:TCEPCVAJ","schema_version":"1.0","canonical_sha256":"9888f154096a023723bd9ab74f692778ce044c565659a08fd1a8a0298e848857","source":{"kind":"arxiv","id":"1506.06215","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.06215","created_at":"2026-05-18T01:41:45.817484+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06215v1","created_at":"2026-05-18T01:41:45.817484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06215","created_at":"2026-05-18T01:41:45.817484+00:00"},{"alias_kind":"pith_short_12","alias_value":"TCEPCVAJNIBD","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TCEPCVAJNIBDOI55","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TCEPCVAJ","created_at":"2026-05-18T12:29:42.218222+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/TCEPCVAJNIBDOI55TK3U62JHPD","json":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD.json","graph_json":"https://pith.science/api/pith-number/TCEPCVAJNIBDOI55TK3U62JHPD/graph.json","events_json":"https://pith.science/api/pith-number/TCEPCVAJNIBDOI55TK3U62JHPD/events.json","paper":"https://pith.science/paper/TCEPCVAJ"},"agent_actions":{"view_html":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD","download_json":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD.json","view_paper":"https://pith.science/paper/TCEPCVAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06215&json=true","fetch_graph":"https://pith.science/api/pith-number/TCEPCVAJNIBDOI55TK3U62JHPD/graph.json","fetch_events":"https://pith.science/api/pith-number/TCEPCVAJNIBDOI55TK3U62JHPD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/action/storage_attestation","attest_author":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/action/author_attestation","sign_citation":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/action/citation_signature","submit_replication":"https://pith.science/pith/TCEPCVAJNIBDOI55TK3U62JHPD/action/replication_record"}},"created_at":"2026-05-18T01:41:45.817484+00:00","updated_at":"2026-05-18T01:41:45.817484+00:00"}