{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HHGKWRNJPXCEQ7IIRYMKZVAJAI","short_pith_number":"pith:HHGKWRNJ","schema_version":"1.0","canonical_sha256":"39ccab45a97dc4487d088e18acd40902309dbd81b5396450280f0fa92f27875f","source":{"kind":"arxiv","id":"2608.01649","version":1},"attestation_state":"computed","paper":{"title":"LLM-Driven Automated Reward Design for Reinforcement Learning-Based Routing in LEO Satellite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"and Carlos A. Astudillo, Nelson L. S. da Fonseca, Walter P. Casas","submitted_at":"2026-08-03T03:40:09Z","abstract_excerpt":"Routing in Low Earth Orbit (LEO) satellite networks is challenging due to highly dynamic topologies and spatio-temporal network conditions. Reinforcement Learning (RL) has emerged as a promising approach for adaptive routing; however, its performance critically depends on reward function design, which must balance objectives such as goodput and end-to-end delay. In practice, reward design remains a complex manual process requiring significant domain expertise and extensive trial-and-error. Recent works have explored Large Language Models (LLMs) for automated reward design, but their applicatio"},"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":"2608.01649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2026-08-03T03:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"cbf83b9167302d82d9e5049288d52c0e6bb736658e6ec312bff34f5aa5acd112","abstract_canon_sha256":"35a00f1bf4a1df8bbd252f9ae170b1db36fa043afa335db0a03a2e8ee3e7bda1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:06:20.074177Z","signature_b64":"A6C+lljaGpMeY0T79w2XEJv82Mgf3Qe875w8HTpPP/POKgN7ByF2C+hXPf3UjepUoDpy7++ejGDvOb36l/HNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39ccab45a97dc4487d088e18acd40902309dbd81b5396450280f0fa92f27875f","last_reissued_at":"2026-08-04T02:06:20.072627Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:06:20.072627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LLM-Driven Automated Reward Design for Reinforcement Learning-Based Routing in LEO Satellite Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"and Carlos A. Astudillo, Nelson L. S. da Fonseca, Walter P. Casas","submitted_at":"2026-08-03T03:40:09Z","abstract_excerpt":"Routing in Low Earth Orbit (LEO) satellite networks is challenging due to highly dynamic topologies and spatio-temporal network conditions. Reinforcement Learning (RL) has emerged as a promising approach for adaptive routing; however, its performance critically depends on reward function design, which must balance objectives such as goodput and end-to-end delay. In practice, reward design remains a complex manual process requiring significant domain expertise and extensive trial-and-error. Recent works have explored Large Language Models (LLMs) for automated reward design, but their applicatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.01649","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/2608.01649/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":"2608.01649","created_at":"2026-08-04T02:06:20.074118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.01649v1","created_at":"2026-08-04T02:06:20.074118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.01649","created_at":"2026-08-04T02:06:20.074118+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHGKWRNJPXCE","created_at":"2026-08-04T02:06:20.074118+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHGKWRNJPXCEQ7II","created_at":"2026-08-04T02:06:20.074118+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHGKWRNJ","created_at":"2026-08-04T02:06:20.074118+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/HHGKWRNJPXCEQ7IIRYMKZVAJAI","json":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI.json","graph_json":"https://pith.science/api/pith-number/HHGKWRNJPXCEQ7IIRYMKZVAJAI/graph.json","events_json":"https://pith.science/api/pith-number/HHGKWRNJPXCEQ7IIRYMKZVAJAI/events.json","paper":"https://pith.science/paper/HHGKWRNJ"},"agent_actions":{"view_html":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI","download_json":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI.json","view_paper":"https://pith.science/paper/HHGKWRNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.01649&json=true","fetch_graph":"https://pith.science/api/pith-number/HHGKWRNJPXCEQ7IIRYMKZVAJAI/graph.json","fetch_events":"https://pith.science/api/pith-number/HHGKWRNJPXCEQ7IIRYMKZVAJAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI/action/storage_attestation","attest_author":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI/action/author_attestation","sign_citation":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI/action/citation_signature","submit_replication":"https://pith.science/pith/HHGKWRNJPXCEQ7IIRYMKZVAJAI/action/replication_record"}},"created_at":"2026-08-04T02:06:20.074118+00:00","updated_at":"2026-08-04T02:06:20.074118+00:00"}