{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Z3BNPK6FQNJ7EWDIWUMP7DMCWP","short_pith_number":"pith:Z3BNPK6F","schema_version":"1.0","canonical_sha256":"cec2d7abc58353f25868b518ff8d82b3e3078ea19854d357e7c96b277d321018","source":{"kind":"arxiv","id":"1602.04227","version":1},"attestation_state":"computed","paper":{"title":"Scale-free network optimization: foundations and algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Patrick Rebeschini, Sekhar Tatikonda","submitted_at":"2016-02-12T21:09:56Z","abstract_excerpt":"We investigate the fundamental principles that drive the development of scalable algorithms for network optimization. Despite the significant amount of work on parallel and decentralized algorithms in the optimization community, the methods that have been proposed typically rely on strict separability assumptions for objective function and constraints. Beside sparsity, these methods typically do not exploit the strength of the interaction between variables in the system. We propose a notion of correlation in constrained optimization that is based on the sensitivity of the optimal solution upon"},"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":"1602.04227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-12T21:09:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aea70f5ca605b9fc014d4121be8d189b13ff77c580b8edea2db1075a5a8f1b74","abstract_canon_sha256":"5d228a3428ce6555b5e6dd8e1b55e962469c0cae47564efc1f8498189b0ac230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:12.882503Z","signature_b64":"oXsHGHU1hnbjFjD4cvLbbpNQLkoHL7AIOCBuoJVlrJOgO+Fpf4SP5Ht5zyJjVtrkdHOUbleyLK48ho/zpwZKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cec2d7abc58353f25868b518ff8d82b3e3078ea19854d357e7c96b277d321018","last_reissued_at":"2026-05-18T00:38:12.881844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:12.881844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scale-free network optimization: foundations and algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"stat.ML","authors_text":"Patrick Rebeschini, Sekhar Tatikonda","submitted_at":"2016-02-12T21:09:56Z","abstract_excerpt":"We investigate the fundamental principles that drive the development of scalable algorithms for network optimization. Despite the significant amount of work on parallel and decentralized algorithms in the optimization community, the methods that have been proposed typically rely on strict separability assumptions for objective function and constraints. Beside sparsity, these methods typically do not exploit the strength of the interaction between variables in the system. We propose a notion of correlation in constrained optimization that is based on the sensitivity of the optimal solution upon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04227","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":"1602.04227","created_at":"2026-05-18T00:38:12.881934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04227v1","created_at":"2026-05-18T00:38:12.881934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04227","created_at":"2026-05-18T00:38:12.881934+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z3BNPK6FQNJ7","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z3BNPK6FQNJ7EWDI","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z3BNPK6F","created_at":"2026-05-18T12:30:53.716459+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/Z3BNPK6FQNJ7EWDIWUMP7DMCWP","json":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP.json","graph_json":"https://pith.science/api/pith-number/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/graph.json","events_json":"https://pith.science/api/pith-number/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/events.json","paper":"https://pith.science/paper/Z3BNPK6F"},"agent_actions":{"view_html":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP","download_json":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP.json","view_paper":"https://pith.science/paper/Z3BNPK6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04227&json=true","fetch_graph":"https://pith.science/api/pith-number/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/graph.json","fetch_events":"https://pith.science/api/pith-number/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/action/storage_attestation","attest_author":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/action/author_attestation","sign_citation":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/action/citation_signature","submit_replication":"https://pith.science/pith/Z3BNPK6FQNJ7EWDIWUMP7DMCWP/action/replication_record"}},"created_at":"2026-05-18T00:38:12.881934+00:00","updated_at":"2026-05-18T00:38:12.881934+00:00"}