{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BOE6IJPK57LOSYD52GV7DMN4WR","short_pith_number":"pith:BOE6IJPK","schema_version":"1.0","canonical_sha256":"0b89e425eaefd6e9607dd1abf1b1bcb4439721a0395dce8e1be0a96fbae9207d","source":{"kind":"arxiv","id":"1012.0742","version":1},"attestation_state":"computed","paper":{"title":"Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.LO"],"primary_cat":"cs.AI","authors_text":"Cristina T\\^irn\\u{a}uc\\u{a}, Jos\\'e L. Balc\\'azar","submitted_at":"2010-12-03T13:57:32Z","abstract_excerpt":"The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice."},"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":"1012.0742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-12-03T13:57:32Z","cross_cats_sorted":["cs.LG","math.LO"],"title_canon_sha256":"e20a9a73f8e827258338697f14db8ef2859a3e23fc156bc662b9c5ffb7a9e445","abstract_canon_sha256":"e2af0d50781743c3443017d55f7817780f836a2bc8117bbc414dec0b38d53e4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:09.532738Z","signature_b64":"CJ6lA3J9Ein7sVaDSaesKxwxmtkeURuGcxQ0Gs1mhtjsDAkBKD7yE5CMJZKsH12MZUI0Fwk2mGkN9TW7qZYJDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b89e425eaefd6e9607dd1abf1b1bcb4439721a0395dce8e1be0a96fbae9207d","last_reissued_at":"2026-05-18T04:34:09.532366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:09.532366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.LO"],"primary_cat":"cs.AI","authors_text":"Cristina T\\^irn\\u{a}uc\\u{a}, Jos\\'e L. Balc\\'azar","submitted_at":"2010-12-03T13:57:32Z","abstract_excerpt":"The Border algorithm and the iPred algorithm find the Hasse diagrams of FCA lattices. We show that they can be generalized to arbitrary lattices. In the case of iPred, this requires the identification of a join-semilattice homomorphism into a distributive lattice."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0742","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":"1012.0742","created_at":"2026-05-18T04:34:09.532430+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0742v1","created_at":"2026-05-18T04:34:09.532430+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0742","created_at":"2026-05-18T04:34:09.532430+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOE6IJPK57LO","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOE6IJPK57LOSYD5","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOE6IJPK","created_at":"2026-05-18T12:26:05.355336+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/BOE6IJPK57LOSYD52GV7DMN4WR","json":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR.json","graph_json":"https://pith.science/api/pith-number/BOE6IJPK57LOSYD52GV7DMN4WR/graph.json","events_json":"https://pith.science/api/pith-number/BOE6IJPK57LOSYD52GV7DMN4WR/events.json","paper":"https://pith.science/paper/BOE6IJPK"},"agent_actions":{"view_html":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR","download_json":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR.json","view_paper":"https://pith.science/paper/BOE6IJPK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0742&json=true","fetch_graph":"https://pith.science/api/pith-number/BOE6IJPK57LOSYD52GV7DMN4WR/graph.json","fetch_events":"https://pith.science/api/pith-number/BOE6IJPK57LOSYD52GV7DMN4WR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR/action/storage_attestation","attest_author":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR/action/author_attestation","sign_citation":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR/action/citation_signature","submit_replication":"https://pith.science/pith/BOE6IJPK57LOSYD52GV7DMN4WR/action/replication_record"}},"created_at":"2026-05-18T04:34:09.532430+00:00","updated_at":"2026-05-18T04:34:09.532430+00:00"}