{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ALSQKIXWE2WNLGCP56PRWL7VVY","short_pith_number":"pith:ALSQKIXW","schema_version":"1.0","canonical_sha256":"02e50522f626acd5984fef9f1b2ff5ae1111df7c743ec417eb75afb8158296b8","source":{"kind":"arxiv","id":"2507.01564","version":2},"attestation_state":"computed","paper":{"title":"Multi Source COVID-19 Detection via Kernel-Density-based Slice Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Bo-Cheng Qiu, Chia-Ming Lee, Chih-Chung Hsu, Fang-Ying Lin, I-An Tsai, Jung-Tse Tsai, Ming-Han Sun, Ting-Yao Chen, Yu-Fan Lin","submitted_at":"2025-07-02T10:27:59Z","abstract_excerpt":"We present our solution for the Multi-Source COVID-19 Detection Challenge, which classifies chest CT scans from four distinct medical centers. To address multi-source variability, we employ the Spatial-Slice Feature Learning (SSFL) framework with Kernel-Density-based Slice Sampling (KDS). Our preprocessing pipeline combines lung region extraction, quality control, and adaptive slice sampling to select eight representative slices per scan. We compare EfficientNet and Swin Transformer architectures on the validation set. The EfficientNet model achieves an F1-score of 94.68%, compared to the Swin"},"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":"2507.01564","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.IV","submitted_at":"2025-07-02T10:27:59Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"74b7ba14c30aa848c995bedc3ec286d0e0f683e4743d09b0dcf8a9ec53d2d0f3","abstract_canon_sha256":"1cbfbaf65603c1f1304aba1b24d74c911e4c1457ead9e52ec4582d17a68d8051"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:35:57.502356Z","signature_b64":"Dm7k9muQHN0D+jfkMow0ur8oOcAwd5zr436eaJS3h2RLSXb7BEmRqyj7H8xmAdnLPuOjh82dJHDQpD9k5KQoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02e50522f626acd5984fef9f1b2ff5ae1111df7c743ec417eb75afb8158296b8","last_reissued_at":"2026-07-05T11:35:57.501819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:35:57.501819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi Source COVID-19 Detection via Kernel-Density-based Slice Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"eess.IV","authors_text":"Bo-Cheng Qiu, Chia-Ming Lee, Chih-Chung Hsu, Fang-Ying Lin, I-An Tsai, Jung-Tse Tsai, Ming-Han Sun, Ting-Yao Chen, Yu-Fan Lin","submitted_at":"2025-07-02T10:27:59Z","abstract_excerpt":"We present our solution for the Multi-Source COVID-19 Detection Challenge, which classifies chest CT scans from four distinct medical centers. To address multi-source variability, we employ the Spatial-Slice Feature Learning (SSFL) framework with Kernel-Density-based Slice Sampling (KDS). Our preprocessing pipeline combines lung region extraction, quality control, and adaptive slice sampling to select eight representative slices per scan. We compare EfficientNet and Swin Transformer architectures on the validation set. The EfficientNet model achieves an F1-score of 94.68%, compared to the Swin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.01564","kind":"arxiv","version":2},"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/2507.01564/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":"2507.01564","created_at":"2026-07-05T11:35:57.501878+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.01564v2","created_at":"2026-07-05T11:35:57.501878+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.01564","created_at":"2026-07-05T11:35:57.501878+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALSQKIXWE2WN","created_at":"2026-07-05T11:35:57.501878+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALSQKIXWE2WNLGCP","created_at":"2026-07-05T11:35:57.501878+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALSQKIXW","created_at":"2026-07-05T11:35:57.501878+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.15941","citing_title":"Towards Fair and Robust Volumetric CT Classification via KL-Regularised Group Distributionally Robust Optimisation","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY","json":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY.json","graph_json":"https://pith.science/api/pith-number/ALSQKIXWE2WNLGCP56PRWL7VVY/graph.json","events_json":"https://pith.science/api/pith-number/ALSQKIXWE2WNLGCP56PRWL7VVY/events.json","paper":"https://pith.science/paper/ALSQKIXW"},"agent_actions":{"view_html":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY","download_json":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY.json","view_paper":"https://pith.science/paper/ALSQKIXW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.01564&json=true","fetch_graph":"https://pith.science/api/pith-number/ALSQKIXWE2WNLGCP56PRWL7VVY/graph.json","fetch_events":"https://pith.science/api/pith-number/ALSQKIXWE2WNLGCP56PRWL7VVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY/action/storage_attestation","attest_author":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY/action/author_attestation","sign_citation":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY/action/citation_signature","submit_replication":"https://pith.science/pith/ALSQKIXWE2WNLGCP56PRWL7VVY/action/replication_record"}},"created_at":"2026-07-05T11:35:57.501878+00:00","updated_at":"2026-07-05T11:35:57.501878+00:00"}