{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WRTQEWKVLR7ZMBOBCKTWZHBVJO","short_pith_number":"pith:WRTQEWKV","schema_version":"1.0","canonical_sha256":"b4670259555c7f9605c112a76c9c354bbf1393dd825cf2776a74480cdac095e9","source":{"kind":"arxiv","id":"1205.3236","version":5},"attestation_state":"computed","paper":{"title":"Optimum basis of finite convex geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.OC","authors_text":"Kira Adaricheva","submitted_at":"2012-05-15T02:08:31Z","abstract_excerpt":"Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right sides (conclusions) of binary implications and left sides (premises) of non-binary ones. The right sides of non-binary implications can also be optimized, when the convex geometry either satisfies the Carousel property, or does not have $D$-cycles. The latter generalizes a result of P.L.~Hammer and A.~Kogan for acyclic Horn Boolean functions. Convex geometries "},"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":"1205.3236","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-05-15T02:08:31Z","cross_cats_sorted":["math.RA"],"title_canon_sha256":"27c0ac96122ef71d30a1203f50ce11137c32baad53f791246b0feb191c0c1dc7","abstract_canon_sha256":"6c43121ec3754cdd2226bc46b709fea358eed51ff591b3ba109c280cd55efc5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:39.815574Z","signature_b64":"C5Sud6zrqEvfn87r/Wq+y46vjabpnkQPdlvSMtv+MYjTX48XIFp9fWrWK9+raR/8ySGQNjcA77LRdm/KwTzPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4670259555c7f9605c112a76c9c354bbf1393dd825cf2776a74480cdac095e9","last_reissued_at":"2026-05-18T01:21:39.815027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:39.815027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimum basis of finite convex geometry","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.RA"],"primary_cat":"math.OC","authors_text":"Kira Adaricheva","submitted_at":"2012-05-15T02:08:31Z","abstract_excerpt":"Convex geometries form a subclass of closure systems with unique criticals, or $UC$-systems. We show that the $F$-basis introduced in [1] for $UC$-systems, becomes optimum in convex geometries, in two essential parts of the basis: right sides (conclusions) of binary implications and left sides (premises) of non-binary ones. The right sides of non-binary implications can also be optimized, when the convex geometry either satisfies the Carousel property, or does not have $D$-cycles. The latter generalizes a result of P.L.~Hammer and A.~Kogan for acyclic Horn Boolean functions. Convex geometries "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.3236","kind":"arxiv","version":5},"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":"1205.3236","created_at":"2026-05-18T01:21:39.815118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.3236v5","created_at":"2026-05-18T01:21:39.815118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.3236","created_at":"2026-05-18T01:21:39.815118+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRTQEWKVLR7Z","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRTQEWKVLR7ZMBOB","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRTQEWKV","created_at":"2026-05-18T12:27:25.539911+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/WRTQEWKVLR7ZMBOBCKTWZHBVJO","json":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO.json","graph_json":"https://pith.science/api/pith-number/WRTQEWKVLR7ZMBOBCKTWZHBVJO/graph.json","events_json":"https://pith.science/api/pith-number/WRTQEWKVLR7ZMBOBCKTWZHBVJO/events.json","paper":"https://pith.science/paper/WRTQEWKV"},"agent_actions":{"view_html":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO","download_json":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO.json","view_paper":"https://pith.science/paper/WRTQEWKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.3236&json=true","fetch_graph":"https://pith.science/api/pith-number/WRTQEWKVLR7ZMBOBCKTWZHBVJO/graph.json","fetch_events":"https://pith.science/api/pith-number/WRTQEWKVLR7ZMBOBCKTWZHBVJO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO/action/storage_attestation","attest_author":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO/action/author_attestation","sign_citation":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO/action/citation_signature","submit_replication":"https://pith.science/pith/WRTQEWKVLR7ZMBOBCKTWZHBVJO/action/replication_record"}},"created_at":"2026-05-18T01:21:39.815118+00:00","updated_at":"2026-05-18T01:21:39.815118+00:00"}