{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:7QVXVDOH7XTD2J4PIKU2H5AYBY","short_pith_number":"pith:7QVXVDOH","canonical_record":{"source":{"id":"2207.09002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T00:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"e10803a46644ad918e9c56db59c68c4bb8a772648540a61d6092b7da2879c284","abstract_canon_sha256":"7d2bbad1fe4372aa10185e1251d9291728c89217d5e4ab7c56e5023e4e966b14"},"schema_version":"1.0"},"canonical_sha256":"fc2b7a8dc7fde63d278f42a9a3f4180e1d7d9ee82c312253faba418aaca1ac96","source":{"kind":"arxiv","id":"2207.09002","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.09002","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"2207.09002v1","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09002","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"7QVXVDOH7XTD","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_16","alias_value":"7QVXVDOH7XTD2J4P","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_8","alias_value":"7QVXVDOH","created_at":"2026-07-05T04:41:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:7QVXVDOH7XTD2J4PIKU2H5AYBY","target":"record","payload":{"canonical_record":{"source":{"id":"2207.09002","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T00:57:58Z","cross_cats_sorted":[],"title_canon_sha256":"e10803a46644ad918e9c56db59c68c4bb8a772648540a61d6092b7da2879c284","abstract_canon_sha256":"7d2bbad1fe4372aa10185e1251d9291728c89217d5e4ab7c56e5023e4e966b14"},"schema_version":"1.0"},"canonical_sha256":"fc2b7a8dc7fde63d278f42a9a3f4180e1d7d9ee82c312253faba418aaca1ac96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:41:15.883301Z","signature_b64":"SceZauRmvIuJUZrQ+ElxfMXfA9AshFPaOGhpfMycOk1K1IK11i7W6uAkIaWq+3El75p+qZUT+GCJty2uhCubCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc2b7a8dc7fde63d278f42a9a3f4180e1d7d9ee82c312253faba418aaca1ac96","last_reissued_at":"2026-07-05T04:41:15.882781Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:41:15.882781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.09002","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-07-05T04:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aJEXRFSn5m9VrzaeLFaCX6O0BmZfoCvmA12LMWUkdOYNDVFd90bY54BYQxObQlIZu8Fr79ff/9A7q9D3b8NeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:48.392134Z"},"content_sha256":"de0612cf636a1d4bc22b9d50c644a9c34451e515112e361c0e54ac1bd63d815f","schema_version":"1.0","event_id":"sha256:de0612cf636a1d4bc22b9d50c644a9c34451e515112e361c0e54ac1bd63d815f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:7QVXVDOH7XTD2J4PIKU2H5AYBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Lichen Zhang, Yuanyuan Yang, Zhao Song, Zhaozhuo Xu","submitted_at":"2022-07-19T00:57:58Z","abstract_excerpt":"In this paper, we study the problem of speeding up a type of optimization algorithms called Frank-Wolfe, a conditional gradient method. We develop and employ two novel inner product search data structures, improving the prior fastest algorithm in [Shrivastava, Song and Xu, NeurIPS 2021].\n  * The first data structure uses low-dimensional random projection to reduce the problem to a lower dimension, then uses efficient inner product data structure. It has preprocessing time $\\tilde O(nd^{\\omega-1}+dn^{1+o(1)})$ and per iteration cost $\\tilde O(d+n^\\rho)$ for small constant $\\rho$.\n  * The second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09002","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/2207.09002/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-05T04:41:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8NwZe/fnuEz0sOQU7ITJSospxNeIUjx5CcN5dDdCdBrskJFrFsh6ag00RgNDHGqjWD2y8qftbVC2lHV9wmQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:01:48.392526Z"},"content_sha256":"cc98ea4562526b49e2edc664c5b5268d0b2c5dbdfaabeb4c4b3a676b6140faef","schema_version":"1.0","event_id":"sha256:cc98ea4562526b49e2edc664c5b5268d0b2c5dbdfaabeb4c4b3a676b6140faef"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/bundle.json","state_url":"https://pith.science/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/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-07T10:01:48Z","links":{"resolver":"https://pith.science/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY","bundle":"https://pith.science/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/bundle.json","state":"https://pith.science/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QVXVDOH7XTD2J4PIKU2H5AYBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:7QVXVDOH7XTD2J4PIKU2H5AYBY","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":"7d2bbad1fe4372aa10185e1251d9291728c89217d5e4ab7c56e5023e4e966b14","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T00:57:58Z","title_canon_sha256":"e10803a46644ad918e9c56db59c68c4bb8a772648540a61d6092b7da2879c284"},"schema_version":"1.0","source":{"id":"2207.09002","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.09002","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"arxiv_version","alias_value":"2207.09002v1","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09002","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_12","alias_value":"7QVXVDOH7XTD","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_16","alias_value":"7QVXVDOH7XTD2J4P","created_at":"2026-07-05T04:41:15Z"},{"alias_kind":"pith_short_8","alias_value":"7QVXVDOH","created_at":"2026-07-05T04:41:15Z"}],"graph_snapshots":[{"event_id":"sha256:cc98ea4562526b49e2edc664c5b5268d0b2c5dbdfaabeb4c4b3a676b6140faef","target":"graph","created_at":"2026-07-05T04:41:15Z","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/2207.09002/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we study the problem of speeding up a type of optimization algorithms called Frank-Wolfe, a conditional gradient method. We develop and employ two novel inner product search data structures, improving the prior fastest algorithm in [Shrivastava, Song and Xu, NeurIPS 2021].\n  * The first data structure uses low-dimensional random projection to reduce the problem to a lower dimension, then uses efficient inner product data structure. It has preprocessing time $\\tilde O(nd^{\\omega-1}+dn^{1+o(1)})$ and per iteration cost $\\tilde O(d+n^\\rho)$ for small constant $\\rho$.\n  * The second","authors_text":"Lichen Zhang, Yuanyuan Yang, Zhao Song, Zhaozhuo Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T00:57:58Z","title":"Accelerating Frank-Wolfe Algorithm using Low-Dimensional and Adaptive Data Structures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09002","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:de0612cf636a1d4bc22b9d50c644a9c34451e515112e361c0e54ac1bd63d815f","target":"record","created_at":"2026-07-05T04:41:15Z","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":"7d2bbad1fe4372aa10185e1251d9291728c89217d5e4ab7c56e5023e4e966b14","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-19T00:57:58Z","title_canon_sha256":"e10803a46644ad918e9c56db59c68c4bb8a772648540a61d6092b7da2879c284"},"schema_version":"1.0","source":{"id":"2207.09002","kind":"arxiv","version":1}},"canonical_sha256":"fc2b7a8dc7fde63d278f42a9a3f4180e1d7d9ee82c312253faba418aaca1ac96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2b7a8dc7fde63d278f42a9a3f4180e1d7d9ee82c312253faba418aaca1ac96","first_computed_at":"2026-07-05T04:41:15.882781Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:41:15.882781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SceZauRmvIuJUZrQ+ElxfMXfA9AshFPaOGhpfMycOk1K1IK11i7W6uAkIaWq+3El75p+qZUT+GCJty2uhCubCA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:41:15.883301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.09002","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de0612cf636a1d4bc22b9d50c644a9c34451e515112e361c0e54ac1bd63d815f","sha256:cc98ea4562526b49e2edc664c5b5268d0b2c5dbdfaabeb4c4b3a676b6140faef"],"state_sha256":"d74cbce6d0ab9683356c134ff5d1e2bea3dfc7895d6958e492848d19048997e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BboPH+fQMB39JjgTQG3HbmLnyoUtlaMDftvmeI0Js2Nl8Ps/069mkZvHodB89WTyJlFKKqql/HRg9xi5m7uNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:01:48.394470Z","bundle_sha256":"1008bd92c1266d357c9c3d416035d62754d146cf76a65035711df5fc49b26d81"}}