{"as_of":"2026-08-10T08:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fe1e827f512502d935260b27ef178464544a57799f500c26a915952be20d7960","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T14:12:45.469795Z","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-06T20:22:15.517455Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2409.08188","last_updated":"2025-08-29T00:03:28Z","snapshot_observed_at":"2026-08-07T09:37:00.237452Z","submitted_at":"2024-09-12T16:26:29Z","title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.08188","snapshot_observed_at":"2026-08-08T14:12:45.469795Z","title":"Efficient sparse coding with the adaptive lo- cally competitive algorithm for speech classification,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.06989","last_updated":"2025-08-29T00:15:16Z","snapshot_observed_at":"2026-08-08T14:05:17.970721Z","submitted_at":"2025-02-10T19:34:16Z","title":"Adaptive Central Frequencies Locally Competitive Algorithm for Speech","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T14:12:45.469795Z"},"links":{"cited_paper":"/paper/2409.08188","citing_paper":"/paper/2502.06989"},"observation_digest":"sha256:9cd5c386c1831d7b7c7c18a75edb89a5867b8aad0497d5a0b28fd141aa7d26c9","observation_id":"e83abfc0-1f25-4801-9640-dae9691aff5c","resolution":{"observed_at":"2026-08-08T14:12:45.469795Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.08188","last_updated":"2025-08-29T00:03:28Z","snapshot_observed_at":"2026-08-07T09:37:00.237452Z","submitted_at":"2024-09-12T16:26:29Z","title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification","version":4},"cited_work":{"arxiv_id":"2409.08188","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.08188","snapshot_observed_at":"2026-08-06T20:22:15.517455Z","title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification","venue":"eess.AS","work_id":"b1cabf2d-168b-4d7b-8797-a2e5100cb4e8","year":2024},"citing_paper":{"arxiv_id":"2507.03221","last_updated":"2025-07-03T23:28:36Z","snapshot_observed_at":"2026-08-08T10:45:31.503190Z","submitted_at":"2025-07-03T23:28:36Z","title":"Neural Inhibition Improves Dynamic Routing and Mixture of Experts","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T20:22:10.662488Z"},"links":{"cited_paper":"/paper/2409.08188","citing_paper":"/paper/2507.03221"},"observation_digest":"sha256:45bc7ea81d297b170dc91a166824521929de97cd13db6aae19c8f64576d78df6","observation_id":"8cc8da38-aa37-451d-83ee-733ff57646d1","resolution":{"observed_at":"2026-08-06T20:22:15.570021Z","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/2409.08188/citation-record","integrity":"/paper/2409.08188/integrity","json":"/paper/2409.08188/citation-record.json","paper":"/paper/2409.08188"},"outbound":[],"paper":{"arxiv_id":"2409.08188","last_updated":"2025-08-29T00:03:28Z","latest_version":4,"primary_category":"eess.AS","snapshot_observed_at":"2026-08-07T09:37:00.237452Z","submitted_at":"2024-09-12T16:26:29Z","title":"Efficient Sparse Coding with the Adaptive Locally Competitive Algorithm for Speech Classification"},"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 2 inbound Pith citation observations for arXiv:2409.08188."}