{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VTPHXK6ZMU4P2EJXPOPA4IH6QA","short_pith_number":"pith:VTPHXK6Z","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"},"canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","source":{"kind":"arxiv","id":"1211.3307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3307","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3307v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3307","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"VTPHXK6ZMU4P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTPHXK6ZMU4P2EJX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTPHXK6Z","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VTPHXK6ZMU4P2EJXPOPA4IH6QA","target":"record","payload":{"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"},"canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","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"},"source_kind":"arxiv","source_id":"1211.3307","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-18T03:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPFvxgImPb+1zhYm/eyVUNfbX0wZmaPsT0KSRT+0Z0VkVxO1FUohCmmX9oL6R9u2Cp6MnUj4xUvw0BSb6+wVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:17:42.352768Z"},"content_sha256":"d1c770d6bc76495ed59392845ddaa741a60eab87f2b5ea97b7188e4a86fef35e","schema_version":"1.0","event_id":"sha256:d1c770d6bc76495ed59392845ddaa741a60eab87f2b5ea97b7188e4a86fef35e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VTPHXK6ZMU4P2EJXPOPA4IH6QA","target":"graph","payload":{"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"},"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-18T03:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qn9QKgVcbwFBfQP/CPOP8m4J4ZgtD+GVsVqNfpLqr/xaWA19AZbbtwVZ32BKx4OeT7WQqF30Qe3KsxME+vsXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:17:42.353110Z"},"content_sha256":"39fca3e3c896f9d4dff4f3d687a7c549869a19c758c1a1f849a9022bf82369c2","schema_version":"1.0","event_id":"sha256:39fca3e3c896f9d4dff4f3d687a7c549869a19c758c1a1f849a9022bf82369c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/bundle.json","state_url":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/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-08T13:17:42Z","links":{"resolver":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA","bundle":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/bundle.json","state":"https://pith.science/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VTPHXK6ZMU4P2EJXPOPA4IH6QA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VTPHXK6ZMU4P2EJXPOPA4IH6QA","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":"50608dc138c8338d108c5fc58d030d00da975a12e4963456e0bfb1619c6f9150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-14T14:04:40Z","title_canon_sha256":"9bc7140c39413841673e0f8017b819298a108ad64c2f6be92b6c082f63e4f1cc"},"schema_version":"1.0","source":{"id":"1211.3307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.3307","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1211.3307v1","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.3307","created_at":"2026-05-18T03:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"VTPHXK6ZMU4P","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VTPHXK6ZMU4P2EJX","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VTPHXK6Z","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:39fca3e3c896f9d4dff4f3d687a7c549869a19c758c1a1f849a9022bf82369c2","target":"graph","created_at":"2026-05-18T03:40:50Z","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":"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","authors_text":"Carlo Fischione, Fortunato Santucci, George Athanasiou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-14T14:04:40Z","title":"Dynamic Optimization of Generalized Least Squares Handover Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.3307","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:d1c770d6bc76495ed59392845ddaa741a60eab87f2b5ea97b7188e4a86fef35e","target":"record","created_at":"2026-05-18T03:40:50Z","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":"50608dc138c8338d108c5fc58d030d00da975a12e4963456e0bfb1619c6f9150","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-11-14T14:04:40Z","title_canon_sha256":"9bc7140c39413841673e0f8017b819298a108ad64c2f6be92b6c082f63e4f1cc"},"schema_version":"1.0","source":{"id":"1211.3307","kind":"arxiv","version":1}},"canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acde7babd96538fd11377b9e0e20fe8033a38e9355d8e8b1f0c25dc08e7f8989","first_computed_at":"2026-05-18T03:40:50.222096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:50.222096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0TwGchC1ddsFEcZ4EgAqPURf7jia0UHrSHFTW9KSq9gFeWeR7Sq+2ckE3tStIz5B1LSTWlsE/G4Nx+X0KxxWBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:50.226052Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.3307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1c770d6bc76495ed59392845ddaa741a60eab87f2b5ea97b7188e4a86fef35e","sha256:39fca3e3c896f9d4dff4f3d687a7c549869a19c758c1a1f849a9022bf82369c2"],"state_sha256":"17bb3dec9a2c79ad7c13c365a9d2f10360d5bc0194ac2024a5974620219d1c57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FkiZxDve3cJTp6z82eeuPLEOOXEw4rD1Lre0ZGqicZYgtm6wC+HFuCzb90Mr+zTboqdhOYZ3kNzJ8Qzc9IHrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:17:42.355250Z","bundle_sha256":"5e26209f4e7ea032f15d0ee6031f73209df7ab8abd479964d2b76f1727ab943b"}}