{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DTK37KE3MLD275EJBCZYNNJEGU","short_pith_number":"pith:DTK37KE3","canonical_record":{"source":{"id":"1108.0904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-30T14:13:40Z","cross_cats_sorted":[],"title_canon_sha256":"e57889a327aec3730ccae2ae3408c5489c7a7b7d6044b390fc30248c79affda2","abstract_canon_sha256":"c974bdafe145236dd4ae4fb7b06f8f9a449bebfd9bcc402f17ba4f20f6a8a68b"},"schema_version":"1.0"},"canonical_sha256":"1cd5bfa89b62c7aff48908b386b5243514b0b06aa693bac036575dff16ac63d1","source":{"kind":"arxiv","id":"1108.0904","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0904","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0904v1","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0904","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"DTK37KE3MLD2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DTK37KE3MLD275EJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DTK37KE3","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DTK37KE3MLD275EJBCZYNNJEGU","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-30T14:13:40Z","cross_cats_sorted":[],"title_canon_sha256":"e57889a327aec3730ccae2ae3408c5489c7a7b7d6044b390fc30248c79affda2","abstract_canon_sha256":"c974bdafe145236dd4ae4fb7b06f8f9a449bebfd9bcc402f17ba4f20f6a8a68b"},"schema_version":"1.0"},"canonical_sha256":"1cd5bfa89b62c7aff48908b386b5243514b0b06aa693bac036575dff16ac63d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:21.823150Z","signature_b64":"kfyPSu/qnSuXhEszKQ0/gIQpniCOcxvp6VcbPNdXcuVPYYLE3Y2xHU3ix7aKc+Cb4zzu8kTeRn3wjhVYBpYhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cd5bfa89b62c7aff48908b386b5243514b0b06aa693bac036575dff16ac63d1","last_reissued_at":"2026-05-18T04:16:21.822646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:21.822646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0904","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-18T04:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RImQElxgjKnIdaKhphVLCRq2Q6W835uFHqmUR1Z5hcX3/JXOuOZ+Y49NVkTdyXsbvV0K0rmAjbVaVznUNNjRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:37:28.428747Z"},"content_sha256":"2143f7215c3a19d49992bd083c1fa0c98e41b33868db4ee5b98de5090b14c115","schema_version":"1.0","event_id":"sha256:2143f7215c3a19d49992bd083c1fa0c98e41b33868db4ee5b98de5090b14c115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DTK37KE3MLD275EJBCZYNNJEGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Base Station Placement: A Stochastic Method Using Interference Gradient In Downlink Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Alonso Silva, Jean-Marc Kelif, Salman Malik","submitted_at":"2011-07-30T14:13:40Z","abstract_excerpt":"In this paper, we study the optimal placement and optimal number of base stations added to an existing wireless data network through the interference gradient method. This proposed method considers a sub-region of the existing wireless data network, hereafter called region of interest. In this region, the provider wants to increase the network coverage and the users throughput. In this aim, the provider needs to determine the optimal number of base stations to be added and their optimal placement. The proposed approach is based on the Delaunay triangulation of the region of interest and the gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0904","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-18T04:16:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yP3zxy62GiYjE5pFXva8rrKjgMoS1dxF4BrErOxV3WJNmHYm7aTUtOT4XubMlRI5R2YX0Sl/k2XSAqxp71E3Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T20:37:28.429086Z"},"content_sha256":"932c82a9ef15e32ae7b08b7e5cc18c2f0a6f1fadcae456250efea564bac66e64","schema_version":"1.0","event_id":"sha256:932c82a9ef15e32ae7b08b7e5cc18c2f0a6f1fadcae456250efea564bac66e64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTK37KE3MLD275EJBCZYNNJEGU/bundle.json","state_url":"https://pith.science/pith/DTK37KE3MLD275EJBCZYNNJEGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTK37KE3MLD275EJBCZYNNJEGU/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-10T20:37:28Z","links":{"resolver":"https://pith.science/pith/DTK37KE3MLD275EJBCZYNNJEGU","bundle":"https://pith.science/pith/DTK37KE3MLD275EJBCZYNNJEGU/bundle.json","state":"https://pith.science/pith/DTK37KE3MLD275EJBCZYNNJEGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTK37KE3MLD275EJBCZYNNJEGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DTK37KE3MLD275EJBCZYNNJEGU","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":"c974bdafe145236dd4ae4fb7b06f8f9a449bebfd9bcc402f17ba4f20f6a8a68b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-30T14:13:40Z","title_canon_sha256":"e57889a327aec3730ccae2ae3408c5489c7a7b7d6044b390fc30248c79affda2"},"schema_version":"1.0","source":{"id":"1108.0904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0904","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0904v1","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0904","created_at":"2026-05-18T04:16:21Z"},{"alias_kind":"pith_short_12","alias_value":"DTK37KE3MLD2","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DTK37KE3MLD275EJ","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DTK37KE3","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:932c82a9ef15e32ae7b08b7e5cc18c2f0a6f1fadcae456250efea564bac66e64","target":"graph","created_at":"2026-05-18T04:16:21Z","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":"In this paper, we study the optimal placement and optimal number of base stations added to an existing wireless data network through the interference gradient method. This proposed method considers a sub-region of the existing wireless data network, hereafter called region of interest. In this region, the provider wants to increase the network coverage and the users throughput. In this aim, the provider needs to determine the optimal number of base stations to be added and their optimal placement. The proposed approach is based on the Delaunay triangulation of the region of interest and the gr","authors_text":"Alonso Silva, Jean-Marc Kelif, Salman Malik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-30T14:13:40Z","title":"Optimal Base Station Placement: A Stochastic Method Using Interference Gradient In Downlink Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0904","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:2143f7215c3a19d49992bd083c1fa0c98e41b33868db4ee5b98de5090b14c115","target":"record","created_at":"2026-05-18T04:16:21Z","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":"c974bdafe145236dd4ae4fb7b06f8f9a449bebfd9bcc402f17ba4f20f6a8a68b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2011-07-30T14:13:40Z","title_canon_sha256":"e57889a327aec3730ccae2ae3408c5489c7a7b7d6044b390fc30248c79affda2"},"schema_version":"1.0","source":{"id":"1108.0904","kind":"arxiv","version":1}},"canonical_sha256":"1cd5bfa89b62c7aff48908b386b5243514b0b06aa693bac036575dff16ac63d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cd5bfa89b62c7aff48908b386b5243514b0b06aa693bac036575dff16ac63d1","first_computed_at":"2026-05-18T04:16:21.822646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:16:21.822646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kfyPSu/qnSuXhEszKQ0/gIQpniCOcxvp6VcbPNdXcuVPYYLE3Y2xHU3ix7aKc+Cb4zzu8kTeRn3wjhVYBpYhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:16:21.823150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2143f7215c3a19d49992bd083c1fa0c98e41b33868db4ee5b98de5090b14c115","sha256:932c82a9ef15e32ae7b08b7e5cc18c2f0a6f1fadcae456250efea564bac66e64"],"state_sha256":"36b7af77d5459a41d142173061bad99b21dedf642918ad057392518b460b9531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PujgmcZHIndOSrBwdToWbInctMrRkM7ckw5Ydr4uLzK1qUDq+80HqdCoq3tyuFHPi94Y+ahm8VPRnPjv1bOkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T20:37:28.430968Z","bundle_sha256":"43643d189fbca42b947f4c44a0aade2ccea9644cacb780a6651c676581764928"}}