{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VTPHXK6ZMU4P2EJXPOPA4IH6QA","short_pith_number":"pith:VTPHXK6Z","schema_version":"1.0","canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","source":{"kind":"arxiv","id":"1211.3307","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Optimization of Generalized Least Squares Handover Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Carlo Fischione, Fortunato Santucci, George Athanasiou","submitted_at":"2012-11-14T14:04:40Z","abstract_excerpt":"Efficient handover algorithms are essential for highly performing mobile wireless communications. These algorithms depend on numerous parameters, whose settings must be appropriately optimized to offer a seamless connectivity. Nevertheless, such an optimization is difficult in a time varying context, unless adaptive strategies are used. In this paper, a new approach for the handover optimization is proposed. First, a new modeling of the handover process by a hybrid system that takes as input the handover parameters is established. Then, this hybrid system is used to pose some dynamical optimiz"},"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":"1211.3307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-14T14:04:40Z","cross_cats_sorted":[],"title_canon_sha256":"9bc7140c39413841673e0f8017b819298a108ad64c2f6be92b6c082f63e4f1cc","abstract_canon_sha256":"50608dc138c8338d108c5fc58d030d00da975a12e4963456e0bfb1619c6f9150"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:50.226052Z","signature_b64":"0TwGchC1ddsFEcZ4EgAqPURf7jia0UHrSHFTW9KSq9gFeWeR7Sq+2ckE3tStIz5B1LSTWlsE/G4Nx+X0KxxWBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","last_reissued_at":"2026-05-18T03:40:50.222096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:50.222096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Optimization of Generalized Least Squares Handover Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Carlo Fischione, Fortunato Santucci, George Athanasiou","submitted_at":"2012-11-14T14:04:40Z","abstract_excerpt":"Efficient handover algorithms are essential for highly performing mobile wireless communications. These algorithms depend on numerous parameters, whose settings must be appropriately optimized to offer a seamless connectivity. Nevertheless, such an optimization is difficult in a time varying context, unless adaptive strategies are used. In this paper, a new approach for the handover optimization is proposed. First, a new modeling of the handover process by a hybrid system that takes as input the handover parameters is established. Then, this hybrid system is used to pose some dynamical optimiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3307","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":"1211.3307","created_at":"2026-05-18T03:40:50.225353+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.3307v1","created_at":"2026-05-18T03:40:50.225353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3307","created_at":"2026-05-18T03:40:50.225353+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTPHXK6ZMU4P","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTPHXK6ZMU4P2EJX","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTPHXK6Z","created_at":"2026-05-18T12:27:25.539911+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/VTPHXK6ZMU4P2EJXPOPA4IH6QA","json":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA.json","graph_json":"https://pith.science/api/pith-number/VTPHXK6ZMU4P2EJXPOPA4IH6QA/graph.json","events_json":"https://pith.science/api/pith-number/VTPHXK6ZMU4P2EJXPOPA4IH6QA/events.json","paper":"https://pith.science/paper/VTPHXK6Z"},"agent_actions":{"view_html":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA","download_json":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA.json","view_paper":"https://pith.science/paper/VTPHXK6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.3307&json=true","fetch_graph":"https://pith.science/api/pith-number/VTPHXK6ZMU4P2EJXPOPA4IH6QA/graph.json","fetch_events":"https://pith.science/api/pith-number/VTPHXK6ZMU4P2EJXPOPA4IH6QA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/action/storage_attestation","attest_author":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/action/author_attestation","sign_citation":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/action/citation_signature","submit_replication":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/action/replication_record"}},"created_at":"2026-05-18T03:40:50.225353+00:00","updated_at":"2026-05-18T03:40:50.225353+00:00"}