{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5KEXK5WFXXEGK7XQQXI5GRBHAE","short_pith_number":"pith:5KEXK5WF","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"},"canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","source":{"kind":"arxiv","id":"1510.06883","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06883","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06883v1","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06883","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"5KEXK5WFXXEG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5KEXK5WFXXEGK7XQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5KEXK5WF","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5KEXK5WFXXEGK7XQQXI5GRBHAE","target":"record","payload":{"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"},"canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","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"},"source_kind":"arxiv","source_id":"1510.06883","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-18T01:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9mqaRxPeqATqTt32CWBFKQA0f31cHO4hJL2JVDoKYof99Xivxpq67iLq4eaZkqE006SLxIdFEVIDFfp9q/koAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:54:42.033559Z"},"content_sha256":"f5a488863f976b73f76f21faa4583fb9008635a588a5b6c5ecc2bbd1ce81ba18","schema_version":"1.0","event_id":"sha256:f5a488863f976b73f76f21faa4583fb9008635a588a5b6c5ecc2bbd1ce81ba18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5KEXK5WFXXEGK7XQQXI5GRBHAE","target":"graph","payload":{"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"},"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:29:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f+a2TWP8K9BujKEScDxDfxNjnjoenRFgioyCYwaTDFWD8tm1lpUAXvDBzMtMmRugNdL6Kn8UGQvAyc4k7Wj4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:54:42.034246Z"},"content_sha256":"150318390e867c87f7e68b16d58d48e9979a94105a5666c6686ef7e473c6092e","schema_version":"1.0","event_id":"sha256:150318390e867c87f7e68b16d58d48e9979a94105a5666c6686ef7e473c6092e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/bundle.json","state_url":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/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-30T18:54:42Z","links":{"resolver":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE","bundle":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/bundle.json","state":"https://pith.science/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5KEXK5WFXXEGK7XQQXI5GRBHAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5KEXK5WFXXEGK7XQQXI5GRBHAE","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":"89b92dc60bddd8eed0bfb2b5e03622d6560deae073e786444f88b370a5d96d7e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-23T10:35:14Z","title_canon_sha256":"4d5d62a8e86a01d1c35b0d4aad28135e4a4fc47c9e6072d6727f7c47bbc36b43"},"schema_version":"1.0","source":{"id":"1510.06883","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06883","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06883v1","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06883","created_at":"2026-05-18T01:29:22Z"},{"alias_kind":"pith_short_12","alias_value":"5KEXK5WFXXEG","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5KEXK5WFXXEGK7XQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5KEXK5WF","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:150318390e867c87f7e68b16d58d48e9979a94105a5666c6686ef7e473c6092e","target":"graph","created_at":"2026-05-18T01:29:22Z","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":"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","authors_text":"Nicola Apollonio, Paolo Giulio Franciosa","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-23T10:35:14Z","title":"On Computing the Galois Lattice of Bipartite Distance Hereditary Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06883","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:f5a488863f976b73f76f21faa4583fb9008635a588a5b6c5ecc2bbd1ce81ba18","target":"record","created_at":"2026-05-18T01:29:22Z","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":"89b92dc60bddd8eed0bfb2b5e03622d6560deae073e786444f88b370a5d96d7e","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-10-23T10:35:14Z","title_canon_sha256":"4d5d62a8e86a01d1c35b0d4aad28135e4a4fc47c9e6072d6727f7c47bbc36b43"},"schema_version":"1.0","source":{"id":"1510.06883","kind":"arxiv","version":1}},"canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea897576c5bdc8657ef085d1d3442701217fca93d22141d291bea57932772b23","first_computed_at":"2026-05-18T01:29:22.807530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:22.807530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ehpEa6W5XG9QQBrCp0OwBQ62ztL6G10KKAQjtGFDrE3eNfmgbZXJXepnworPGt3uYU0emGzaizbJ258s3JfRDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:22.808190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06883","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5a488863f976b73f76f21faa4583fb9008635a588a5b6c5ecc2bbd1ce81ba18","sha256:150318390e867c87f7e68b16d58d48e9979a94105a5666c6686ef7e473c6092e"],"state_sha256":"13858a02b4d37cb473579467b44e308cc0d33142adc2a9f884cf63f93c32cf5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ZL7QDrNXxNvMzUYIqrzqwiDKQQoe+Vl6dax9Xbu6pLfj60lu3ILTgzER3+yBLQUpdOJPzSWaY49BINLyGsYDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:54:42.038955Z","bundle_sha256":"6b3ada010c0243e40d587bf6dfc204bf878760ae2d8edaaabd76232d49af15f7"}}