{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7CMZFIB34PAH2NUR55YLZELG3L","short_pith_number":"pith:7CMZFIB3","schema_version":"1.0","canonical_sha256":"f89992a03be3c07d3691ef70bc9166daedee12ee71ea6d547ffc01e767631973","source":{"kind":"arxiv","id":"2409.01686","version":1},"attestation_state":"computed","paper":{"title":"Frequency-Spatial Entanglement Learning for Camouflaged Object Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chunyan Xu, Hanyu Xuan, Jian Yang, Lei Luo, Yanguang Sun","submitted_at":"2024-09-03T07:58:47Z","abstract_excerpt":"Camouflaged object detection has attracted a lot of attention in computer vision. The main challenge lies in the high degree of similarity between camouflaged objects and their surroundings in the spatial domain, making identification difficult. Existing methods attempt to reduce the impact of pixel similarity by maximizing the distinguishing ability of spatial features with complicated design, but often ignore the sensitivity and locality of features in the spatial domain, leading to sub-optimal results. In this paper, we propose a new approach to address this issue by jointly exploring the r"},"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":"2409.01686","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2024-09-03T07:58:47Z","cross_cats_sorted":[],"title_canon_sha256":"1d91fa25c7d0ad88f4ed4a4105b0ac8dac61bf63e2d6b92f8548dcec5207c6b0","abstract_canon_sha256":"7e6d00401065831124b7cc94001d06f4f84eebd0a3e913f22a9fe54e3f23dc29"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:02:32.800582Z","signature_b64":"sgGBFUZUZzBri9cbZponQJ7c5T0XbaF+Ncs5Fy5aYH67qeIri2zdWyfNrZskZvBPpVpxp8H4jh0ft6GtALaWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f89992a03be3c07d3691ef70bc9166daedee12ee71ea6d547ffc01e767631973","last_reissued_at":"2026-07-05T09:02:32.800103Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:02:32.800103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frequency-Spatial Entanglement Learning for Camouflaged Object Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chunyan Xu, Hanyu Xuan, Jian Yang, Lei Luo, Yanguang Sun","submitted_at":"2024-09-03T07:58:47Z","abstract_excerpt":"Camouflaged object detection has attracted a lot of attention in computer vision. The main challenge lies in the high degree of similarity between camouflaged objects and their surroundings in the spatial domain, making identification difficult. Existing methods attempt to reduce the impact of pixel similarity by maximizing the distinguishing ability of spatial features with complicated design, but often ignore the sensitivity and locality of features in the spatial domain, leading to sub-optimal results. In this paper, we propose a new approach to address this issue by jointly exploring the r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.01686","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/2409.01686/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":"2409.01686","created_at":"2026-07-05T09:02:32.800165+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.01686v1","created_at":"2026-07-05T09:02:32.800165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01686","created_at":"2026-07-05T09:02:32.800165+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CMZFIB34PAH","created_at":"2026-07-05T09:02:32.800165+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CMZFIB34PAH2NUR","created_at":"2026-07-05T09:02:32.800165+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CMZFIB3","created_at":"2026-07-05T09:02:32.800165+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.14755","citing_title":"ASGNet: Adaptive Spectrum Guidance Network for Automatic Polyp Segmentation","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L","json":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L.json","graph_json":"https://pith.science/api/pith-number/7CMZFIB34PAH2NUR55YLZELG3L/graph.json","events_json":"https://pith.science/api/pith-number/7CMZFIB34PAH2NUR55YLZELG3L/events.json","paper":"https://pith.science/paper/7CMZFIB3"},"agent_actions":{"view_html":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L","download_json":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L.json","view_paper":"https://pith.science/paper/7CMZFIB3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.01686&json=true","fetch_graph":"https://pith.science/api/pith-number/7CMZFIB34PAH2NUR55YLZELG3L/graph.json","fetch_events":"https://pith.science/api/pith-number/7CMZFIB34PAH2NUR55YLZELG3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L/action/storage_attestation","attest_author":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L/action/author_attestation","sign_citation":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L/action/citation_signature","submit_replication":"https://pith.science/pith/7CMZFIB34PAH2NUR55YLZELG3L/action/replication_record"}},"created_at":"2026-07-05T09:02:32.800165+00:00","updated_at":"2026-07-05T09:02:32.800165+00:00"}