{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:337LJZ2WGDVGCZVKRGWZBDGA3E","short_pith_number":"pith:337LJZ2W","canonical_record":{"source":{"id":"2607.11575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-13T13:55:34Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"06dc8a19f595318ebd9d3ced5967b42aacf2eb569bed3b426865804d20bb6b06","abstract_canon_sha256":"015f9b070edd9bbf9adb8ce7064a55647a88000ccb7a6501ef5af2bc3772e031"},"schema_version":"1.0"},"canonical_sha256":"defeb4e75630ea6166aa89ad908cc0d9385725aafcdcf733582a156f5f56d87d","source":{"kind":"arxiv","id":"2607.11575","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11575","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11575v1","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11575","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"337LJZ2WGDVG","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_16","alias_value":"337LJZ2WGDVGCZVK","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_8","alias_value":"337LJZ2W","created_at":"2026-07-14T02:22:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:337LJZ2WGDVGCZVKRGWZBDGA3E","target":"record","payload":{"canonical_record":{"source":{"id":"2607.11575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-13T13:55:34Z","cross_cats_sorted":["cs.NA","math.OC"],"title_canon_sha256":"06dc8a19f595318ebd9d3ced5967b42aacf2eb569bed3b426865804d20bb6b06","abstract_canon_sha256":"015f9b070edd9bbf9adb8ce7064a55647a88000ccb7a6501ef5af2bc3772e031"},"schema_version":"1.0"},"canonical_sha256":"defeb4e75630ea6166aa89ad908cc0d9385725aafcdcf733582a156f5f56d87d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:22:12.893728Z","signature_b64":"kWfIPbR6k6RO09cvHikFlaFaK1ZxWpeVK5nVfnH0QJQnI1wCwQJ7JLn8prERIfSJK9YBH3uE4WmsOvf9KySMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"defeb4e75630ea6166aa89ad908cc0d9385725aafcdcf733582a156f5f56d87d","last_reissued_at":"2026-07-14T02:22:12.892903Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:22:12.892903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.11575","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-14T02:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhj59CQ4toyuC7+mlhd4GqFSMO1a8POx7gwF8t9kYKhEsV6MFpekeY3Zni4JXpwGnRhX5ia0Bv7IoUF6OMr8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:04:22.206385Z"},"content_sha256":"143d4d5f7e89872eeacef17bc31d602b95c9e83065dde823cc5869a789bce575","schema_version":"1.0","event_id":"sha256:143d4d5f7e89872eeacef17bc31d602b95c9e83065dde823cc5869a789bce575"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:337LJZ2WGDVGCZVKRGWZBDGA3E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Twin gradient method for unconstrained optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.OC"],"primary_cat":"math.NA","authors_text":"Anna De Magistris, Gerardo Toraldo, Michiel E. Hochstenbach","submitted_at":"2026-07-13T13:55:34Z","abstract_excerpt":"We propose a new strategy for gradient-based unconstrained optimization, involving two parallel sequences of iterates that cooperate to determine their stepsizes via a \\textit{Twin-Step} principle. Rather than minimizing the objective function individually, the algorithm selects steplengths that minimize the Euclidean distance between the two gradient based processes occurring simultaneously at each iteration. The theoretical analysis shows that the convergence of the mutual distance is governed by the angle between the search directions. In particular the effectiveness of the overall process "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11575","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.11575/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-14T02:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmmodrFoc9Ro7IlfdrB6SgNIOWDU1P1P5y/1AkABXr3o+C/opLU9zSzmM9Ip/2N3XJs4IF9KgeGmk5ELC2ULDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T09:04:22.207043Z"},"content_sha256":"84623ce7c9f9fe93dd5f99afdc5e3b51eb72d1b819788e92b5193d14e99c912a","schema_version":"1.0","event_id":"sha256:84623ce7c9f9fe93dd5f99afdc5e3b51eb72d1b819788e92b5193d14e99c912a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/bundle.json","state_url":"https://pith.science/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/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-14T09:04:22Z","links":{"resolver":"https://pith.science/pith/337LJZ2WGDVGCZVKRGWZBDGA3E","bundle":"https://pith.science/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/bundle.json","state":"https://pith.science/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/337LJZ2WGDVGCZVKRGWZBDGA3E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:337LJZ2WGDVGCZVKRGWZBDGA3E","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":"015f9b070edd9bbf9adb8ce7064a55647a88000ccb7a6501ef5af2bc3772e031","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-13T13:55:34Z","title_canon_sha256":"06dc8a19f595318ebd9d3ced5967b42aacf2eb569bed3b426865804d20bb6b06"},"schema_version":"1.0","source":{"id":"2607.11575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11575","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11575v1","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11575","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"337LJZ2WGDVG","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_16","alias_value":"337LJZ2WGDVGCZVK","created_at":"2026-07-14T02:22:12Z"},{"alias_kind":"pith_short_8","alias_value":"337LJZ2W","created_at":"2026-07-14T02:22:12Z"}],"graph_snapshots":[{"event_id":"sha256:84623ce7c9f9fe93dd5f99afdc5e3b51eb72d1b819788e92b5193d14e99c912a","target":"graph","created_at":"2026-07-14T02:22:12Z","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.11575/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a new strategy for gradient-based unconstrained optimization, involving two parallel sequences of iterates that cooperate to determine their stepsizes via a \\textit{Twin-Step} principle. Rather than minimizing the objective function individually, the algorithm selects steplengths that minimize the Euclidean distance between the two gradient based processes occurring simultaneously at each iteration. The theoretical analysis shows that the convergence of the mutual distance is governed by the angle between the search directions. In particular the effectiveness of the overall process ","authors_text":"Anna De Magistris, Gerardo Toraldo, Michiel E. Hochstenbach","cross_cats":["cs.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11575","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:143d4d5f7e89872eeacef17bc31d602b95c9e83065dde823cc5869a789bce575","target":"record","created_at":"2026-07-14T02:22:12Z","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":"015f9b070edd9bbf9adb8ce7064a55647a88000ccb7a6501ef5af2bc3772e031","cross_cats_sorted":["cs.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2026-07-13T13:55:34Z","title_canon_sha256":"06dc8a19f595318ebd9d3ced5967b42aacf2eb569bed3b426865804d20bb6b06"},"schema_version":"1.0","source":{"id":"2607.11575","kind":"arxiv","version":1}},"canonical_sha256":"defeb4e75630ea6166aa89ad908cc0d9385725aafcdcf733582a156f5f56d87d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"defeb4e75630ea6166aa89ad908cc0d9385725aafcdcf733582a156f5f56d87d","first_computed_at":"2026-07-14T02:22:12.892903Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T02:22:12.892903Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kWfIPbR6k6RO09cvHikFlaFaK1ZxWpeVK5nVfnH0QJQnI1wCwQJ7JLn8prERIfSJK9YBH3uE4WmsOvf9KySMAQ==","signature_status":"signed_v1","signed_at":"2026-07-14T02:22:12.893728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:143d4d5f7e89872eeacef17bc31d602b95c9e83065dde823cc5869a789bce575","sha256:84623ce7c9f9fe93dd5f99afdc5e3b51eb72d1b819788e92b5193d14e99c912a"],"state_sha256":"c6a7297eb12fb708a5402081f5e7199eab5697ba87c4a6ad02377c8c670d4945"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wdX3Xg8UO4PUhv76kvSWgsVqcOKlcHCbVc1vORKp1Yb+izeCltNk2wibm0jVgbCJaoo/b+xXhJfzpVuw5Ou7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T09:04:22.211635Z","bundle_sha256":"7beb065eabc60c09ae8c36854f962cc9a0975df2febe5d27695d20718d2c6e88"}}