{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:34BMLBANLRCE7LNYPXYFDDN747","short_pith_number":"pith:34BMLBAN","canonical_record":{"source":{"id":"1307.4629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T13:44:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c50028a2c060c953624695153c5402f4a1414e777ed11e89e51387da4e04047f","abstract_canon_sha256":"235553f95c046f9e2b1c6ee9062642facb26438d97408b4152519ffded046244"},"schema_version":"1.0"},"canonical_sha256":"df02c5840d5c444fadb87df0518dbfe7dd57dfc6c18343d21f2efbf627ea4a82","source":{"kind":"arxiv","id":"1307.4629","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4629","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4629v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4629","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"34BMLBANLRCE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"34BMLBANLRCE7LNY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"34BMLBAN","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:34BMLBANLRCE7LNYPXYFDDN747","target":"record","payload":{"canonical_record":{"source":{"id":"1307.4629","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T13:44:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c50028a2c060c953624695153c5402f4a1414e777ed11e89e51387da4e04047f","abstract_canon_sha256":"235553f95c046f9e2b1c6ee9062642facb26438d97408b4152519ffded046244"},"schema_version":"1.0"},"canonical_sha256":"df02c5840d5c444fadb87df0518dbfe7dd57dfc6c18343d21f2efbf627ea4a82","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:17.479003Z","signature_b64":"02Cm6VEqtUgSS8Op2EN+nlgxNY1cWJV++UYZgA/caRWDRJZONCkx8mvJQ2nFTrcwSbz/bWytyHa/DIXc/nSeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df02c5840d5c444fadb87df0518dbfe7dd57dfc6c18343d21f2efbf627ea4a82","last_reissued_at":"2026-05-18T03:18:17.478380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:17.478380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.4629","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-18T03:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nyjGZpZ9zuL31KwzOI02lMbD5W9zoPMaJ45vmIeTVsfTenLB5+P+8DMgJ0UZPy+nnSlnBN+Y7vdltrrBNwNeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:46:02.214803Z"},"content_sha256":"a0597b33df45f4845bc306bed719fa843e09261d56765114a1b28cb47557da54","schema_version":"1.0","event_id":"sha256:a0597b33df45f4845bc306bed719fa843e09261d56765114a1b28cb47557da54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:34BMLBANLRCE7LNYPXYFDDN747","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On edge-sets of bicliques in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Juraj Stacho, Marina Groshaus, Pavol Hell","submitted_at":"2013-07-17T13:44:58Z","abstract_excerpt":"A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-sets of all bicliques. We characterize graphs whose edge-biclique hypergraph is conformal (i.e., it is the clique hypergraph of its 2-section) by means of a single forbidden induced obstruction, the triangular prism. Using this result, we characterize graphs whose edge-biclique hypergraph is Helly and provide a polynomial time recognition algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4629","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-18T03:18:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Odns3BdXV1LvrIbrOVkT2M+7g3c7+ydNgAGtWW5q+tlj/Q1K8lv++BtHcEVsNphhfwiGKS6H+5ocoysIcIleBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:46:02.215496Z"},"content_sha256":"e8f24aad540ef58eb4d4a253068f4d690fbdb0b7fd436288285cd90e3ec7b0a7","schema_version":"1.0","event_id":"sha256:e8f24aad540ef58eb4d4a253068f4d690fbdb0b7fd436288285cd90e3ec7b0a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/34BMLBANLRCE7LNYPXYFDDN747/bundle.json","state_url":"https://pith.science/pith/34BMLBANLRCE7LNYPXYFDDN747/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/34BMLBANLRCE7LNYPXYFDDN747/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-25T09:46:02Z","links":{"resolver":"https://pith.science/pith/34BMLBANLRCE7LNYPXYFDDN747","bundle":"https://pith.science/pith/34BMLBANLRCE7LNYPXYFDDN747/bundle.json","state":"https://pith.science/pith/34BMLBANLRCE7LNYPXYFDDN747/state.json","well_known_bundle":"https://pith.science/.well-known/pith/34BMLBANLRCE7LNYPXYFDDN747/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:34BMLBANLRCE7LNYPXYFDDN747","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":"235553f95c046f9e2b1c6ee9062642facb26438d97408b4152519ffded046244","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T13:44:58Z","title_canon_sha256":"c50028a2c060c953624695153c5402f4a1414e777ed11e89e51387da4e04047f"},"schema_version":"1.0","source":{"id":"1307.4629","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4629","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4629v1","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4629","created_at":"2026-05-18T03:18:17Z"},{"alias_kind":"pith_short_12","alias_value":"34BMLBANLRCE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"34BMLBANLRCE7LNY","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"34BMLBAN","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:e8f24aad540ef58eb4d4a253068f4d690fbdb0b7fd436288285cd90e3ec7b0a7","target":"graph","created_at":"2026-05-18T03:18:17Z","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 biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the associated edge-biclique hypergraph whose hyperedges are precisely the edge-sets of all bicliques. We characterize graphs whose edge-biclique hypergraph is conformal (i.e., it is the clique hypergraph of its 2-section) by means of a single forbidden induced obstruction, the triangular prism. Using this result, we characterize graphs whose edge-biclique hypergraph is Helly and provide a polynomial time recognition algo","authors_text":"Juraj Stacho, Marina Groshaus, Pavol Hell","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T13:44:58Z","title":"On edge-sets of bicliques in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4629","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:a0597b33df45f4845bc306bed719fa843e09261d56765114a1b28cb47557da54","target":"record","created_at":"2026-05-18T03:18:17Z","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":"235553f95c046f9e2b1c6ee9062642facb26438d97408b4152519ffded046244","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-17T13:44:58Z","title_canon_sha256":"c50028a2c060c953624695153c5402f4a1414e777ed11e89e51387da4e04047f"},"schema_version":"1.0","source":{"id":"1307.4629","kind":"arxiv","version":1}},"canonical_sha256":"df02c5840d5c444fadb87df0518dbfe7dd57dfc6c18343d21f2efbf627ea4a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df02c5840d5c444fadb87df0518dbfe7dd57dfc6c18343d21f2efbf627ea4a82","first_computed_at":"2026-05-18T03:18:17.478380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:17.478380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"02Cm6VEqtUgSS8Op2EN+nlgxNY1cWJV++UYZgA/caRWDRJZONCkx8mvJQ2nFTrcwSbz/bWytyHa/DIXc/nSeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:17.479003Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4629","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a0597b33df45f4845bc306bed719fa843e09261d56765114a1b28cb47557da54","sha256:e8f24aad540ef58eb4d4a253068f4d690fbdb0b7fd436288285cd90e3ec7b0a7"],"state_sha256":"39a7aab6f590a26906b88aa87f606b841a577edcd8718cbf12b15de28df1b347"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kigwkU5pMWwMxHXbm/1Kj/aLlEXgiyjruLGVSkUumzdBvkymqA1VD3f/3Qx34Dr5lud44P91uPdCwypA638yDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:46:02.218860Z","bundle_sha256":"24d7556f006c61de2c6f236082937c5a2f50d8f013726da40043874de6e4ac88"}}