{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:AVT4QON7GJKZJDQROMJWNV2JUT","short_pith_number":"pith:AVT4QON7","schema_version":"1.0","canonical_sha256":"0567c839bf3255948e11731366d749a4ef872da7ad6860b3bddd011a7918085a","source":{"kind":"arxiv","id":"2504.10931","version":1},"attestation_state":"computed","paper":{"title":"A Highly Efficient Cross-matching Scheme using Learned Index Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.IM","authors_text":"Baolong Zhang, Dongwei Fan, Hongbo Wei, Jun Wang, Phu-Minh Lam, Qi Ma, Xiazhao Zhang, Yongheng Wang, Yu Zhou","submitted_at":"2025-04-15T07:19:15Z","abstract_excerpt":"Spatial data fusion is a bottleneck when it meets the scale of 10 billion records. Cross-matching celestial catalogs is just one example of this. To challenge this, we present a framework that enables efficient cross-matching using Learned Index Structures. Our approach involves a data transformation method to map multi-dimensional data into easily learnable distributions, coupled with a novel search algorithm that leverages the advantages of model pairs, significantly enhancing the efficiency of nearest-neighbor search. In this study, we utilized celestial catalog data derived from astronomic"},"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":"2504.10931","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"astro-ph.IM","submitted_at":"2025-04-15T07:19:15Z","cross_cats_sorted":[],"title_canon_sha256":"aa9a6dc8bb399c0699bef82a415d1eaad991cc0aa25269d9d56b1b95b29542a3","abstract_canon_sha256":"484de0c25e3a03bda960332dffe11059a9e165480501cc38231392a11b474394"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:49:26.474967Z","signature_b64":"fXQnnoASY2WDaK1sJRhQ+Y/Glb/gyaXGSbPo6n1h0G76YZYfJN32i9b7/knyESABQ8iRpuyqoA8w+dUHmahxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0567c839bf3255948e11731366d749a4ef872da7ad6860b3bddd011a7918085a","last_reissued_at":"2026-07-05T10:49:26.474532Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:49:26.474532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Highly Efficient Cross-matching Scheme using Learned Index Structure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"astro-ph.IM","authors_text":"Baolong Zhang, Dongwei Fan, Hongbo Wei, Jun Wang, Phu-Minh Lam, Qi Ma, Xiazhao Zhang, Yongheng Wang, Yu Zhou","submitted_at":"2025-04-15T07:19:15Z","abstract_excerpt":"Spatial data fusion is a bottleneck when it meets the scale of 10 billion records. Cross-matching celestial catalogs is just one example of this. To challenge this, we present a framework that enables efficient cross-matching using Learned Index Structures. Our approach involves a data transformation method to map multi-dimensional data into easily learnable distributions, coupled with a novel search algorithm that leverages the advantages of model pairs, significantly enhancing the efficiency of nearest-neighbor search. In this study, we utilized celestial catalog data derived from astronomic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.10931","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/2504.10931/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":"2504.10931","created_at":"2026-07-05T10:49:26.474583+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.10931v1","created_at":"2026-07-05T10:49:26.474583+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.10931","created_at":"2026-07-05T10:49:26.474583+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVT4QON7GJKZ","created_at":"2026-07-05T10:49:26.474583+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVT4QON7GJKZJDQR","created_at":"2026-07-05T10:49:26.474583+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVT4QON7","created_at":"2026-07-05T10:49:26.474583+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00058","citing_title":"A Survey on Security with Quantum Computing","ref_index":92,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT","json":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT.json","graph_json":"https://pith.science/api/pith-number/AVT4QON7GJKZJDQROMJWNV2JUT/graph.json","events_json":"https://pith.science/api/pith-number/AVT4QON7GJKZJDQROMJWNV2JUT/events.json","paper":"https://pith.science/paper/AVT4QON7"},"agent_actions":{"view_html":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT","download_json":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT.json","view_paper":"https://pith.science/paper/AVT4QON7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.10931&json=true","fetch_graph":"https://pith.science/api/pith-number/AVT4QON7GJKZJDQROMJWNV2JUT/graph.json","fetch_events":"https://pith.science/api/pith-number/AVT4QON7GJKZJDQROMJWNV2JUT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT/action/storage_attestation","attest_author":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT/action/author_attestation","sign_citation":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT/action/citation_signature","submit_replication":"https://pith.science/pith/AVT4QON7GJKZJDQROMJWNV2JUT/action/replication_record"}},"created_at":"2026-07-05T10:49:26.474583+00:00","updated_at":"2026-07-05T10:49:26.474583+00:00"}