{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CLSTHHNKJ6NPXNOBZTV557CFSH","short_pith_number":"pith:CLSTHHNK","canonical_record":{"source":{"id":"1502.00033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-30T22:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abb38a51ec518a3f11ea317be6edb5a5de303329f938770d0193eb7f64bf8e91","abstract_canon_sha256":"b4b872cc1207230464c679b50d78c9c720575a12a099925b550ad4d55113b1fa"},"schema_version":"1.0"},"canonical_sha256":"12e5339daa4f9afbb5c1ccebdefc4591f2dbd984ca4485c0a173344612ac61a5","source":{"kind":"arxiv","id":"1502.00033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00033","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00033v1","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00033","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"pith_short_12","alias_value":"CLSTHHNKJ6NP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLSTHHNKJ6NPXNOB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLSTHHNK","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CLSTHHNKJ6NPXNOBZTV557CFSH","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-30T22:18:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"abb38a51ec518a3f11ea317be6edb5a5de303329f938770d0193eb7f64bf8e91","abstract_canon_sha256":"b4b872cc1207230464c679b50d78c9c720575a12a099925b550ad4d55113b1fa"},"schema_version":"1.0"},"canonical_sha256":"12e5339daa4f9afbb5c1ccebdefc4591f2dbd984ca4485c0a173344612ac61a5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:56.838608Z","signature_b64":"Kv7dWj4b2RPDM6eomvLdNj8V31OqZJABkGb/e30uIc9U7LLRXzNTllh7rJ6+9B469Rtfecnm9fzARkFV93QKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e5339daa4f9afbb5c1ccebdefc4591f2dbd984ca4485c0a173344612ac61a5","last_reissued_at":"2026-05-18T01:33:56.838254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:56.838254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00033","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:33:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kIiWnavJ1dSKUBAuTKRjmBToM+5P0gMwDs+Kjmn9jdWaQ3/Mw0TcD8QNTW9JtUo+zqnCROMnXAw1VSRi9wEmBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:30.056884Z"},"content_sha256":"d048cae87985c5ccd7bf66bc38ea7a72a59ec7f4a77fd0f697be29a01e9c5f3b","schema_version":"1.0","event_id":"sha256:d048cae87985c5ccd7bf66bc38ea7a72a59ec7f4a77fd0f697be29a01e9c5f3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CLSTHHNKJ6NPXNOBZTV557CFSH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analyzing Interference from Static Cellular Cooperation using the Nearest Neighbour Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Anastasios Giovanidis, Laurent Decreusefond, Luis David Alvarez Corrales","submitted_at":"2015-01-30T22:18:04Z","abstract_excerpt":"The problem of base station cooperation has recently been set within the framework of Stochastic Geometry. Existing works consider that a user dynamically chooses the set of stations that cooperate for his/her service. However, this assumption often does not hold. Cooperation groups could be predefined and static, with nodes connected by fixed infrastructure. To analyse such a potential network, in this work we propose a grouping method based on proximity. It is a variation of the so called Nearest Neighbour Model. We restrict ourselves to the simplest case where only singles and pairs of base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00033","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:33:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nRGhI1yTMFiVgsBOb1CUwj4aG7ahNz47TJ3tlFWUYKBPUbbu3S6xlwsY7rd7hcEgMN7buVqGiWLaXeJdB84DCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:56:30.057229Z"},"content_sha256":"dcddd0f52530ff4caf54d9bc963047a2130640f2bccded4b7d08e77225f8f07b","schema_version":"1.0","event_id":"sha256:dcddd0f52530ff4caf54d9bc963047a2130640f2bccded4b7d08e77225f8f07b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/bundle.json","state_url":"https://pith.science/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/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:56:30Z","links":{"resolver":"https://pith.science/pith/CLSTHHNKJ6NPXNOBZTV557CFSH","bundle":"https://pith.science/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/bundle.json","state":"https://pith.science/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLSTHHNKJ6NPXNOBZTV557CFSH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CLSTHHNKJ6NPXNOBZTV557CFSH","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":"b4b872cc1207230464c679b50d78c9c720575a12a099925b550ad4d55113b1fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-30T22:18:04Z","title_canon_sha256":"abb38a51ec518a3f11ea317be6edb5a5de303329f938770d0193eb7f64bf8e91"},"schema_version":"1.0","source":{"id":"1502.00033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00033","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00033v1","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00033","created_at":"2026-05-18T01:33:56Z"},{"alias_kind":"pith_short_12","alias_value":"CLSTHHNKJ6NP","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"CLSTHHNKJ6NPXNOB","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"CLSTHHNK","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:dcddd0f52530ff4caf54d9bc963047a2130640f2bccded4b7d08e77225f8f07b","target":"graph","created_at":"2026-05-18T01:33:56Z","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":"The problem of base station cooperation has recently been set within the framework of Stochastic Geometry. Existing works consider that a user dynamically chooses the set of stations that cooperate for his/her service. However, this assumption often does not hold. Cooperation groups could be predefined and static, with nodes connected by fixed infrastructure. To analyse such a potential network, in this work we propose a grouping method based on proximity. It is a variation of the so called Nearest Neighbour Model. We restrict ourselves to the simplest case where only singles and pairs of base","authors_text":"Anastasios Giovanidis, Laurent Decreusefond, Luis David Alvarez Corrales","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-30T22:18:04Z","title":"Analyzing Interference from Static Cellular Cooperation using the Nearest Neighbour Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00033","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:d048cae87985c5ccd7bf66bc38ea7a72a59ec7f4a77fd0f697be29a01e9c5f3b","target":"record","created_at":"2026-05-18T01:33:56Z","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":"b4b872cc1207230464c679b50d78c9c720575a12a099925b550ad4d55113b1fa","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-01-30T22:18:04Z","title_canon_sha256":"abb38a51ec518a3f11ea317be6edb5a5de303329f938770d0193eb7f64bf8e91"},"schema_version":"1.0","source":{"id":"1502.00033","kind":"arxiv","version":1}},"canonical_sha256":"12e5339daa4f9afbb5c1ccebdefc4591f2dbd984ca4485c0a173344612ac61a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12e5339daa4f9afbb5c1ccebdefc4591f2dbd984ca4485c0a173344612ac61a5","first_computed_at":"2026-05-18T01:33:56.838254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:56.838254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kv7dWj4b2RPDM6eomvLdNj8V31OqZJABkGb/e30uIc9U7LLRXzNTllh7rJ6+9B469Rtfecnm9fzARkFV93QKBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:56.838608Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d048cae87985c5ccd7bf66bc38ea7a72a59ec7f4a77fd0f697be29a01e9c5f3b","sha256:dcddd0f52530ff4caf54d9bc963047a2130640f2bccded4b7d08e77225f8f07b"],"state_sha256":"b991cbcd82957bc9ebac0dcc1ef27cee16cb717e6b65a6998dafe27e4cf9b214"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+A0F8ZF30l16l3PBveyRxHxB/jk7/JRnYnYqOUX3qUZf/miNkQdN9yqcjXNGEB4+6Hr+HR+uSHiogyS24JtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:56:30.059220Z","bundle_sha256":"62e71bbd80c7bfe29d90db1246491b8f471c6862231d96d6a9b388411a831d60"}}