{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:D25W4EP4K5TSHH3SIYKM3ZIVEK","short_pith_number":"pith:D25W4EP4","schema_version":"1.0","canonical_sha256":"1ebb6e11fc5767239f724614cde515229f3c650e988d20b6513c3bf48c3b00cb","source":{"kind":"arxiv","id":"2608.15768","version":1},"attestation_state":"computed","paper":{"title":"Temporal Graph Prototype-conditioned Conformal Prediction for Fraud Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Lu Cheng, Shengbo Gong, Wei Jin, Xudong Chen","submitted_at":"2026-08-16T14:44:16Z","abstract_excerpt":"Conformal prediction (CP) provides distribution-free coverage guarantees and has emerged as a principled tool for uncertainty quantification. In edge-level fraud detection on temporal interaction graphs, where false positives and false negatives both carry substantial cost, such coverage guarantees are particularly appealing for risk-aware decision making. However, directly applying existing graph conformal predictors yields inefficient prediction sets due to two recurring properties of fraud data. Fraudulent interactions are often embedded in benign-dominated neighborhoods that dilute calibra"},"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":"2608.15768","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-16T14:44:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"67aba53138160081bbcb233082004b2f1465b13d153124b6d99850fb908790e6","abstract_canon_sha256":"e27389ae94a04ae0054689012e04b46ad3a46b14653a0b972dec7e48ceed4f7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-18T01:16:09.469388Z","signature_b64":"EYqb5NMCVIVDFhB7Zjg3aISBANdfWe+i4aICX2ZD4yKNoUbA5h0SKJBkWUkuV5RuSUzTrsxMVnbVoKPqKHZdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ebb6e11fc5767239f724614cde515229f3c650e988d20b6513c3bf48c3b00cb","last_reissued_at":"2026-08-18T01:16:09.467770Z","signature_status":"signed_v1","first_computed_at":"2026-08-18T01:16:09.467770Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Temporal Graph Prototype-conditioned Conformal Prediction for Fraud Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Lu Cheng, Shengbo Gong, Wei Jin, Xudong Chen","submitted_at":"2026-08-16T14:44:16Z","abstract_excerpt":"Conformal prediction (CP) provides distribution-free coverage guarantees and has emerged as a principled tool for uncertainty quantification. In edge-level fraud detection on temporal interaction graphs, where false positives and false negatives both carry substantial cost, such coverage guarantees are particularly appealing for risk-aware decision making. However, directly applying existing graph conformal predictors yields inefficient prediction sets due to two recurring properties of fraud data. Fraudulent interactions are often embedded in benign-dominated neighborhoods that dilute calibra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.15768","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/2608.15768/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":"2608.15768","created_at":"2026-08-18T01:16:09.468419+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.15768v1","created_at":"2026-08-18T01:16:09.468419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.15768","created_at":"2026-08-18T01:16:09.468419+00:00"},{"alias_kind":"pith_short_12","alias_value":"D25W4EP4K5TS","created_at":"2026-08-18T01:16:09.468419+00:00"},{"alias_kind":"pith_short_16","alias_value":"D25W4EP4K5TSHH3S","created_at":"2026-08-18T01:16:09.468419+00:00"},{"alias_kind":"pith_short_8","alias_value":"D25W4EP4","created_at":"2026-08-18T01:16:09.468419+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK","json":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK.json","graph_json":"https://pith.science/api/pith-number/D25W4EP4K5TSHH3SIYKM3ZIVEK/graph.json","events_json":"https://pith.science/api/pith-number/D25W4EP4K5TSHH3SIYKM3ZIVEK/events.json","paper":"https://pith.science/paper/D25W4EP4"},"agent_actions":{"view_html":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK","download_json":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK.json","view_paper":"https://pith.science/paper/D25W4EP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.15768&json=true","fetch_graph":"https://pith.science/api/pith-number/D25W4EP4K5TSHH3SIYKM3ZIVEK/graph.json","fetch_events":"https://pith.science/api/pith-number/D25W4EP4K5TSHH3SIYKM3ZIVEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK/action/storage_attestation","attest_author":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK/action/author_attestation","sign_citation":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK/action/citation_signature","submit_replication":"https://pith.science/pith/D25W4EP4K5TSHH3SIYKM3ZIVEK/action/replication_record"}},"created_at":"2026-08-18T01:16:09.468419+00:00","updated_at":"2026-08-18T01:16:09.468419+00:00"}