{"as_of":"2026-08-10T22:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17af095b56452ba887b039c85070af9fe8be1e88af0b77b6ccb3177fcdece0be","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:59:29.665905Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-10T05:30:23.456663Z","state":"measured"}],"external_citation_measurements":[{"count":1229,"observed_at":"2026-08-10T05:30:23.456663Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1106.5730","last_updated":"2011-11-11T15:59:15Z","snapshot_observed_at":"2026-08-10T19:20:39.566566Z","submitted_at":"2011-06-28T17:23:42Z","title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent","version":2},"cited_work":{"arxiv_id":"1106.5730","doi":"10.48550/arxiv.1106.5730","metadata_source":"pith","pith_arxiv_id":"1106.5730","snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent","venue":"math.OC","work_id":"2faf15f5-5810-4bb3-8e62-1156a25c03d5","year":2011},"citing_paper":{"arxiv_id":"2508.07706","last_updated":"2025-08-11T07:34:04Z","snapshot_observed_at":"2026-08-08T22:46:05.653614Z","submitted_at":"2025-08-11T07:34:04Z","title":"Energy Consumption in Parallel Neural Network Training","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T21:59:29.665905Z"},"links":{"cited_paper":"/paper/1106.5730","citing_paper":"/paper/2508.07706"},"observation_digest":"sha256:67adb1a5ee6b76de4c49d74fb09830e633a4045d4f50af712828bc2cfb11d578","observation_id":"f7a37f95-4a06-4189-86ce-60f1e2912d17","resolution":{"observed_at":"2026-08-05T21:59:30.417365Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1106.5730/citation-record","integrity":"/paper/1106.5730/integrity","json":"/paper/1106.5730/citation-record.json","paper":"/paper/1106.5730"},"outbound":[],"paper":{"arxiv_id":"1106.5730","last_updated":"2011-11-11T15:59:15Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-10T19:20:39.566566Z","submitted_at":"2011-06-28T17:23:42Z","title":"HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient 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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1106.5730."}