{"as_of":"2026-08-18T20:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7910c342fb4bb023ef3d5a0623ea4243f06259ccbb1875f99e34ba90819eb5ec","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-18T06:34:40.430872+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-15T21:11:55.393434Z","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-05T22:03:10.019297Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.09685","last_updated":"2025-04-13T18:36:03Z","snapshot_observed_at":"2026-08-18T10:31:36.791507Z","submitted_at":"2025-04-13T18:36:03Z","title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.09685","snapshot_observed_at":"2026-08-15T21:11:55.393434Z","title":"E.; Hamidouche, W.; Herrou, G.; Menard, D.; and Debbah, M","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.10457","last_updated":"2026-06-23T08:14:28Z","snapshot_observed_at":"2026-08-17T12:18:08.501082Z","submitted_at":"2025-05-15T16:14:18Z","title":"SEAL: Searching Expandable Architectures for Incremental Learning","version":3},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T21:11:55.393434Z"},"links":{"cited_paper":"/paper/2504.09685","citing_paper":"/paper/2505.10457"},"observation_digest":"sha256:5bec9eb38cc2d0eb0eadfd34af2c30f30fb34c3dbaf968e9121f0e13cbbe30b6","observation_id":"e68ac95d-4f0d-4b59-89fb-7b68e777aa81","resolution":{"observed_at":"2026-08-15T21:11:55.393434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.09685","last_updated":"2025-04-13T18:36:03Z","snapshot_observed_at":"2026-08-18T10:31:36.791507Z","submitted_at":"2025-04-13T18:36:03Z","title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?","version":1},"cited_work":{"arxiv_id":"2504.09685","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.09685","snapshot_observed_at":"2026-08-05T22:03:10.019297Z","title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?","venue":"cs.LG","work_id":"c60eeefc-322a-48ca-8e09-6f6700cfe0d3","year":2025},"citing_paper":{"arxiv_id":"2508.08339","last_updated":"2025-08-11T04:13:56Z","snapshot_observed_at":"2026-08-13T23:15:07.914754Z","submitted_at":"2025-08-11T04:13:56Z","title":"SHeRL-FL: When Representation Learning Meets Split Learning in Hierarchical Federated Learning","version":1},"reference_index":164,"source":"pdf_text","source_observed_at":"2026-08-05T22:03:09.914167Z"},"links":{"cited_paper":"/paper/2504.09685","citing_paper":"/paper/2508.08339"},"observation_digest":"sha256:1925c151baea10856dd5d1a10d6c7f68e1145f165e05672fe51e64ac59b1bd1d","observation_id":"abc2b83a-0e26-4210-9c0f-511043ce0a14","resolution":{"observed_at":"2026-08-05T22:03:10.022044Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.09685/citation-record","integrity":"/paper/2504.09685/integrity","json":"/paper/2504.09685/citation-record.json","paper":"/paper/2504.09685"},"outbound":[],"paper":{"arxiv_id":"2504.09685","last_updated":"2025-04-13T18:36:03Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T10:31:36.791507Z","submitted_at":"2025-04-13T18:36:03Z","title":"Can LLMs Revolutionize the Design of Explainable and Efficient TinyML Models?"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2504.09685."}