{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZTYE36PBAYKRXZXJJKO22HKR4Q","short_pith_number":"pith:ZTYE36PB","schema_version":"1.0","canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","source":{"kind":"arxiv","id":"2607.07419","version":1},"attestation_state":"computed","paper":{"title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Donghang Cui, Guoren Wang, Qiangqiang Dai, Ronghua Li","submitted_at":"2026-07-08T13:47:42Z","abstract_excerpt":"Biplex, as a relaxation of the biclique model, has emerged as an important cohesive subgraph model for bipartite graph analysis. The maximum $k$-biplex search problem aims to identify the $k$-biplex with maximum number of edges and has been widely applied in various real-world applications, including community detection, online recommendation, and fraud detection. However, the problem is NP-hard, and existing exact algorithms remain inefficient on large-scale bipartite graphs with large values of $k$ (e.g., $k\\geq 3$). In this paper, we revisit the maximum $k$-biplex search problem from a comp"},"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":"2607.07419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T13:47:42Z","cross_cats_sorted":[],"title_canon_sha256":"b8f5fe95b3cbb9faccd76fa5fd2fc540290a73687ff8b2de3b9a260837ff5316","abstract_canon_sha256":"4897fad8cc86c1d21c2087a657f4ead193898c828b0fa308950e8e681e479186"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:24.471100Z","signature_b64":"WSF5AzhKv9+tXpKK3HZftbZz9in+TayriMiOIX5cu22+JGt7TfZ1GbzoCoRgrsUXkaghaztPHxufUwkWG++WCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","last_reissued_at":"2026-07-09T01:20:24.470688Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:24.470688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Donghang Cui, Guoren Wang, Qiangqiang Dai, Ronghua Li","submitted_at":"2026-07-08T13:47:42Z","abstract_excerpt":"Biplex, as a relaxation of the biclique model, has emerged as an important cohesive subgraph model for bipartite graph analysis. The maximum $k$-biplex search problem aims to identify the $k$-biplex with maximum number of edges and has been widely applied in various real-world applications, including community detection, online recommendation, and fraud detection. However, the problem is NP-hard, and existing exact algorithms remain inefficient on large-scale bipartite graphs with large values of $k$ (e.g., $k\\geq 3$). In this paper, we revisit the maximum $k$-biplex search problem from a comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07419","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07419/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.07419","created_at":"2026-07-09T01:20:24.470746+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07419v1","created_at":"2026-07-09T01:20:24.470746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07419","created_at":"2026-07-09T01:20:24.470746+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZTYE36PBAYKR","created_at":"2026-07-09T01:20:24.470746+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZTYE36PBAYKRXZXJ","created_at":"2026-07-09T01:20:24.470746+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZTYE36PB","created_at":"2026-07-09T01:20:24.470746+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/ZTYE36PBAYKRXZXJJKO22HKR4Q","json":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q.json","graph_json":"https://pith.science/api/pith-number/ZTYE36PBAYKRXZXJJKO22HKR4Q/graph.json","events_json":"https://pith.science/api/pith-number/ZTYE36PBAYKRXZXJJKO22HKR4Q/events.json","paper":"https://pith.science/paper/ZTYE36PB"},"agent_actions":{"view_html":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q","download_json":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q.json","view_paper":"https://pith.science/paper/ZTYE36PB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07419&json=true","fetch_graph":"https://pith.science/api/pith-number/ZTYE36PBAYKRXZXJJKO22HKR4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/ZTYE36PBAYKRXZXJJKO22HKR4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/action/storage_attestation","attest_author":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/action/author_attestation","sign_citation":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/action/citation_signature","submit_replication":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/action/replication_record"}},"created_at":"2026-07-09T01:20:24.470746+00:00","updated_at":"2026-07-09T01:20:24.470746+00:00"}