{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3DHDKGLGZEWAOAHJ7LLGS76POO","short_pith_number":"pith:3DHDKGLG","canonical_record":{"source":{"id":"2605.17027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T14:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"5800bf1cd15a693b49bf57698e8828c02b06542be1b44991e862037f3a67a71a","abstract_canon_sha256":"660f1bbf5749e8738df0f1ef57732fb266d5f7b21bc4db112e06c9a8068243c4"},"schema_version":"1.0"},"canonical_sha256":"d8ce351966c92c0700e9fad6697fcf739525bd708073cfa230b629a140cb3a65","source":{"kind":"arxiv","id":"2605.17027","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17027","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17027v1","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17027","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"3DHDKGLGZEWA","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_16","alias_value":"3DHDKGLGZEWAOAHJ","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_8","alias_value":"3DHDKGLG","created_at":"2026-05-20T00:03:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3DHDKGLGZEWAOAHJ7LLGS76POO","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17027","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T14:55:54Z","cross_cats_sorted":[],"title_canon_sha256":"5800bf1cd15a693b49bf57698e8828c02b06542be1b44991e862037f3a67a71a","abstract_canon_sha256":"660f1bbf5749e8738df0f1ef57732fb266d5f7b21bc4db112e06c9a8068243c4"},"schema_version":"1.0"},"canonical_sha256":"d8ce351966c92c0700e9fad6697fcf739525bd708073cfa230b629a140cb3a65","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:36.630125Z","signature_b64":"z2djQ7eS1ECvp285ZbvhjPohyKoHfLD2sUc8prL9weUJyy83EE5cN4IjDDFywge9WqRXb8RdgeXqe1rm8+skAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8ce351966c92c0700e9fad6697fcf739525bd708073cfa230b629a140cb3a65","last_reissued_at":"2026-05-20T00:03:36.629224Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:36.629224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17027","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-20T00:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFIYmez+6gLbo5BilQJZ9CcT1YfkkSprx7GVoZn6NOkhgxR/X09w7oSiH1IzPaGir5pQjMFCrgA/EFw+9V60AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:09:20.063894Z"},"content_sha256":"f7efbe09bde2b0934c493ae43bc8cbee198c18fa1edd7167c1d47eb231545a82","schema_version":"1.0","event_id":"sha256:f7efbe09bde2b0934c493ae43bc8cbee198c18fa1edd7167c1d47eb231545a82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3DHDKGLGZEWAOAHJ7LLGS76POO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clipped Stochastic Gradient Tracking For Locally Smooth Functions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Junyu Zhang, Leilei Mei","submitted_at":"2026-05-16T14:55:54Z","abstract_excerpt":"Most stochastic gradient tracking (GT) methods adopt pre-scheduled stepsize rules, while a few recent works studied adaptive stepsizes that attempt to respond to the problem's local landscape. These methods are typically built upon the problem's global smoothness constant in both analysis and implementation, even for the adaptive ones. On the one hand, for many problems the local smoothness constant may vary drastically across the domain, and sometimes even unbounded, using the global upper bound of the local constants is too conservative. On the other hand, drastic stepsize changes can cause "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an O(∑_i n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity has been established for our algorithm.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The distributed optimization problems satisfy the Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets, which the paper states covers most common growth functions ranging from constant and logarithmic to polynomial and exponential.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The authors derive a clipped gradient tracking method with staggered variance reduction for RUC-regular finite-sum distributed optimization problems, establishing an O(∑ n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity bound that relies only on local smoothness.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"791f88806ce90aa8cdd6516e9fe7b519cd3897fc70c72bce354bf83f7ceaea66"},"source":{"id":"2605.17027","kind":"arxiv","version":1},"verdict":{"id":"549dd20c-67b0-4689-a30a-963561d4363b","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:06:34.601391Z","strongest_claim":"For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an O(∑_i n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity has been established for our algorithm.","one_line_summary":"The authors derive a clipped gradient tracking method with staggered variance reduction for RUC-regular finite-sum distributed optimization problems, establishing an O(∑ n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity bound that relies only on local smoothness.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The distributed optimization problems satisfy the Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets, which the paper states covers most common growth functions ranging from constant and logarithmic to polynomial and exponential.","pith_extraction_headline":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17027/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:18.976685Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:20:46.037867Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:44.684306Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T18:51:57.540894Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.176362Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:23.493330Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"e80cfc4e152201efcbf43c260621402a1ccd48bc20caaeb91dbab7d8b22cefec"},"references":{"count":56,"sample":[{"doi":"","year":2019,"title":"Stochastic gradient push for distributed deep learning","work_id":"66a35772-7edb-4b82-91ba-872982917d3c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications","work_id":"6506c06d-66f0-45ff-a2f8-94a23c106fbf","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"One hundred years since the introduction of the set distance by dimitrie pompeiu","work_id":"dedd6e29-278c-43e1-ad9b-eca82bf7a1bb","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems","work_id":"70fbd2bf-85d6-488f-87d4-f6ee1f04ac00","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1985,"title":"Phase retrieval via wirtinger flow: Theory and algorithms","work_id":"3aae7f90-2cbe-4b83-8dfd-ea8b54b76506","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":56,"snapshot_sha256":"7777eae14041370a4c8eb1f66058bfa8be7c1b0ad208617f4edee6d3c74d643a","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"88ee2199779a9aefeaa82ec2c3b8d267a78dc69ce30c11bc4709724e3b7f9e62"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"549dd20c-67b0-4689-a30a-963561d4363b"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gmwvF6Q+7TaupH4x1vh0dSoqXH+s+ICFsO35Hgx7ifYDtB4cqc/a1CDlrY9TgDLOvROHJiq+Z7aS45tcWEFDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:09:20.064737Z"},"content_sha256":"bee213557f8f4948a9b884ab7f56121e3b1df4ef1996ca5a9839b0989011f2a9","schema_version":"1.0","event_id":"sha256:bee213557f8f4948a9b884ab7f56121e3b1df4ef1996ca5a9839b0989011f2a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/bundle.json","state_url":"https://pith.science/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/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-30T21:09:20Z","links":{"resolver":"https://pith.science/pith/3DHDKGLGZEWAOAHJ7LLGS76POO","bundle":"https://pith.science/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/bundle.json","state":"https://pith.science/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DHDKGLGZEWAOAHJ7LLGS76POO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3DHDKGLGZEWAOAHJ7LLGS76POO","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":"660f1bbf5749e8738df0f1ef57732fb266d5f7b21bc4db112e06c9a8068243c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T14:55:54Z","title_canon_sha256":"5800bf1cd15a693b49bf57698e8828c02b06542be1b44991e862037f3a67a71a"},"schema_version":"1.0","source":{"id":"2605.17027","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17027","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17027v1","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17027","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_12","alias_value":"3DHDKGLGZEWA","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_16","alias_value":"3DHDKGLGZEWAOAHJ","created_at":"2026-05-20T00:03:36Z"},{"alias_kind":"pith_short_8","alias_value":"3DHDKGLG","created_at":"2026-05-20T00:03:36Z"}],"graph_snapshots":[{"event_id":"sha256:bee213557f8f4948a9b884ab7f56121e3b1df4ef1996ca5a9839b0989011f2a9","target":"graph","created_at":"2026-05-20T00:03:36Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an O(∑_i n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity has been established for our algorithm."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The distributed optimization problems satisfy the Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets, which the paper states covers most common growth functions ranging from constant and logarithmic to polynomial and exponential."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"The authors derive a clipped gradient tracking method with staggered variance reduction for RUC-regular finite-sum distributed optimization problems, establishing an O(∑ n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity bound that relies only on local smoothness."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems."}],"snapshot_sha256":"791f88806ce90aa8cdd6516e9fe7b519cd3897fc70c72bce354bf83f7ceaea66"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"88ee2199779a9aefeaa82ec2c3b8d267a78dc69ce30c11bc4709724e3b7f9e62"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T20:31:18.976685Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:20:46.037867Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T19:49:44.684306Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T18:51:57.540894Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.176362Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:23.493330Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17027/integrity.json","findings":[],"snapshot_sha256":"e80cfc4e152201efcbf43c260621402a1ccd48bc20caaeb91dbab7d8b22cefec","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most stochastic gradient tracking (GT) methods adopt pre-scheduled stepsize rules, while a few recent works studied adaptive stepsizes that attempt to respond to the problem's local landscape. These methods are typically built upon the problem's global smoothness constant in both analysis and implementation, even for the adaptive ones. On the one hand, for many problems the local smoothness constant may vary drastically across the domain, and sometimes even unbounded, using the global upper bound of the local constants is too conservative. On the other hand, drastic stepsize changes can cause ","authors_text":"Junyu Zhang, Leilei Mei","cross_cats":[],"headline":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T14:55:54Z","title":"Clipped Stochastic Gradient Tracking For Locally Smooth Functions"},"references":{"count":56,"internal_anchors":1,"resolved_work":56,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Stochastic gradient push for distributed deep learning","work_id":"66a35772-7edb-4b82-91ba-872982917d3c","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"A descent lemma beyond lipschitz gradient continuity: first-order methods revisited and applications","work_id":"6506c06d-66f0-45ff-a2f8-94a23c106fbf","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"One hundred years since the introduction of the set distance by dimitrie pompeiu","work_id":"dedd6e29-278c-43e1-ad9b-eca82bf7a1bb","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"First order methods beyond convexity and lipschitz gradient continuity with applications to quadratic inverse problems","work_id":"70fbd2bf-85d6-488f-87d4-f6ee1f04ac00","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Phase retrieval via wirtinger flow: Theory and algorithms","work_id":"3aae7f90-2cbe-4b83-8dfd-ea8b54b76506","year":1985}],"snapshot_sha256":"7777eae14041370a4c8eb1f66058bfa8be7c1b0ad208617f4edee6d3c74d643a"},"source":{"id":"2605.17027","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:06:34.601391Z","id":"549dd20c-67b0-4689-a30a-963561d4363b","model_set":{"reader":"grok-4.3"},"one_line_summary":"The authors derive a clipped gradient tracking method with staggered variance reduction for RUC-regular finite-sum distributed optimization problems, establishing an O(∑ n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity bound that relies only on local smoothness.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A clipped stochastic gradient tracking method with staggered variance reduction converges using only local smoothness for RUC-regular distributed problems.","strongest_claim":"For RUC-regular distributed optimization problems with finite-sum structure, we derive a clipped gradient tracking method with staggered variance reduction, which only relies on the local smoothness of objective functions, and an O(∑_i n_i^{1.5} + n_i^{0.5} ε^{-1}) complexity has been established for our algorithm.","weakest_assumption":"The distributed optimization problems satisfy the Relative Uniform Continuity (RUC) regularity condition for the local smoothness constant as a function of sets, which the paper states covers most common growth functions ranging from constant and logarithmic to polynomial and exponential."}},"verdict_id":"549dd20c-67b0-4689-a30a-963561d4363b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f7efbe09bde2b0934c493ae43bc8cbee198c18fa1edd7167c1d47eb231545a82","target":"record","created_at":"2026-05-20T00:03:36Z","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":"660f1bbf5749e8738df0f1ef57732fb266d5f7b21bc4db112e06c9a8068243c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-16T14:55:54Z","title_canon_sha256":"5800bf1cd15a693b49bf57698e8828c02b06542be1b44991e862037f3a67a71a"},"schema_version":"1.0","source":{"id":"2605.17027","kind":"arxiv","version":1}},"canonical_sha256":"d8ce351966c92c0700e9fad6697fcf739525bd708073cfa230b629a140cb3a65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8ce351966c92c0700e9fad6697fcf739525bd708073cfa230b629a140cb3a65","first_computed_at":"2026-05-20T00:03:36.629224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:36.629224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2djQ7eS1ECvp285ZbvhjPohyKoHfLD2sUc8prL9weUJyy83EE5cN4IjDDFywge9WqRXb8RdgeXqe1rm8+skAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:36.630125Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17027","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7efbe09bde2b0934c493ae43bc8cbee198c18fa1edd7167c1d47eb231545a82","sha256:bee213557f8f4948a9b884ab7f56121e3b1df4ef1996ca5a9839b0989011f2a9"],"state_sha256":"56e38d7435c0c5f432ae698dec1ad674672225a0e5d1d2b9e6cd8526b6506037"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AupDefWLYjqMTZzXy9JfoFylWeuZiC/sGrpGU0+t2/dAzAa6zyWwVa+3uH3r7bPa6eoupu78TGCbG6Vrdo1fAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:09:20.068629Z","bundle_sha256":"d72b6684defb13a18549b2ea2f4637f1126dce44c6a94248079453feabb5ea80"}}