{"as_of":"2026-08-14T10:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6ff256adf40f499af5b025614b6d4baecbc8960b445b2ae01d5bb32bbd50f5e4","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T04:41:08.849858Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11575/citation-record","integrity":"/paper/2607.11575/integrity","json":"/paper/2607.11575/citation-record.json","paper":"/paper/2607.11575"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Andrei.Unconstrained optimization test functions","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:78076cedd23b42094e25d9619b4a7236bdb735d4d002e51d10b45a2ad048237f","observation_id":"d307fdf8-9679-465d-86f3-82d0db9521db","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Barzilai and J","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:89074ee301878c133fc322710fc32039df0a4dfc2ac893781dc09473c03f1dcd","observation_id":"6d5abe54-b8aa-48ae-899f-ff5c94f21e53","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:5e22a4a49687c472a7e4f3688540ed17733b85c2308a478fb93ae2ead3d3b34a","observation_id":"346d7991-8d10-4437-9fe6-a4879b140c36","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Bottou, F","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:72810a7df463053cd912f9b8219531ffe6590a711f01f40f241b000bae9ca7a6","observation_id":"b61bf1ba-2e1d-4ea8-9c5e-763e86fb7429","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:758d4176b96d24abeff3248274d849d4f5edbea99a758e02a4b858edb930c9c6","observation_id":"a2a62b2b-6f74-42dc-83b1-19c65774c8e3","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Crisci, V","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:7ac064fac1c322546c25464446d3f2b05cd86ae6a029356168df087868bce83b","observation_id":"c7919b2f-d2f1-4ffa-aee8-262ec96c2e6c","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:b7fc7f425a5b19bce1aa13fb0c4883a6b59959b195ad10e968f9b125f2f0a78c","observation_id":"ad796e1b-5a0d-4c93-8d25-48b655e7d108","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:6f5c22fd069895b148b68dba528877b1372bcfff2a80229b88ffcb7f5c24365a","observation_id":"8f427fda-26d5-45a0-b484-0692b5bea57c","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"On spectral properties of steepest descent methods.IMA J","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:73dec79d39e5745a2cfb7b8346127553df0d9c709c6daa3a2d466922351be579","observation_id":"1d618fd4-6762-4d01-a392-08656d83f273","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"De Magistris, S","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:5a43715294cae8b1d2512cc2868c9513c51bdde8ce6c25c7c0452b6ee50c7aff","observation_id":"c46fdc40-8d66-43e0-969a-14131175311a","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"di Serafino, V","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:b51e76fb52942828a175b2e8453d83fc2acf91c6225afbde713fe2fb9748c4fe","observation_id":"aea6252b-3fb3-4d06-8c99-eb5ff97c4377","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:231d9846fa1b1a53391b9afbff1e42803af6a7c299c28065482a592eca3d172a","observation_id":"c9a8fb70-0361-47c8-9d80-5ffc253bb4ae","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Frassoldati, L","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:6b1028c6681c785c00b45dce099820a6a39eb2210e88616f7e791e1d60e3cc41","observation_id":"ba7b6b6c-9a20-44cc-a6c0-043554f4b410","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.05636","last_updated":"2025-01-16T14:54:27Z","snapshot_observed_at":"2026-08-13T17:18:03.864114Z","submitted_at":"2021-12-10T16:10:00Z","title":"OPM, a collection of Optimization Problems in Matlab","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.05636","snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Gratton and P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"cited_paper":"/paper/2112.05636","citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:61f761342a71f3ccd7b3e7dba0d81236b87f1175371fc0a08af7a9fffbaf3fe1","observation_id":"40ed619d-aaed-44c8-aa03-c501339511a6","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Grippo, F","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:a3df24cd340ad28e74ba10fd7084808fd9a974a4382b8e6defd033453f5a18ea","observation_id":"c6cbf72e-313e-4231-a94e-c40a4945eb79","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.07255","last_updated":"2024-06-20T02:22:29Z","snapshot_observed_at":"2026-08-13T13:22:06.564888Z","submitted_at":"2022-12-14T14:44:20Z","title":"A mechanism of three-dimensional quadratic termination for the gradient method with applications","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.07255","snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Huang, Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"cited_paper":"/paper/2212.07255","citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:8d0a56373fe7a1d8a52e6d95b2fcb666e59aba95c38f4d9b7aaa983ac0c949b5","observation_id":"a440dc13-baf7-4648-9d0e-092c657e4924","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Loris, M","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:c07f87695ca8f4ae6bb1912fee9a9b87e90695e13be433b54c5d3d0e5c9b5166","observation_id":"82e3ce22-3ce8-41d1-a3f6-dbf41336b91d","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Maligranda","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:0c3f082bfc047f0f436208220d4fb35514697e735681bc1c7534f465638b9d4b","observation_id":"128a18d4-48e1-464e-b1ab-0d0a0cf25b34","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:f58f937cb6e04d5e51a35925b79707414c20265dac3b54d2b5c37dfcb764d315","observation_id":"7fab7f2e-9aab-4a1a-9474-473b5422e35e","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Nocedal and S","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:5dcfa8c01b6f810ba35b85683eec0f5e0cb16cfe8a936b605968da29387515e3","observation_id":"2b6a3ea7-c61e-4272-9d81-5e1faef1c533","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:84144dacb20d67acd38cd1bef74aa385a3aa79cf0ea80ef9816d8da1604bca54","observation_id":"ae626b5c-3ff7-4200-a7d4-a6364c12c754","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:f0049a35b405c1471f90eef86f82fde991067e21ed700c48aec6ff3c524a3a3f","observation_id":"74874bf0-7b2f-4b95-9942-fff54dfe5107","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"SIAM, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:51867456ed171dc8e5843a8d0ff02cf35d80cabb3687dbe02f320cd8a96b489c","observation_id":"bf7a59a2-a96b-4e78-9336-ef5c1417634d","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Serafini, G","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:7271469a22cd050319637d5d7e20ad69cf1a325ae7361835fc5e6b83c483c0f8","observation_id":"0c45c5dc-10c2-4d6e-85f9-a2c54c8e153d","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Sun and J","venue":null,"work_id":null,"year":1943},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:53d2e75f6570a6c82e4161dbac2d33a5ed0cb9ba864203c30071e6ad893b4f0a","observation_id":"9b5435a7-d2cb-4981-8232-69dd99683959","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:294b1f976c766e58f235425582ad88c7c894bca7a81dc590552f0f8bfef4306e","observation_id":"f8bdba27-fc72-4c26-abec-af8f93cbcc4c","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:d4bc2f54f74164fcfd40969edb00714174a344624bb8993bd2edd50012c32474","observation_id":"723de957-f54c-40a2-96a9-e5e2a5398843","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:883057a344ce1025910b26bb7709c3fb1349c296b6b6d96da0e33452da00118e","observation_id":"42f57817-aa80-46d7-b955-697ace141316","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Zanella, G","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:c810591f7093f2033d13c87deeff64a62860d872b157d537d215ff2bebda50cd","observation_id":"60d39eae-111c-4218-bc55-d097c06d7fed","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":"Zhang and C","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:f53b37e20e7c283dc2ebc8adb2f0719eaa20b31c8f0191ffc58d72f2b5d22575","observation_id":"d01b3ca1-2fbf-4da9-ad11-fa09452167de","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T04:41:08.849858Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T04:41:08.849858Z"},"links":{"citing_paper":"/paper/2607.11575"},"observation_digest":"sha256:1fd3e416a72f31d448f930f395e27a2e147fe024d8209ea981762fbf23387791","observation_id":"c18e0eb2-373e-4301-9016-824f73998eaa","resolution":{"observed_at":"2026-07-14T04:41:08.849858Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11575","last_updated":"2026-07-13T13:55:34Z","latest_version":1,"primary_category":"math.NA","snapshot_observed_at":"2026-07-16T23:19:54.345185Z","submitted_at":"2026-07-13T13:55:34Z","title":"A Twin gradient method for unconstrained optimization"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2607.11575."}