{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:F3KIIOFVM2W3TPO7PEMH7ELQWY","short_pith_number":"pith:F3KIIOFV","schema_version":"1.0","canonical_sha256":"2ed48438b566adb9bddf79187f9170b61a2be0074c24f147badfa633ba3add6b","source":{"kind":"arxiv","id":"2405.12230","version":1},"attestation_state":"computed","paper":{"title":"Computing the Instantaneous Collision Probability between Satellites using Characteristic Function Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"astro-ph.IM","authors_text":"Jason Bernstein","submitted_at":"2024-05-10T14:14:51Z","abstract_excerpt":"The probability that two satellites overlap in space at a specified instant of time is called their instantaneous collision probability. Assuming Gaussian uncertainties and spherical satellites, this probability is the integral of a Gaussian distribution over a sphere. This paper shows how to compute the probability using an established numerical procedure called characteristic function inversion. The collision probability in the short-term encounter scenario is also evaluated with this approach, where the instant at which the probability is computed is the time of closest approach between the"},"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":"2405.12230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"astro-ph.IM","submitted_at":"2024-05-10T14:14:51Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"90a1467c11c8558c0d83b74ea7ca8e34d256db18ac7f2939c143e51f53241b29","abstract_canon_sha256":"0a4f9e8de31cb6f50bda8a0032fa9a802e29660562f638705fa0bf870e2b0d1a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:21:55.623280Z","signature_b64":"2lmmmPCR+0w5inzr0OLxunNEY6ohRS9Q0CMCR4MIhCP9m5Umz1WlAqVoyuz3dOXZKBeY57NidLrFCsAU8ZT/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ed48438b566adb9bddf79187f9170b61a2be0074c24f147badfa633ba3add6b","last_reissued_at":"2026-07-05T08:21:55.622779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:21:55.622779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Instantaneous Collision Probability between Satellites using Characteristic Function Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"astro-ph.IM","authors_text":"Jason Bernstein","submitted_at":"2024-05-10T14:14:51Z","abstract_excerpt":"The probability that two satellites overlap in space at a specified instant of time is called their instantaneous collision probability. Assuming Gaussian uncertainties and spherical satellites, this probability is the integral of a Gaussian distribution over a sphere. This paper shows how to compute the probability using an established numerical procedure called characteristic function inversion. The collision probability in the short-term encounter scenario is also evaluated with this approach, where the instant at which the probability is computed is the time of closest approach between the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12230","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/2405.12230/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":"2405.12230","created_at":"2026-07-05T08:21:55.622846+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12230v1","created_at":"2026-07-05T08:21:55.622846+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12230","created_at":"2026-07-05T08:21:55.622846+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3KIIOFVM2W3","created_at":"2026-07-05T08:21:55.622846+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3KIIOFVM2W3TPO7","created_at":"2026-07-05T08:21:55.622846+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3KIIOFV","created_at":"2026-07-05T08:21:55.622846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06124","citing_title":"P-Guide: Parameter-Efficient Prior Steering for Single-Pass CFG Inference","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY","json":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY.json","graph_json":"https://pith.science/api/pith-number/F3KIIOFVM2W3TPO7PEMH7ELQWY/graph.json","events_json":"https://pith.science/api/pith-number/F3KIIOFVM2W3TPO7PEMH7ELQWY/events.json","paper":"https://pith.science/paper/F3KIIOFV"},"agent_actions":{"view_html":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY","download_json":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY.json","view_paper":"https://pith.science/paper/F3KIIOFV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12230&json=true","fetch_graph":"https://pith.science/api/pith-number/F3KIIOFVM2W3TPO7PEMH7ELQWY/graph.json","fetch_events":"https://pith.science/api/pith-number/F3KIIOFVM2W3TPO7PEMH7ELQWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY/action/storage_attestation","attest_author":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY/action/author_attestation","sign_citation":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY/action/citation_signature","submit_replication":"https://pith.science/pith/F3KIIOFVM2W3TPO7PEMH7ELQWY/action/replication_record"}},"created_at":"2026-07-05T08:21:55.622846+00:00","updated_at":"2026-07-05T08:21:55.622846+00:00"}