{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:B7SN44QHZ6HCLEWJXYJH7Y3MZH","short_pith_number":"pith:B7SN44QH","schema_version":"1.0","canonical_sha256":"0fe4de7207cf8e2592c9be127fe36cc9c4262ffc7fb56daf4f9996243fab1d4e","source":{"kind":"arxiv","id":"2309.04503","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithm for Maximum Biclique Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"quant-ph","authors_text":"Prasenjit Mitra, Rui Zhou, Wolfgang Nejdl, Xiaofan Li","submitted_at":"2023-09-08T04:43:05Z","abstract_excerpt":"Identifying a biclique with the maximum number of edges bears considerable implications for numerous fields of application, such as detecting anomalies in E-commerce transactions, discerning protein-protein interactions in biology, and refining the efficacy of social network recommendation algorithms. However, the inherent NP-hardness of this problem significantly complicates the matter. The prohibitive time complexity of existing algorithms is the primary bottleneck constraining the application scenarios. Aiming to address this challenge, we present an unprecedented exploration of a quantum c"},"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":"2309.04503","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-08T04:43:05Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"ae2fa2b824fc937db64019252d06fda532ea4cb7e96ccba3d2b2b17a95bc8ec8","abstract_canon_sha256":"8f3fde297b3f3c604e59c3ebf6697b9339fb3f4e73baec2222fd1b8d042e316e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:03.915428Z","signature_b64":"i38gJAwGd4DIRAFNvAtbAwv5K8LdMtgyCz3Ql7xyJUnBelRrAbX7SyTlfEQbT/kgRM5Fzm4nptX1UBdCdr0FDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fe4de7207cf8e2592c9be127fe36cc9c4262ffc7fb56daf4f9996243fab1d4e","last_reissued_at":"2026-07-05T06:49:03.914928Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:03.914928Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithm for Maximum Biclique Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"quant-ph","authors_text":"Prasenjit Mitra, Rui Zhou, Wolfgang Nejdl, Xiaofan Li","submitted_at":"2023-09-08T04:43:05Z","abstract_excerpt":"Identifying a biclique with the maximum number of edges bears considerable implications for numerous fields of application, such as detecting anomalies in E-commerce transactions, discerning protein-protein interactions in biology, and refining the efficacy of social network recommendation algorithms. However, the inherent NP-hardness of this problem significantly complicates the matter. The prohibitive time complexity of existing algorithms is the primary bottleneck constraining the application scenarios. Aiming to address this challenge, we present an unprecedented exploration of a quantum c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.04503","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/2309.04503/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":"2309.04503","created_at":"2026-07-05T06:49:03.914987+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.04503v1","created_at":"2026-07-05T06:49:03.914987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.04503","created_at":"2026-07-05T06:49:03.914987+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7SN44QHZ6HC","created_at":"2026-07-05T06:49:03.914987+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7SN44QHZ6HCLEWJ","created_at":"2026-07-05T06:49:03.914987+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7SN44QH","created_at":"2026-07-05T06:49:03.914987+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/B7SN44QHZ6HCLEWJXYJH7Y3MZH","json":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH.json","graph_json":"https://pith.science/api/pith-number/B7SN44QHZ6HCLEWJXYJH7Y3MZH/graph.json","events_json":"https://pith.science/api/pith-number/B7SN44QHZ6HCLEWJXYJH7Y3MZH/events.json","paper":"https://pith.science/paper/B7SN44QH"},"agent_actions":{"view_html":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH","download_json":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH.json","view_paper":"https://pith.science/paper/B7SN44QH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.04503&json=true","fetch_graph":"https://pith.science/api/pith-number/B7SN44QHZ6HCLEWJXYJH7Y3MZH/graph.json","fetch_events":"https://pith.science/api/pith-number/B7SN44QHZ6HCLEWJXYJH7Y3MZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH/action/storage_attestation","attest_author":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH/action/author_attestation","sign_citation":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH/action/citation_signature","submit_replication":"https://pith.science/pith/B7SN44QHZ6HCLEWJXYJH7Y3MZH/action/replication_record"}},"created_at":"2026-07-05T06:49:03.914987+00:00","updated_at":"2026-07-05T06:49:03.914987+00:00"}