{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:4JLOB7KVM3NBT5A7FXFMY4WT5F","short_pith_number":"pith:4JLOB7KV","schema_version":"1.0","canonical_sha256":"e256e0fd5566da19f41f2dcacc72d3e950083e28f33604d88c2bd2ff6ae2ce15","source":{"kind":"arxiv","id":"2105.05352","version":1},"attestation_state":"computed","paper":{"title":"Frank-Wolfe Methods in Probability Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Carson Kent, Jose Blanchet, Peter Glynn","submitted_at":"2021-05-11T21:58:17Z","abstract_excerpt":"We introduce a new class of Frank-Wolfe algorithms for minimizing differentiable functionals over probability measures. This framework can be shown to encompass a diverse range of tasks in areas such as artificial intelligence, reinforcement learning, and optimization. Concrete computational complexities for these algorithms are established and demonstrate that these methods enjoy convergence in regimes that go beyond convexity and require minimal regularity of the underlying functional. Novel techniques used to obtain these results also lead to the development of new complexity bounds and dua"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2105.05352","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2021-05-11T21:58:17Z","cross_cats_sorted":[],"title_canon_sha256":"f3479837381973be7ee43039dc08c78d52041573a96625f67b7cb9f5f9c76656","abstract_canon_sha256":"c7d9061f36638b4084679bb8a55a3a0ad9eced39d95298d0d72f21ce298b5210"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:50.107476Z","signature_b64":"rdyy6NSadEigsQ14/VilLRkUSetXksIdzeUiulhpnd2xvTIFHRIF6zjpxp44INCUfDZ/PCvS70AiQQv9MrJLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e256e0fd5566da19f41f2dcacc72d3e950083e28f33604d88c2bd2ff6ae2ce15","last_reissued_at":"2026-07-05T02:39:50.106906Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:50.106906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Frank-Wolfe Methods in Probability Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Carson Kent, Jose Blanchet, Peter Glynn","submitted_at":"2021-05-11T21:58:17Z","abstract_excerpt":"We introduce a new class of Frank-Wolfe algorithms for minimizing differentiable functionals over probability measures. This framework can be shown to encompass a diverse range of tasks in areas such as artificial intelligence, reinforcement learning, and optimization. Concrete computational complexities for these algorithms are established and demonstrate that these methods enjoy convergence in regimes that go beyond convexity and require minimal regularity of the underlying functional. Novel techniques used to obtain these results also lead to the development of new complexity bounds and dua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.05352","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.05352/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2105.05352","created_at":"2026-07-05T02:39:50.106966+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.05352v1","created_at":"2026-07-05T02:39:50.106966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.05352","created_at":"2026-07-05T02:39:50.106966+00:00"},{"alias_kind":"pith_short_12","alias_value":"4JLOB7KVM3NB","created_at":"2026-07-05T02:39:50.106966+00:00"},{"alias_kind":"pith_short_16","alias_value":"4JLOB7KVM3NBT5A7","created_at":"2026-07-05T02:39:50.106966+00:00"},{"alias_kind":"pith_short_8","alias_value":"4JLOB7KV","created_at":"2026-07-05T02:39:50.106966+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11170","citing_title":"Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08222","citing_title":"Free-Energy Minimizing Policies Under Generative Model Ambiguity","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F","json":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F.json","graph_json":"https://pith.science/api/pith-number/4JLOB7KVM3NBT5A7FXFMY4WT5F/graph.json","events_json":"https://pith.science/api/pith-number/4JLOB7KVM3NBT5A7FXFMY4WT5F/events.json","paper":"https://pith.science/paper/4JLOB7KV"},"agent_actions":{"view_html":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F","download_json":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F.json","view_paper":"https://pith.science/paper/4JLOB7KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.05352&json=true","fetch_graph":"https://pith.science/api/pith-number/4JLOB7KVM3NBT5A7FXFMY4WT5F/graph.json","fetch_events":"https://pith.science/api/pith-number/4JLOB7KVM3NBT5A7FXFMY4WT5F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F/action/storage_attestation","attest_author":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F/action/author_attestation","sign_citation":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F/action/citation_signature","submit_replication":"https://pith.science/pith/4JLOB7KVM3NBT5A7FXFMY4WT5F/action/replication_record"}},"created_at":"2026-07-05T02:39:50.106966+00:00","updated_at":"2026-07-05T02:39:50.106966+00:00"}