{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E","short_pith_number":"pith:KK72YKAR","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"},"canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","source":{"kind":"arxiv","id":"1810.06809","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06809","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06809v3","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06809","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"KK72YKARYIZ4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KK72YKARYIZ4UTO3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KK72YKAR","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E","target":"record","payload":{"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"},"canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","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"},"source_kind":"arxiv","source_id":"1810.06809","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FON8h5ykEePmII6kzGZ3MUWd+CV+4EVb8bMxdEFCysCvnylHt+fbsJFot8rfXUTPkcxnDPF8cSpkOqA9JqvyCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:03:06.472271Z"},"content_sha256":"2dbd590625532b0cb4691c6534400b052019c6b0479833dfa0ae4b15f8fbd7a7","schema_version":"1.0","event_id":"sha256:2dbd590625532b0cb4691c6534400b052019c6b0479833dfa0ae4b15f8fbd7a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GM2zJtgyBq4ChFBEb6g4eOMdpnTIw9divvjZGm1JFnFvFYpuiRMchWdhD788CgHAywM1z/B/WMiHDILuoOjNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:03:06.473008Z"},"content_sha256":"35c09704dca318099bb2c150fef86d766afe5733f6e1f8a84be7aa2fa13f8b3c","schema_version":"1.0","event_id":"sha256:35c09704dca318099bb2c150fef86d766afe5733f6e1f8a84be7aa2fa13f8b3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/bundle.json","state_url":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T01:03:06Z","links":{"resolver":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E","bundle":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/bundle.json","state":"https://pith.science/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KK72YKARYIZ4UTO3GEW7WI3K4E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KK72YKARYIZ4UTO3GEW7WI3K4E","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":"55a79a63b22dbcc2185c38a122d008a96351d8e5d24e40eb4da6973073cdf222","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T05:01:28Z","title_canon_sha256":"b65c96c69545fdc21d8f7b494ff05f8426b71448be9c363612021edd3f9e197f"},"schema_version":"1.0","source":{"id":"1810.06809","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06809","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06809v3","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06809","created_at":"2026-05-18T00:01:37Z"},{"alias_kind":"pith_short_12","alias_value":"KK72YKARYIZ4","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KK72YKARYIZ4UTO3","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KK72YKAR","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:35c09704dca318099bb2c150fef86d766afe5733f6e1f8a84be7aa2fa13f8b3c","target":"graph","created_at":"2026-05-18T00:01:37Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Yikun Ban","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T05:01:28Z","title":"On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06809","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2dbd590625532b0cb4691c6534400b052019c6b0479833dfa0ae4b15f8fbd7a7","target":"record","created_at":"2026-05-18T00:01:37Z","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":"55a79a63b22dbcc2185c38a122d008a96351d8e5d24e40eb4da6973073cdf222","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-16T05:01:28Z","title_canon_sha256":"b65c96c69545fdc21d8f7b494ff05f8426b71448be9c363612021edd3f9e197f"},"schema_version":"1.0","source":{"id":"1810.06809","kind":"arxiv","version":3}},"canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52bfac2811c233ca4ddb312dfb236ae1018edc07edb81a9fc0052bb8539e2f52","first_computed_at":"2026-05-18T00:01:37.553742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:37.553742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AbcdJhZI9DLUwHr9VwqEZgdazUyVwrz+Ql9xINoiD1jCGygntEAVcfwuAQg4KuazhXz4yawPVNUdDWBXyDs1AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:37.554257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06809","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dbd590625532b0cb4691c6534400b052019c6b0479833dfa0ae4b15f8fbd7a7","sha256:35c09704dca318099bb2c150fef86d766afe5733f6e1f8a84be7aa2fa13f8b3c"],"state_sha256":"fcd66704293a4d31c40611c289769d6fe971ab17f6bc30de4d45042bd0531d1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UU2/c0OnsqMHmBBvgtMbD2ac4yq92SSqiyDLWOI1m9aXtYj8FnVjmORmUK0Dxw/J56KKUS/Up7ORrwUgh9TwCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:03:06.476865Z","bundle_sha256":"101830f15833bdbfd177eeea4c119b4290f16a8bc1d52d52c346aed5801162d9"}}