{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AF7DYXBDJDIHK2PEEZTWZRPD75","short_pith_number":"pith:AF7DYXBD","schema_version":"1.0","canonical_sha256":"017e3c5c2348d07569e426676cc5e3ff5ecf17a44f466c4692ae4b861ba87952","source":{"kind":"arxiv","id":"1509.06457","version":2},"attestation_state":"computed","paper":{"title":"Identifying collusion groups using spectral clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","stat.ML"],"primary_cat":"q-fin.TR","authors_text":"Kandathil Mathew Abraham, Subir Kumar Ghosh, Suneel Sarswat","submitted_at":"2015-09-22T04:03:18Z","abstract_excerpt":"In an illiquid stock, traders can collude and place orders on a predetermined price and quantity at a fixed schedule. This is usually done to manipulate the price of the stock or to create artificial liquidity in the stock, which may mislead genuine investors. Here, the problem is to identify such group of colluding traders. We modeled the problem instance as a graph, where each trader corresponds to a vertex of the graph and trade corresponds to edges of the graph. Further, we assign weights on edges depending on total volume, total number of trades, maximum change in the price and commonalit"},"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":"1509.06457","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-fin.TR","submitted_at":"2015-09-22T04:03:18Z","cross_cats_sorted":["cs.CE","stat.ML"],"title_canon_sha256":"4321125b7e7dbb999fb09de1894b12efd27c6c252b2f8bfe0f7cc641f0ad94ea","abstract_canon_sha256":"c1afc302f70a7124ef99fb33e8f49755d8f7099538c7531a4a1726835c577b67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:13.705441Z","signature_b64":"H+MIFmIxBvL7foD4yMyTForz9slvmvPOhgGS5uVe2IEVoTpfFleC/eEfol7td1xsr284FU0ZspPrv/O/M9ORBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"017e3c5c2348d07569e426676cc5e3ff5ecf17a44f466c4692ae4b861ba87952","last_reissued_at":"2026-05-18T01:02:13.704154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:13.704154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Identifying collusion groups using spectral clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","stat.ML"],"primary_cat":"q-fin.TR","authors_text":"Kandathil Mathew Abraham, Subir Kumar Ghosh, Suneel Sarswat","submitted_at":"2015-09-22T04:03:18Z","abstract_excerpt":"In an illiquid stock, traders can collude and place orders on a predetermined price and quantity at a fixed schedule. This is usually done to manipulate the price of the stock or to create artificial liquidity in the stock, which may mislead genuine investors. Here, the problem is to identify such group of colluding traders. We modeled the problem instance as a graph, where each trader corresponds to a vertex of the graph and trade corresponds to edges of the graph. Further, we assign weights on edges depending on total volume, total number of trades, maximum change in the price and commonalit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06457","kind":"arxiv","version":2},"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":"1509.06457","created_at":"2026-05-18T01:02:13.704466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06457v2","created_at":"2026-05-18T01:02:13.704466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06457","created_at":"2026-05-18T01:02:13.704466+00:00"},{"alias_kind":"pith_short_12","alias_value":"AF7DYXBDJDIH","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AF7DYXBDJDIHK2PE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AF7DYXBD","created_at":"2026-05-18T12:29:10.953037+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/AF7DYXBDJDIHK2PEEZTWZRPD75","json":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75.json","graph_json":"https://pith.science/api/pith-number/AF7DYXBDJDIHK2PEEZTWZRPD75/graph.json","events_json":"https://pith.science/api/pith-number/AF7DYXBDJDIHK2PEEZTWZRPD75/events.json","paper":"https://pith.science/paper/AF7DYXBD"},"agent_actions":{"view_html":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75","download_json":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75.json","view_paper":"https://pith.science/paper/AF7DYXBD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06457&json=true","fetch_graph":"https://pith.science/api/pith-number/AF7DYXBDJDIHK2PEEZTWZRPD75/graph.json","fetch_events":"https://pith.science/api/pith-number/AF7DYXBDJDIHK2PEEZTWZRPD75/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75/action/storage_attestation","attest_author":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75/action/author_attestation","sign_citation":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75/action/citation_signature","submit_replication":"https://pith.science/pith/AF7DYXBDJDIHK2PEEZTWZRPD75/action/replication_record"}},"created_at":"2026-05-18T01:02:13.704466+00:00","updated_at":"2026-05-18T01:02:13.704466+00:00"}