{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:J7A435C47USQUCYEOIS4I5IZEW","short_pith_number":"pith:J7A435C4","schema_version":"1.0","canonical_sha256":"4fc1cdf45cfd250a0b047225c475192587470abe56802127c8b12fe640d65baf","source":{"kind":"arxiv","id":"1507.00702","version":1},"attestation_state":"computed","paper":{"title":"Centralized and Distributed Newton Methods for Network Optimization and Extensions","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Dimitri P. Bertsekas","submitted_at":"2015-07-02T19:06:47Z","abstract_excerpt":"We consider Newton methods for common types of single commodity and multi-commodity network flow problems. Despite the potentially very large dimension of the problem, they can be implemented using the conjugate gradient method and low-dimensional network operations, as shown nearly thirty years ago. We revisit these methods, compare them to more recent proposals, and describe how they can be implemented in a distributed computing system. We also discuss generalizations, including the treatment of arc gains, linear side constraints, and related special structures."},"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":"1507.00702","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.NA","submitted_at":"2015-07-02T19:06:47Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"324e3ad76374e1d57aa8b99134b9c41ffe91028d8775e9777d09fc7bee44967e","abstract_canon_sha256":"5b6cf40806a446216657f5877c2c4a25c420744de4ab5fad4b84af267ba05835"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:23.840042Z","signature_b64":"eOe41nwDAo0pwbqm+8/Qpb3cRY45xbSyFnl2YZh1TGsmuvw7V/XryUqvojYBy9cl31GN64Ep7CJdXfe2wMkJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fc1cdf45cfd250a0b047225c475192587470abe56802127c8b12fe640d65baf","last_reissued_at":"2026-05-18T01:37:23.839467Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:23.839467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centralized and Distributed Newton Methods for Network Optimization and Extensions","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.NA","authors_text":"Dimitri P. Bertsekas","submitted_at":"2015-07-02T19:06:47Z","abstract_excerpt":"We consider Newton methods for common types of single commodity and multi-commodity network flow problems. Despite the potentially very large dimension of the problem, they can be implemented using the conjugate gradient method and low-dimensional network operations, as shown nearly thirty years ago. We revisit these methods, compare them to more recent proposals, and describe how they can be implemented in a distributed computing system. We also discuss generalizations, including the treatment of arc gains, linear side constraints, and related special structures."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00702","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":"1507.00702","created_at":"2026-05-18T01:37:23.839558+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00702v1","created_at":"2026-05-18T01:37:23.839558+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00702","created_at":"2026-05-18T01:37:23.839558+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7A435C47USQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7A435C47USQUCYE","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7A435C4","created_at":"2026-05-18T12:29:27.538025+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/J7A435C47USQUCYEOIS4I5IZEW","json":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW.json","graph_json":"https://pith.science/api/pith-number/J7A435C47USQUCYEOIS4I5IZEW/graph.json","events_json":"https://pith.science/api/pith-number/J7A435C47USQUCYEOIS4I5IZEW/events.json","paper":"https://pith.science/paper/J7A435C4"},"agent_actions":{"view_html":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW","download_json":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW.json","view_paper":"https://pith.science/paper/J7A435C4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00702&json=true","fetch_graph":"https://pith.science/api/pith-number/J7A435C47USQUCYEOIS4I5IZEW/graph.json","fetch_events":"https://pith.science/api/pith-number/J7A435C47USQUCYEOIS4I5IZEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW/action/storage_attestation","attest_author":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW/action/author_attestation","sign_citation":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW/action/citation_signature","submit_replication":"https://pith.science/pith/J7A435C47USQUCYEOIS4I5IZEW/action/replication_record"}},"created_at":"2026-05-18T01:37:23.839558+00:00","updated_at":"2026-05-18T01:37:23.839558+00:00"}