{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FIBTGH77BYDPDGNG3TASVOQJOF","short_pith_number":"pith:FIBTGH77","schema_version":"1.0","canonical_sha256":"2a03331fff0e06f199a6dcc12aba097146e6537a7826737acd9fd4ad2a8bbf5c","source":{"kind":"arxiv","id":"2403.02253","version":2},"attestation_state":"computed","paper":{"title":"KnowPhish: Large Language Models Meet Multimodal Knowledge Graphs for Enhancing Reference-Based Phishing Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.CR","authors_text":"Bryan Hooi, Chengyu Huang, Hoon Wei Lim, Mei Lin Lock, Nay Oo, Shumin Deng, Tri Cao, Yuexin Li","submitted_at":"2024-03-04T17:38:32Z","abstract_excerpt":"Phishing attacks have inflicted substantial losses on individuals and businesses alike, necessitating the development of robust and efficient automated phishing detection approaches. Reference-based phishing detectors (RBPDs), which compare the logos on a target webpage to a known set of logos, have emerged as the state-of-the-art approach. However, a major limitation of existing RBPDs is that they rely on a manually constructed brand knowledge base, making it infeasible to scale to a large number of brands, which results in false negative errors due to the insufficient brand coverage of the k"},"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":"2403.02253","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2024-03-04T17:38:32Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"9bc58f72a9907c5c94852e645b52291875aaea22f0512ac63493180ea08bb652","abstract_canon_sha256":"978cc34045169c9c2243152d4ce7460255040739f290f45f32153811c9db32a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:48.158951Z","signature_b64":"V/Yh/sbxp8kBlbQ1FmuM5JyOOXCjY8wvJMZNE4jAGiTNsbbT7FveuuHoeg82nCRB6Yf9wYaYzT/ufX7DLkk0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a03331fff0e06f199a6dcc12aba097146e6537a7826737acd9fd4ad2a8bbf5c","last_reissued_at":"2026-07-05T09:35:48.158490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:48.158490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"KnowPhish: Large Language Models Meet Multimodal Knowledge Graphs for Enhancing Reference-Based Phishing Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.CR","authors_text":"Bryan Hooi, Chengyu Huang, Hoon Wei Lim, Mei Lin Lock, Nay Oo, Shumin Deng, Tri Cao, Yuexin Li","submitted_at":"2024-03-04T17:38:32Z","abstract_excerpt":"Phishing attacks have inflicted substantial losses on individuals and businesses alike, necessitating the development of robust and efficient automated phishing detection approaches. Reference-based phishing detectors (RBPDs), which compare the logos on a target webpage to a known set of logos, have emerged as the state-of-the-art approach. However, a major limitation of existing RBPDs is that they rely on a manually constructed brand knowledge base, making it infeasible to scale to a large number of brands, which results in false negative errors due to the insufficient brand coverage of the k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02253","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/2403.02253/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":"2403.02253","created_at":"2026-07-05T09:35:48.158548+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02253v2","created_at":"2026-07-05T09:35:48.158548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02253","created_at":"2026-07-05T09:35:48.158548+00:00"},{"alias_kind":"pith_short_12","alias_value":"FIBTGH77BYDP","created_at":"2026-07-05T09:35:48.158548+00:00"},{"alias_kind":"pith_short_16","alias_value":"FIBTGH77BYDPDGNG","created_at":"2026-07-05T09:35:48.158548+00:00"},{"alias_kind":"pith_short_8","alias_value":"FIBTGH77","created_at":"2026-07-05T09:35:48.158548+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.21353","citing_title":"Beyond Classification Accuracy: An Exploration-Range Evaluation of Adaptive Crawling for Fake Shopping Sites","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF","json":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF.json","graph_json":"https://pith.science/api/pith-number/FIBTGH77BYDPDGNG3TASVOQJOF/graph.json","events_json":"https://pith.science/api/pith-number/FIBTGH77BYDPDGNG3TASVOQJOF/events.json","paper":"https://pith.science/paper/FIBTGH77"},"agent_actions":{"view_html":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF","download_json":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF.json","view_paper":"https://pith.science/paper/FIBTGH77","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02253&json=true","fetch_graph":"https://pith.science/api/pith-number/FIBTGH77BYDPDGNG3TASVOQJOF/graph.json","fetch_events":"https://pith.science/api/pith-number/FIBTGH77BYDPDGNG3TASVOQJOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF/action/storage_attestation","attest_author":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF/action/author_attestation","sign_citation":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF/action/citation_signature","submit_replication":"https://pith.science/pith/FIBTGH77BYDPDGNG3TASVOQJOF/action/replication_record"}},"created_at":"2026-07-05T09:35:48.158548+00:00","updated_at":"2026-07-05T09:35:48.158548+00:00"}