{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VRJK7Z6LWX7JH5TSD7OALDTRSU","short_pith_number":"pith:VRJK7Z6L","canonical_record":{"source":{"id":"2607.22467","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-24T16:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"a006ca7da920d110893e4bf7f3e13e5f2a0a75e089f85f4f6f545e51069b68ce","abstract_canon_sha256":"6362e13c2c5b19d025d96ff10022e7219a61d74999585a475178386cc7b01e39"},"schema_version":"1.0"},"canonical_sha256":"ac52afe7cbb5fe93f6721fdc058e719518f1355019681e1c8d51eeed7dd48fc8","source":{"kind":"arxiv","id":"2607.22467","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22467","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22467v1","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22467","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"VRJK7Z6LWX7J","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_16","alias_value":"VRJK7Z6LWX7JH5TS","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_8","alias_value":"VRJK7Z6L","created_at":"2026-07-27T01:21:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VRJK7Z6LWX7JH5TSD7OALDTRSU","target":"record","payload":{"canonical_record":{"source":{"id":"2607.22467","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-24T16:31:30Z","cross_cats_sorted":[],"title_canon_sha256":"a006ca7da920d110893e4bf7f3e13e5f2a0a75e089f85f4f6f545e51069b68ce","abstract_canon_sha256":"6362e13c2c5b19d025d96ff10022e7219a61d74999585a475178386cc7b01e39"},"schema_version":"1.0"},"canonical_sha256":"ac52afe7cbb5fe93f6721fdc058e719518f1355019681e1c8d51eeed7dd48fc8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-27T01:21:22.501761Z","signature_b64":"sE3qhUIXI/vQQCeW1gWMyFtM8LPja0fxdV11H72+KfeGb4DoiHW8FrknSm3Mc3OI57jHkfoF6+RI21/SEbE8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac52afe7cbb5fe93f6721fdc058e719518f1355019681e1c8d51eeed7dd48fc8","last_reissued_at":"2026-07-27T01:21:22.500771Z","signature_status":"signed_v1","first_computed_at":"2026-07-27T01:21:22.500771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.22467","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-27T01:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zi6YHkYwT8nH3AnEPcQ9s/C5uT0r60WTTUzVp5HKkqAQ64an3Ix8VuWbCkWpbgWvQM4ISQTSuCDdy6RKfSodBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:13:05.588512Z"},"content_sha256":"0ceba5443c577c8ed314a5c3cc64f663fb1ebdd090a7a9f4bc4693891941b55d","schema_version":"1.0","event_id":"sha256:0ceba5443c577c8ed314a5c3cc64f663fb1ebdd090a7a9f4bc4693891941b55d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VRJK7Z6LWX7JH5TSD7OALDTRSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anjian Li, Ryne Beeson","submitted_at":"2026-07-24T16:31:30Z","abstract_excerpt":"Data scarcity poses a fundamental challenge in training generative models to produce initial guesses for parametric optimization problems that are otherwise numerically expensive to solve. We therefore study a $k$-neighborhood data collection strategy that augments datasets of converged solutions with intermediate solver iterates, increasing the amount of training data without additional solver runs. To understand the benefits of this approach, we derive a generalization bound based on Rademacher complexity that reveals the role of the $k$-neighborhoods and related parameters. To achieve this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22467","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/2607.22467/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-27T01:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LapvssVGQFqY0KqJl7cCBm80uXKNeygEr1nl5jdZLwRecU1YmHbkLPP2F3XZTg+OmZTOKmCaS2Wt7mxfooizCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:13:05.592105Z"},"content_sha256":"905b5ee301ae3ccc0b8a9da565b9618cd79a15a1bce4113c59622d5867b1e044","schema_version":"1.0","event_id":"sha256:905b5ee301ae3ccc0b8a9da565b9618cd79a15a1bce4113c59622d5867b1e044"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/bundle.json","state_url":"https://pith.science/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/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-11T18:13:05Z","links":{"resolver":"https://pith.science/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU","bundle":"https://pith.science/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/bundle.json","state":"https://pith.science/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VRJK7Z6LWX7JH5TSD7OALDTRSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VRJK7Z6LWX7JH5TSD7OALDTRSU","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":"6362e13c2c5b19d025d96ff10022e7219a61d74999585a475178386cc7b01e39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-24T16:31:30Z","title_canon_sha256":"a006ca7da920d110893e4bf7f3e13e5f2a0a75e089f85f4f6f545e51069b68ce"},"schema_version":"1.0","source":{"id":"2607.22467","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.22467","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"2607.22467v1","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.22467","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"VRJK7Z6LWX7J","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_16","alias_value":"VRJK7Z6LWX7JH5TS","created_at":"2026-07-27T01:21:22Z"},{"alias_kind":"pith_short_8","alias_value":"VRJK7Z6L","created_at":"2026-07-27T01:21:22Z"}],"graph_snapshots":[{"event_id":"sha256:905b5ee301ae3ccc0b8a9da565b9618cd79a15a1bce4113c59622d5867b1e044","target":"graph","created_at":"2026-07-27T01:21:22Z","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/2607.22467/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Data scarcity poses a fundamental challenge in training generative models to produce initial guesses for parametric optimization problems that are otherwise numerically expensive to solve. We therefore study a $k$-neighborhood data collection strategy that augments datasets of converged solutions with intermediate solver iterates, increasing the amount of training data without additional solver runs. To understand the benefits of this approach, we derive a generalization bound based on Rademacher complexity that reveals the role of the $k$-neighborhoods and related parameters. To achieve this ","authors_text":"Anjian Li, Ryne Beeson","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-24T16:31:30Z","title":"Complexity Bounds and Approaches to Learning Projected Gradient Descent Solver Iterates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.22467","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:0ceba5443c577c8ed314a5c3cc64f663fb1ebdd090a7a9f4bc4693891941b55d","target":"record","created_at":"2026-07-27T01:21:22Z","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":"6362e13c2c5b19d025d96ff10022e7219a61d74999585a475178386cc7b01e39","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-24T16:31:30Z","title_canon_sha256":"a006ca7da920d110893e4bf7f3e13e5f2a0a75e089f85f4f6f545e51069b68ce"},"schema_version":"1.0","source":{"id":"2607.22467","kind":"arxiv","version":1}},"canonical_sha256":"ac52afe7cbb5fe93f6721fdc058e719518f1355019681e1c8d51eeed7dd48fc8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac52afe7cbb5fe93f6721fdc058e719518f1355019681e1c8d51eeed7dd48fc8","first_computed_at":"2026-07-27T01:21:22.500771Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-27T01:21:22.500771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sE3qhUIXI/vQQCeW1gWMyFtM8LPja0fxdV11H72+KfeGb4DoiHW8FrknSm3Mc3OI57jHkfoF6+RI21/SEbE8Bg==","signature_status":"signed_v1","signed_at":"2026-07-27T01:21:22.501761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.22467","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ceba5443c577c8ed314a5c3cc64f663fb1ebdd090a7a9f4bc4693891941b55d","sha256:905b5ee301ae3ccc0b8a9da565b9618cd79a15a1bce4113c59622d5867b1e044"],"state_sha256":"142e4526f802336d32f1f36af8aae358b5bab9ff649ff2f324de4b6dd76d1b64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j8BkPVPIAIklnkt64HjCUp7t0j402Z2CGcXDr+BwfZb1TzNl4MsIPa/cz+NRSKcEkzv36+wcxBkSt9X9DCQXBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:13:05.602446Z","bundle_sha256":"cad3d285328b1df6ef5c29d3c297bd57b6cf95c54b9d506d5322caada3437c92"}}