{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:T3XG2TU44B5IPFFBH4TV7O3VG2","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":"7629a3d37f4457154d5cf70c0c779e2cab500b8a69596140f327b01f3761b612","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-25T20:49:22Z","title_canon_sha256":"ea12dab7173577d9356116d833c3ad48d8fa60af1965a718d84d95eec7822cc2"},"schema_version":"1.0","source":{"id":"2604.23437","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.23437","created_at":"2026-05-20T00:03:12Z"},{"alias_kind":"arxiv_version","alias_value":"2604.23437v2","created_at":"2026-05-20T00:03:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.23437","created_at":"2026-05-20T00:03:12Z"},{"alias_kind":"pith_short_12","alias_value":"T3XG2TU44B5I","created_at":"2026-05-20T00:03:12Z"},{"alias_kind":"pith_short_16","alias_value":"T3XG2TU44B5IPFFB","created_at":"2026-05-20T00:03:12Z"},{"alias_kind":"pith_short_8","alias_value":"T3XG2TU4","created_at":"2026-05-20T00:03:12Z"}],"graph_snapshots":[{"event_id":"sha256:d03ef4e2ce6f1af9038ad138fa3b612b246a0389a9440f9113e5dfbcacd54b45","target":"graph","created_at":"2026-05-20T00:03:12Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"DSFL replaces mesh topologies with Dynamic Stochastic Sharding, reducing communication complexity from O(N^2) to O(N m), ... Empirical evaluation on the Credit Card Fraud Detection Dataset (ULB) demonstrates an approximately 33x latency reduction compared to Paillier-based secure aggregation, while maintaining strong resilience under simulated failures."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that Linear Integrity Tags suffice for integrity without enforcing semantic correctness of updates and that dynamic sharding preserves privacy against gradient inversion attacks, as stated in the abstract's description of the mechanisms."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"DSFL introduces dynamic stochastic sharding and linear integrity tags to reduce federated learning communication from quadratic to linear while enabling verifiable aggregation, achieving 33x lower latency than Paillier on credit card fraud data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Dynamic stochastic sharding and linear integrity tags let banks train shared fraud models with linear communication costs and verifiable updates."}],"snapshot_sha256":"81169a28299c88dab2a2c650f982a24b8199cd0a48cd41c539cacf0d43665651"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:05:34.087576Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.23437/integrity.json","findings":[],"snapshot_sha256":"74449808d0baa53f935bc7c167df06ccb29b2b3f016069d4e898c1e2659dac6c","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Financial fraud increasingly exploits institutional boundaries: laundering networks distribute transactions across multiple banks because no single institution can observe the full pattern. Federated Learning (FL) enables collaborative detection without raw data sharing, yet practical deployment in banking environments remains constrained by three pressures. First, homomorphic encryption schemes impose high computational costs that limit real-time aggregation at scale. Second, mask-based protocols such as Google's SecAgg require O(N^2) pairwise key exchanges, which become inefficient as partic","authors_text":"Nishant Nigam, Prajwal Panth","cross_cats":["cs.LG"],"headline":"Dynamic stochastic sharding and linear integrity tags let banks train shared fraud models with linear communication costs and verifiable updates.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-25T20:49:22Z","title":"Scalable and Verifiable Federated Learning for Cross-Institution Financial Fraud Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.23437","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T07:51:40.106582Z","id":"57d9552f-784a-4516-81ef-ea177fd9513c","model_set":{"reader":"grok-4.3"},"one_line_summary":"DSFL introduces dynamic stochastic sharding and linear integrity tags to reduce federated learning communication from quadratic to linear while enabling verifiable aggregation, achieving 33x lower latency than Paillier on credit card fraud data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Dynamic stochastic sharding and linear integrity tags let banks train shared fraud models with linear communication costs and verifiable updates.","strongest_claim":"DSFL replaces mesh topologies with Dynamic Stochastic Sharding, reducing communication complexity from O(N^2) to O(N m), ... Empirical evaluation on the Credit Card Fraud Detection Dataset (ULB) demonstrates an approximately 33x latency reduction compared to Paillier-based secure aggregation, while maintaining strong resilience under simulated failures.","weakest_assumption":"The assumption that Linear Integrity Tags suffice for integrity without enforcing semantic correctness of updates and that dynamic sharding preserves privacy against gradient inversion attacks, as stated in the abstract's description of the mechanisms."}},"verdict_id":"57d9552f-784a-4516-81ef-ea177fd9513c"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ffd76f47b36a24e120351fd116a3aad2281484a491f514a88d9d1129335378d8","target":"record","created_at":"2026-05-20T00:03:12Z","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":"7629a3d37f4457154d5cf70c0c779e2cab500b8a69596140f327b01f3761b612","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-25T20:49:22Z","title_canon_sha256":"ea12dab7173577d9356116d833c3ad48d8fa60af1965a718d84d95eec7822cc2"},"schema_version":"1.0","source":{"id":"2604.23437","kind":"arxiv","version":2}},"canonical_sha256":"9eee6d4e9ce07a8794a13f275fbb753693f0beb48eaea6d220922b53411a3670","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9eee6d4e9ce07a8794a13f275fbb753693f0beb48eaea6d220922b53411a3670","first_computed_at":"2026-05-20T00:03:12.545038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:12.545038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w/9uVsaK2CBVtJ3OOXbl0ST8LAXYoVfrFzLosmwHeExi0StEjA4cEE174h9hUt30m0b41VsCvuzyslP/6nHRCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:12.546052Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.23437","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffd76f47b36a24e120351fd116a3aad2281484a491f514a88d9d1129335378d8","sha256:d03ef4e2ce6f1af9038ad138fa3b612b246a0389a9440f9113e5dfbcacd54b45"],"state_sha256":"5274bcd2b687ba1c05694174ee53d95fa2210276141d0d4e673ae1a771b1a498"}