{"as_of":"2026-08-16T20:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f02ac5b64f08295e09390f1e4b37e5c85e6ca9ed638969cdb335144e014d977f","coverage":[{"denominator":38,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":38,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:12:21.679097Z","state":"measured"},{"denominator":38,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":38,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/2412.13473/citation-record","integrity":"/paper/2412.13473/integrity","json":"/paper/2412.13473/citation-record.json","paper":"/paper/2412.13473"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.439519Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.439519Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:94adf5b9f97a5a4159d04703208c995b7d227b47ecac4c54dc2aca8006fda7ac","observation_id":"71a0a057-d24e-4eb9-8360-9839542233ce","resolution":{"observed_at":"2026-08-11T13:12:21.439519Z","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-08-11T13:12:21.446074Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.446074Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:6ae7d553a63d44e574550e1faf2bfd8bee3a9ac496cedb6df5ff778ec6805cbd","observation_id":"7f1ca59e-1852-4609-8fa6-4029f5992a23","resolution":{"observed_at":"2026-08-11T13:12:21.446074Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.617818Z","title":"T.; Liggett, K.; Musco, C.; Tzamos, C.; and Vitercik, E","venue":null,"work_id":"b89ac983-cddd-4690-a915-cee9576add8f","year":2019},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.452552Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:1c84499cf62b5f3e7d373622e40de4d8cfa34e59ce205cc46e2cfedfb4fb7edf","observation_id":"1afb1192-78b6-4020-a8a1-e05dfcbbc1f5","resolution":{"observed_at":"2026-08-11T13:12:22.625947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.591256Z","title":null,"venue":null,"work_id":"3e4a94f0-c5bb-4236-b5e9-d9901b26a7a2","year":2020},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.458436Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:91d972734fe54ff81e2dd52e9a17bca1d5faae2fdf37c160b61495f552d62619","observation_id":"f1b60068-7514-4f89-9992-024128a126aa","resolution":{"observed_at":"2026-08-11T13:12:22.598572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.567756Z","title":"W.; Pfau, D.; Schaul, T.; Shillingford, B.; and de Freitas, N","venue":null,"work_id":"1b3108da-e4f4-434c-af4b-1dc3a150231e","year":2016},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.465064Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:bae25894b8e74b34726c7e70754c882c6ff3ff9d49fde8fccec4c4d40e4d4177","observation_id":"61eb7e7e-e6dc-45fb-a157-7edcc3bf3ba3","resolution":{"observed_at":"2026-08-11T13:12:22.575412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.537583Z","title":null,"venue":null,"work_id":"99250780-aeac-4b5b-a7e5-b134766c18f2","year":1999},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.471878Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:44637697a6fab4daeaa3104815f11bb746d219fc12875e287e70242bfde897e0","observation_id":"46506578-7b5c-432c-bd4d-bfadc39463ee","resolution":{"observed_at":"2026-08-11T13:12:22.543968Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.514134Z","title":null,"venue":null,"work_id":"c95a2728-05d9-4324-917f-bcd609d828f1","year":2023},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.478012Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:be3379907724f03744d730552a32bb60b315f04611878d9a0a9f32eabf2548ad","observation_id":"d872553c-9b23-44d0-a7c2-1aa13c065d1f","resolution":{"observed_at":"2026-08-11T13:12:22.520675Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.480216Z","title":null,"venue":null,"work_id":"5952a9e6-207d-4edf-9068-b5b6e2655500","year":2021},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.483608Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:1f8916c2d73d138c24a6f76a4f475b107fef5645387e2231e52d2bb7a1340af8","observation_id":"4451fce6-1c84-4ed3-9734-366c803b47dd","resolution":{"observed_at":"2026-08-11T13:12:22.485710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.457387Z","title":null,"venue":null,"work_id":"3e1b96f4-5964-48fd-bbea-0df307a7ebd6","year":2018},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.489226Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:670f35975ac7b6f6da52ec6fa2bf1578fedeecfbc19d48ca10c33c8d0c5fc969","observation_id":"0630b708-222d-4333-a50d-3f923308a6b7","resolution":{"observed_at":"2026-08-11T13:12:22.464178Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.433060Z","title":null,"venue":null,"work_id":"f1293eef-dba5-4813-a06f-148bb268843c","year":2017},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.494264Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:3e4e34ed264fcb856dabda542d482f1e7a3f439ff6688660a14ba914416e22bd","observation_id":"d3df9b86-2292-4ab4-90ad-9d498f237557","resolution":{"observed_at":"2026-08-11T13:12:22.440843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2111.11207","last_updated":"2022-05-11T21:33:18Z","snapshot_observed_at":"2026-08-16T17:41:00.280754Z","submitted_at":"2021-11-18T04:07:29Z","title":"Improved Sample Complexity Bounds for Branch-and-Cut","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2111.11207","snapshot_observed_at":"2026-08-11T13:12:21.499741Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.499741Z"},"links":{"cited_paper":"/paper/2111.11207","citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:951f0a652f1c0691c5b4bcfe15123c90a3ce4656aba8f4eb296b3242999bacaa","observation_id":"65ba58d5-05b2-43bf-88cd-59378ad92bb3","resolution":{"observed_at":"2026-08-11T13:12:21.499741Z","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-08-11T13:12:21.505028Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.505028Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:e7b31bf66061198cb56a544a7bbd69b1cce58b68ce97005f20459537eb95cb51","observation_id":"45c0d375-1c60-4ebe-9563-95aaf35aaf93","resolution":{"observed_at":"2026-08-11T13:12:21.505028Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.394532Z","title":null,"venue":null,"work_id":"09ce81d0-8b6f-4f0e-bdda-7a1ad617e892","year":2015},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.511048Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:e748f95d28945a0d934d21ef581c12931c039519a318eebc8392fc1eaea3a71c","observation_id":"10abba42-5e7f-4098-97bc-1d357e3a2379","resolution":{"observed_at":"2026-08-11T13:12:22.401152Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.376865Z","title":"H.; and Yuan, Y","venue":null,"work_id":"65db033f-157a-4cad-be37-da4c57e56b76","year":1999},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.516275Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:d68770014439485ba6517a1d145cb288ae957cc2d447575a2efded4d7929bda6","observation_id":"3b7b478d-e85d-4d54-a3cc-f93658993ec7","resolution":{"observed_at":"2026-08-11T13:12:22.382674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.356617Z","title":null,"venue":null,"work_id":"f9d17440-f1ce-47cb-b06b-3c9d5cfcd3e1","year":2019},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.521788Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:71eb1572cf3469bd7609158f1b02cc7a2b3e5853048eb45fbf6f4543b8d4b6ae","observation_id":"45b8572c-94c5-47fc-841b-b15063e5c283","resolution":{"observed_at":"2026-08-11T13:12:22.362976Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.334450Z","title":null,"venue":null,"work_id":"fbfa003f-292e-424b-8aa4-6e86f9bd1c11","year":2016},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.532988Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:781fc358690a404cb170f223d3e80b5bc9037a538a94d61449449cc82f657fe4","observation_id":"b1f944ba-c421-477f-a934-1f600621e161","resolution":{"observed_at":"2026-08-11T13:12:22.340400Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.300728Z","title":null,"venue":null,"work_id":"4aee9f4b-a4d4-4590-90c1-b196c0b71aa6","year":2010},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.540172Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:4dbdb3b3e090239bf36c417e9755ddb12e37fc565de9a92d29ae8031f58c77b6","observation_id":"88b3f200-e34f-4d52-89b0-5043ac8b3b29","resolution":{"observed_at":"2026-08-11T13:12:22.311591Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.274358Z","title":null,"venue":null,"work_id":"ca321fe8-1d47-481a-9856-14ab6c9635c9","year":1964},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.546753Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:4677d032a574c2118340626a1f7303758f8ce2379e3ab5a0cd385bed714e7219","observation_id":"596452f8-3db2-4c39-af7f-a368c4c7ab19","resolution":{"observed_at":"2026-08-11T13:12:22.282270Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.249981Z","title":"M.; Khalil, E.; Lichocki, P.; Lodi, A.; Lubin, M.; Maddison, C","venue":null,"work_id":"8be9fe9f-2d11-4bc3-a7be-478bd6e83776","year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.551838Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:16dabec6341dac66d831387a7d5dd6293246802b320e826dae8bc7ff1327e67b","observation_id":"9c96f1f9-31ba-4562-8aa5-6400938f4f47","resolution":{"observed_at":"2026-08-11T13:12:22.257063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.230119Z","title":null,"venue":null,"work_id":"d324a7be-ace0-4ade-a788-cded27dfad0f","year":2016},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.557875Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:e80f5247d3a55a37f925d995624e3608bc368b558446c47dfd47a01bad137cc7","observation_id":"e5827399-119b-42d0-b644-af42456f3f32","resolution":{"observed_at":"2026-08-11T13:12:22.235850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2209.14110","last_updated":"2023-03-01T16:39:54Z","snapshot_observed_at":"2026-08-16T16:29:14.693779Z","submitted_at":"2022-09-28T13:57:25Z","title":"Meta-Learning in Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.14110","snapshot_observed_at":"2026-08-11T13:12:21.564197Z","title":"S.; and Sandholm, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.564197Z"},"links":{"cited_paper":"/paper/2209.14110","citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:9164dd7a00ba8de5bc2e8d37104211ea5acbf05258f2a9aa814950af2cccb56f","observation_id":"b596a79b-8d60-4126-8063-cd608c869269","resolution":{"observed_at":"2026-08-11T13:12:21.564197Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.203025Z","title":"R.; and Stiefel, E","venue":null,"work_id":"db1366a1-947b-4e0b-a970-c9a6e25d5b6f","year":1952},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.570863Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:9a00e8a559ff2c727f82d4e7db67c3c09ee70ed432f888665ea34614cf1d542b","observation_id":"bec29711-85fd-4e17-ae20-3fe352cd82ff","resolution":{"observed_at":"2026-08-11T13:12:22.209786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.176603Z","title":null,"venue":null,"work_id":"d80dfde1-3880-4e6b-8888-db258ce6c280","year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.576556Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:a1127b39848a0e4921d76531ed81d243f1850b6de020a08b976202fc65294c8e","observation_id":"c90e471d-37b7-4de7-960c-84e2a74988be","resolution":{"observed_at":"2026-08-11T13:12:22.183225Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.151447Z","title":"J.; and Vazirani, U","venue":null,"work_id":"29aa6718-53e1-4fd7-a123-9c9f420a5307","year":1994},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.582231Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:8621ab870b584ae395ee1c0363c3f73e56b2166d448ce67ee74383b53fd8cff9","observation_id":"a3bfeb4b-8ee4-498d-af01-3aeafd08b8fe","resolution":{"observed_at":"2026-08-11T13:12:22.158232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.01885","last_updated":"2016-06-06T19:50:47Z","snapshot_observed_at":"2026-08-16T15:15:44.121112Z","submitted_at":"2016-06-06T19:50:47Z","title":"Learning to Optimize","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.01885","snapshot_observed_at":"2026-08-11T13:12:21.587381Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.587381Z"},"links":{"cited_paper":"/paper/1606.01885","citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:738af3213aa4559e8066f20f6ccf326cfcbc2c09e165f3e4d3460bdb3d51a9a8","observation_id":"1e5ae5db-4ff8-4d75-b64e-d80393d71241","resolution":{"observed_at":"2026-08-11T13:12:21.587381Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.122789Z","title":null,"venue":null,"work_id":"7a5c6411-c85e-49c4-88a2-3a6c73abfc0d","year":2020},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.592641Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:e06023de48b6363c7631e5294a17fdc7dbcf6ddd16b41356048696ce037a0cbc","observation_id":"621e7d16-d540-40af-a402-72f818ec94d8","resolution":{"observed_at":"2026-08-11T13:12:22.128650Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.093138Z","title":null,"venue":null,"work_id":"6a32c36c-fbdf-426d-9952-8827bd7f9813","year":2015},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.598201Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:7187169babfb0ac1b2d96a833c82b623951ac3b490869a912160dcde27ccb7d2","observation_id":"d822d012-5723-4212-b061-e7482a469b5a","resolution":{"observed_at":"2026-08-11T13:12:22.103341Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.066871Z","title":null,"venue":null,"work_id":"c1570bc0-6690-4d58-b9eb-a26b4bd109dc","year":2021},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.604573Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:f0b569ab3b296e471ced4d6ad898c36ebbb355a2bb20bdd980107c8f81001026","observation_id":"b98dce78-20f9-40e4-b772-2a69ccbff333","resolution":{"observed_at":"2026-08-11T13:12:22.072805Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.042920Z","title":null,"venue":null,"work_id":"666f4182-e7f1-4b64-adfd-d386f0119213","year":1984},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.611295Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:303aac135978360483cc04d4efd7ff6a993fa950e35eacfa48ecac0f02491ef6","observation_id":"8ef507a0-4f63-4512-bc85-606ee0c392d6","resolution":{"observed_at":"2026-08-11T13:12:22.050640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:22.008579Z","title":null,"venue":null,"work_id":"8b2e173f-4d45-47fc-b778-03cb8678b5f5","year":1969},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.620911Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:88ed5d4464dddbfe7125862c2591a6fdb9d8fe355b77a80a49bc973baceb8f29","observation_id":"27b3e6c2-f52d-403c-bb68-db780f3a4e8e","resolution":{"observed_at":"2026-08-11T13:12:22.017680Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2201.06213","last_updated":"2022-01-17T04:50:11Z","snapshot_observed_at":"2026-08-16T17:27:59.196358Z","submitted_at":"2022-01-17T04:50:11Z","title":"An Improved Reinforcement Learning Algorithm for Learning to Branch","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.06213","snapshot_observed_at":"2026-08-11T13:12:21.628110Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.628110Z"},"links":{"cited_paper":"/paper/2201.06213","citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:10b651235e4e1bd9881e4a07266861c9fb116f0961cfaca48b3f65f0c9460a75","observation_id":"eab809ef-ccdc-420b-a859-a824b25f75f9","resolution":{"observed_at":"2026-08-11T13:12:21.628110Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.980191Z","title":null,"venue":null,"work_id":"5ed6b044-6141-4694-995a-3c98222402d5","year":2005},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.637163Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:a46a8da4658b1834b58ffec1593a0167de6992ce526d5d2eda5859a5bbc23e6a","observation_id":"e17f3df9-905b-44d3-8405-e75b875f9d34","resolution":{"observed_at":"2026-08-11T13:12:21.987444Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.956788Z","title":"S.; Ivanov, B.; Ma, H.; and Mosić, D","venue":null,"work_id":"93151cc9-c951-46a0-be84-7b0a8ad50937","year":2020},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.645002Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:cc61c9db05836e422a5b2aca3961d89421366de2ae803f13a618019d3b41b542","observation_id":"19e14a8f-eae3-499f-b447-34bbd706e7db","resolution":{"observed_at":"2026-08-11T13:12:21.963506Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.923854Z","title":null,"venue":null,"work_id":"83324de3-d74c-49fa-95cc-49f803be27cf","year":1991},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.651968Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:436343df963f3b60727883148cb52a4345c052335f0487e8ea4e91cd431fa981","observation_id":"d5a43b4c-d125-4856-9f06-8b740e72a683","resolution":{"observed_at":"2026-08-11T13:12:21.934037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.898400Z","title":null,"venue":null,"work_id":"84fe2b1b-10fd-41b5-85de-617ac4757662","year":2021},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.657835Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:1d6336f818626ba282516d7296c9401e8193726abf1996c4b98abcdda38339ee","observation_id":"1ba63fb6-6d2f-4748-aebe-a29a019dfc43","resolution":{"observed_at":"2026-08-11T13:12:21.905261Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.871791Z","title":null,"venue":null,"work_id":"1891689c-4db1-4f31-a434-b7efcc5ea2cb","year":1969},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.664354Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:22f025c4270c53bec87c58af30ccdcfe10e9980d7d822a12bc125dff5d162008","observation_id":"73cb358c-0a52-4cfb-851c-bf46b58354c3","resolution":{"observed_at":"2026-08-11T13:12:21.878171Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.847891Z","title":null,"venue":null,"work_id":"cbf6e457-abdf-4872-8ae8-04c31723454a","year":2022},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.671634Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:768b473e1fb84b3545481dce20f3f04114d0487582a4579e7baebb6619de3adb","observation_id":"b1e8613e-22ce-4cb2-abaa-67d90701a048","resolution":{"observed_at":"2026-08-11T13:12:21.855212Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:12:21.679097Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-11T13:12:21.679097Z"},"links":{"citing_paper":"/paper/2412.13473"},"observation_digest":"sha256:76e64c59a324a14aaaba2fe970adb3839b9e05cf19005ab123f1ecdc815af0be","observation_id":"7a22137c-5c6c-4299-9880-d5f2013ddb9d","resolution":{"observed_at":"2026-08-11T13:12:21.679097Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.13473","last_updated":"2024-12-18T03:38:29Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T15:16:29.727315Z","submitted_at":"2024-12-18T03:38:29Z","title":"Learning complexity of gradient descent and conjugate gradient algorithms"},"reference_resolution":{"displayed":38,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":38},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 38 of 38 outbound references and 0 inbound Pith citation observations for arXiv:2412.13473."}