{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5DASOWZAVVSPCUVO76IU6JA6V5","short_pith_number":"pith:5DASOWZA","schema_version":"1.0","canonical_sha256":"e8c1275b20ad64f152aeff914f241eaf7f467d365e92576bfe373e9c3dd7cb13","source":{"kind":"arxiv","id":"1202.5528","version":1},"attestation_state":"computed","paper":{"title":"Hierarchical Resource Allocation in Femtocell Networks using Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Raviraj Adve, Sanam Sadr","submitted_at":"2012-02-24T19:03:31Z","abstract_excerpt":"This paper presents a hierarchical approach to resource allocation in open-access femtocell networks. The major challenge in femtocell networks is interference management which in our system, based on the Long Term Evolution (LTE) standard, translates to which user should be allocated which physical resource block (or fraction thereof) from which femtocell access point (FAP). The globally optimal solution requires integer programming and is mathematically intractable. We propose a hierarchical three-stage solution: first, the load of each FAP is estimated considering the number of users connec"},"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":"1202.5528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-24T19:03:31Z","cross_cats_sorted":["cs.NI","math.IT"],"title_canon_sha256":"82a523a2ebfa70d28b422e45ce01fcf62d22fb339d28daddc180f9a9fa7c9a98","abstract_canon_sha256":"e4352034a1e74c8b3c4fa2408d647b2eab70470fd7b649b1d5aa82f59f15f8c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:36.800980Z","signature_b64":"xdy9LkkuMnzU3fMh5cwRdX9e1j/cz2+HW6oLr5ZnuJlob5uB3SEp3pqBwEhrcBLerFQ/tZMrzpjFS5r6G/01DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c1275b20ad64f152aeff914f241eaf7f467d365e92576bfe373e9c3dd7cb13","last_reissued_at":"2026-05-18T04:01:36.799456Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:36.799456Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Resource Allocation in Femtocell Networks using Graph Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI","math.IT"],"primary_cat":"cs.IT","authors_text":"Raviraj Adve, Sanam Sadr","submitted_at":"2012-02-24T19:03:31Z","abstract_excerpt":"This paper presents a hierarchical approach to resource allocation in open-access femtocell networks. The major challenge in femtocell networks is interference management which in our system, based on the Long Term Evolution (LTE) standard, translates to which user should be allocated which physical resource block (or fraction thereof) from which femtocell access point (FAP). The globally optimal solution requires integer programming and is mathematically intractable. We propose a hierarchical three-stage solution: first, the load of each FAP is estimated considering the number of users connec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5528","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.5528","created_at":"2026-05-18T04:01:36.800234+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5528v1","created_at":"2026-05-18T04:01:36.800234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5528","created_at":"2026-05-18T04:01:36.800234+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DASOWZAVVSP","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DASOWZAVVSPCUVO","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DASOWZA","created_at":"2026-05-18T12:26:53.410803+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/5DASOWZAVVSPCUVO76IU6JA6V5","json":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5.json","graph_json":"https://pith.science/api/pith-number/5DASOWZAVVSPCUVO76IU6JA6V5/graph.json","events_json":"https://pith.science/api/pith-number/5DASOWZAVVSPCUVO76IU6JA6V5/events.json","paper":"https://pith.science/paper/5DASOWZA"},"agent_actions":{"view_html":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5","download_json":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5.json","view_paper":"https://pith.science/paper/5DASOWZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5528&json=true","fetch_graph":"https://pith.science/api/pith-number/5DASOWZAVVSPCUVO76IU6JA6V5/graph.json","fetch_events":"https://pith.science/api/pith-number/5DASOWZAVVSPCUVO76IU6JA6V5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5/action/storage_attestation","attest_author":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5/action/author_attestation","sign_citation":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5/action/citation_signature","submit_replication":"https://pith.science/pith/5DASOWZAVVSPCUVO76IU6JA6V5/action/replication_record"}},"created_at":"2026-05-18T04:01:36.800234+00:00","updated_at":"2026-05-18T04:01:36.800234+00:00"}