{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5KEXK5WFXXEGK7XQQXI5GRBHAE","short_pith_number":"pith:5KEXK5WF","schema_version":"1.0","canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","source":{"kind":"arxiv","id":"1510.06883","version":1},"attestation_state":"computed","paper":{"title":"On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Nicola Apollonio, Paolo Giulio Franciosa","submitted_at":"2015-10-23T10:35:14Z","abstract_excerpt":"The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs.\\ Graphs in both the latter classes have linearly many maximal bicliques, implying the existence of polynomial-time algorithms for computing the associated Galois lattice.\\ Such a lattice can indeed be built in $O(m\\times n)$ worst case-time for a domino-free graph with $m$ edges and $n$ vertices.\\ In this paper we give a sharp estimate on the number of the maximal bicliques of BDH graphs and exploit such result to give an $O(m)$ worst case time algorithm for c"},"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":"1510.06883","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-23T10:35:14Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"4d5d62a8e86a01d1c35b0d4aad28135e4a4fc47c9e6072d6727f7c47bbc36b43","abstract_canon_sha256":"89b92dc60bddd8eed0bfb2b5e03622d6560deae073e786444f88b370a5d96d7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:22.808190Z","signature_b64":"ehpEa6W5XG9QQBrCp0OwBQ62ztL6G10KKAQjtGFDrE3eNfmgbZXJXepnworPGt3uYU0emGzaizbJ258s3JfRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","last_reissued_at":"2026-05-18T01:29:22.807530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:22.807530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Nicola Apollonio, Paolo Giulio Franciosa","submitted_at":"2015-10-23T10:35:14Z","abstract_excerpt":"The class of Bipartite Distance Hereditary (BDH) graphs is the intersection between bipartite domino-free and chordal bipartite graphs.\\ Graphs in both the latter classes have linearly many maximal bicliques, implying the existence of polynomial-time algorithms for computing the associated Galois lattice.\\ Such a lattice can indeed be built in $O(m\\times n)$ worst case-time for a domino-free graph with $m$ edges and $n$ vertices.\\ In this paper we give a sharp estimate on the number of the maximal bicliques of BDH graphs and exploit such result to give an $O(m)$ worst case time algorithm for c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06883","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.06883","created_at":"2026-05-18T01:29:22.807639+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06883v1","created_at":"2026-05-18T01:29:22.807639+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06883","created_at":"2026-05-18T01:29:22.807639+00:00"},{"alias_kind":"pith_short_12","alias_value":"5KEXK5WFXXEG","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"5KEXK5WFXXEGK7XQ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"5KEXK5WF","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE","json":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE.json","graph_json":"https://pith.science/api/pith-number/5KEXK5WFXXEGK7XQQXI5GRBHAE/graph.json","events_json":"https://pith.science/api/pith-number/5KEXK5WFXXEGK7XQQXI5GRBHAE/events.json","paper":"https://pith.science/paper/5KEXK5WF"},"agent_actions":{"view_html":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE","download_json":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE.json","view_paper":"https://pith.science/paper/5KEXK5WF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06883&json=true","fetch_graph":"https://pith.science/api/pith-number/5KEXK5WFXXEGK7XQQXI5GRBHAE/graph.json","fetch_events":"https://pith.science/api/pith-number/5KEXK5WFXXEGK7XQQXI5GRBHAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/action/storage_attestation","attest_author":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/action/author_attestation","sign_citation":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/action/citation_signature","submit_replication":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/action/replication_record"}},"created_at":"2026-05-18T01:29:22.807639+00:00","updated_at":"2026-05-18T01:29:22.807639+00:00"}