{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UMYCW4NFEHWVPPZWFMJMQKKPOF","short_pith_number":"pith:UMYCW4NF","canonical_record":{"source":{"id":"1611.09512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-29T07:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"535f6f46796466448fb557da4904f596166f76008b3e03464308e8924237d568","abstract_canon_sha256":"7aa8f7494e193f61cc52ac0efd63f263c857b266243764a1f3381e4e2da91818"},"schema_version":"1.0"},"canonical_sha256":"a3302b71a521ed57bf362b12c8294f7162cb45838e7e5cec8f8c961df307a599","source":{"kind":"arxiv","id":"1611.09512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09512","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09512v1","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09512","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"UMYCW4NFEHWV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMYCW4NFEHWVPPZW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMYCW4NF","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UMYCW4NFEHWVPPZWFMJMQKKPOF","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-29T07:16:53Z","cross_cats_sorted":[],"title_canon_sha256":"535f6f46796466448fb557da4904f596166f76008b3e03464308e8924237d568","abstract_canon_sha256":"7aa8f7494e193f61cc52ac0efd63f263c857b266243764a1f3381e4e2da91818"},"schema_version":"1.0"},"canonical_sha256":"a3302b71a521ed57bf362b12c8294f7162cb45838e7e5cec8f8c961df307a599","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:18.235347Z","signature_b64":"ZEk1FLgTGKpc0MXgYOYh5FS2TY4467hYqSMOOfd7IZIW0MFwI1RmyTqa+WM6mbr+RIlaCweCPyfp09lZBpnbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3302b71a521ed57bf362b12c8294f7162cb45838e7e5cec8f8c961df307a599","last_reissued_at":"2026-05-18T00:56:18.234649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:18.234649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09512","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-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FXMTbIG3wsh0YNg5GVJ14Hs8gfWmMjD94xJ950SSfadiEeWM2FPnSV6GCLHW0Iv5QUfrIaSR776b8QvwOmW+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:50:05.411154Z"},"content_sha256":"a989b299e09f4477039b16571978e01528ab658389f4a12df9716cef49ca278d","schema_version":"1.0","event_id":"sha256:a989b299e09f4477039b16571978e01528ab658389f4a12df9716cef49ca278d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UMYCW4NFEHWVPPZWFMJMQKKPOF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fair Relay Selection Scheme for a DF Cooperative Network With Spatially Random Relays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Amirmasoud Rabiei, Masoumeh Sadeghi","submitted_at":"2016-11-29T07:16:53Z","abstract_excerpt":"A new, fair relay selection scheme is proposed for a dual-hop decode-and-forward network with randomly-distributed relays. Most of the reported works in the literature achieve fairness at the expense of degrading the outage probability performance. In addition, they often assume that the number and locations of the relays are known. In contrast, the proposed scheme achieves fairness in a random field of relays without deteriorating the outage probability performance. In this scheme, each relay maintains a countdown timer whose initial value is a function of the relay location and a tunable par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09512","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-18T00:56:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M/s3Cu8WYn/NuqJOgJaiIrsQ6WZRyWz3ioRe3mlNDPklkwVXDNGN8pJYjQgK5UweVSIowRWR4U4se8458FxdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T05:50:05.411537Z"},"content_sha256":"dc25394e576ff03045489f698fd590c439f4a9a9a5da882a443a2e1b244610e5","schema_version":"1.0","event_id":"sha256:dc25394e576ff03045489f698fd590c439f4a9a9a5da882a443a2e1b244610e5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/bundle.json","state_url":"https://pith.science/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/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-01T05:50:05Z","links":{"resolver":"https://pith.science/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF","bundle":"https://pith.science/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/bundle.json","state":"https://pith.science/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMYCW4NFEHWVPPZWFMJMQKKPOF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UMYCW4NFEHWVPPZWFMJMQKKPOF","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":"7aa8f7494e193f61cc52ac0efd63f263c857b266243764a1f3381e4e2da91818","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-29T07:16:53Z","title_canon_sha256":"535f6f46796466448fb557da4904f596166f76008b3e03464308e8924237d568"},"schema_version":"1.0","source":{"id":"1611.09512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09512","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09512v1","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09512","created_at":"2026-05-18T00:56:18Z"},{"alias_kind":"pith_short_12","alias_value":"UMYCW4NFEHWV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UMYCW4NFEHWVPPZW","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UMYCW4NF","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:dc25394e576ff03045489f698fd590c439f4a9a9a5da882a443a2e1b244610e5","target":"graph","created_at":"2026-05-18T00:56:18Z","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":"A new, fair relay selection scheme is proposed for a dual-hop decode-and-forward network with randomly-distributed relays. Most of the reported works in the literature achieve fairness at the expense of degrading the outage probability performance. In addition, they often assume that the number and locations of the relays are known. In contrast, the proposed scheme achieves fairness in a random field of relays without deteriorating the outage probability performance. In this scheme, each relay maintains a countdown timer whose initial value is a function of the relay location and a tunable par","authors_text":"Amirmasoud Rabiei, Masoumeh Sadeghi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-29T07:16:53Z","title":"A Fair Relay Selection Scheme for a DF Cooperative Network With Spatially Random Relays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09512","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:a989b299e09f4477039b16571978e01528ab658389f4a12df9716cef49ca278d","target":"record","created_at":"2026-05-18T00:56:18Z","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":"7aa8f7494e193f61cc52ac0efd63f263c857b266243764a1f3381e4e2da91818","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-29T07:16:53Z","title_canon_sha256":"535f6f46796466448fb557da4904f596166f76008b3e03464308e8924237d568"},"schema_version":"1.0","source":{"id":"1611.09512","kind":"arxiv","version":1}},"canonical_sha256":"a3302b71a521ed57bf362b12c8294f7162cb45838e7e5cec8f8c961df307a599","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3302b71a521ed57bf362b12c8294f7162cb45838e7e5cec8f8c961df307a599","first_computed_at":"2026-05-18T00:56:18.234649Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:18.234649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZEk1FLgTGKpc0MXgYOYh5FS2TY4467hYqSMOOfd7IZIW0MFwI1RmyTqa+WM6mbr+RIlaCweCPyfp09lZBpnbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:18.235347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a989b299e09f4477039b16571978e01528ab658389f4a12df9716cef49ca278d","sha256:dc25394e576ff03045489f698fd590c439f4a9a9a5da882a443a2e1b244610e5"],"state_sha256":"2d312ad177dd4e42943e9b238f4dc5fc2a83f0c05272f63c356b73e2802f4493"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n+xK8DWWuos0XoFQCraKDpV44vfX7YdgqINm3dHo5ZKGJUir2cvx8yLvo0EM6KoYZM9IpsNSwVnQR1NhBujxAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T05:50:05.414261Z","bundle_sha256":"25a6a971639f33fdc14422945c5fe182affdd5182e1c0f3eb9453315d64611dd"}}