{"as_of":"2026-08-12T17:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1801ee63648ee92c41dffcfc5744b760251a4e0b42727ed0b64704f7e8f22d3f","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-12T06:34:41.77262+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-10T15:51:26.110366Z","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-09T01:03:52.928779Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.15050","last_updated":"2025-05-12T08:55:42Z","snapshot_observed_at":"2026-08-05T13:54:11.668956Z","submitted_at":"2024-09-23T14:25:20Z","title":"Learning efficient erasure protocols for an underdamped memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15050","snapshot_observed_at":"2026-08-10T15:51:26.110366Z","title":"Barros, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13593","last_updated":"2025-01-23T12:02:09Z","snapshot_observed_at":"2026-08-12T12:25:01.320747Z","submitted_at":"2025-01-23T12:02:09Z","title":"Experimental Realizations of Information Engines: Beyond Proof of Concept","version":1},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-08-10T15:51:26.110366Z"},"links":{"cited_paper":"/paper/2409.15050","citing_paper":"/paper/2501.13593"},"observation_digest":"sha256:e5ecfc811e33413b9ec0e66d98678a7e350471a05434dadcf8c2a25f92c4b37e","observation_id":"9880748b-66c6-458e-a725-2221ed0430b6","resolution":{"observed_at":"2026-08-10T15:51:26.110366Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15050","last_updated":"2025-05-12T08:55:42Z","snapshot_observed_at":"2026-08-05T13:54:11.668956Z","submitted_at":"2024-09-23T14:25:20Z","title":"Learning efficient erasure protocols for an underdamped memory","version":2},"cited_work":{"arxiv_id":"2409.15050","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.15050","snapshot_observed_at":"2026-08-09T01:03:52.928779Z","title":"Learning efficient erasure protocols for an underdamped memory","venue":"cond-mat.stat-mech","work_id":"672f37ce-bc63-459f-974f-b8f3267d9b1d","year":2024},"citing_paper":{"arxiv_id":"2502.03734","last_updated":"2025-08-12T23:38:46Z","snapshot_observed_at":"2026-08-10T13:59:48.584052Z","submitted_at":"2025-02-06T02:51:43Z","title":"Improving noisy free-energy measurements by adding more noise","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T01:03:52.881729Z"},"links":{"cited_paper":"/paper/2409.15050","citing_paper":"/paper/2502.03734"},"observation_digest":"sha256:96b302579d40b2d12d0e35d87728ccdd315de457304bf6b1697ad04f00035262","observation_id":"d27d85e5-2a40-4b27-9da9-dc5918183035","resolution":{"observed_at":"2026-08-09T01:03:52.934450Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.15050","last_updated":"2025-05-12T08:55:42Z","snapshot_observed_at":"2026-08-05T13:54:11.668956Z","submitted_at":"2024-09-23T14:25:20Z","title":"Learning efficient erasure protocols for an underdamped memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.15050","snapshot_observed_at":"2026-08-04T12:54:57.397753Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.01823","last_updated":"2025-10-02T09:10:59Z","snapshot_observed_at":"2026-08-12T16:56:00.353043Z","submitted_at":"2025-10-02T09:10:59Z","title":"Optimal Control of Engineered Swift Equilibration of Nanomechanical Oscillators","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T12:54:57.397753Z"},"links":{"cited_paper":"/paper/2409.15050","citing_paper":"/paper/2510.01823"},"observation_digest":"sha256:2c6836a3f66ba5fe50798201d6b4a7f3981cfb8162483e5418b39b8f6a4bdc0a","observation_id":"f615c444-c0d9-49f0-afed-b00b7de5449d","resolution":{"observed_at":"2026-08-04T12:54:57.397753Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2409.15050/citation-record","integrity":"/paper/2409.15050/integrity","json":"/paper/2409.15050/citation-record.json","paper":"/paper/2409.15050"},"outbound":[],"paper":{"arxiv_id":"2409.15050","last_updated":"2025-05-12T08:55:42Z","latest_version":2,"primary_category":"cond-mat.stat-mech","snapshot_observed_at":"2026-08-05T13:54:11.668956Z","submitted_at":"2024-09-23T14:25:20Z","title":"Learning efficient erasure protocols for an underdamped memory"},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2409.15050."}