{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XJVIMYVC6375AO7PNTOZ6GNI5U","short_pith_number":"pith:XJVIMYVC","schema_version":"1.0","canonical_sha256":"ba6a8662a2f6ffd03bef6cdd9f19a8ed2ccc87ca4066cc71c2636491252ae729","source":{"kind":"arxiv","id":"2605.31543","version":1},"attestation_state":"computed","paper":{"title":"Orbital Networks in the Three-Body Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.EP","physics.space-ph"],"primary_cat":"math.DS","authors_text":"Abdullah Braik, Shane D. Ross","submitted_at":"2026-05-29T16:58:57Z","abstract_excerpt":"Orbital transfers in multi-body systems are often studied as isolated trajectory design problems, making it difficult to identify the larger transport structure connecting families of periodic orbits, including which families act as hubs, gateways, relays, or persistently difficult-to-access regions. This work introduces a reachable-set-based framework for constructing orbital networks in the circular restricted three-body problem. Finite-$\\Delta V$ and finite-time-of-flight reachable-set overlaps are used to infer accessibility relationships between representative periodic orbit families on a"},"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":"2605.31543","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2026-05-29T16:58:57Z","cross_cats_sorted":["astro-ph.EP","physics.space-ph"],"title_canon_sha256":"21f409aa81bf5365e7b88fd909dd9364abba7aef62f2d60d97a6d278766a807b","abstract_canon_sha256":"36e8e09278a7d82377a851ea03281995e8895877da7d29b30a8037ddfd3fd373"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T02:04:11.869137Z","signature_b64":"DuhebkoUxMvlXsnYsM5Q9pEiEbvdaIFafgVejweILU4b8wcxAaWWWIXftS0TyPHFuZYGKQUNuuWyx6GPjLbvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba6a8662a2f6ffd03bef6cdd9f19a8ed2ccc87ca4066cc71c2636491252ae729","last_reissued_at":"2026-06-01T02:04:11.868296Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T02:04:11.868296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orbital Networks in the Three-Body Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["astro-ph.EP","physics.space-ph"],"primary_cat":"math.DS","authors_text":"Abdullah Braik, Shane D. Ross","submitted_at":"2026-05-29T16:58:57Z","abstract_excerpt":"Orbital transfers in multi-body systems are often studied as isolated trajectory design problems, making it difficult to identify the larger transport structure connecting families of periodic orbits, including which families act as hubs, gateways, relays, or persistently difficult-to-access regions. This work introduces a reachable-set-based framework for constructing orbital networks in the circular restricted three-body problem. Finite-$\\Delta V$ and finite-time-of-flight reachable-set overlaps are used to infer accessibility relationships between representative periodic orbit families on a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.31543","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/2605.31543/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":"2605.31543","created_at":"2026-06-01T02:04:11.868445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.31543v1","created_at":"2026-06-01T02:04:11.868445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.31543","created_at":"2026-06-01T02:04:11.868445+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJVIMYVC6375","created_at":"2026-06-01T02:04:11.868445+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJVIMYVC6375AO7P","created_at":"2026-06-01T02:04:11.868445+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJVIMYVC","created_at":"2026-06-01T02:04:11.868445+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/XJVIMYVC6375AO7PNTOZ6GNI5U","json":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U.json","graph_json":"https://pith.science/api/pith-number/XJVIMYVC6375AO7PNTOZ6GNI5U/graph.json","events_json":"https://pith.science/api/pith-number/XJVIMYVC6375AO7PNTOZ6GNI5U/events.json","paper":"https://pith.science/paper/XJVIMYVC"},"agent_actions":{"view_html":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U","download_json":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U.json","view_paper":"https://pith.science/paper/XJVIMYVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.31543&json=true","fetch_graph":"https://pith.science/api/pith-number/XJVIMYVC6375AO7PNTOZ6GNI5U/graph.json","fetch_events":"https://pith.science/api/pith-number/XJVIMYVC6375AO7PNTOZ6GNI5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U/action/storage_attestation","attest_author":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U/action/author_attestation","sign_citation":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U/action/citation_signature","submit_replication":"https://pith.science/pith/XJVIMYVC6375AO7PNTOZ6GNI5U/action/replication_record"}},"created_at":"2026-06-01T02:04:11.868445+00:00","updated_at":"2026-06-01T02:04:11.868445+00:00"}