{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PLOLCDFFTRQC3QRBDBWYRUM44M","short_pith_number":"pith:PLOLCDFF","schema_version":"1.0","canonical_sha256":"7adcb10ca59c602dc221186d88d19ce33efaaec7046ab0b8a3f4a7ec0f09e39b","source":{"kind":"arxiv","id":"1504.00110","version":1},"attestation_state":"computed","paper":{"title":"The Libra Toolkit for Probabilistic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amirmohammad Rooshenas, Daniel Lowd","submitted_at":"2015-04-01T06:05:40Z","abstract_excerpt":"The Libra Toolkit is a collection of algorithms for learning and inference with discrete probabilistic models, including Bayesian networks, Markov networks, dependency networks, and sum-product networks. Compared to other toolkits, Libra places a greater emphasis on learning the structure of tractable models in which exact inference is efficient. It also includes a variety of algorithms for learning graphical models in which inference is potentially intractable, and for performing exact and approximate inference. Libra is released under a 2-clause BSD license to encourage broad use in academia"},"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":"1504.00110","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-01T06:05:40Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"eeffebfcde29444753e3c80f3ceb77dd00772a1146c70d0aad01a47437966797","abstract_canon_sha256":"900b05f7e91afb3735ecf3cb0d50fc22b5d86d6438d599d6d98ec92131cc5a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:49.767282Z","signature_b64":"grfMVwAGvPhTgKeIdMAiqKQUE0U7tXUwd5m3RXaMaFgEUUJCUFz6t0hV1ZMxjt91PovuQnOtEPcuwRFysWznBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7adcb10ca59c602dc221186d88d19ce33efaaec7046ab0b8a3f4a7ec0f09e39b","last_reissued_at":"2026-05-18T02:19:49.766773Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:49.766773Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Libra Toolkit for Probabilistic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Amirmohammad Rooshenas, Daniel Lowd","submitted_at":"2015-04-01T06:05:40Z","abstract_excerpt":"The Libra Toolkit is a collection of algorithms for learning and inference with discrete probabilistic models, including Bayesian networks, Markov networks, dependency networks, and sum-product networks. Compared to other toolkits, Libra places a greater emphasis on learning the structure of tractable models in which exact inference is efficient. It also includes a variety of algorithms for learning graphical models in which inference is potentially intractable, and for performing exact and approximate inference. Libra is released under a 2-clause BSD license to encourage broad use in academia"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00110","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":"1504.00110","created_at":"2026-05-18T02:19:49.766847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00110v1","created_at":"2026-05-18T02:19:49.766847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00110","created_at":"2026-05-18T02:19:49.766847+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLOLCDFFTRQC","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLOLCDFFTRQC3QRB","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLOLCDFF","created_at":"2026-05-18T12:29:37.295048+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/PLOLCDFFTRQC3QRBDBWYRUM44M","json":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M.json","graph_json":"https://pith.science/api/pith-number/PLOLCDFFTRQC3QRBDBWYRUM44M/graph.json","events_json":"https://pith.science/api/pith-number/PLOLCDFFTRQC3QRBDBWYRUM44M/events.json","paper":"https://pith.science/paper/PLOLCDFF"},"agent_actions":{"view_html":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M","download_json":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M.json","view_paper":"https://pith.science/paper/PLOLCDFF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00110&json=true","fetch_graph":"https://pith.science/api/pith-number/PLOLCDFFTRQC3QRBDBWYRUM44M/graph.json","fetch_events":"https://pith.science/api/pith-number/PLOLCDFFTRQC3QRBDBWYRUM44M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M/action/storage_attestation","attest_author":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M/action/author_attestation","sign_citation":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M/action/citation_signature","submit_replication":"https://pith.science/pith/PLOLCDFFTRQC3QRBDBWYRUM44M/action/replication_record"}},"created_at":"2026-05-18T02:19:49.766847+00:00","updated_at":"2026-05-18T02:19:49.766847+00:00"}