{"as_of":"2026-08-10T02:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56409f2148e700ced6b3a625f4a6595251773e646a2e3e1734190fb9f4735a2e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:40:42.374967Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T10:29:46.726746Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.09958","last_updated":"2024-10-17T06:33:05Z","snapshot_observed_at":"2026-07-06T18:30:59.857334Z","submitted_at":"2024-06-14T12:05:17Z","title":"Memory-Efficient Optimization with Factorized Hamiltonian Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09958","snapshot_observed_at":"2026-08-08T12:40:42.374967Z","title":"H-fac: Memory-efficient optimization with factorized hamiltonian descent","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.07488","last_updated":"2025-02-11T11:48:04Z","snapshot_observed_at":"2026-08-09T07:29:37.710010Z","submitted_at":"2025-02-11T11:48:04Z","title":"Improving Adaptive Moment Optimization via Preconditioner Diagonalization","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T12:40:42.374967Z"},"links":{"cited_paper":"/paper/2406.09958","citing_paper":"/paper/2502.07488"},"observation_digest":"sha256:366f2789134bc8f8f9b818743533669560d096387cc02e2a18b86bb9cde7256a","observation_id":"9bce9ba0-b666-4026-8659-30882c7e084f","resolution":{"observed_at":"2026-08-08T12:40:42.374967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09958","last_updated":"2024-10-17T06:33:05Z","snapshot_observed_at":"2026-07-06T18:30:59.857334Z","submitted_at":"2024-06-14T12:05:17Z","title":"Memory-Efficient Optimization with Factorized Hamiltonian Descent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.09958","snapshot_observed_at":"2026-08-07T13:06:25.959409Z","title":"Nguyen, L","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.22922","last_updated":"2025-05-28T22:51:43Z","snapshot_observed_at":"2026-08-09T07:36:25.123706Z","submitted_at":"2025-05-28T22:51:43Z","title":"Scalable Parameter and Memory Efficient Pretraining for LLM: Recent Algorithmic Advances and Benchmarking","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T13:06:25.959409Z"},"links":{"cited_paper":"/paper/2406.09958","citing_paper":"/paper/2505.22922"},"observation_digest":"sha256:d90939d9025be3a59f05e9939fa25cc7f79282feda958f3a7cd73f854672325e","observation_id":"426ae338-2280-4904-b1f8-01a9dcadba53","resolution":{"observed_at":"2026-08-07T13:06:25.959409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09958","last_updated":"2024-10-17T06:33:05Z","snapshot_observed_at":"2026-07-06T18:30:59.857334Z","submitted_at":"2024-06-14T12:05:17Z","title":"Memory-Efficient Optimization with Factorized Hamiltonian Descent","version":3},"cited_work":{"arxiv_id":"2406.09958","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.09958","snapshot_observed_at":"2026-08-07T10:29:46.726746Z","title":"Memory-Efficient Optimization with Factorized Hamiltonian Descent","venue":"cs.LG","work_id":"46a4500f-5f5f-4e43-9bb8-69e6bd418eeb","year":2024},"citing_paper":{"arxiv_id":"2506.05259","last_updated":"2025-06-05T17:20:39Z","snapshot_observed_at":"2026-08-09T01:50:52.096033Z","submitted_at":"2025-06-05T17:20:39Z","title":"Learning long range dependencies through time reversal symmetry breaking","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T10:29:46.482638Z"},"links":{"cited_paper":"/paper/2406.09958","citing_paper":"/paper/2506.05259"},"observation_digest":"sha256:89fd414a2c6410d46d7ab808d0011ad477e2b760522839d6967adf3bb2e319b9","observation_id":"d85bf66d-0a09-4479-8e73-216c9c9f545d","resolution":{"observed_at":"2026-08-07T10:29:46.732188Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.09958/citation-record","integrity":"/paper/2406.09958/integrity","json":"/paper/2406.09958/citation-record.json","paper":"/paper/2406.09958"},"outbound":[],"paper":{"arxiv_id":"2406.09958","last_updated":"2024-10-17T06:33:05Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:30:59.857334Z","submitted_at":"2024-06-14T12:05:17Z","title":"Memory-Efficient Optimization with Factorized Hamiltonian Descent"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2406.09958."}