{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7AYGVI4G4IZTTNRLVHNRHLRQZL","short_pith_number":"pith:7AYGVI4G","canonical_record":{"source":{"id":"1308.6823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-30T19:30:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0c02a8365601c6ad46fca6f185d9b8859b9ead15c8f8a93989cffd36eeed9623","abstract_canon_sha256":"24cb028b9d5e8d2266832edf5dbdbd5dcb357a68b8ee6162d0e825af070c9b7b"},"schema_version":"1.0"},"canonical_sha256":"f8306aa386e23339b62ba9db13ae30cac71c1ba79eb7c12a20b481e2a709ad07","source":{"kind":"arxiv","id":"1308.6823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6823","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6823v1","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6823","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"7AYGVI4G4IZT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AYGVI4G4IZTTNRL","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AYGVI4G","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7AYGVI4G4IZTTNRLVHNRHLRQZL","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-30T19:30:44Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0c02a8365601c6ad46fca6f185d9b8859b9ead15c8f8a93989cffd36eeed9623","abstract_canon_sha256":"24cb028b9d5e8d2266832edf5dbdbd5dcb357a68b8ee6162d0e825af070c9b7b"},"schema_version":"1.0"},"canonical_sha256":"f8306aa386e23339b62ba9db13ae30cac71c1ba79eb7c12a20b481e2a709ad07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:13.389386Z","signature_b64":"HDfTc/CmrWFe2xaxS74zrSKdI+UY/ykHycJ53lxDZxpO1eF+s6R4eWC3+6yc4NXcA0fcUgzuFG2IdHGEhzMsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8306aa386e23339b62ba9db13ae30cac71c1ba79eb7c12a20b481e2a709ad07","last_reissued_at":"2026-05-18T02:50:13.388752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:13.388752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6823","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-18T02:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pvy212FLrMwOkmOopbhEbHRHCpXS9y/UapOABrMov3FWXEbNE0TdDLBDEW6xjO3frEP+xLzBgtQ+I+Dl/RIJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:49:04.222473Z"},"content_sha256":"47da0ec58176433c6de2df58889e30ddc8d6cac8a2f0d564f69bb4f7b7264cd0","schema_version":"1.0","event_id":"sha256:47da0ec58176433c6de2df58889e30ddc8d6cac8a2f0d564f69bb4f7b7264cd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7AYGVI4G4IZTTNRLVHNRHLRQZL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.AI","authors_text":"Bert Huang, Hui Miao, Lise Getoor, Xiangyang Liu","submitted_at":"2013-08-30T19:30:44Z","abstract_excerpt":"In modern data science problems, techniques for extracting value from big data require performing large-scale optimization over heterogenous, irregularly structured data. Much of this data is best represented as multi-relational graphs, making vertex programming abstractions such as those of Pregel and GraphLab ideal fits for modern large-scale data analysis. In this paper, we describe a vertex-programming implementation of a popular consensus optimization technique known as the alternating direction of multipliers (ADMM). ADMM consensus optimization allows elegant solution of complex objectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6823","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-18T02:50:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkELl5B2pD89wtrLQzZfn4moN7gzZWQEz8i46cOMrI+XoYeChuRmv52h1p8YUWgBv6x8y/z44YYTM0uj1RUdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:49:04.222819Z"},"content_sha256":"5cc605704115ce698696dec85766b6ef6aae721c6f1d62bec093b03172ea9214","schema_version":"1.0","event_id":"sha256:5cc605704115ce698696dec85766b6ef6aae721c6f1d62bec093b03172ea9214"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/bundle.json","state_url":"https://pith.science/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/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-06-25T04:49:04Z","links":{"resolver":"https://pith.science/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL","bundle":"https://pith.science/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/bundle.json","state":"https://pith.science/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7AYGVI4G4IZTTNRLVHNRHLRQZL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7AYGVI4G4IZTTNRLVHNRHLRQZL","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":"24cb028b9d5e8d2266832edf5dbdbd5dcb357a68b8ee6162d0e825af070c9b7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-30T19:30:44Z","title_canon_sha256":"0c02a8365601c6ad46fca6f185d9b8859b9ead15c8f8a93989cffd36eeed9623"},"schema_version":"1.0","source":{"id":"1308.6823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6823","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6823v1","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6823","created_at":"2026-05-18T02:50:13Z"},{"alias_kind":"pith_short_12","alias_value":"7AYGVI4G4IZT","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7AYGVI4G4IZTTNRL","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7AYGVI4G","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:5cc605704115ce698696dec85766b6ef6aae721c6f1d62bec093b03172ea9214","target":"graph","created_at":"2026-05-18T02:50:13Z","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":"In modern data science problems, techniques for extracting value from big data require performing large-scale optimization over heterogenous, irregularly structured data. Much of this data is best represented as multi-relational graphs, making vertex programming abstractions such as those of Pregel and GraphLab ideal fits for modern large-scale data analysis. In this paper, we describe a vertex-programming implementation of a popular consensus optimization technique known as the alternating direction of multipliers (ADMM). ADMM consensus optimization allows elegant solution of complex objectiv","authors_text":"Bert Huang, Hui Miao, Lise Getoor, Xiangyang Liu","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-30T19:30:44Z","title":"A Hypergraph-Partitioned Vertex Programming Approach for Large-scale Consensus Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6823","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:47da0ec58176433c6de2df58889e30ddc8d6cac8a2f0d564f69bb4f7b7264cd0","target":"record","created_at":"2026-05-18T02:50:13Z","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":"24cb028b9d5e8d2266832edf5dbdbd5dcb357a68b8ee6162d0e825af070c9b7b","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-08-30T19:30:44Z","title_canon_sha256":"0c02a8365601c6ad46fca6f185d9b8859b9ead15c8f8a93989cffd36eeed9623"},"schema_version":"1.0","source":{"id":"1308.6823","kind":"arxiv","version":1}},"canonical_sha256":"f8306aa386e23339b62ba9db13ae30cac71c1ba79eb7c12a20b481e2a709ad07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8306aa386e23339b62ba9db13ae30cac71c1ba79eb7c12a20b481e2a709ad07","first_computed_at":"2026-05-18T02:50:13.388752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:13.388752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HDfTc/CmrWFe2xaxS74zrSKdI+UY/ykHycJ53lxDZxpO1eF+s6R4eWC3+6yc4NXcA0fcUgzuFG2IdHGEhzMsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:13.389386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47da0ec58176433c6de2df58889e30ddc8d6cac8a2f0d564f69bb4f7b7264cd0","sha256:5cc605704115ce698696dec85766b6ef6aae721c6f1d62bec093b03172ea9214"],"state_sha256":"f1e507f65342c1b523385d1a19e56e3cad1519c0ad7a1a3ea68def9d6c6f5698"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"auzLjMojT+fPyguCRbL+mLGHaa01JN49ZKucF4i2jP+eAvgJ4+VlxnlmISsCAO4BrO6nIbXRXCsbRV2OSfG5Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:49:04.224842Z","bundle_sha256":"57d9e2f33ded6e7bd6733664309623269560dbbff02881e582fc507a7db3eea8"}}