{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IKT6JX3PICF2FCVCUEOVOGINTL","short_pith_number":"pith:IKT6JX3P","schema_version":"1.0","canonical_sha256":"42a7e4df6f408ba28aa2a11d57190d9aeb5bc24b1949f177f9cfe8541cc9c089","source":{"kind":"arxiv","id":"2508.03391","version":1},"attestation_state":"computed","paper":{"title":"Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Gyeongrae Im, Seonjung Kim, Seunghyeon Jeon, Yo-Seb Jeon","submitted_at":"2025-08-05T12:41:53Z","abstract_excerpt":"Increasing demand for massive device connectivity in underserved regions drives the development of advanced low Earth orbit (LEO) satellite communication systems. Beam-hopping LEO systems without connection establishment provide a promising solution for achieving both demand-aware resource allocation and low access latency. This paper investigates beam-hopping pattern design for the grant-free random access systems to dynamically allocate satellite resources according to traffic demands across serving cells. We formulate a binary optimization problem that aims to maximize the minimum successfu"},"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":"2508.03391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2025-08-05T12:41:53Z","cross_cats_sorted":[],"title_canon_sha256":"a7faac660ab1439536225aedd81269d1b2458ce1c4c86839996c760f586d4397","abstract_canon_sha256":"72934b0264568983de521b7c09ba7e505afb6af32b8dc8dcbfc8eb2d33cef0b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:48:55.545208Z","signature_b64":"FUxliKLtfNZZOMwq1kACATGSwKyEcJRorFyVwilSBDD6K1iS5dauWaO65NaEWMA7A1qPVKemS23n7Jpm4qAzCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42a7e4df6f408ba28aa2a11d57190d9aeb5bc24b1949f177f9cfe8541cc9c089","last_reissued_at":"2026-07-05T11:48:55.544753Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:48:55.544753Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beam-Hopping Pattern Design for Grant-Free Random Access in LEO Satellite Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Gyeongrae Im, Seonjung Kim, Seunghyeon Jeon, Yo-Seb Jeon","submitted_at":"2025-08-05T12:41:53Z","abstract_excerpt":"Increasing demand for massive device connectivity in underserved regions drives the development of advanced low Earth orbit (LEO) satellite communication systems. Beam-hopping LEO systems without connection establishment provide a promising solution for achieving both demand-aware resource allocation and low access latency. This paper investigates beam-hopping pattern design for the grant-free random access systems to dynamically allocate satellite resources according to traffic demands across serving cells. We formulate a binary optimization problem that aims to maximize the minimum successfu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03391","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.03391/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.03391","created_at":"2026-07-05T11:48:55.544810+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.03391v1","created_at":"2026-07-05T11:48:55.544810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03391","created_at":"2026-07-05T11:48:55.544810+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKT6JX3PICF2","created_at":"2026-07-05T11:48:55.544810+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKT6JX3PICF2FCVC","created_at":"2026-07-05T11:48:55.544810+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKT6JX3P","created_at":"2026-07-05T11:48:55.544810+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22900","citing_title":"Radio Resource Allocation for Beam Hopping Scheduling in LEO Satellite Communications: A Spatio-Temporal Perspective","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL","json":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL.json","graph_json":"https://pith.science/api/pith-number/IKT6JX3PICF2FCVCUEOVOGINTL/graph.json","events_json":"https://pith.science/api/pith-number/IKT6JX3PICF2FCVCUEOVOGINTL/events.json","paper":"https://pith.science/paper/IKT6JX3P"},"agent_actions":{"view_html":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL","download_json":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL.json","view_paper":"https://pith.science/paper/IKT6JX3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.03391&json=true","fetch_graph":"https://pith.science/api/pith-number/IKT6JX3PICF2FCVCUEOVOGINTL/graph.json","fetch_events":"https://pith.science/api/pith-number/IKT6JX3PICF2FCVCUEOVOGINTL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL/action/storage_attestation","attest_author":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL/action/author_attestation","sign_citation":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL/action/citation_signature","submit_replication":"https://pith.science/pith/IKT6JX3PICF2FCVCUEOVOGINTL/action/replication_record"}},"created_at":"2026-07-05T11:48:55.544810+00:00","updated_at":"2026-07-05T11:48:55.544810+00:00"}