{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4NZDS6MMAYAB47JKDD2JJGP7RJ","short_pith_number":"pith:4NZDS6MM","canonical_record":{"source":{"id":"1710.08994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-24T21:15:44Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"853f239d23e12a707556b972305f8e313c8d5f33e1faa9cd3819922531a2dfaa","abstract_canon_sha256":"04a9b80886b2597352089e834910948210243f955ce916d1d42c99729b09234e"},"schema_version":"1.0"},"canonical_sha256":"e37239798c06001e7d2a18f49499ff8a671b3f9d8ebf888b169c52b7d09f012d","source":{"kind":"arxiv","id":"1710.08994","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08994","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08994v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08994","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"4NZDS6MMAYAB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NZDS6MMAYAB47JK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NZDS6MM","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4NZDS6MMAYAB47JKDD2JJGP7RJ","target":"record","payload":{"canonical_record":{"source":{"id":"1710.08994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-24T21:15:44Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"853f239d23e12a707556b972305f8e313c8d5f33e1faa9cd3819922531a2dfaa","abstract_canon_sha256":"04a9b80886b2597352089e834910948210243f955ce916d1d42c99729b09234e"},"schema_version":"1.0"},"canonical_sha256":"e37239798c06001e7d2a18f49499ff8a671b3f9d8ebf888b169c52b7d09f012d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:00.623951Z","signature_b64":"gRXD9hNb3jj2vhUiPKwTRdkzfUm0AMxkcVLxEe/Z9MMqdU15D4ifHteDLHdvCzNQS3weFZ+UdalurUFCEogPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e37239798c06001e7d2a18f49499ff8a671b3f9d8ebf888b169c52b7d09f012d","last_reissued_at":"2026-05-18T00:32:00.623439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:00.623439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.08994","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ur60HdIutNA5xPhinUdz4YpubWnVs5jyrS7Fc6uUKM+q+I1tqd0PFoDEWLBMnEODOjdMOTXTbqv3p00PJ0EMDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:02:11.902389Z"},"content_sha256":"020ecad6268ac89a963e9608045f5167e854cebca3339c6254b7ed053b1b28d4","schema_version":"1.0","event_id":"sha256:020ecad6268ac89a963e9608045f5167e854cebca3339c6254b7ed053b1b28d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4NZDS6MMAYAB47JKDD2JJGP7RJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Variable Partitioning for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.OC","authors_text":"Ilbin Lee, Nicoleta Serban, Yuchen Zheng","submitted_at":"2017-10-24T21:15:44Z","abstract_excerpt":"This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be computationally challenging. One classic approach is to decompose the problem into smaller sub-problems and solve them in a distributed fashion. However, there is little discussion in the literature on which variables should be grouped together to form the sub-problems, especially when the optimization formulation involves complex constraints. We focus on one of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08994","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-18T00:32:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gSTmZSC84GhcjItiDmvWo67BEbfrklGc5eK8IEK1cEcDtJRlZtfqnWA/MDh0oLbMGbiBte2zGbdzUSuPmDl4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T07:02:11.902851Z"},"content_sha256":"8dbdc8ae7c3049e27392e4f897fff85030c50aeefc92af69f4a8dfa79bd5004b","schema_version":"1.0","event_id":"sha256:8dbdc8ae7c3049e27392e4f897fff85030c50aeefc92af69f4a8dfa79bd5004b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/bundle.json","state_url":"https://pith.science/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/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-08-15T07:02:11Z","links":{"resolver":"https://pith.science/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ","bundle":"https://pith.science/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/bundle.json","state":"https://pith.science/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4NZDS6MMAYAB47JKDD2JJGP7RJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4NZDS6MMAYAB47JKDD2JJGP7RJ","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":"04a9b80886b2597352089e834910948210243f955ce916d1d42c99729b09234e","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-24T21:15:44Z","title_canon_sha256":"853f239d23e12a707556b972305f8e313c8d5f33e1faa9cd3819922531a2dfaa"},"schema_version":"1.0","source":{"id":"1710.08994","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.08994","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.08994v1","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.08994","created_at":"2026-05-18T00:32:00Z"},{"alias_kind":"pith_short_12","alias_value":"4NZDS6MMAYAB","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4NZDS6MMAYAB47JK","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4NZDS6MM","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:8dbdc8ae7c3049e27392e4f897fff85030c50aeefc92af69f4a8dfa79bd5004b","target":"graph","created_at":"2026-05-18T00:32:00Z","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":"This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be computationally challenging. One classic approach is to decompose the problem into smaller sub-problems and solve them in a distributed fashion. However, there is little discussion in the literature on which variables should be grouped together to form the sub-problems, especially when the optimization formulation involves complex constraints. We focus on one of the","authors_text":"Ilbin Lee, Nicoleta Serban, Yuchen Zheng","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-24T21:15:44Z","title":"Variable Partitioning for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.08994","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:020ecad6268ac89a963e9608045f5167e854cebca3339c6254b7ed053b1b28d4","target":"record","created_at":"2026-05-18T00:32:00Z","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":"04a9b80886b2597352089e834910948210243f955ce916d1d42c99729b09234e","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-24T21:15:44Z","title_canon_sha256":"853f239d23e12a707556b972305f8e313c8d5f33e1faa9cd3819922531a2dfaa"},"schema_version":"1.0","source":{"id":"1710.08994","kind":"arxiv","version":1}},"canonical_sha256":"e37239798c06001e7d2a18f49499ff8a671b3f9d8ebf888b169c52b7d09f012d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e37239798c06001e7d2a18f49499ff8a671b3f9d8ebf888b169c52b7d09f012d","first_computed_at":"2026-05-18T00:32:00.623439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:00.623439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gRXD9hNb3jj2vhUiPKwTRdkzfUm0AMxkcVLxEe/Z9MMqdU15D4ifHteDLHdvCzNQS3weFZ+UdalurUFCEogPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:00.623951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.08994","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:020ecad6268ac89a963e9608045f5167e854cebca3339c6254b7ed053b1b28d4","sha256:8dbdc8ae7c3049e27392e4f897fff85030c50aeefc92af69f4a8dfa79bd5004b"],"state_sha256":"6d4bb846298eb25c17d76cea7b4531862f06e2fd9c432bb3c278af3ef900c212"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T3wZtLtf0IdQH4XYlFckOg5or5ZysymYBURE1CFeM+Plpe7h72CRqt3VRYmDbsfD/ZTVxGdxXwMNT0C2s3HuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T07:02:11.910153Z","bundle_sha256":"9885e11410a58583424843a11d8d827ae73fba5428a4660b6be900cdfb02f538"}}