{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B2VQEBNGZQIGU22QYJ2ZLQYEXD","short_pith_number":"pith:B2VQEBNG","schema_version":"1.0","canonical_sha256":"0eab0205a6cc106a6b50c27595c304b8c605f0e336fa1d229d3f0deaac596e3c","source":{"kind":"arxiv","id":"1502.06384","version":2},"attestation_state":"computed","paper":{"title":"Distributed Primal-dual Interior-point Methods for Solving Loosely Coupled Problems Using Message Passing","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":"2015-02-23T11:00:05Z","abstract_excerpt":"In this paper, we propose a distributed algorithm for solving loosely coupled problems with chordal sparsity which relies on primal-dual interior-point methods. We achieve this by distributing the computations at each iteration, using message-passing. In comparison to already existing distributed algorithms for solving such problems, this algorithm requires far less number of iterations to converge to a solution with high accuracy. Furthermore, it is possible to compute an upper-bound for the number of required iterations which, unlike already existing methods, only depends on the coupling str"},"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":"1502.06384","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-23T11:00:05Z","cross_cats_sorted":[],"title_canon_sha256":"4ad8c55bc6e159dd00d682e593bac25e022beb4d712b17412f9d2b62b94abe79","abstract_canon_sha256":"772a0743aa65129497db2a5e2285922cc9533f13de89c1894005e1a29159a67a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:44.412999Z","signature_b64":"7iWwflA2iA2jNYF8jGOqQgROK6PuNYKdf/GJwGJjKfhrQZpJjkxNCr0Jg2lx9VLqK61gOm2lmonlhhzyDElfDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eab0205a6cc106a6b50c27595c304b8c605f0e336fa1d229d3f0deaac596e3c","last_reissued_at":"2026-05-18T01:37:44.412374Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:44.412374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Primal-dual Interior-point Methods for Solving Loosely Coupled Problems Using Message Passing","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":"2015-02-23T11:00:05Z","abstract_excerpt":"In this paper, we propose a distributed algorithm for solving loosely coupled problems with chordal sparsity which relies on primal-dual interior-point methods. We achieve this by distributing the computations at each iteration, using message-passing. In comparison to already existing distributed algorithms for solving such problems, this algorithm requires far less number of iterations to converge to a solution with high accuracy. Furthermore, it is possible to compute an upper-bound for the number of required iterations which, unlike already existing methods, only depends on the coupling str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.06384","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.06384","created_at":"2026-05-18T01:37:44.412477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.06384v2","created_at":"2026-05-18T01:37:44.412477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.06384","created_at":"2026-05-18T01:37:44.412477+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2VQEBNGZQIG","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2VQEBNGZQIGU22Q","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2VQEBNG","created_at":"2026-05-18T12:29:14.074870+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/B2VQEBNGZQIGU22QYJ2ZLQYEXD","json":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD.json","graph_json":"https://pith.science/api/pith-number/B2VQEBNGZQIGU22QYJ2ZLQYEXD/graph.json","events_json":"https://pith.science/api/pith-number/B2VQEBNGZQIGU22QYJ2ZLQYEXD/events.json","paper":"https://pith.science/paper/B2VQEBNG"},"agent_actions":{"view_html":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD","download_json":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD.json","view_paper":"https://pith.science/paper/B2VQEBNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.06384&json=true","fetch_graph":"https://pith.science/api/pith-number/B2VQEBNGZQIGU22QYJ2ZLQYEXD/graph.json","fetch_events":"https://pith.science/api/pith-number/B2VQEBNGZQIGU22QYJ2ZLQYEXD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD/action/storage_attestation","attest_author":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD/action/author_attestation","sign_citation":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD/action/citation_signature","submit_replication":"https://pith.science/pith/B2VQEBNGZQIGU22QYJ2ZLQYEXD/action/replication_record"}},"created_at":"2026-05-18T01:37:44.412477+00:00","updated_at":"2026-05-18T01:37:44.412477+00:00"}