{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UY3VZVBZQEHIU4PPA5CTX4AX65","short_pith_number":"pith:UY3VZVBZ","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"},"canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","source":{"kind":"arxiv","id":"1708.09686","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09686","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09686v7","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09686","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"UY3VZVBZQEHI","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_16","alias_value":"UY3VZVBZQEHIU4PP","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_8","alias_value":"UY3VZVBZ","created_at":"2026-07-05T03:10:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UY3VZVBZQEHIU4PPA5CTX4AX65","target":"record","payload":{"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"},"canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","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"},"source_kind":"arxiv","source_id":"1708.09686","source_version":7,"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-05T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlV+jrZSwbUaVRpL9Zpmxh2OF1YS/ERgl2Y08vAOeGRMLdXO17SFK29tZHkhp/sXrh8qKzlagNf6PIcdFN0jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:49:18.496811Z"},"content_sha256":"64fb587f3db7040875b88e8d8ebd46e8eecea3e8f19a498f459ef04a62aa084c","schema_version":"1.0","event_id":"sha256:64fb587f3db7040875b88e8d8ebd46e8eecea3e8f19a498f459ef04a62aa084c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UY3VZVBZQEHIU4PPA5CTX4AX65","target":"graph","payload":{"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"},"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-05T03:10:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lYWMaz3C9jBjehJbkeMgDrWYwvBnrtYnN8wmvpEZtw40rGu0vesGvLWbULE/8/A4AW7089YaYBi3rLDl5AEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T10:49:18.497325Z"},"content_sha256":"eb31d6016088608e4027ec5d1752e6660a6d963e5e26882e6cacc5f98b20809b","schema_version":"1.0","event_id":"sha256:eb31d6016088608e4027ec5d1752e6660a6d963e5e26882e6cacc5f98b20809b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/bundle.json","state_url":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/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-16T10:49:18Z","links":{"resolver":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65","bundle":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/bundle.json","state":"https://pith.science/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UY3VZVBZQEHIU4PPA5CTX4AX65/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UY3VZVBZQEHIU4PPA5CTX4AX65","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":"3fd22a72ed298224d86b6baf3296f68d67560a536d5f99ca9204e616a3a51107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-31T12:47:35Z","title_canon_sha256":"4d4e683b6e80a529f5525bb0a9ee0f1b1a8986a2faf3f3b5068d61b786eb331a"},"schema_version":"1.0","source":{"id":"1708.09686","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09686","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09686v7","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09686","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_12","alias_value":"UY3VZVBZQEHI","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_16","alias_value":"UY3VZVBZQEHIU4PP","created_at":"2026-07-05T03:10:35Z"},{"alias_kind":"pith_short_8","alias_value":"UY3VZVBZ","created_at":"2026-07-05T03:10:35Z"}],"graph_snapshots":[{"event_id":"sha256:eb31d6016088608e4027ec5d1752e6660a6d963e5e26882e6cacc5f98b20809b","target":"graph","created_at":"2026-07-05T03:10:35Z","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/1708.09686/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Leandro Montero, Marina Groshaus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-31T12:47:35Z","title":"Structural properties of biclique graphs and the distance formula"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09686","kind":"arxiv","version":7},"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:64fb587f3db7040875b88e8d8ebd46e8eecea3e8f19a498f459ef04a62aa084c","target":"record","created_at":"2026-07-05T03:10:35Z","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":"3fd22a72ed298224d86b6baf3296f68d67560a536d5f99ca9204e616a3a51107","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-08-31T12:47:35Z","title_canon_sha256":"4d4e683b6e80a529f5525bb0a9ee0f1b1a8986a2faf3f3b5068d61b786eb331a"},"schema_version":"1.0","source":{"id":"1708.09686","kind":"arxiv","version":7}},"canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6375cd439810e8a71ef07453bf017f75101102ef5fd50334d83d2a1bcbc9189","first_computed_at":"2026-07-05T03:10:35.927097Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:10:35.927097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cSesIxQGM0YF0N3bSVTEkndlaqcNI9W+YozPMBEY4KC+oy7et7Okh389hYQ7DmlrJf99AjWqUDpBIUVfs4N6BA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:10:35.927514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09686","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64fb587f3db7040875b88e8d8ebd46e8eecea3e8f19a498f459ef04a62aa084c","sha256:eb31d6016088608e4027ec5d1752e6660a6d963e5e26882e6cacc5f98b20809b"],"state_sha256":"263f4545b93a330b60f976e4d328b7c877439bce429f6da364a55c30a4d4f785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZPPsOY/EZh6WQE8D0ytnAO2u2zr9AwolivCa1Qps0A+TSSyCgqBmQfWKPc/nSq2RFS51Lm2GVML9tXfxJT7KCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T10:49:18.502682Z","bundle_sha256":"de7c3ca5942522fe4cac9bf2e2b40f073955a154887add39daf37e10e028cd77"}}