{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:PIRSZ7JH4ROYEL6LKVBGSMUFQU","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":"eb735419fba57dea8f24f162edcec26248fa77dc537cb8ba29189f636f45366d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-12-02T06:14:34Z","title_canon_sha256":"80e57adb2814f62d5ab7879ecdc9a76095a00039a13564a02d5f29675ccf2a32"},"schema_version":"1.0","source":{"id":"2512.02449","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2512.02449","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"arxiv_version","alias_value":"2512.02449v2","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.02449","created_at":"2026-05-18T03:09:32Z"},{"alias_kind":"pith_short_12","alias_value":"PIRSZ7JH4ROY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"PIRSZ7JH4ROYEL6L","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"PIRSZ7JH","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:626afdac9b2472900897e09cbbbf00a0616e99dd121e1f516aae6f6457e8af9d","target":"graph","created_at":"2026-05-18T03:09:32Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers."}],"snapshot_sha256":"a0e048b7cca5406968aedf5467f1feca5450c9dcb3521cc245ae2e85fc3bd013"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"07b01838c3556282c3378e319384bf77592b65dd2f05d85846cd59e30d62b10f"},"paper":{"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","authors_text":"Brendon McBain, Emanuele Viterbo, Yi Hong","cross_cats":["math.IT"],"headline":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-12-02T06:14:34Z","title":"Ergodic Capacity and Optimal Handover in Satellite Mega-Constellations under Finite Serving Times"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Research on user access technologies in satellite communication networks,","work_id":"ddd4b61c-4ad3-4eba-8e5b-6471fb60bb43","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Handover manage- ment in low Earth orbit (LEO) satellite networks,","work_id":"914bb105-d569-483e-a473-d1e4f5315b68","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Handover technique in LEO satellite networks: A review,","work_id":"9950661e-aa62-48b2-979a-b1a0e09ca798","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Handover schemes in satellite networks: state-of-the-art and future research directions,","work_id":"e41d48c0-6eaa-43a4-94aa-9964d6a54046","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"A technical compar- ison of three low Earth orbit satellite constellation systems to provide global broadband,","work_id":"4c9a7a5d-39f0-45db-a7e6-ae07ed05b821","year":2019}],"snapshot_sha256":"fb28b02d095265e53a6d12c1fe56f2c9e9c6f4a432cff3f1503c76e4a80a79c5"},"source":{"id":"2512.02449","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-17T03:01:52.492643Z","id":"26932df6-7280-4ca0-90b6-fe7d121f446e","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"A renewal-theoretic model derives ergodic capacity for LEO mega-constellations with finite serving times and optimal uncoordinated handovers.","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.","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."}},"verdict_id":"26932df6-7280-4ca0-90b6-fe7d121f446e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd621dd075003376161f07545822b8b75c1348b169cf15455b1ad56230abb81f","target":"record","created_at":"2026-05-18T03:09:32Z","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":"eb735419fba57dea8f24f162edcec26248fa77dc537cb8ba29189f636f45366d","cross_cats_sorted":["math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2025-12-02T06:14:34Z","title_canon_sha256":"80e57adb2814f62d5ab7879ecdc9a76095a00039a13564a02d5f29675ccf2a32"},"schema_version":"1.0","source":{"id":"2512.02449","kind":"arxiv","version":2}},"canonical_sha256":"7a232cfd27e45d822fcb5542693285851d382963c087e5184658ecd6452d8e50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a232cfd27e45d822fcb5542693285851d382963c087e5184658ecd6452d8e50","first_computed_at":"2026-05-18T03:09:32.887227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:32.887227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"inPwU6tNAtLZUzSjcYomEPMLsiQqI37DSVHtKePG8ROxTOMvtQoU9STGCiG72Ctl/76qsWWjn/SnHxasxtrdAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:32.887973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2512.02449","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd621dd075003376161f07545822b8b75c1348b169cf15455b1ad56230abb81f","sha256:626afdac9b2472900897e09cbbbf00a0616e99dd121e1f516aae6f6457e8af9d"],"state_sha256":"bead2e140dd1dea8189b915bb07bd98fde7e4d03c99a1bae8b9fac9573055479"}