{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MVGH2HGJLB6UGM5DXRCXU355EF","short_pith_number":"pith:MVGH2HGJ","canonical_record":{"source":{"id":"1312.5440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-19T08:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"c2a3e78fb239cc2d54e2d101e8588f363a1b59b7ffe00393a9788edf58b10afd","abstract_canon_sha256":"59d2d69eda21cecfb5dc55c582ac299a8b695814476d160ae996488871ff5b2c"},"schema_version":"1.0"},"canonical_sha256":"654c7d1cc9587d4333a3bc457a6fbd215ed4559896a69cb0b2a76237aea88f8c","source":{"kind":"arxiv","id":"1312.5440","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5440","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5440v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5440","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"MVGH2HGJLB6U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MVGH2HGJLB6UGM5D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MVGH2HGJ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MVGH2HGJLB6UGM5DXRCXU355EF","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-19T08:45:48Z","cross_cats_sorted":[],"title_canon_sha256":"c2a3e78fb239cc2d54e2d101e8588f363a1b59b7ffe00393a9788edf58b10afd","abstract_canon_sha256":"59d2d69eda21cecfb5dc55c582ac299a8b695814476d160ae996488871ff5b2c"},"schema_version":"1.0"},"canonical_sha256":"654c7d1cc9587d4333a3bc457a6fbd215ed4559896a69cb0b2a76237aea88f8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:14.779529Z","signature_b64":"qOdkgCKve8GqEjOZhp+DXNrmJAioWjYj1JH+hdM+pFkqc21X0DgwT3c7fODm7oqJiHKth2j/W8KQVIn9NoBXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654c7d1cc9587d4333a3bc457a6fbd215ed4559896a69cb0b2a76237aea88f8c","last_reissued_at":"2026-05-18T03:04:14.779148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:14.779148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5440","source_version":1,"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-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9d67DZLfPc8hQ21UH+X0i/To6P7Wt3+Y+QsB5D0EAaAkhBJaV/KDahGOqvPWEP2UOyisIUxv5IYi4oAECgQJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:18:05.139888Z"},"content_sha256":"e7fd2100f66827daff0401796add7e65af7769408587510e89612b3f0999dc6b","schema_version":"1.0","event_id":"sha256:e7fd2100f66827daff0401796add7e65af7769408587510e89612b3f0999dc6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MVGH2HGJLB6UGM5DXRCXU355EF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Interior-point Method for Loosely Coupled Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Hansson, Martin S. Andersen, Sina Khoshfetrat Pakazad","submitted_at":"2013-12-19T08:45:48Z","abstract_excerpt":"In this paper, we put forth distributed algorithms for solving loosely coupled unconstrained and constrained optimization problems. Such problems are usually solved using algorithms that are based on a combination of decomposition and first order methods. These algorithms are commonly very slow and require many iterations to converge. In order to alleviate this issue, we propose algorithms that combine the Newton and interior-point methods with proximal splitting methods for solving such problems. Particularly, the algorithm for solving unconstrained loosely coupled problems, is based on Newto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5440","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"},"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-18T03:04:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBel7A9Bk+EIyWjrpVVPuWBjn7wXE4zZahmXmW2x4AowgqIXUVJ0/xPFBnuhUR2qQPKZWf0D9JAcnRBUNjTsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T03:18:05.140586Z"},"content_sha256":"f9a9f5b0e3637a6b949484dcb6124918ca836d5cc3ae206397a14c3a737d4403","schema_version":"1.0","event_id":"sha256:f9a9f5b0e3637a6b949484dcb6124918ca836d5cc3ae206397a14c3a737d4403"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVGH2HGJLB6UGM5DXRCXU355EF/bundle.json","state_url":"https://pith.science/pith/MVGH2HGJLB6UGM5DXRCXU355EF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVGH2HGJLB6UGM5DXRCXU355EF/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-09T03:18:05Z","links":{"resolver":"https://pith.science/pith/MVGH2HGJLB6UGM5DXRCXU355EF","bundle":"https://pith.science/pith/MVGH2HGJLB6UGM5DXRCXU355EF/bundle.json","state":"https://pith.science/pith/MVGH2HGJLB6UGM5DXRCXU355EF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVGH2HGJLB6UGM5DXRCXU355EF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MVGH2HGJLB6UGM5DXRCXU355EF","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":"59d2d69eda21cecfb5dc55c582ac299a8b695814476d160ae996488871ff5b2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-19T08:45:48Z","title_canon_sha256":"c2a3e78fb239cc2d54e2d101e8588f363a1b59b7ffe00393a9788edf58b10afd"},"schema_version":"1.0","source":{"id":"1312.5440","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5440","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5440v1","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5440","created_at":"2026-05-18T03:04:14Z"},{"alias_kind":"pith_short_12","alias_value":"MVGH2HGJLB6U","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MVGH2HGJLB6UGM5D","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MVGH2HGJ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:f9a9f5b0e3637a6b949484dcb6124918ca836d5cc3ae206397a14c3a737d4403","target":"graph","created_at":"2026-05-18T03:04:14Z","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":"In this paper, we put forth distributed algorithms for solving loosely coupled unconstrained and constrained optimization problems. Such problems are usually solved using algorithms that are based on a combination of decomposition and first order methods. These algorithms are commonly very slow and require many iterations to converge. In order to alleviate this issue, we propose algorithms that combine the Newton and interior-point methods with proximal splitting methods for solving such problems. Particularly, the algorithm for solving unconstrained loosely coupled problems, is based on Newto","authors_text":"Anders Hansson, Martin S. Andersen, Sina Khoshfetrat Pakazad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-19T08:45:48Z","title":"Distributed Interior-point Method for Loosely Coupled Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5440","kind":"arxiv","version":1},"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:e7fd2100f66827daff0401796add7e65af7769408587510e89612b3f0999dc6b","target":"record","created_at":"2026-05-18T03:04:14Z","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":"59d2d69eda21cecfb5dc55c582ac299a8b695814476d160ae996488871ff5b2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-19T08:45:48Z","title_canon_sha256":"c2a3e78fb239cc2d54e2d101e8588f363a1b59b7ffe00393a9788edf58b10afd"},"schema_version":"1.0","source":{"id":"1312.5440","kind":"arxiv","version":1}},"canonical_sha256":"654c7d1cc9587d4333a3bc457a6fbd215ed4559896a69cb0b2a76237aea88f8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654c7d1cc9587d4333a3bc457a6fbd215ed4559896a69cb0b2a76237aea88f8c","first_computed_at":"2026-05-18T03:04:14.779148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:14.779148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOdkgCKve8GqEjOZhp+DXNrmJAioWjYj1JH+hdM+pFkqc21X0DgwT3c7fODm7oqJiHKth2j/W8KQVIn9NoBXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:14.779529Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5440","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7fd2100f66827daff0401796add7e65af7769408587510e89612b3f0999dc6b","sha256:f9a9f5b0e3637a6b949484dcb6124918ca836d5cc3ae206397a14c3a737d4403"],"state_sha256":"89a75de8c1d722eb12a8274e1319bc39facea5136d82b7462a6e414bd920beae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0cBrouJIkL7zfKOjQMJVCbk9yU8fe0i3aptKD0SxlGK1d4Fa4rPtwTRxi5XHApFTa2DowABT9AwSPXiEUJXLDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T03:18:05.144473Z","bundle_sha256":"6cc83e2de42282dedd0ba8d58f0dec949fbfeb2aa84da57361ff4fdca1559273"}}