{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JR3COGR43Z4SYXTHWEN5QMODYK","short_pith_number":"pith:JR3COGR4","canonical_record":{"source":{"id":"1603.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-08T14:13:38Z","cross_cats_sorted":["cs.MS","math.OC"],"title_canon_sha256":"6b6ee17972c0615d62df9717aa89952cb4c74992384cc06e5b7ff38a3ae5c1c8","abstract_canon_sha256":"f68167041aa1d5059222f4d3f583ba2697c0a12070d591e683471df7d5e93b0c"},"schema_version":"1.0"},"canonical_sha256":"4c76271a3cde792c5e67b11bd831c3c2a9436899ba7ea7ab918900aa283f085c","source":{"kind":"arxiv","id":"1603.02526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02526","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02526v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02526","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"JR3COGR43Z4S","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR3COGR43Z4SYXTH","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR3COGR4","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JR3COGR43Z4SYXTHWEN5QMODYK","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-08T14:13:38Z","cross_cats_sorted":["cs.MS","math.OC"],"title_canon_sha256":"6b6ee17972c0615d62df9717aa89952cb4c74992384cc06e5b7ff38a3ae5c1c8","abstract_canon_sha256":"f68167041aa1d5059222f4d3f583ba2697c0a12070d591e683471df7d5e93b0c"},"schema_version":"1.0"},"canonical_sha256":"4c76271a3cde792c5e67b11bd831c3c2a9436899ba7ea7ab918900aa283f085c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:23.017109Z","signature_b64":"xTEy/ovUnhgyGpIVEAAlibiI/J+eZaPw5Wx2GdgkdrwJzHylcPVRuceVcs2CLOOPLk1BJBcudmv+i5IqCiZNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c76271a3cde792c5e67b11bd831c3c2a9436899ba7ea7ab918900aa283f085c","last_reissued_at":"2026-05-18T01:19:23.016427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:23.016427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02526","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-18T01:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FRKbbjGgNZ4sW6pXbcG+e8CqKz78YWTytYWLUiH3z/Bwqc/+l5nNB6w9C+pUSOicU46DSIXC0YA7jmjrZW31Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:24.337954Z"},"content_sha256":"9b531cc6e3d3358e4135b632fb587efa1c8baa70751654747929e270c283eb75","schema_version":"1.0","event_id":"sha256:9b531cc6e3d3358e4135b632fb587efa1c8baa70751654747929e270c283eb75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JR3COGR43Z4SYXTHWEN5QMODYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing fine-grained parallelism for the ADMM on a factor-graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","math.OC"],"primary_cat":"cs.DC","authors_text":"Amirreza Oghbaee, Jos\\'e Bento, Mohammad Rostami, Nate Derbinsky, Ning Hao","submitted_at":"2016-03-08T14:13:38Z","abstract_excerpt":"There is an ongoing effort to develop tools that apply distributed computational resources to tackle large problems or reduce the time to solve them. In this context, the Alternating Direction Method of Multipliers (ADMM) arises as a method that can exploit distributed resources like the dual ascent method and has the robustness and improved convergence of the augmented Lagrangian method. Traditional approaches to accelerate the ADMM using multiple cores are problem-specific and often require multi-core programming. By contrast, we propose a problem-independent scheme of accelerating the ADMM "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02526","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-18T01:19:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAro9PJb9sa6Q/ltRZ3tnfykTqKfgLvjdFn7J1njcRDPOxXLE8xmsIq1VyDBggYAEIHueCU1NIReXZS6LBroDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:41:24.338624Z"},"content_sha256":"de80568e1f0b06bb2ef91d82c0fdccafc26a238747ab7a1f7297f50088a12315","schema_version":"1.0","event_id":"sha256:de80568e1f0b06bb2ef91d82c0fdccafc26a238747ab7a1f7297f50088a12315"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JR3COGR43Z4SYXTHWEN5QMODYK/bundle.json","state_url":"https://pith.science/pith/JR3COGR43Z4SYXTHWEN5QMODYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JR3COGR43Z4SYXTHWEN5QMODYK/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-05-26T23:41:24Z","links":{"resolver":"https://pith.science/pith/JR3COGR43Z4SYXTHWEN5QMODYK","bundle":"https://pith.science/pith/JR3COGR43Z4SYXTHWEN5QMODYK/bundle.json","state":"https://pith.science/pith/JR3COGR43Z4SYXTHWEN5QMODYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JR3COGR43Z4SYXTHWEN5QMODYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JR3COGR43Z4SYXTHWEN5QMODYK","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":"f68167041aa1d5059222f4d3f583ba2697c0a12070d591e683471df7d5e93b0c","cross_cats_sorted":["cs.MS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-08T14:13:38Z","title_canon_sha256":"6b6ee17972c0615d62df9717aa89952cb4c74992384cc06e5b7ff38a3ae5c1c8"},"schema_version":"1.0","source":{"id":"1603.02526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02526","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02526v1","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02526","created_at":"2026-05-18T01:19:23Z"},{"alias_kind":"pith_short_12","alias_value":"JR3COGR43Z4S","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JR3COGR43Z4SYXTH","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JR3COGR4","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:de80568e1f0b06bb2ef91d82c0fdccafc26a238747ab7a1f7297f50088a12315","target":"graph","created_at":"2026-05-18T01:19:23Z","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":"There is an ongoing effort to develop tools that apply distributed computational resources to tackle large problems or reduce the time to solve them. In this context, the Alternating Direction Method of Multipliers (ADMM) arises as a method that can exploit distributed resources like the dual ascent method and has the robustness and improved convergence of the augmented Lagrangian method. Traditional approaches to accelerate the ADMM using multiple cores are problem-specific and often require multi-core programming. By contrast, we propose a problem-independent scheme of accelerating the ADMM ","authors_text":"Amirreza Oghbaee, Jos\\'e Bento, Mohammad Rostami, Nate Derbinsky, Ning Hao","cross_cats":["cs.MS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-08T14:13:38Z","title":"Testing fine-grained parallelism for the ADMM on a factor-graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02526","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:9b531cc6e3d3358e4135b632fb587efa1c8baa70751654747929e270c283eb75","target":"record","created_at":"2026-05-18T01:19:23Z","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":"f68167041aa1d5059222f4d3f583ba2697c0a12070d591e683471df7d5e93b0c","cross_cats_sorted":["cs.MS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-08T14:13:38Z","title_canon_sha256":"6b6ee17972c0615d62df9717aa89952cb4c74992384cc06e5b7ff38a3ae5c1c8"},"schema_version":"1.0","source":{"id":"1603.02526","kind":"arxiv","version":1}},"canonical_sha256":"4c76271a3cde792c5e67b11bd831c3c2a9436899ba7ea7ab918900aa283f085c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c76271a3cde792c5e67b11bd831c3c2a9436899ba7ea7ab918900aa283f085c","first_computed_at":"2026-05-18T01:19:23.016427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:23.016427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xTEy/ovUnhgyGpIVEAAlibiI/J+eZaPw5Wx2GdgkdrwJzHylcPVRuceVcs2CLOOPLk1BJBcudmv+i5IqCiZNCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:23.017109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b531cc6e3d3358e4135b632fb587efa1c8baa70751654747929e270c283eb75","sha256:de80568e1f0b06bb2ef91d82c0fdccafc26a238747ab7a1f7297f50088a12315"],"state_sha256":"09545117c25a2d4ca8d151b21f2bbafd2aa5296ac226c2fd04032206eebf13fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"enzH7QCKXE8EV2nGIg6fA2Y8tcrirXINky+iEbeNh5auVroZSc2dvw8IQyl2jiF97lsVk9fhvHg5zIpqUqx0BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:41:24.342100Z","bundle_sha256":"60a308023c37b54b9e085047ead35937de7b06a7fc13d3885559d2778a93bfad"}}