{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PGGMLDT4FXFDCFBLYMHSQFJRSF","short_pith_number":"pith:PGGMLDT4","schema_version":"1.0","canonical_sha256":"798cc58e7c2dca31142bc30f2815319178141a79fd315b3c93a5c897e66699b8","source":{"kind":"arxiv","id":"1905.08040","version":1},"attestation_state":"computed","paper":{"title":"Graph distances for determining entities relationships: a topological approach to fraud detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"A. Ferrer-Sapena, E.A. S\\'anchez-P\\'erez, H. Falciani, J.M. Calabuig, L.M. Garc\\'ia-Raffi","submitted_at":"2019-05-03T14:02:38Z","abstract_excerpt":"Given a set $\\Omega$ and a proximity function $\\phi: \\Omega \\times \\Omega \\to \\mathbb R^+$, we define a new metric for $\\Omega$ by considering a path distance in $\\Omega$, that is considered as a complete graph. We analyze the properties of such a distance, and several procedures for defining the initial proximity matrix $( \\phi(a,b) )_{(a,b) \\in \\Omega \\times \\Omega}.$ Our motivation has its roots in the current interest in finding effective algorithms for detecting and classifying relations among elements of a social network. For example, the analysis of a set of companies working for a give"},"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":"1905.08040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-05-03T14:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"fbe71b741e5dd838090888a9401327ede78704d60e64f51e91bdd1bb0d9005c9","abstract_canon_sha256":"e09886887ff8c8dcf3cd18977db8e713cddd0add9ca0e3bdeaadfd32fae46647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.763902Z","signature_b64":"H6oZLl65y7/1kJAeFMtPKIBcPgxyy2sTjiz1WgsBKUSdNO+ET637TveOi1RIMyNDajcd4NZAqd1JmtLjDxsFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"798cc58e7c2dca31142bc30f2815319178141a79fd315b3c93a5c897e66699b8","last_reissued_at":"2026-05-17T23:45:47.763289Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.763289Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph distances for determining entities relationships: a topological approach to fraud detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"A. Ferrer-Sapena, E.A. S\\'anchez-P\\'erez, H. Falciani, J.M. Calabuig, L.M. Garc\\'ia-Raffi","submitted_at":"2019-05-03T14:02:38Z","abstract_excerpt":"Given a set $\\Omega$ and a proximity function $\\phi: \\Omega \\times \\Omega \\to \\mathbb R^+$, we define a new metric for $\\Omega$ by considering a path distance in $\\Omega$, that is considered as a complete graph. We analyze the properties of such a distance, and several procedures for defining the initial proximity matrix $( \\phi(a,b) )_{(a,b) \\in \\Omega \\times \\Omega}.$ Our motivation has its roots in the current interest in finding effective algorithms for detecting and classifying relations among elements of a social network. For example, the analysis of a set of companies working for a give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08040","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":""},"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":"1905.08040","created_at":"2026-05-17T23:45:47.763387+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08040v1","created_at":"2026-05-17T23:45:47.763387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08040","created_at":"2026-05-17T23:45:47.763387+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGGMLDT4FXFD","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGGMLDT4FXFDCFBL","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGGMLDT4","created_at":"2026-05-18T12:33:24.271573+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/PGGMLDT4FXFDCFBLYMHSQFJRSF","json":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF.json","graph_json":"https://pith.science/api/pith-number/PGGMLDT4FXFDCFBLYMHSQFJRSF/graph.json","events_json":"https://pith.science/api/pith-number/PGGMLDT4FXFDCFBLYMHSQFJRSF/events.json","paper":"https://pith.science/paper/PGGMLDT4"},"agent_actions":{"view_html":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF","download_json":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF.json","view_paper":"https://pith.science/paper/PGGMLDT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08040&json=true","fetch_graph":"https://pith.science/api/pith-number/PGGMLDT4FXFDCFBLYMHSQFJRSF/graph.json","fetch_events":"https://pith.science/api/pith-number/PGGMLDT4FXFDCFBLYMHSQFJRSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF/action/storage_attestation","attest_author":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF/action/author_attestation","sign_citation":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF/action/citation_signature","submit_replication":"https://pith.science/pith/PGGMLDT4FXFDCFBLYMHSQFJRSF/action/replication_record"}},"created_at":"2026-05-17T23:45:47.763387+00:00","updated_at":"2026-05-17T23:45:47.763387+00:00"}