{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IFZXBR7ABJ6CBPIXRJJ6UBC3M3","short_pith_number":"pith:IFZXBR7A","schema_version":"1.0","canonical_sha256":"417370c7e00a7c20bd178a53ea045b66e12440a306c70067674068bc5e3701a1","source":{"kind":"arxiv","id":"1503.06289","version":1},"attestation_state":"computed","paper":{"title":"Using shortest path to discover criminal community","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Asha Rao, Pritheega Magalingam, Stephen Davis","submitted_at":"2015-03-21T12:27:49Z","abstract_excerpt":"Extracting communities using existing community detection algorithms yields dense sub-networks that are difficult to analyse. Extracting a smaller sample that embodies the relationships of a list of suspects is an important part of the beginning of an investigation. In this paper, we present the efficacy of our shortest paths network search algorithm (SPNSA) that begins with an \"algorithm feed\", a small subset of nodes of particular interest, and builds an investigative sub-network. The algorithm feed may consist of known criminals or suspects, or persons of influence. This sets our approach a"},"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":"1503.06289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-03-21T12:27:49Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"875af087bbd3fc5c373b06f32cd1d7f71538edf0c6058bb20f5b3c2521097e05","abstract_canon_sha256":"b09e3a473240627acfbc88090c3dbffb02bd09b8ea51831e90d0a9a65268c35b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:34.930867Z","signature_b64":"qMhzl10DjaE251+MeTjFtCqTVmWa4NqvZ2OKioptpP4FEmae+QgjH6cfWo2/ZhbZYSEexVjW7WCr89nRMtveDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"417370c7e00a7c20bd178a53ea045b66e12440a306c70067674068bc5e3701a1","last_reissued_at":"2026-05-18T01:34:34.930214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:34.930214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using shortest path to discover criminal community","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Asha Rao, Pritheega Magalingam, Stephen Davis","submitted_at":"2015-03-21T12:27:49Z","abstract_excerpt":"Extracting communities using existing community detection algorithms yields dense sub-networks that are difficult to analyse. Extracting a smaller sample that embodies the relationships of a list of suspects is an important part of the beginning of an investigation. In this paper, we present the efficacy of our shortest paths network search algorithm (SPNSA) that begins with an \"algorithm feed\", a small subset of nodes of particular interest, and builds an investigative sub-network. The algorithm feed may consist of known criminals or suspects, or persons of influence. This sets our approach a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06289","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":"1503.06289","created_at":"2026-05-18T01:34:34.930309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.06289v1","created_at":"2026-05-18T01:34:34.930309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06289","created_at":"2026-05-18T01:34:34.930309+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFZXBR7ABJ6C","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFZXBR7ABJ6CBPIX","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFZXBR7A","created_at":"2026-05-18T12:29:25.134429+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/IFZXBR7ABJ6CBPIXRJJ6UBC3M3","json":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3.json","graph_json":"https://pith.science/api/pith-number/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/graph.json","events_json":"https://pith.science/api/pith-number/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/events.json","paper":"https://pith.science/paper/IFZXBR7A"},"agent_actions":{"view_html":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3","download_json":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3.json","view_paper":"https://pith.science/paper/IFZXBR7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.06289&json=true","fetch_graph":"https://pith.science/api/pith-number/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/graph.json","fetch_events":"https://pith.science/api/pith-number/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/action/storage_attestation","attest_author":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/action/author_attestation","sign_citation":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/action/citation_signature","submit_replication":"https://pith.science/pith/IFZXBR7ABJ6CBPIXRJJ6UBC3M3/action/replication_record"}},"created_at":"2026-05-18T01:34:34.930309+00:00","updated_at":"2026-05-18T01:34:34.930309+00:00"}