{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Z3EL2SOAFPBIX4RZDJKENMOOZ4","short_pith_number":"pith:Z3EL2SOA","schema_version":"1.0","canonical_sha256":"cec8bd49c02bc28bf2391a5446b1cecf27169bcb19dc2f5526778e8e74362124","source":{"kind":"arxiv","id":"1312.1664","version":4},"attestation_state":"computed","paper":{"title":"Simplicial Homology for Future Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ana\\\"is Vergne (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2013-12-05T20:02:21Z","abstract_excerpt":"Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies wh"},"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":"1312.1664","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-12-05T20:02:21Z","cross_cats_sorted":[],"title_canon_sha256":"b90f59ae3cbaa5b94c8de4e7f8565dd0e2e2900d49b79d06a52c1374b5978964","abstract_canon_sha256":"7bc1cec35921daaa90651780c3fc2d1b8a4892b981ac47befaeb126a60480700"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:42.613579Z","signature_b64":"xp82qaobmcIdfB+Ak/L4qRXKlQP37CGp65YHVjqyrA9ju+OW3ARKgvwpdJwcq64kD5MRwJg+MZY5FtiqCVuCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec8bd49c02bc28bf2391a5446b1cecf27169bcb19dc2f5526778e8e74362124","last_reissued_at":"2026-05-18T00:09:42.612821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:42.612821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplicial Homology for Future Cellular Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ana\\\"is Vergne (INRIA Sophia Antipolis / INRIA Saclay - Ile de France), Laurent Decreusefond (LTCI), Philippe Martins (LTCI)","submitted_at":"2013-12-05T20:02:21Z","abstract_excerpt":"Simplicial homology is a tool that provides a mathematical way to compute the connectivity and the coverage of a cellular network without any node location information. In this article, we use simplicial homology in order to not only compute the topology of a cellular network, but also to discover the clusters of nodes still with no location information. We propose three algorithms for the management of future cellular networks. The first one is a frequency auto-planning algorithm for the self-configuration of future cellular networks. It aims at minimizing the number of planned frequencies wh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1664","kind":"arxiv","version":4},"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":"1312.1664","created_at":"2026-05-18T00:09:42.612946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1664v4","created_at":"2026-05-18T00:09:42.612946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1664","created_at":"2026-05-18T00:09:42.612946+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3EL2SOAFPBI","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3EL2SOAFPBIX4RZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3EL2SOA","created_at":"2026-05-18T12:28:09.283467+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/Z3EL2SOAFPBIX4RZDJKENMOOZ4","json":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4.json","graph_json":"https://pith.science/api/pith-number/Z3EL2SOAFPBIX4RZDJKENMOOZ4/graph.json","events_json":"https://pith.science/api/pith-number/Z3EL2SOAFPBIX4RZDJKENMOOZ4/events.json","paper":"https://pith.science/paper/Z3EL2SOA"},"agent_actions":{"view_html":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4","download_json":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4.json","view_paper":"https://pith.science/paper/Z3EL2SOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1664&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3EL2SOAFPBIX4RZDJKENMOOZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3EL2SOAFPBIX4RZDJKENMOOZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4/action/storage_attestation","attest_author":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4/action/author_attestation","sign_citation":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4/action/citation_signature","submit_replication":"https://pith.science/pith/Z3EL2SOAFPBIX4RZDJKENMOOZ4/action/replication_record"}},"created_at":"2026-05-18T00:09:42.612946+00:00","updated_at":"2026-05-18T00:09:42.612946+00:00"}