{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3L7DNGEWLLUL725FFZ2ZA2XMVI","short_pith_number":"pith:3L7DNGEW","schema_version":"1.0","canonical_sha256":"dafe3698965ae8bfeba52e75906aecaa3374fd5c1662e8758fac8dc8362c073a","source":{"kind":"arxiv","id":"1203.2742","version":1},"attestation_state":"computed","paper":{"title":"Logarithmic barriers for sparse matrix cones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Joachim Dahl, Lieven Vandenberghe, Martin S. Andersen","submitted_at":"2012-03-13T08:59:26Z","abstract_excerpt":"Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivatives are important in interior-point methods for nonsymmetric conic formulations of sparse semidefinite programs. The algorithms are based on the multifrontal method for sparse Cholesky factorization."},"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":"1203.2742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-03-13T08:59:26Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"a11e373f4d90f0246837bdb3389f4de9e3a4f912567f3f5585ef563a876f5064","abstract_canon_sha256":"295ca2be88718c89b189c2a3527f945c88ab3409359ba4030385e87be03d8ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:42.163987Z","signature_b64":"Md2MFogY0lMsPhXD5Z9oUWe1vOjQ4xqgq/ds4aIgeYhp+x41u4EhgkO+JcIy1vE4MySbpa0UsXIYJD+DaRgyAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dafe3698965ae8bfeba52e75906aecaa3374fd5c1662e8758fac8dc8362c073a","last_reissued_at":"2026-05-18T03:53:42.163533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:42.163533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmic barriers for sparse matrix cones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.OC","authors_text":"Joachim Dahl, Lieven Vandenberghe, Martin S. Andersen","submitted_at":"2012-03-13T08:59:26Z","abstract_excerpt":"Algorithms are presented for evaluating gradients and Hessians of logarithmic barrier functions for two types of convex cones: the cone of positive semidefinite matrices with a given sparsity pattern, and its dual cone, the cone of sparse matrices with the same pattern that have a positive semidefinite completion. Efficient large-scale algorithms for evaluating these barriers and their derivatives are important in interior-point methods for nonsymmetric conic formulations of sparse semidefinite programs. The algorithms are based on the multifrontal method for sparse Cholesky factorization."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2742","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":"1203.2742","created_at":"2026-05-18T03:53:42.163601+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2742v1","created_at":"2026-05-18T03:53:42.163601+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2742","created_at":"2026-05-18T03:53:42.163601+00:00"},{"alias_kind":"pith_short_12","alias_value":"3L7DNGEWLLUL","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"3L7DNGEWLLUL725F","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"3L7DNGEW","created_at":"2026-05-18T12:26:50.516681+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/3L7DNGEWLLUL725FFZ2ZA2XMVI","json":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI.json","graph_json":"https://pith.science/api/pith-number/3L7DNGEWLLUL725FFZ2ZA2XMVI/graph.json","events_json":"https://pith.science/api/pith-number/3L7DNGEWLLUL725FFZ2ZA2XMVI/events.json","paper":"https://pith.science/paper/3L7DNGEW"},"agent_actions":{"view_html":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI","download_json":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI.json","view_paper":"https://pith.science/paper/3L7DNGEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2742&json=true","fetch_graph":"https://pith.science/api/pith-number/3L7DNGEWLLUL725FFZ2ZA2XMVI/graph.json","fetch_events":"https://pith.science/api/pith-number/3L7DNGEWLLUL725FFZ2ZA2XMVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI/action/storage_attestation","attest_author":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI/action/author_attestation","sign_citation":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI/action/citation_signature","submit_replication":"https://pith.science/pith/3L7DNGEWLLUL725FFZ2ZA2XMVI/action/replication_record"}},"created_at":"2026-05-18T03:53:42.163601+00:00","updated_at":"2026-05-18T03:53:42.163601+00:00"}