{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E","short_pith_number":"pith:KK72YKAR","schema_version":"1.0","canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","source":{"kind":"arxiv","id":"1810.06809","version":3},"attestation_state":"computed","paper":{"title":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Yikun Ban","submitted_at":"2018-10-16T05:01:28Z","abstract_excerpt":"Detecting dense subgraphs from large graphs is a core component in many applications, ranging from social networks mining, bioinformatics. In this paper, we focus on mining dense subgraphs in a bipartite graph. The work is motivated by the task of detecting synchronized behavior that can often be formulated as mining a bipartite graph formed by the source nodes (followers, customers) and target nodes (followees, products, etc.) for malicious patterns. We introduce a new restricted biclique problem, Maximal Half Isolated Biclique (MHI Biclique), and show that the problem finds immediate applica"},"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":"1810.06809","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T05:01:28Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b65c96c69545fdc21d8f7b494ff05f8426b71448be9c363612021edd3f9e197f","abstract_canon_sha256":"55a79a63b22dbcc2185c38a122d008a96351d8e5d24e40eb4da6973073cdf222"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:37.554257Z","signature_b64":"AbcdJhZI9DLUwHr9VwqEZgdazUyVwrz+Ql9xINoiD1jCGygntEAVcfwuAQg4KuazhXz4yawPVNUdDWBXyDs1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","last_reissued_at":"2026-05-18T00:01:37.553742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:37.553742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DS","authors_text":"Yikun Ban","submitted_at":"2018-10-16T05:01:28Z","abstract_excerpt":"Detecting dense subgraphs from large graphs is a core component in many applications, ranging from social networks mining, bioinformatics. In this paper, we focus on mining dense subgraphs in a bipartite graph. The work is motivated by the task of detecting synchronized behavior that can often be formulated as mining a bipartite graph formed by the source nodes (followers, customers) and target nodes (followees, products, etc.) for malicious patterns. We introduce a new restricted biclique problem, Maximal Half Isolated Biclique (MHI Biclique), and show that the problem finds immediate applica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06809","kind":"arxiv","version":3},"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":"1810.06809","created_at":"2026-05-18T00:01:37.553835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.06809v3","created_at":"2026-05-18T00:01:37.553835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06809","created_at":"2026-05-18T00:01:37.553835+00:00"},{"alias_kind":"pith_short_12","alias_value":"KK72YKARYIZ4","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KK72YKARYIZ4UTO3","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KK72YKAR","created_at":"2026-05-18T12:32:33.847187+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/KK72YKARYIZ4UTO3GEW7WI3K4E","json":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E.json","graph_json":"https://pith.science/api/pith-number/KK72YKARYIZ4UTO3GEW7WI3K4E/graph.json","events_json":"https://pith.science/api/pith-number/KK72YKARYIZ4UTO3GEW7WI3K4E/events.json","paper":"https://pith.science/paper/KK72YKAR"},"agent_actions":{"view_html":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E","download_json":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E.json","view_paper":"https://pith.science/paper/KK72YKAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.06809&json=true","fetch_graph":"https://pith.science/api/pith-number/KK72YKARYIZ4UTO3GEW7WI3K4E/graph.json","fetch_events":"https://pith.science/api/pith-number/KK72YKARYIZ4UTO3GEW7WI3K4E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/action/storage_attestation","attest_author":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/action/author_attestation","sign_citation":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/action/citation_signature","submit_replication":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/action/replication_record"}},"created_at":"2026-05-18T00:01:37.553835+00:00","updated_at":"2026-05-18T00:01:37.553835+00:00"}