{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PLA5D6WZU6A3EGZZGV7H3XZFR2","short_pith_number":"pith:PLA5D6WZ","canonical_record":{"source":{"id":"1310.6919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"518c02a003f2a85b692dee198fc9fc62e79c4648f24f3375c3638d1af22ce8e8","abstract_canon_sha256":"6407a089b4d1d810d087edbd4d6aba1ebdd3bca78b8487303979f53932ee7cba"},"schema_version":"1.0"},"canonical_sha256":"7ac1d1fad9a781b21b39357e7ddf258e8f5810ecf7c36da9c18eee67dc8400f7","source":{"kind":"arxiv","id":"1310.6919","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6919","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6919v2","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6919","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"PLA5D6WZU6A3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PLA5D6WZU6A3EGZZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PLA5D6WZ","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PLA5D6WZU6A3EGZZGV7H3XZFR2","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6919","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"518c02a003f2a85b692dee198fc9fc62e79c4648f24f3375c3638d1af22ce8e8","abstract_canon_sha256":"6407a089b4d1d810d087edbd4d6aba1ebdd3bca78b8487303979f53932ee7cba"},"schema_version":"1.0"},"canonical_sha256":"7ac1d1fad9a781b21b39357e7ddf258e8f5810ecf7c36da9c18eee67dc8400f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:08.337561Z","signature_b64":"SsnO/Kh1nnA9Pi9jv1E+PJ3P9G9YpCOw3y3CfYAeeFe4viX469eKVbu2u6YbcI5FScPchzKUVGwxAdTZuI9HDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac1d1fad9a781b21b39357e7ddf258e8f5810ecf7c36da9c18eee67dc8400f7","last_reissued_at":"2026-05-18T02:51:08.337104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:08.337104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6919","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVnbSGvi84aoCAOl0lM2KG9MAYGwdO+70ZiSpvq3pWivJDdwN4qLXBrOXJYCSZa12Y4nyQV7N3tSyP9GybTVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:32:57.281494Z"},"content_sha256":"1df33411bb5f0ecdd1d9c974cefd0545f2f300db70d5ca3a95a71e0aa74e3119","schema_version":"1.0","event_id":"sha256:1df33411bb5f0ecdd1d9c974cefd0545f2f300db70d5ca3a95a71e0aa74e3119"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PLA5D6WZU6A3EGZZGV7H3XZFR2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast implementation for semidefinite programs with positive matrix completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kazuhide Nakata, Makoto Yamashita","submitted_at":"2013-10-25T13:55:03Z","abstract_excerpt":"Solving semidefinite programs (SDP) in a short time is the key to managing various mathematical optimization problems. The matrix-completion primal-dual interior-point method (MC-PDIPM) extracts a sparse structure of input SDP by factorizing the variable matrices. In this paper, we propose a new factorization based on the inverse of the variable matrix to enhance the performance of MC-PDIPM. We also use multithreaded parallel computing to deal with the major bottlenecks in MC-PDIPM. Numerical results show that the new factorization and multithreaded computing reduce the computation time for SD"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6919","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4qUgB+ML7aVz6vufnq5pzAJe1SMq9PEAgU1F/sT1P9dT9wzRRdtf0H/euR6SAsWzmhU4gGKXZTIigH4QlAULAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:32:57.282234Z"},"content_sha256":"733e5ed743f9919671bf6556cf859dca60be7047ca4768691211f4d09ca034c8","schema_version":"1.0","event_id":"sha256:733e5ed743f9919671bf6556cf859dca60be7047ca4768691211f4d09ca034c8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/bundle.json","state_url":"https://pith.science/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T08:32:57Z","links":{"resolver":"https://pith.science/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2","bundle":"https://pith.science/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/bundle.json","state":"https://pith.science/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLA5D6WZU6A3EGZZGV7H3XZFR2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PLA5D6WZU6A3EGZZGV7H3XZFR2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6407a089b4d1d810d087edbd4d6aba1ebdd3bca78b8487303979f53932ee7cba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T13:55:03Z","title_canon_sha256":"518c02a003f2a85b692dee198fc9fc62e79c4648f24f3375c3638d1af22ce8e8"},"schema_version":"1.0","source":{"id":"1310.6919","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6919","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6919v2","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6919","created_at":"2026-05-18T02:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"PLA5D6WZU6A3","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PLA5D6WZU6A3EGZZ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PLA5D6WZ","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:733e5ed743f9919671bf6556cf859dca60be7047ca4768691211f4d09ca034c8","target":"graph","created_at":"2026-05-18T02:51:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Solving semidefinite programs (SDP) in a short time is the key to managing various mathematical optimization problems. The matrix-completion primal-dual interior-point method (MC-PDIPM) extracts a sparse structure of input SDP by factorizing the variable matrices. In this paper, we propose a new factorization based on the inverse of the variable matrix to enhance the performance of MC-PDIPM. We also use multithreaded parallel computing to deal with the major bottlenecks in MC-PDIPM. Numerical results show that the new factorization and multithreaded computing reduce the computation time for SD","authors_text":"Kazuhide Nakata, Makoto Yamashita","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T13:55:03Z","title":"Fast implementation for semidefinite programs with positive matrix completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6919","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1df33411bb5f0ecdd1d9c974cefd0545f2f300db70d5ca3a95a71e0aa74e3119","target":"record","created_at":"2026-05-18T02:51:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6407a089b4d1d810d087edbd4d6aba1ebdd3bca78b8487303979f53932ee7cba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T13:55:03Z","title_canon_sha256":"518c02a003f2a85b692dee198fc9fc62e79c4648f24f3375c3638d1af22ce8e8"},"schema_version":"1.0","source":{"id":"1310.6919","kind":"arxiv","version":2}},"canonical_sha256":"7ac1d1fad9a781b21b39357e7ddf258e8f5810ecf7c36da9c18eee67dc8400f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ac1d1fad9a781b21b39357e7ddf258e8f5810ecf7c36da9c18eee67dc8400f7","first_computed_at":"2026-05-18T02:51:08.337104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:08.337104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SsnO/Kh1nnA9Pi9jv1E+PJ3P9G9YpCOw3y3CfYAeeFe4viX469eKVbu2u6YbcI5FScPchzKUVGwxAdTZuI9HDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:08.337561Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6919","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df33411bb5f0ecdd1d9c974cefd0545f2f300db70d5ca3a95a71e0aa74e3119","sha256:733e5ed743f9919671bf6556cf859dca60be7047ca4768691211f4d09ca034c8"],"state_sha256":"991e594142651a19296ebdd0081f62fc460fc3739838238f58f4b74c9fb51e59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SczZU0w1CDWUpqsU9iKulu3ek+0o63p7Ssl9ncHAMlqkGybmDITbPnLee5FP50O73jcb+/MIZ7RuGOpoSlI+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:32:57.286249Z","bundle_sha256":"2edc8599d749663949fc18bf60c4067d10054ae9ecb7dc2a7e466e835dd00e86"}}