{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4YJFRPGUDPRCXUDOWZIXS7SPAT","short_pith_number":"pith:4YJFRPGU","canonical_record":{"source":{"id":"1611.02614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-08T17:18:38Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"e23a9d37f812851a94149782d78ce6ee8bd0512cab3aad7cc5417c79129bcc73","abstract_canon_sha256":"a19e7ee92055d16ee6af41b9fcc92ed90d919f3c9a4ab26c790476481b05c251"},"schema_version":"1.0"},"canonical_sha256":"e61258bcd41be22bd06eb651797e4f04cf2152416b089b3833b6990c3080b160","source":{"kind":"arxiv","id":"1611.02614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02614","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02614v1","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02614","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"4YJFRPGUDPRC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4YJFRPGUDPRCXUDO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4YJFRPGU","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4YJFRPGUDPRCXUDOWZIXS7SPAT","target":"record","payload":{"canonical_record":{"source":{"id":"1611.02614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-08T17:18:38Z","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"title_canon_sha256":"e23a9d37f812851a94149782d78ce6ee8bd0512cab3aad7cc5417c79129bcc73","abstract_canon_sha256":"a19e7ee92055d16ee6af41b9fcc92ed90d919f3c9a4ab26c790476481b05c251"},"schema_version":"1.0"},"canonical_sha256":"e61258bcd41be22bd06eb651797e4f04cf2152416b089b3833b6990c3080b160","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:51.482442Z","signature_b64":"DopmrhkrXXN+RchYvmJrB4gi0Ev4wy0Fp5lqGx0mP9zMuHBwe/9gGmTD7xeM1JLKIwYnusfmC+Y1UGda8PI5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e61258bcd41be22bd06eb651797e4f04cf2152416b089b3833b6990c3080b160","last_reissued_at":"2026-05-18T00:59:51.481756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:51.481756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.02614","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:59:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dn1nuQ99P+ihnOE0V/pOHFX1UZkBF+qBJOs2l2OBNzerUyf93GfNbkMXcv/8JUESRU0Av6T8m5sPf4Dh/7w5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:54:42.912671Z"},"content_sha256":"98f752ddc79ac6c8a7dea5de275777936a7cd9603e5a921888481f95a8b5fb2d","schema_version":"1.0","event_id":"sha256:98f752ddc79ac6c8a7dea5de275777936a7cd9603e5a921888481f95a8b5fb2d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4YJFRPGUDPRCXUDOWZIXS7SPAT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Static Cellular Cooperation between Mutually Nearest Neighboring Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR"],"primary_cat":"cs.NI","authors_text":"Anastasios Giovanidis, Laurent Decreusefond, Luis David Alvarez Corrales, Philippe Martins","submitted_at":"2016-11-08T17:18:38Z","abstract_excerpt":"Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical limitations. Instead, cooperation groups can be predefined and static, with nodes linked by fixed infrastructure. To analyze such a potential network, we propose a grouping method based on node proximity. With the Mutually Nearest Neighbour Relation, we allow the formation of singles and pairs of nodes. Given an initial topology for the stations, two new point proces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02614","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:59:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qyBdNlADkG+NhlDfcbU/1yACl1O1e2wKVmA1GiH2LQlR7UJVkspjxj6jSK4qbKzit9nkCY7E+YLQugq49EqqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:54:42.913030Z"},"content_sha256":"b34301e4a3d2747083ed12fa14b48b377c19165375767b34efad55275d2f594d","schema_version":"1.0","event_id":"sha256:b34301e4a3d2747083ed12fa14b48b377c19165375767b34efad55275d2f594d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/bundle.json","state_url":"https://pith.science/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/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-03T19:54:42Z","links":{"resolver":"https://pith.science/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT","bundle":"https://pith.science/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/bundle.json","state":"https://pith.science/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YJFRPGUDPRCXUDOWZIXS7SPAT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4YJFRPGUDPRCXUDOWZIXS7SPAT","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":"a19e7ee92055d16ee6af41b9fcc92ed90d919f3c9a4ab26c790476481b05c251","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-08T17:18:38Z","title_canon_sha256":"e23a9d37f812851a94149782d78ce6ee8bd0512cab3aad7cc5417c79129bcc73"},"schema_version":"1.0","source":{"id":"1611.02614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.02614","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"arxiv_version","alias_value":"1611.02614v1","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02614","created_at":"2026-05-18T00:59:51Z"},{"alias_kind":"pith_short_12","alias_value":"4YJFRPGUDPRC","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4YJFRPGUDPRCXUDO","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4YJFRPGU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:b34301e4a3d2747083ed12fa14b48b377c19165375767b34efad55275d2f594d","target":"graph","created_at":"2026-05-18T00:59:51Z","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":"Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical limitations. Instead, cooperation groups can be predefined and static, with nodes linked by fixed infrastructure. To analyze such a potential network, we propose a grouping method based on node proximity. With the Mutually Nearest Neighbour Relation, we allow the formation of singles and pairs of nodes. Given an initial topology for the stations, two new point proces","authors_text":"Anastasios Giovanidis, Laurent Decreusefond, Luis David Alvarez Corrales, Philippe Martins","cross_cats":["cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-08T17:18:38Z","title":"Analysis of Static Cellular Cooperation between Mutually Nearest Neighboring Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02614","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:98f752ddc79ac6c8a7dea5de275777936a7cd9603e5a921888481f95a8b5fb2d","target":"record","created_at":"2026-05-18T00:59:51Z","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":"a19e7ee92055d16ee6af41b9fcc92ed90d919f3c9a4ab26c790476481b05c251","cross_cats_sorted":["cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-11-08T17:18:38Z","title_canon_sha256":"e23a9d37f812851a94149782d78ce6ee8bd0512cab3aad7cc5417c79129bcc73"},"schema_version":"1.0","source":{"id":"1611.02614","kind":"arxiv","version":1}},"canonical_sha256":"e61258bcd41be22bd06eb651797e4f04cf2152416b089b3833b6990c3080b160","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e61258bcd41be22bd06eb651797e4f04cf2152416b089b3833b6990c3080b160","first_computed_at":"2026-05-18T00:59:51.481756Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:51.481756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DopmrhkrXXN+RchYvmJrB4gi0Ev4wy0Fp5lqGx0mP9zMuHBwe/9gGmTD7xeM1JLKIwYnusfmC+Y1UGda8PI5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:51.482442Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.02614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98f752ddc79ac6c8a7dea5de275777936a7cd9603e5a921888481f95a8b5fb2d","sha256:b34301e4a3d2747083ed12fa14b48b377c19165375767b34efad55275d2f594d"],"state_sha256":"90017d52e00383fed601cfdfbc749322f678370cbad0786eae3310122bbf7e16"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFk7ISj1G+kH0btyxyFnSD8WRBLiR/MCFJRkbLSLfV6TAUXSeLX8GVKsnchh6fx9qXH2KMsRHRL/8tWv0E0mDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:54:42.915180Z","bundle_sha256":"caff532d887ed92ce77e19930cd1eed92ac0eab1dcfcb5e67a1e07d7e9f47aa6"}}