{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UY3VZVBZQEHIU4PPA5CTX4AX65","short_pith_number":"pith:UY3VZVBZ","schema_version":"1.0","canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","source":{"kind":"arxiv","id":"1708.09686","version":7},"attestation_state":"computed","paper":{"title":"Structural properties of biclique graphs and the distance formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Leandro Montero, Marina Groshaus","submitted_at":"2017-08-31T12:47:35Z","abstract_excerpt":"A \\textit{biclique} is a maximal induced complete bipartite subgraph of $G$. The \\textit{biclique graph} of a graph $G$, denoted by $KB(G)$, is the intersection graph of the family of all bicliques of $G$. In this work we study some structural properties of biclique graphs which are necessary conditions for a graph to be a biclique graph. In particular, we prove that for biclique graphs that are neither a $K_3$ nor a \\textit{diamond}, the number of vertices of degree $2$ is less than half the number of vertices in the graph. Also, we present forbidden structures. For this, we introduce a natur"},"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":"1708.09686","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-31T12:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"4d4e683b6e80a529f5525bb0a9ee0f1b1a8986a2faf3f3b5068d61b786eb331a","abstract_canon_sha256":"3fd22a72ed298224d86b6baf3296f68d67560a536d5f99ca9204e616a3a51107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:35.927514Z","signature_b64":"cSesIxQGM0YF0N3bSVTEkndlaqcNI9W+YozPMBEY4KC+oy7et7Okh389hYQ7DmlrJf99AjWqUDpBIUVfs4N6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","last_reissued_at":"2026-07-05T03:10:35.927097Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:35.927097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural properties of biclique graphs and the distance formula","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Leandro Montero, Marina Groshaus","submitted_at":"2017-08-31T12:47:35Z","abstract_excerpt":"A \\textit{biclique} is a maximal induced complete bipartite subgraph of $G$. The \\textit{biclique graph} of a graph $G$, denoted by $KB(G)$, is the intersection graph of the family of all bicliques of $G$. In this work we study some structural properties of biclique graphs which are necessary conditions for a graph to be a biclique graph. In particular, we prove that for biclique graphs that are neither a $K_3$ nor a \\textit{diamond}, the number of vertices of degree $2$ is less than half the number of vertices in the graph. Also, we present forbidden structures. For this, we introduce a natur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09686","kind":"arxiv","version":7},"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/1708.09686/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":"1708.09686","created_at":"2026-07-05T03:10:35.927152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09686v7","created_at":"2026-07-05T03:10:35.927152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09686","created_at":"2026-07-05T03:10:35.927152+00:00"},{"alias_kind":"pith_short_12","alias_value":"UY3VZVBZQEHI","created_at":"2026-07-05T03:10:35.927152+00:00"},{"alias_kind":"pith_short_16","alias_value":"UY3VZVBZQEHIU4PP","created_at":"2026-07-05T03:10:35.927152+00:00"},{"alias_kind":"pith_short_8","alias_value":"UY3VZVBZ","created_at":"2026-07-05T03:10:35.927152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.06656","citing_title":"On the edge-biclique graph and the iterated edge-biclique operator","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65","json":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65.json","graph_json":"https://pith.science/api/pith-number/UY3VZVBZQEHIU4PPA5CTX4AX65/graph.json","events_json":"https://pith.science/api/pith-number/UY3VZVBZQEHIU4PPA5CTX4AX65/events.json","paper":"https://pith.science/paper/UY3VZVBZ"},"agent_actions":{"view_html":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65","download_json":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65.json","view_paper":"https://pith.science/paper/UY3VZVBZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09686&json=true","fetch_graph":"https://pith.science/api/pith-number/UY3VZVBZQEHIU4PPA5CTX4AX65/graph.json","fetch_events":"https://pith.science/api/pith-number/UY3VZVBZQEHIU4PPA5CTX4AX65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/action/storage_attestation","attest_author":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/action/author_attestation","sign_citation":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/action/citation_signature","submit_replication":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/action/replication_record"}},"created_at":"2026-07-05T03:10:35.927152+00:00","updated_at":"2026-07-05T03:10:35.927152+00:00"}