{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3H2MBGTMBA2ZI23K3HWAKNDXE4","short_pith_number":"pith:3H2MBGTM","canonical_record":{"source":{"id":"1510.01165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-05T14:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"11d2005b7f04b3abaad11c3ff8fa7143623095898efdb4e44411412c51045dab","abstract_canon_sha256":"87fb76cd58d9c82077f025b7eeb092b56f97b6c7f1d556a40ddd6c17947a987a"},"schema_version":"1.0"},"canonical_sha256":"d9f4c09a6c0835946b6ad9ec053477272e5d56bb335fbc4676025974ecea236c","source":{"kind":"arxiv","id":"1510.01165","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01165","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01165v2","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01165","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"3H2MBGTMBA2Z","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3H2MBGTMBA2ZI23K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3H2MBGTM","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3H2MBGTMBA2ZI23K3HWAKNDXE4","target":"record","payload":{"canonical_record":{"source":{"id":"1510.01165","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-05T14:22:16Z","cross_cats_sorted":[],"title_canon_sha256":"11d2005b7f04b3abaad11c3ff8fa7143623095898efdb4e44411412c51045dab","abstract_canon_sha256":"87fb76cd58d9c82077f025b7eeb092b56f97b6c7f1d556a40ddd6c17947a987a"},"schema_version":"1.0"},"canonical_sha256":"d9f4c09a6c0835946b6ad9ec053477272e5d56bb335fbc4676025974ecea236c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:06.689228Z","signature_b64":"op+bFzPS/N7wzpaoEIySxF0Vm6Q4XH+bZd+QallPGTYzpuOXsqDvlX3PjDgPJJqf61A6ZoenVenmn12aUkYRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9f4c09a6c0835946b6ad9ec053477272e5d56bb335fbc4676025974ecea236c","last_reissued_at":"2026-05-18T01:15:06.688562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:06.688562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.01165","source_version":2,"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-18T01:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUZS9KVVaBfpDhXTejQLpPi62OaeTlLswu/1M8Lu4SitL836J2hcXP675uXxl4hR7rfs5nvPqcHgduRtBVYTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:26.748761Z"},"content_sha256":"b785e50a3f6bb88c2c1872156af5e228c1195fe3a890af725f7cb9c69fc6a8a7","schema_version":"1.0","event_id":"sha256:b785e50a3f6bb88c2c1872156af5e228c1195fe3a890af725f7cb9c69fc6a8a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3H2MBGTMBA2ZI23K3HWAKNDXE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight lower bounds on the number of bicliques in false-twin-free graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Leandro Montero, Marina Groshaus","submitted_at":"2015-10-05T14:22:16Z","abstract_excerpt":"A \\emph{biclique} is a maximal bipartite complete induced subgraph of $G$. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data analysis. Associated with this issue, bounds on the maximum number of bicliques were given. In this paper we study bounds on the minimun number of bicliques of a graph. Since adding false-twin vertices to $G$ does not change the number of bicliques, we restrict to false-twin-free graphs. We give a tight lower bound on the minimum number bicliques fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01165","kind":"arxiv","version":2},"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-18T01:15:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKepxZDQjgDLGshhOF0G93VJnal2BuD+p/MxpTNViHUvZ3RR6mxxQWSv0yAzLWfYxtfi/KB4r3Xds0aQP8tfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:17:26.749417Z"},"content_sha256":"196dff0ecac7847fe208c90c6bd49ddc2a1b9fe44a112775bb08b05ee3905c2f","schema_version":"1.0","event_id":"sha256:196dff0ecac7847fe208c90c6bd49ddc2a1b9fe44a112775bb08b05ee3905c2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/bundle.json","state_url":"https://pith.science/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/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-05-25T22:17:26Z","links":{"resolver":"https://pith.science/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4","bundle":"https://pith.science/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/bundle.json","state":"https://pith.science/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3H2MBGTMBA2ZI23K3HWAKNDXE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3H2MBGTMBA2ZI23K3HWAKNDXE4","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":"87fb76cd58d9c82077f025b7eeb092b56f97b6c7f1d556a40ddd6c17947a987a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-05T14:22:16Z","title_canon_sha256":"11d2005b7f04b3abaad11c3ff8fa7143623095898efdb4e44411412c51045dab"},"schema_version":"1.0","source":{"id":"1510.01165","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.01165","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"arxiv_version","alias_value":"1510.01165v2","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.01165","created_at":"2026-05-18T01:15:06Z"},{"alias_kind":"pith_short_12","alias_value":"3H2MBGTMBA2Z","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3H2MBGTMBA2ZI23K","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3H2MBGTM","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:196dff0ecac7847fe208c90c6bd49ddc2a1b9fe44a112775bb08b05ee3905c2f","target":"graph","created_at":"2026-05-18T01:15:06Z","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":"A \\emph{biclique} is a maximal bipartite complete induced subgraph of $G$. Bicliques have been studied in the last years motivated by the large number of applications. In particular, enumeration of the maximal bicliques has been of interest in data analysis. Associated with this issue, bounds on the maximum number of bicliques were given. In this paper we study bounds on the minimun number of bicliques of a graph. Since adding false-twin vertices to $G$ does not change the number of bicliques, we restrict to false-twin-free graphs. We give a tight lower bound on the minimum number bicliques fo","authors_text":"Leandro Montero, Marina Groshaus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-05T14:22:16Z","title":"Tight lower bounds on the number of bicliques in false-twin-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01165","kind":"arxiv","version":2},"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:b785e50a3f6bb88c2c1872156af5e228c1195fe3a890af725f7cb9c69fc6a8a7","target":"record","created_at":"2026-05-18T01:15:06Z","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":"87fb76cd58d9c82077f025b7eeb092b56f97b6c7f1d556a40ddd6c17947a987a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-05T14:22:16Z","title_canon_sha256":"11d2005b7f04b3abaad11c3ff8fa7143623095898efdb4e44411412c51045dab"},"schema_version":"1.0","source":{"id":"1510.01165","kind":"arxiv","version":2}},"canonical_sha256":"d9f4c09a6c0835946b6ad9ec053477272e5d56bb335fbc4676025974ecea236c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9f4c09a6c0835946b6ad9ec053477272e5d56bb335fbc4676025974ecea236c","first_computed_at":"2026-05-18T01:15:06.688562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:06.688562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"op+bFzPS/N7wzpaoEIySxF0Vm6Q4XH+bZd+QallPGTYzpuOXsqDvlX3PjDgPJJqf61A6ZoenVenmn12aUkYRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:06.689228Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.01165","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b785e50a3f6bb88c2c1872156af5e228c1195fe3a890af725f7cb9c69fc6a8a7","sha256:196dff0ecac7847fe208c90c6bd49ddc2a1b9fe44a112775bb08b05ee3905c2f"],"state_sha256":"1fa85f0b2e2aceea7b77d299ce00dc9ac86b729897ded5867fb08f7c69d1e1e8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UnfUhunu+U3LoDnXGBzT3IU/rz1g+WDcSAmMeMvq6z8e/597DLHioEatiY0x49awrXm3dqLvV4hjRrtTgOxkAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:17:26.752486Z","bundle_sha256":"92936d4574647167e1fd91677ee8686fdd73392eb6bbe36cfa802617df519b8d"}}