{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QFWJRI4GUVU4KO2XT2E2NAKE2U","short_pith_number":"pith:QFWJRI4G","canonical_record":{"source":{"id":"2507.10452","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-14T16:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b1e1f664e77993fbb370e6e7ae7666e51c4c944c56a6abd98bd5216025a1cc9","abstract_canon_sha256":"c6211489e298ed02ba0eef21318d085df66f6c1194552361e94f77965b6293ff"},"schema_version":"1.0"},"canonical_sha256":"816c98a386a569c53b579e89a68144d51c8ca45ad31eb65b0e092825bdb5b7d4","source":{"kind":"arxiv","id":"2507.10452","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10452","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10452v2","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10452","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"QFWJRI4GUVU4","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"QFWJRI4GUVU4KO2X","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"QFWJRI4G","created_at":"2026-07-05T11:37:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QFWJRI4GUVU4KO2XT2E2NAKE2U","target":"record","payload":{"canonical_record":{"source":{"id":"2507.10452","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-14T16:31:06Z","cross_cats_sorted":[],"title_canon_sha256":"4b1e1f664e77993fbb370e6e7ae7666e51c4c944c56a6abd98bd5216025a1cc9","abstract_canon_sha256":"c6211489e298ed02ba0eef21318d085df66f6c1194552361e94f77965b6293ff"},"schema_version":"1.0"},"canonical_sha256":"816c98a386a569c53b579e89a68144d51c8ca45ad31eb65b0e092825bdb5b7d4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:45.783881Z","signature_b64":"ynIu+39l07HgYT/usG+bwl2qb9w5AdGidItGU/Sqq+08/j8bKmXGyB/CpadajHaO1RwWd0HMCEWSDzQdrikBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816c98a386a569c53b579e89a68144d51c8ca45ad31eb65b0e092825bdb5b7d4","last_reissued_at":"2026-07-05T11:37:45.783344Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:45.783344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.10452","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-05T11:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"viJTy8uj4c2WjLIz8/FpC3kwc+6Ou9ctIRQ9l6BaipfKMslLPP0yhtstV5E+LQzwFpA/oaTekSuS2EDBTNXlAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:53:03.591039Z"},"content_sha256":"1edc2f618589c484188efd5454ce016c64d285b013987991bdaff3bda30f8d37","schema_version":"1.0","event_id":"sha256:1edc2f618589c484188efd5454ce016c64d285b013987991bdaff3bda30f8d37"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QFWJRI4GUVU4KO2XT2E2NAKE2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some remarks on gradient dominance and LQR policy optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eduardo D. Sontag","submitted_at":"2025-07-14T16:31:06Z","abstract_excerpt":"Solutions of optimization problems, including policy optimization in reinforcement learning, typically rely upon some variant of gradient descent. There has been much recent work in the machine learning, control, and optimization communities applying the Polyak-{\\L}ojasiewicz Inequality (PLI) to such problems in order to establish an exponential rate of convergence (a.k.a. ``linear convergence'' in the local-iteration language of numerical analysis) of loss functions to their minima under the gradient flow. Often, as is the case of policy iteration for the continuous-time LQR problem, this rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10452","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/2507.10452/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-05T11:37:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6qbJP9e41C9odObbTKafABKqPiIxeOKjLcodQ0VCYkNUjz9sRRK3Cu/a7GrsIrDNPDPJlR/NhtplqIPnwYLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:53:03.591518Z"},"content_sha256":"d72596a09572e7aa725705058c5217c5566c340b3feda7a5f0def5d91ae61990","schema_version":"1.0","event_id":"sha256:d72596a09572e7aa725705058c5217c5566c340b3feda7a5f0def5d91ae61990"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/bundle.json","state_url":"https://pith.science/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/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-08T11:53:03Z","links":{"resolver":"https://pith.science/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U","bundle":"https://pith.science/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/bundle.json","state":"https://pith.science/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFWJRI4GUVU4KO2XT2E2NAKE2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QFWJRI4GUVU4KO2XT2E2NAKE2U","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":"c6211489e298ed02ba0eef21318d085df66f6c1194552361e94f77965b6293ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-14T16:31:06Z","title_canon_sha256":"4b1e1f664e77993fbb370e6e7ae7666e51c4c944c56a6abd98bd5216025a1cc9"},"schema_version":"1.0","source":{"id":"2507.10452","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10452","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10452v2","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10452","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_12","alias_value":"QFWJRI4GUVU4","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_16","alias_value":"QFWJRI4GUVU4KO2X","created_at":"2026-07-05T11:37:45Z"},{"alias_kind":"pith_short_8","alias_value":"QFWJRI4G","created_at":"2026-07-05T11:37:45Z"}],"graph_snapshots":[{"event_id":"sha256:d72596a09572e7aa725705058c5217c5566c340b3feda7a5f0def5d91ae61990","target":"graph","created_at":"2026-07-05T11:37:45Z","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/2507.10452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solutions of optimization problems, including policy optimization in reinforcement learning, typically rely upon some variant of gradient descent. There has been much recent work in the machine learning, control, and optimization communities applying the Polyak-{\\L}ojasiewicz Inequality (PLI) to such problems in order to establish an exponential rate of convergence (a.k.a. ``linear convergence'' in the local-iteration language of numerical analysis) of loss functions to their minima under the gradient flow. Often, as is the case of policy iteration for the continuous-time LQR problem, this rat","authors_text":"Eduardo D. Sontag","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-14T16:31:06Z","title":"Some remarks on gradient dominance and LQR policy optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10452","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:1edc2f618589c484188efd5454ce016c64d285b013987991bdaff3bda30f8d37","target":"record","created_at":"2026-07-05T11:37:45Z","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":"c6211489e298ed02ba0eef21318d085df66f6c1194552361e94f77965b6293ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-14T16:31:06Z","title_canon_sha256":"4b1e1f664e77993fbb370e6e7ae7666e51c4c944c56a6abd98bd5216025a1cc9"},"schema_version":"1.0","source":{"id":"2507.10452","kind":"arxiv","version":2}},"canonical_sha256":"816c98a386a569c53b579e89a68144d51c8ca45ad31eb65b0e092825bdb5b7d4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"816c98a386a569c53b579e89a68144d51c8ca45ad31eb65b0e092825bdb5b7d4","first_computed_at":"2026-07-05T11:37:45.783344Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:45.783344Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ynIu+39l07HgYT/usG+bwl2qb9w5AdGidItGU/Sqq+08/j8bKmXGyB/CpadajHaO1RwWd0HMCEWSDzQdrikBBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:45.783881Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.10452","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1edc2f618589c484188efd5454ce016c64d285b013987991bdaff3bda30f8d37","sha256:d72596a09572e7aa725705058c5217c5566c340b3feda7a5f0def5d91ae61990"],"state_sha256":"2d726a435330bc7d9896a3383a953d373ea8f2321fd339d4d397b0f6d519df4d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOsTEzgvZOU6+qBrMoVkNocwtC9Hlocg9hDurOliEb54QywwSZuCyM9H1CrdZtLdXykDNRfSLoibH6zM9yOiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:53:03.594906Z","bundle_sha256":"5a4a4ef1c5b44219d399c860485860144521ae3b618f199fa6d428099cfa59f0"}}