{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PIRSZ7JH4ROYEL6LKVBGSMUFQU","short_pith_number":"pith:PIRSZ7JH","schema_version":"1.0","canonical_sha256":"7a232cfd27e45d822fcb5542693285851d382963c087e5184658ecd6452d8e50","source":{"kind":"arxiv","id":"2512.02449","version":2},"attestation_state":"computed","paper":{"title":"Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brendon McBain, Emanuele Viterbo, Yi Hong","submitted_at":"2025-12-02T06:14:34Z","abstract_excerpt":"Existing analyses of ergodic capacity in satellite mega-constellations often rely on restrictive serving time assumptions or become intractable under realistic handover strategies. This paper develops a framework for characterising the ergodic capacity of low-Earth-orbit (LEO) mega-constellation links under arbitrary handover strategies and serving times. The user--satellite link is modelled as shadowed-Rician fading, and a semi-stochastic satellite channel with persistence is introduced in which visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2512.02449","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-12-02T06:14:34Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"80e57adb2814f62d5ab7879ecdc9a76095a00039a13564a02d5f29675ccf2a32","abstract_canon_sha256":"eb735419fba57dea8f24f162edcec26248fa77dc537cb8ba29189f636f45366d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:32.887973Z","signature_b64":"inPwU6tNAtLZUzSjcYomEPMLsiQqI37DSVHtKePG8ROxTOMvtQoU9STGCiG72Ctl/76qsWWjn/SnHxasxtrdAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a232cfd27e45d822fcb5542693285851d382963c087e5184658ecd6452d8e50","last_reissued_at":"2026-05-18T03:09:32.887227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:32.887227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Brendon McBain, Emanuele Viterbo, Yi Hong","submitted_at":"2025-12-02T06:14:34Z","abstract_excerpt":"Existing analyses of ergodic capacity in satellite mega-constellations often rely on restrictive serving time assumptions or become intractable under realistic handover strategies. This paper develops a framework for characterising the ergodic capacity of low-Earth-orbit (LEO) mega-constellation links under arbitrary handover strategies and serving times. The user--satellite link is modelled as shadowed-Rician fading, and a semi-stochastic satellite channel with persistence is introduced in which visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The results show that a simpler strategy that maximises serving capacity closely approximates the optimum while performing best under SGP4-based orbit prediction and mega-constellation simulation.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover and the selected satellite is then propagated using circular orbit dynamics, yielding independent serving periods under uncoordinated decisions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A renewal-theoretic framework derives persistent ergodic capacity for LEO mega-constellations under finite serving times and arbitrary handovers, with optimal handover decisions obtained via a fractional program solved by Dinkelbach's algorithm.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a0e048b7cca5406968aedf5467f1feca5450c9dcb3521cc245ae2e85fc3bd013"},"source":{"id":"2512.02449","kind":"arxiv","version":2},"verdict":{"id":"26932df6-7280-4ca0-90b6-fe7d121f446e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-17T03:01:52.492643Z","strongest_claim":"The results show that a simpler strategy that maximises serving capacity closely approximates the optimum while performing best under SGP4-based orbit prediction and mega-constellation simulation.","one_line_summary":"A renewal-theoretic framework derives persistent ergodic capacity for LEO mega-constellations under finite serving times and arbitrary handovers, with optimal handover decisions obtained via a fractional program solved by Dinkelbach's algorithm.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The visible satellites are drawn from a non-homogeneous binomial point process (NBPP) at each handover and the selected satellite is then propagated using circular orbit dynamics, yielding independent serving periods under uncoordinated decisions.","pith_extraction_headline":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers."},"references":{"count":25,"sample":[{"doi":"","year":2024,"title":"Research on user access technologies in satellite communication networks,","work_id":"ddd4b61c-4ad3-4eba-8e5b-6471fb60bb43","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"Handover manage- ment in low Earth orbit (LEO) satellite networks,","work_id":"914bb105-d569-483e-a473-d1e4f5315b68","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Handover technique in LEO satellite networks: A review,","work_id":"9950661e-aa62-48b2-979a-b1a0e09ca798","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Handover schemes in satellite networks: state-of-the-art and future research directions,","work_id":"e41d48c0-6eaa-43a4-94aa-9964d6a54046","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"A technical compar- ison of three low Earth orbit satellite constellation systems to provide global broadband,","work_id":"4c9a7a5d-39f0-45db-a7e6-ae07ed05b821","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"fb28b02d095265e53a6d12c1fe56f2c9e9c6f4a432cff3f1503c76e4a80a79c5","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"07b01838c3556282c3378e319384bf77592b65dd2f05d85846cd59e30d62b10f"},"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":"2512.02449","created_at":"2026-05-18T03:09:32.887337+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.02449v2","created_at":"2026-05-18T03:09:32.887337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02449","created_at":"2026-05-18T03:09:32.887337+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIRSZ7JH4ROY","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIRSZ7JH4ROYEL6L","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIRSZ7JH","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU","json":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU.json","graph_json":"https://pith.science/api/pith-number/PIRSZ7JH4ROYEL6LKVBGSMUFQU/graph.json","events_json":"https://pith.science/api/pith-number/PIRSZ7JH4ROYEL6LKVBGSMUFQU/events.json","paper":"https://pith.science/paper/PIRSZ7JH"},"agent_actions":{"view_html":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU","download_json":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU.json","view_paper":"https://pith.science/paper/PIRSZ7JH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.02449&json=true","fetch_graph":"https://pith.science/api/pith-number/PIRSZ7JH4ROYEL6LKVBGSMUFQU/graph.json","fetch_events":"https://pith.science/api/pith-number/PIRSZ7JH4ROYEL6LKVBGSMUFQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU/action/storage_attestation","attest_author":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU/action/author_attestation","sign_citation":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU/action/citation_signature","submit_replication":"https://pith.science/pith/PIRSZ7JH4ROYEL6LKVBGSMUFQU/action/replication_record"}},"created_at":"2026-05-18T03:09:32.887337+00:00","updated_at":"2026-05-18T03:09:32.887337+00:00"}