{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:Q5BDEKPFK3BP6O4AJQVBC7OWZB","short_pith_number":"pith:Q5BDEKPF","canonical_record":{"source":{"id":"1905.08750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-21T16:59:16Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"a59ece132d75a937afb1cd9608bbe9075b3541a00d1a732c11294140788ffd43","abstract_canon_sha256":"cbe189fafb92a27fced35fea46ad1ce679e07495fa4345cc25e55f3e88e94e7c"},"schema_version":"1.0"},"canonical_sha256":"87423229e556c2ff3b804c2a117dd6c84758cff984424ae1dde1ad203d84a275","source":{"kind":"arxiv","id":"1905.08750","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08750","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08750v2","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08750","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"Q5BDEKPFK3BP","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_16","alias_value":"Q5BDEKPFK3BP6O4A","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_8","alias_value":"Q5BDEKPF","created_at":"2026-07-05T00:57:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:Q5BDEKPFK3BP6O4AJQVBC7OWZB","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08750","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-21T16:59:16Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"a59ece132d75a937afb1cd9608bbe9075b3541a00d1a732c11294140788ffd43","abstract_canon_sha256":"cbe189fafb92a27fced35fea46ad1ce679e07495fa4345cc25e55f3e88e94e7c"},"schema_version":"1.0"},"canonical_sha256":"87423229e556c2ff3b804c2a117dd6c84758cff984424ae1dde1ad203d84a275","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:05.227662Z","signature_b64":"h05bxrmoSPMsOeQQhFFjm9RBYcPBbczBJm1A+JnuiQ2B+/7gxcGOujXHxd8PL77MKUQqBeTxEVrbeF8nz4NHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87423229e556c2ff3b804c2a117dd6c84758cff984424ae1dde1ad203d84a275","last_reissued_at":"2026-07-05T00:57:05.227182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:05.227182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08750","source_version":2,"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-07-05T00:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dQSxxTGJwVtsnnAWczxPmQZD52jGYwWvRer4BdaDaPplmo+I3yPReUQHnaLa37Z0x/vCT0YoeKQPcqLKcKshDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:33:28.430197Z"},"content_sha256":"ca685a26ddaaa833dbc2fc8a0229750b1f9e28e978d378fc26dec04468bb362d","schema_version":"1.0","event_id":"sha256:ca685a26ddaaa833dbc2fc8a0229750b1f9e28e978d378fc26dec04468bb362d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:Q5BDEKPFK3BP6O4AJQVBC7OWZB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptation and learning over networks under subspace constraints -- Part I: Stability Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"cs.MA","authors_text":"Ali H. Sayed, Roula Nassif, Stefan Vlaski","submitted_at":"2019-05-21T16:59:16Z","abstract_excerpt":"This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional subspaces. This constrained formulation includes consensus optimization as a special case, and allows for more general task relatedness models such as smoothness. While such formulations can be solved via projected gradient descent, the resulting algorithm is not distributed. Starting from the centralized solution, we propose an iterative and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08750","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.08750/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YXpJC00UPeeDt84WAdWPDRR93czUVT68HKxnz7qFNF/QZhtP7OV3DbcfekT/36qX+iy41tcyoW2JYZ9MkMuXAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T16:33:28.430772Z"},"content_sha256":"e5bf95d6d192eae0c1a5377649f7fe1111be01694be18c9bcd1dacd2af974ce8","schema_version":"1.0","event_id":"sha256:e5bf95d6d192eae0c1a5377649f7fe1111be01694be18c9bcd1dacd2af974ce8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/bundle.json","state_url":"https://pith.science/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/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-16T16:33:28Z","links":{"resolver":"https://pith.science/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB","bundle":"https://pith.science/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/bundle.json","state":"https://pith.science/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5BDEKPFK3BP6O4AJQVBC7OWZB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:Q5BDEKPFK3BP6O4AJQVBC7OWZB","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":"cbe189fafb92a27fced35fea46ad1ce679e07495fa4345cc25e55f3e88e94e7c","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-21T16:59:16Z","title_canon_sha256":"a59ece132d75a937afb1cd9608bbe9075b3541a00d1a732c11294140788ffd43"},"schema_version":"1.0","source":{"id":"1905.08750","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08750","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08750v2","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08750","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"Q5BDEKPFK3BP","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_16","alias_value":"Q5BDEKPFK3BP6O4A","created_at":"2026-07-05T00:57:05Z"},{"alias_kind":"pith_short_8","alias_value":"Q5BDEKPF","created_at":"2026-07-05T00:57:05Z"}],"graph_snapshots":[{"event_id":"sha256:e5bf95d6d192eae0c1a5377649f7fe1111be01694be18c9bcd1dacd2af974ce8","target":"graph","created_at":"2026-07-05T00:57:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1905.08750/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers optimization problems over networks where agents have individual objectives to meet, or individual parameter vectors to estimate, subject to subspace constraints that require the objectives across the network to lie in low-dimensional subspaces. This constrained formulation includes consensus optimization as a special case, and allows for more general task relatedness models such as smoothness. While such formulations can be solved via projected gradient descent, the resulting algorithm is not distributed. Starting from the centralized solution, we propose an iterative and","authors_text":"Ali H. Sayed, Roula Nassif, Stefan Vlaski","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-21T16:59:16Z","title":"Adaptation and learning over networks under subspace constraints -- Part I: Stability Analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08750","kind":"arxiv","version":2},"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:ca685a26ddaaa833dbc2fc8a0229750b1f9e28e978d378fc26dec04468bb362d","target":"record","created_at":"2026-07-05T00:57:05Z","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":"cbe189fafb92a27fced35fea46ad1ce679e07495fa4345cc25e55f3e88e94e7c","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2019-05-21T16:59:16Z","title_canon_sha256":"a59ece132d75a937afb1cd9608bbe9075b3541a00d1a732c11294140788ffd43"},"schema_version":"1.0","source":{"id":"1905.08750","kind":"arxiv","version":2}},"canonical_sha256":"87423229e556c2ff3b804c2a117dd6c84758cff984424ae1dde1ad203d84a275","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87423229e556c2ff3b804c2a117dd6c84758cff984424ae1dde1ad203d84a275","first_computed_at":"2026-07-05T00:57:05.227182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:57:05.227182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h05bxrmoSPMsOeQQhFFjm9RBYcPBbczBJm1A+JnuiQ2B+/7gxcGOujXHxd8PL77MKUQqBeTxEVrbeF8nz4NHBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:57:05.227662Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08750","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca685a26ddaaa833dbc2fc8a0229750b1f9e28e978d378fc26dec04468bb362d","sha256:e5bf95d6d192eae0c1a5377649f7fe1111be01694be18c9bcd1dacd2af974ce8"],"state_sha256":"5fdf850ee0495cb5c3c7a45b6dfa7dd890021bb20cdd23fd7803e9f8e5d0c81a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LirFFxmlT3uCUkLaqhU231rHCM77iICETKjt4I6UyXujm0d4ShMGsUP80Db+0YKZlb74+YbexQbpG1/aoM4bCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T16:33:28.434873Z","bundle_sha256":"4fe27066ad083b37f26af18df76275d54e63f3b015fac4bb99248a5c95c600d0"}}