{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:FCQMQUVA4RUHGKLQUQJ35THPUG","short_pith_number":"pith:FCQMQUVA","schema_version":"1.0","canonical_sha256":"28a0c852a0e468732970a413beccefa1aeb76f20ddc6cf29033c21596461db93","source":{"kind":"arxiv","id":"1110.5805","version":3},"attestation_state":"computed","paper":{"title":"Ordered direct implicational basis of a finite closure system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.RA"],"primary_cat":"math.CO","authors_text":"J.B. Nation, Kira Adaricheva, Robert Rand","submitted_at":"2011-10-26T14:47:29Z","abstract_excerpt":"Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of implications that allows one to compute the closure of an arbitrary set by a single iteration. This property"},"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":"1110.5805","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-26T14:47:29Z","cross_cats_sorted":["cs.LO","math.RA"],"title_canon_sha256":"bea62ba8ff5c454ba215788df0100025acecd5f33c96c088f29d251419f27805","abstract_canon_sha256":"a8621edc0b67f9ca95f4d1df0581a41cda0bb2d780d8c4d99a46f08430f29a48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:59.445629Z","signature_b64":"4oIYSgAX6Qh5UKrnzzQd4sPzp71du6hZZONUCr3dB92S/udbcgqdMgURJso1urCl594hgGecyEj6/1jZzPzoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"28a0c852a0e468732970a413beccefa1aeb76f20ddc6cf29033c21596461db93","last_reissued_at":"2026-05-18T03:00:59.444752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:59.444752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ordered direct implicational basis of a finite closure system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.RA"],"primary_cat":"math.CO","authors_text":"J.B. Nation, Kira Adaricheva, Robert Rand","submitted_at":"2011-10-26T14:47:29Z","abstract_excerpt":"Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have long existed in lattice theory. We present this approach by describing the so-called D-basis and introducing the concept of ordered direct basis of an implicational system. A direct basis of a closure operator, or an implicational system, is a set of implications that allows one to compute the closure of an arbitrary set by a single iteration. This property"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.5805","kind":"arxiv","version":3},"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":"1110.5805","created_at":"2026-05-18T03:00:59.444899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.5805v3","created_at":"2026-05-18T03:00:59.444899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.5805","created_at":"2026-05-18T03:00:59.444899+00:00"},{"alias_kind":"pith_short_12","alias_value":"FCQMQUVA4RUH","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"FCQMQUVA4RUHGKLQ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"FCQMQUVA","created_at":"2026-05-18T12:26:28.662955+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/FCQMQUVA4RUHGKLQUQJ35THPUG","json":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG.json","graph_json":"https://pith.science/api/pith-number/FCQMQUVA4RUHGKLQUQJ35THPUG/graph.json","events_json":"https://pith.science/api/pith-number/FCQMQUVA4RUHGKLQUQJ35THPUG/events.json","paper":"https://pith.science/paper/FCQMQUVA"},"agent_actions":{"view_html":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG","download_json":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG.json","view_paper":"https://pith.science/paper/FCQMQUVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.5805&json=true","fetch_graph":"https://pith.science/api/pith-number/FCQMQUVA4RUHGKLQUQJ35THPUG/graph.json","fetch_events":"https://pith.science/api/pith-number/FCQMQUVA4RUHGKLQUQJ35THPUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG/action/storage_attestation","attest_author":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG/action/author_attestation","sign_citation":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG/action/citation_signature","submit_replication":"https://pith.science/pith/FCQMQUVA4RUHGKLQUQJ35THPUG/action/replication_record"}},"created_at":"2026-05-18T03:00:59.444899+00:00","updated_at":"2026-05-18T03:00:59.444899+00:00"}