{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TEHLIVCP7PABJGZQS7SHMSBZB7","short_pith_number":"pith:TEHLIVCP","canonical_record":{"source":{"id":"2606.03383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T09:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"cadc0d6a4e18d7317c73e09de6d345271b9ae0824f270c53ad6c69d926f34e65","abstract_canon_sha256":"25545df27447fb8a8f86b200d8f1ffe15a1922538715f1f64f3b634f5b4ae387"},"schema_version":"1.0"},"canonical_sha256":"990eb4544ffbc0149b3097e47648390fcbfd292a3b790e2a053830d6b4c05a9b","source":{"kind":"arxiv","id":"2606.03383","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03383","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03383v1","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03383","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"TEHLIVCP7PAB","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"TEHLIVCP7PABJGZQ","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"TEHLIVCP","created_at":"2026-06-03T01:05:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TEHLIVCP7PABJGZQS7SHMSBZB7","target":"record","payload":{"canonical_record":{"source":{"id":"2606.03383","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T09:27:42Z","cross_cats_sorted":[],"title_canon_sha256":"cadc0d6a4e18d7317c73e09de6d345271b9ae0824f270c53ad6c69d926f34e65","abstract_canon_sha256":"25545df27447fb8a8f86b200d8f1ffe15a1922538715f1f64f3b634f5b4ae387"},"schema_version":"1.0"},"canonical_sha256":"990eb4544ffbc0149b3097e47648390fcbfd292a3b790e2a053830d6b4c05a9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:56.490056Z","signature_b64":"xH6IRHdLkp1wnh1qTS0aU61r8jpXSY1dzked97Wpu9LiYP0SnpxcGkRaT/rW21ZBbaOcmXkqp+fR+SjSrFBwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"990eb4544ffbc0149b3097e47648390fcbfd292a3b790e2a053830d6b4c05a9b","last_reissued_at":"2026-06-03T01:05:56.489477Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:56.489477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.03383","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-06-03T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HE3GJrkBgX17UPprT2MEq3yxKFTVPc79W6p2J64pqExEdY1XZFlww4ELheXL0v04lQJUzeJ4/ud/iTxFpfHaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:43.413335Z"},"content_sha256":"92696726c2a746020261b66367ba85ab158c6b3c68766e334dcd3dd012104a2a","schema_version":"1.0","event_id":"sha256:92696726c2a746020261b66367ba85ab158c6b3c68766e334dcd3dd012104a2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TEHLIVCP7PABJGZQS7SHMSBZB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Recursive Domain- and Objective-Adaptive Frank-Wolfe Algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Marcel Kaiser, Tobias Sutter","submitted_at":"2026-06-02T09:27:42Z","abstract_excerpt":"We investigate a recursive variant of the classical Frank-Wolfe algorithm for minimizing a convex differentiable function over a convex compact domain. Unlike the traditional setting, we assume that both the problem domain and the objective function are initially unknown and must be learned from data. To address this, we integrate estimators into the optimization process, allowing the algorithm to iteratively refine approximations of the problem domain and the objective function. Our approach maintains the projection-free nature of the classical Frank-Wolfe algorithm while adapting to the unce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03383","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/2606.03383/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-06-03T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5yYY37P/NGE1Z4/YRrcIEjJAcoDPbTmEH/uvrfY6cR7zAaLsT9Kj0pvVsnCpbpo6f1jK5tPbhn/6HnYZWbC6DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:43.413731Z"},"content_sha256":"2debd971e5492a05434aed2229881dc6bdc7bfe4d8c93a975d933691925a652e","schema_version":"1.0","event_id":"sha256:2debd971e5492a05434aed2229881dc6bdc7bfe4d8c93a975d933691925a652e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/bundle.json","state_url":"https://pith.science/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/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-07-03T21:53:43Z","links":{"resolver":"https://pith.science/pith/TEHLIVCP7PABJGZQS7SHMSBZB7","bundle":"https://pith.science/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/bundle.json","state":"https://pith.science/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TEHLIVCP7PABJGZQS7SHMSBZB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TEHLIVCP7PABJGZQS7SHMSBZB7","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":"25545df27447fb8a8f86b200d8f1ffe15a1922538715f1f64f3b634f5b4ae387","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T09:27:42Z","title_canon_sha256":"cadc0d6a4e18d7317c73e09de6d345271b9ae0824f270c53ad6c69d926f34e65"},"schema_version":"1.0","source":{"id":"2606.03383","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.03383","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2606.03383v1","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03383","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"TEHLIVCP7PAB","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"TEHLIVCP7PABJGZQ","created_at":"2026-06-03T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"TEHLIVCP","created_at":"2026-06-03T01:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:2debd971e5492a05434aed2229881dc6bdc7bfe4d8c93a975d933691925a652e","target":"graph","created_at":"2026-06-03T01:05:56Z","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/2606.03383/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate a recursive variant of the classical Frank-Wolfe algorithm for minimizing a convex differentiable function over a convex compact domain. Unlike the traditional setting, we assume that both the problem domain and the objective function are initially unknown and must be learned from data. To address this, we integrate estimators into the optimization process, allowing the algorithm to iteratively refine approximations of the problem domain and the objective function. Our approach maintains the projection-free nature of the classical Frank-Wolfe algorithm while adapting to the unce","authors_text":"Marcel Kaiser, Tobias Sutter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T09:27:42Z","title":"A Recursive Domain- and Objective-Adaptive Frank-Wolfe Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03383","kind":"arxiv","version":1},"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:92696726c2a746020261b66367ba85ab158c6b3c68766e334dcd3dd012104a2a","target":"record","created_at":"2026-06-03T01:05:56Z","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":"25545df27447fb8a8f86b200d8f1ffe15a1922538715f1f64f3b634f5b4ae387","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-02T09:27:42Z","title_canon_sha256":"cadc0d6a4e18d7317c73e09de6d345271b9ae0824f270c53ad6c69d926f34e65"},"schema_version":"1.0","source":{"id":"2606.03383","kind":"arxiv","version":1}},"canonical_sha256":"990eb4544ffbc0149b3097e47648390fcbfd292a3b790e2a053830d6b4c05a9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"990eb4544ffbc0149b3097e47648390fcbfd292a3b790e2a053830d6b4c05a9b","first_computed_at":"2026-06-03T01:05:56.489477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:56.489477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xH6IRHdLkp1wnh1qTS0aU61r8jpXSY1dzked97Wpu9LiYP0SnpxcGkRaT/rW21ZBbaOcmXkqp+fR+SjSrFBwCg==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:56.490056Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.03383","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92696726c2a746020261b66367ba85ab158c6b3c68766e334dcd3dd012104a2a","sha256:2debd971e5492a05434aed2229881dc6bdc7bfe4d8c93a975d933691925a652e"],"state_sha256":"6651a9312bfc18c923cec40abadc60540bb754c0c6f2ee5d403d311ea3e05ea9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRiR/U78tIU+aWUXfcbS6Pq5sz7L+PC8qqBbilMhTuEG8GChHUPMfpqspKOJ3XL7RUtt06+rkieE44WJ6whZDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:53:43.415858Z","bundle_sha256":"294016898bdfc8744535d6447fd08f00eb71fb64b8c4dc412697dce36d9c7a98"}}