{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZTYE36PBAYKRXZXJJKO22HKR4Q","short_pith_number":"pith:ZTYE36PB","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"},"canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","source":{"kind":"arxiv","id":"2607.07419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07419","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07419v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07419","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZTYE36PBAYKR","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"ZTYE36PBAYKRXZXJ","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"ZTYE36PB","created_at":"2026-07-09T01:20:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZTYE36PBAYKRXZXJJKO22HKR4Q","target":"record","payload":{"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"},"canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","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"},"source_kind":"arxiv","source_id":"2607.07419","source_version":1,"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-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+jO88wYKHbGaoeEVeCtYyRUQg2geTGY3exLHQBhNALZDyW8Vuvx5tV1w9JSUWhymq1n1m/8p5OLFO5zEbgoYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:43:49.332621Z"},"content_sha256":"d4cf5f1c80ce00cfcad9e8d9c5e299c45911ac32dda5f7a137c1059139fe372f","schema_version":"1.0","event_id":"sha256:d4cf5f1c80ce00cfcad9e8d9c5e299c45911ac32dda5f7a137c1059139fe372f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZTYE36PBAYKRXZXJJKO22HKR4Q","target":"graph","payload":{"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"},"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-07-09T01:20:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7J8WQm3ycztAaPXGZVyZoAydpSUyfj/XqghFqACr3oWeTRSABdl4fgJggOX87Fqr4tVvObbfYwR+IVex462mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T15:43:49.333021Z"},"content_sha256":"4bb6b9f637b0f63e6487c2f1cde0e431bcb7e990b4f5800618e308b1fb3d3f9c","schema_version":"1.0","event_id":"sha256:4bb6b9f637b0f63e6487c2f1cde0e431bcb7e990b4f5800618e308b1fb3d3f9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/bundle.json","state_url":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/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-08-18T15:43:49Z","links":{"resolver":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q","bundle":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/bundle.json","state":"https://pith.science/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZTYE36PBAYKRXZXJJKO22HKR4Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZTYE36PBAYKRXZXJJKO22HKR4Q","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":"4897fad8cc86c1d21c2087a657f4ead193898c828b0fa308950e8e681e479186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T13:47:42Z","title_canon_sha256":"b8f5fe95b3cbb9faccd76fa5fd2fc540290a73687ff8b2de3b9a260837ff5316"},"schema_version":"1.0","source":{"id":"2607.07419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07419","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07419v1","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07419","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_12","alias_value":"ZTYE36PBAYKR","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_16","alias_value":"ZTYE36PBAYKRXZXJ","created_at":"2026-07-09T01:20:24Z"},{"alias_kind":"pith_short_8","alias_value":"ZTYE36PB","created_at":"2026-07-09T01:20:24Z"}],"graph_snapshots":[{"event_id":"sha256:4bb6b9f637b0f63e6487c2f1cde0e431bcb7e990b4f5800618e308b1fb3d3f9c","target":"graph","created_at":"2026-07-09T01:20:24Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07419/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Donghang Cui, Guoren Wang, Qiangqiang Dai, Ronghua Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T13:47:42Z","title":"Revisiting Maximum $k$-Biplex Search Through $k$-Bounded-Degree Deletion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07419","kind":"arxiv","version":1},"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:d4cf5f1c80ce00cfcad9e8d9c5e299c45911ac32dda5f7a137c1059139fe372f","target":"record","created_at":"2026-07-09T01:20:24Z","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":"4897fad8cc86c1d21c2087a657f4ead193898c828b0fa308950e8e681e479186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-08T13:47:42Z","title_canon_sha256":"b8f5fe95b3cbb9faccd76fa5fd2fc540290a73687ff8b2de3b9a260837ff5316"},"schema_version":"1.0","source":{"id":"2607.07419","kind":"arxiv","version":1}},"canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ccf04df9e106151be6e94a9dad1d51e43810b05398c1029d2cfd0348150b6e6b","first_computed_at":"2026-07-09T01:20:24.470688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:24.470688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WSF5AzhKv9+tXpKK3HZftbZz9in+TayriMiOIX5cu22+JGt7TfZ1GbzoCoRgrsUXkaghaztPHxufUwkWG++WCw==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:24.471100Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d4cf5f1c80ce00cfcad9e8d9c5e299c45911ac32dda5f7a137c1059139fe372f","sha256:4bb6b9f637b0f63e6487c2f1cde0e431bcb7e990b4f5800618e308b1fb3d3f9c"],"state_sha256":"826513c46853dc00e23c016fa845587c38af2acff74ea27d3605e63584f8aa1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B4xKJxeRfYqG5ec+onevGe5ainM8mAepeKYFhycWY2znm/dsHlqFzUUgYD4OeVblmeZraaMiONdoCaVFq9hQCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T15:43:49.335382Z","bundle_sha256":"c611c80f034898ee58402e800505331ac1d97199c63c26b4a6d62e113415336f"}}