{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3JLJQVSTLTZRMAYWUSCGQYIOMA","short_pith_number":"pith:3JLJQVST","canonical_record":{"source":{"id":"2605.28524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-27T14:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"8630d141f38ed665cbfecc5134c16300cbb7519581b31e967400c11563a0d7a2","abstract_canon_sha256":"3179beba80edd0c42f3457e8a9e7332d34c7fc93e07c7671d0620e965f845cb1"},"schema_version":"1.0"},"canonical_sha256":"da569856535cf3160316a48468610e600b1479d793aaaa256bdada6c37daddd5","source":{"kind":"arxiv","id":"2605.28524","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28524","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28524v1","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28524","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JLJQVSTLTZR","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"3JLJQVSTLTZRMAYW","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"3JLJQVST","created_at":"2026-05-28T02:04:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3JLJQVSTLTZRMAYWUSCGQYIOMA","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28524","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-27T14:21:47Z","cross_cats_sorted":[],"title_canon_sha256":"8630d141f38ed665cbfecc5134c16300cbb7519581b31e967400c11563a0d7a2","abstract_canon_sha256":"3179beba80edd0c42f3457e8a9e7332d34c7fc93e07c7671d0620e965f845cb1"},"schema_version":"1.0"},"canonical_sha256":"da569856535cf3160316a48468610e600b1479d793aaaa256bdada6c37daddd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T02:04:55.393472Z","signature_b64":"AT+mF8cyoQyNiKQyfiYGCDHQjNypaYrRH7FbHmN07dNIGPEPAX7qAHKhmK8FmaM3O+KOTJQW0ue8VLtEhMcoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da569856535cf3160316a48468610e600b1479d793aaaa256bdada6c37daddd5","last_reissued_at":"2026-05-28T02:04:55.393066Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T02:04:55.393066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28524","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tvlxRtUCJCzbXxQU4hqyiMYzDn/iSJuT1p6afmUFDtZ/tj8OZ80ILxogFYf0wfKJhHlQfVCxGnL4D5Di70hBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:26:27.048230Z"},"content_sha256":"70905d371f0d7a9afbff24b3cfff41e2104766737cf7b96f2d1215a077614d38","schema_version":"1.0","event_id":"sha256:70905d371f0d7a9afbff24b3cfff41e2104766737cf7b96f2d1215a077614d38"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3JLJQVSTLTZRMAYWUSCGQYIOMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Let Relations Speak: An End-to-End LLM-GNN Soft Prompt Framework for Fraud Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dawei Cheng, Huilin He, Jiasheng Wu, Zhixing Zuo","submitted_at":"2026-05-27T14:21:47Z","abstract_excerpt":"In recent years, Large Language Models (LLMs) have shown great capability in processing graph tasks such as fraud detection. However, most existing methods rely heavily on rich text attributes, which poses difficulties for this domain due to the lack of textual data. Although some pioneering methods attempt to overcome it, their textualization of graph structures via hard prompts easily leads to feature distortion. Additionally, fraud detection often exhibits multi-relational complexity, where current methods struggle to capture this deep semantic information. To address these challenges, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28524","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/2605.28524/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T02:04:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gCie/DdLsTKGDbgaxTgxLFsSTVJQ3gglVYoyFAhdebnmhqYOeidyesYp4ZfSOrzlYDIJ9zlhQ/UvIZ/sr4IFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T12:26:27.048655Z"},"content_sha256":"580b72420a3dcedc0d66ec42c3887c705af2d3a4a89e7cace0c0352df5104216","schema_version":"1.0","event_id":"sha256:580b72420a3dcedc0d66ec42c3887c705af2d3a4a89e7cace0c0352df5104216"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/bundle.json","state_url":"https://pith.science/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T12:26:27Z","links":{"resolver":"https://pith.science/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA","bundle":"https://pith.science/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/bundle.json","state":"https://pith.science/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3JLJQVSTLTZRMAYWUSCGQYIOMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3JLJQVSTLTZRMAYWUSCGQYIOMA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3179beba80edd0c42f3457e8a9e7332d34c7fc93e07c7671d0620e965f845cb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-27T14:21:47Z","title_canon_sha256":"8630d141f38ed665cbfecc5134c16300cbb7519581b31e967400c11563a0d7a2"},"schema_version":"1.0","source":{"id":"2605.28524","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28524","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28524v1","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28524","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_12","alias_value":"3JLJQVSTLTZR","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_16","alias_value":"3JLJQVSTLTZRMAYW","created_at":"2026-05-28T02:04:55Z"},{"alias_kind":"pith_short_8","alias_value":"3JLJQVST","created_at":"2026-05-28T02:04:55Z"}],"graph_snapshots":[{"event_id":"sha256:580b72420a3dcedc0d66ec42c3887c705af2d3a4a89e7cace0c0352df5104216","target":"graph","created_at":"2026-05-28T02:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.28524/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In recent years, Large Language Models (LLMs) have shown great capability in processing graph tasks such as fraud detection. However, most existing methods rely heavily on rich text attributes, which poses difficulties for this domain due to the lack of textual data. Although some pioneering methods attempt to overcome it, their textualization of graph structures via hard prompts easily leads to feature distortion. Additionally, fraud detection often exhibits multi-relational complexity, where current methods struggle to capture this deep semantic information. To address these challenges, we p","authors_text":"Dawei Cheng, Huilin He, Jiasheng Wu, Zhixing Zuo","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-27T14:21:47Z","title":"Let Relations Speak: An End-to-End LLM-GNN Soft Prompt Framework for Fraud Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28524","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:70905d371f0d7a9afbff24b3cfff41e2104766737cf7b96f2d1215a077614d38","target":"record","created_at":"2026-05-28T02:04:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3179beba80edd0c42f3457e8a9e7332d34c7fc93e07c7671d0620e965f845cb1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-27T14:21:47Z","title_canon_sha256":"8630d141f38ed665cbfecc5134c16300cbb7519581b31e967400c11563a0d7a2"},"schema_version":"1.0","source":{"id":"2605.28524","kind":"arxiv","version":1}},"canonical_sha256":"da569856535cf3160316a48468610e600b1479d793aaaa256bdada6c37daddd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da569856535cf3160316a48468610e600b1479d793aaaa256bdada6c37daddd5","first_computed_at":"2026-05-28T02:04:55.393066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T02:04:55.393066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AT+mF8cyoQyNiKQyfiYGCDHQjNypaYrRH7FbHmN07dNIGPEPAX7qAHKhmK8FmaM3O+KOTJQW0ue8VLtEhMcoAw==","signature_status":"signed_v1","signed_at":"2026-05-28T02:04:55.393472Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28524","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70905d371f0d7a9afbff24b3cfff41e2104766737cf7b96f2d1215a077614d38","sha256:580b72420a3dcedc0d66ec42c3887c705af2d3a4a89e7cace0c0352df5104216"],"state_sha256":"76428af0a34a48cfacb9e3ab80ff45e7413bbb9c34106b08d9f47113eb61baa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2EX7Hz3mC0VbJXIGMbFE2j8UFleFEtY+48JU8AXzqjgLY39oxHQGnxaIxqSaxOQeZEzvP69phREg2InKyaECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T12:26:27.050638Z","bundle_sha256":"72e7c6de930255ed7124dcf41e1fd446624790bbe60dba5ac52fb1b37f9bdfef"}}