{"as_of":"2026-08-10T20:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e80b9122154edd6d0cb777cd3cd55579f169b48c43b5a47d2c962792a7b2a2df","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-05T22:03:09.762298Z","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.252048Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2012.13587","last_updated":"2021-05-10T12:54:26Z","snapshot_observed_at":"2026-08-04T08:59:52.662089Z","submitted_at":"2020-12-25T14:58:35Z","title":"Inception Convolution with Efficient Dilation Search","version":2},"cited_work":{"arxiv_id":"2012.13587","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.13587","snapshot_observed_at":"2026-08-05T22:03:10.252048Z","title":"Inception Convolution with Efficient Dilation Search","venue":"cs.CV","work_id":"771f510c-34e0-4f34-b8fd-61381823fe98","year":2020},"citing_paper":{"arxiv_id":"2508.08339","last_updated":"2025-08-11T04:13:56Z","snapshot_observed_at":"2026-08-08T14:13:05.982332Z","submitted_at":"2025-08-11T04:13:56Z","title":"SHeRL-FL: When Representation Learning Meets Split Learning in Hierarchical Federated Learning","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-05T22:03:09.762298Z"},"links":{"cited_paper":"/paper/2012.13587","citing_paper":"/paper/2508.08339"},"observation_digest":"sha256:3bf7323c2954d9751f18b88aec302e5e8fbb2ade7fe2241f258c85760aa5a07a","observation_id":"765949bd-cc54-4a43-9cdf-04237096d300","resolution":{"observed_at":"2026-08-05T22:03:10.254530Z","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/2012.13587/citation-record","integrity":"/paper/2012.13587/integrity","json":"/paper/2012.13587/citation-record.json","paper":"/paper/2012.13587"},"outbound":[],"paper":{"arxiv_id":"2012.13587","last_updated":"2021-05-10T12:54:26Z","latest_version":2,"primary_category":"cs.CV","snapshot_observed_at":"2026-08-04T08:59:52.662089Z","submitted_at":"2020-12-25T14:58:35Z","title":"Inception Convolution with Efficient Dilation Search"},"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:2012.13587."}