{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:ZWWNQNP3VESEWI54SJVWQIJFH5","short_pith_number":"pith:ZWWNQNP3","canonical_record":{"source":{"id":"cs/0701043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-01-08T18:41:38Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"fc5bd90cd2588d1010f5f72eb808da8bcad125fa034d1db6813f767fc9c56f71","abstract_canon_sha256":"f86d1dfdde172c083373b782adfdaba68dea3bd20c1d1ec306adac84d6b0b367"},"schema_version":"1.0"},"canonical_sha256":"cdacd835fba9244b23bc926b6821253f7acc9c208c13cd0f4a204a8f39f53837","source":{"kind":"arxiv","id":"cs/0701043","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701043","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701043v2","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701043","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZWWNQNP3VESE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZWWNQNP3VESEWI54","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZWWNQNP3","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:ZWWNQNP3VESEWI54SJVWQIJFH5","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0701043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-01-08T18:41:38Z","cross_cats_sorted":["math.IT","math.OC"],"title_canon_sha256":"fc5bd90cd2588d1010f5f72eb808da8bcad125fa034d1db6813f767fc9c56f71","abstract_canon_sha256":"f86d1dfdde172c083373b782adfdaba68dea3bd20c1d1ec306adac84d6b0b367"},"schema_version":"1.0"},"canonical_sha256":"cdacd835fba9244b23bc926b6821253f7acc9c208c13cd0f4a204a8f39f53837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:55.004503Z","signature_b64":"uij2yJvFWwfZu9iBrQdIDV65SpO+TqokyHhYz+iQ+X3wr7NLcFw5UeaiMgDLkqio9bTynzkdt99cdejszARNAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdacd835fba9244b23bc926b6821253f7acc9c208c13cd0f4a204a8f39f53837","last_reissued_at":"2026-05-18T04:41:55.003855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:55.003855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0701043","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-05-18T04:41:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RdbYVNGjGx0VQxSSDO06otJtrymDfplrkIYhXHdrNHgLDW2Yy0qNwKm9GFelTL+FfqVnrN8J4S9cU9YmugytAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:24:36.601500Z"},"content_sha256":"e8018b55c44c24e5358a4cd763aac5491ba49a6a8cb824f8919e95e2b2d1d4f0","schema_version":"1.0","event_id":"sha256:e8018b55c44c24e5358a4cd763aac5491ba49a6a8cb824f8919e95e2b2d1d4f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:ZWWNQNP3VESEWI54SJVWQIJFH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Alternating Minimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.OC"],"primary_cat":"cs.IT","authors_text":"Devavrat Shah, Gregory Wornell, Urs Niesen","submitted_at":"2007-01-08T18:41:38Z","abstract_excerpt":"The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many areas such as signal processing, information theory, control, and finance. A general set of sufficient conditions for the convergence and correctness of the algorithm is quite well-known when the underlying problem parameters are fixed. In many practical situations, however, the underlying problem parameters are changing over time, and the use of an adaptiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701043","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":""},"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-18T04:41:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cs7MwT6xZhqojauJyJOkPJvc8aAGgFEOR3XMxCop57emlZKFI2VXuM5VB+w50mIA9uVSyWlrUOuAdSC8RvytCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:24:36.602086Z"},"content_sha256":"b91bebcf6b26bdeda04b155201aa821418cfc347f16ef6c941c3be7149417a1e","schema_version":"1.0","event_id":"sha256:b91bebcf6b26bdeda04b155201aa821418cfc347f16ef6c941c3be7149417a1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/bundle.json","state_url":"https://pith.science/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/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-04T18:24:36Z","links":{"resolver":"https://pith.science/pith/ZWWNQNP3VESEWI54SJVWQIJFH5","bundle":"https://pith.science/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/bundle.json","state":"https://pith.science/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWWNQNP3VESEWI54SJVWQIJFH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:ZWWNQNP3VESEWI54SJVWQIJFH5","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":"f86d1dfdde172c083373b782adfdaba68dea3bd20c1d1ec306adac84d6b0b367","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-01-08T18:41:38Z","title_canon_sha256":"fc5bd90cd2588d1010f5f72eb808da8bcad125fa034d1db6813f767fc9c56f71"},"schema_version":"1.0","source":{"id":"cs/0701043","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0701043","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0701043v2","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0701043","created_at":"2026-05-18T04:41:55Z"},{"alias_kind":"pith_short_12","alias_value":"ZWWNQNP3VESE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"ZWWNQNP3VESEWI54","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"ZWWNQNP3","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:b91bebcf6b26bdeda04b155201aa821418cfc347f16ef6c941c3be7149417a1e","target":"graph","created_at":"2026-05-18T04:41:55Z","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":"The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The iterative nature and simplicity of the algorithm has led to its application to many areas such as signal processing, information theory, control, and finance. A general set of sufficient conditions for the convergence and correctness of the algorithm is quite well-known when the underlying problem parameters are fixed. In many practical situations, however, the underlying problem parameters are changing over time, and the use of an adaptiv","authors_text":"Devavrat Shah, Gregory Wornell, Urs Niesen","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-01-08T18:41:38Z","title":"Adaptive Alternating Minimization Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0701043","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:e8018b55c44c24e5358a4cd763aac5491ba49a6a8cb824f8919e95e2b2d1d4f0","target":"record","created_at":"2026-05-18T04:41:55Z","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":"f86d1dfdde172c083373b782adfdaba68dea3bd20c1d1ec306adac84d6b0b367","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2007-01-08T18:41:38Z","title_canon_sha256":"fc5bd90cd2588d1010f5f72eb808da8bcad125fa034d1db6813f767fc9c56f71"},"schema_version":"1.0","source":{"id":"cs/0701043","kind":"arxiv","version":2}},"canonical_sha256":"cdacd835fba9244b23bc926b6821253f7acc9c208c13cd0f4a204a8f39f53837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdacd835fba9244b23bc926b6821253f7acc9c208c13cd0f4a204a8f39f53837","first_computed_at":"2026-05-18T04:41:55.003855Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:41:55.003855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uij2yJvFWwfZu9iBrQdIDV65SpO+TqokyHhYz+iQ+X3wr7NLcFw5UeaiMgDLkqio9bTynzkdt99cdejszARNAA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:41:55.004503Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0701043","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8018b55c44c24e5358a4cd763aac5491ba49a6a8cb824f8919e95e2b2d1d4f0","sha256:b91bebcf6b26bdeda04b155201aa821418cfc347f16ef6c941c3be7149417a1e"],"state_sha256":"af8eadedc65bd3d1ee866860dceb30bfbdacd1567c460e5f8523fc0f703fea15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eT+HOSiJZcD75trU5gYkzKYN2CuV8V/06mmvUgsMtDlE1ZWUXbRPpw/+tJjBgWw+oKGJfRbFDCjhpj8A6XD+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:24:36.605307Z","bundle_sha256":"620d57ac7c351f5965613488dd379f256bb456d6a686992ed494747c7bb44ce3"}}