{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ZWIOX5YYZP2L6D6BS63KWL3PJX","short_pith_number":"pith:ZWIOX5YY","canonical_record":{"source":{"id":"1903.01538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T21:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"dbed486f02645b45d1e31c66e7b3c0ea33e04598f488e9f0e9cce603b062d3a0","abstract_canon_sha256":"4a562f8c72e8bb330ed43eaaa259337431c44dd1aa233c9ffa7a8f7079aa2627"},"schema_version":"1.0"},"canonical_sha256":"cd90ebf718cbf4bf0fc197b6ab2f6f4df543d725a5ff94699ff17e0f6585d2ea","source":{"kind":"arxiv","id":"1903.01538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01538","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01538v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01538","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZWIOX5YYZP2L","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZWIOX5YYZP2L6D6B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZWIOX5YY","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ZWIOX5YYZP2L6D6BS63KWL3PJX","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01538","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T21:07:26Z","cross_cats_sorted":[],"title_canon_sha256":"dbed486f02645b45d1e31c66e7b3c0ea33e04598f488e9f0e9cce603b062d3a0","abstract_canon_sha256":"4a562f8c72e8bb330ed43eaaa259337431c44dd1aa233c9ffa7a8f7079aa2627"},"schema_version":"1.0"},"canonical_sha256":"cd90ebf718cbf4bf0fc197b6ab2f6f4df543d725a5ff94699ff17e0f6585d2ea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:00.372263Z","signature_b64":"dqm08yDNYkD+9tcYfOw9MWVFmz9DK/1C6hnEQKeMOLVTsGWsDTT3CCvpbiViFxXCVwxbFaAEzKIbRxKDbf1cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd90ebf718cbf4bf0fc197b6ab2f6f4df543d725a5ff94699ff17e0f6585d2ea","last_reissued_at":"2026-05-17T23:52:00.371862Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:00.371862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01538","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-05-17T23:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Bu8WQHepOxVJ7rmC+1HElLMHd+iVKSPzdrLQfLzNVxpCBjxKhUE2vB+9dqMPS7bg5inML3dEKEsP7goX7+YBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:28:43.003606Z"},"content_sha256":"5415d300c38e2a2cda1a3d4fa27c47d1f53f00ea8ff1f89eabb8a5ffe90fb9ed","schema_version":"1.0","event_id":"sha256:5415d300c38e2a2cda1a3d4fa27c47d1f53f00ea8ff1f89eabb8a5ffe90fb9ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ZWIOX5YYZP2L6D6BS63KWL3PJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Biclique Mining in Near-Bipartite Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew van der Poel, Blair D. Sullivan, Trey Woodlief","submitted_at":"2019-03-04T21:07:26Z","abstract_excerpt":"Identifying dense bipartite subgraphs is a common graph data mining task. Many applications focus on the enumeration of all maximal bicliques (MBs), though sometimes the stricter variant of maximal induced bicliques (MIBs) is of interest. Recent work of Kloster et al. introduced a MIB-enumeration approach designed for \"near-bipartite\" graphs, where the runtime is parameterized by the size k of an odd cycle transversal (OCT), a vertex set whose deletion results in a bipartite graph. Their algorithm was shown to outperform the previously best known algorithm even when k was logarithmic in |V|. I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01538","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":""},"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-17T23:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpMiVtoUe/S3jaFxXz+avs2L3dc/l7gsjqqS/r3AjsLTKSdijWXpzQVVwV9ORtdhpsF3iHjIcvWCR66t3h1hDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:28:43.003946Z"},"content_sha256":"79c56df730c49062993b5fb28ae27fbbd41f045b1a9004064485f91fdd04162d","schema_version":"1.0","event_id":"sha256:79c56df730c49062993b5fb28ae27fbbd41f045b1a9004064485f91fdd04162d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/bundle.json","state_url":"https://pith.science/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/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-25T08:28:43Z","links":{"resolver":"https://pith.science/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX","bundle":"https://pith.science/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/bundle.json","state":"https://pith.science/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWIOX5YYZP2L6D6BS63KWL3PJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ZWIOX5YYZP2L6D6BS63KWL3PJX","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":"4a562f8c72e8bb330ed43eaaa259337431c44dd1aa233c9ffa7a8f7079aa2627","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T21:07:26Z","title_canon_sha256":"dbed486f02645b45d1e31c66e7b3c0ea33e04598f488e9f0e9cce603b062d3a0"},"schema_version":"1.0","source":{"id":"1903.01538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01538","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01538v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01538","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"ZWIOX5YYZP2L","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"ZWIOX5YYZP2L6D6B","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"ZWIOX5YY","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:79c56df730c49062993b5fb28ae27fbbd41f045b1a9004064485f91fdd04162d","target":"graph","created_at":"2026-05-17T23:52:00Z","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":"Identifying dense bipartite subgraphs is a common graph data mining task. Many applications focus on the enumeration of all maximal bicliques (MBs), though sometimes the stricter variant of maximal induced bicliques (MIBs) is of interest. Recent work of Kloster et al. introduced a MIB-enumeration approach designed for \"near-bipartite\" graphs, where the runtime is parameterized by the size k of an odd cycle transversal (OCT), a vertex set whose deletion results in a bipartite graph. Their algorithm was shown to outperform the previously best known algorithm even when k was logarithmic in |V|. I","authors_text":"Andrew van der Poel, Blair D. Sullivan, Trey Woodlief","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T21:07:26Z","title":"Faster Biclique Mining in Near-Bipartite Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01538","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:5415d300c38e2a2cda1a3d4fa27c47d1f53f00ea8ff1f89eabb8a5ffe90fb9ed","target":"record","created_at":"2026-05-17T23:52:00Z","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":"4a562f8c72e8bb330ed43eaaa259337431c44dd1aa233c9ffa7a8f7079aa2627","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-03-04T21:07:26Z","title_canon_sha256":"dbed486f02645b45d1e31c66e7b3c0ea33e04598f488e9f0e9cce603b062d3a0"},"schema_version":"1.0","source":{"id":"1903.01538","kind":"arxiv","version":1}},"canonical_sha256":"cd90ebf718cbf4bf0fc197b6ab2f6f4df543d725a5ff94699ff17e0f6585d2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd90ebf718cbf4bf0fc197b6ab2f6f4df543d725a5ff94699ff17e0f6585d2ea","first_computed_at":"2026-05-17T23:52:00.371862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:00.371862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqm08yDNYkD+9tcYfOw9MWVFmz9DK/1C6hnEQKeMOLVTsGWsDTT3CCvpbiViFxXCVwxbFaAEzKIbRxKDbf1cAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:00.372263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5415d300c38e2a2cda1a3d4fa27c47d1f53f00ea8ff1f89eabb8a5ffe90fb9ed","sha256:79c56df730c49062993b5fb28ae27fbbd41f045b1a9004064485f91fdd04162d"],"state_sha256":"4b13d316219c4fcbaa2a7d9026948952b7b418a0d38e025eadb930c7c7f52b11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NZGKVxlZrQK4Pt1LqBITFzJpjLLKZs49Czb4j1EvTrflhIFRegpIm5bKWxkJGM5iMJmnWBAaoterJrkjXYLgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:28:43.005900Z","bundle_sha256":"249969197119bc573056e5744ba55feb703e978d378ce661717f47b56944ca7e"}}