{"as_of":"2026-08-16T10:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:afd0191d6db75e686666dea25356b34b9566b9816913ecbbe4223d4991457f94","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-16T06:30:59.297886+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-10T17:35:46.155869Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-09T22:29:06.660458Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2310.11611","last_updated":"2023-10-17T22:08:01Z","snapshot_observed_at":"2026-08-14T23:40:12.653361Z","submitted_at":"2023-10-17T22:08:01Z","title":"In defense of parameter sharing for model-compression","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11611","snapshot_observed_at":"2026-08-10T17:35:46.155869Z","title":"In defense of parameter sharing for model-compression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.12115","last_updated":"2025-01-21T13:25:32Z","snapshot_observed_at":"2026-08-12T20:51:33.069348Z","submitted_at":"2025-01-21T13:25:32Z","title":"Meta-Sparsity: Learning Optimal Sparse Structures in Multi-task Networks through Meta-learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-10T17:35:46.155869Z"},"links":{"cited_paper":"/paper/2310.11611","citing_paper":"/paper/2501.12115"},"observation_digest":"sha256:04d957775316995375217271cbdaab6b99627cf0b8358c73f96535d9bb9cf9b1","observation_id":"486df19c-f9a3-444e-9994-84207b81f30e","resolution":{"observed_at":"2026-08-10T17:35:46.155869Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11611","last_updated":"2023-10-17T22:08:01Z","snapshot_observed_at":"2026-08-14T23:40:12.653361Z","submitted_at":"2023-10-17T22:08:01Z","title":"In defense of parameter sharing for model-compression","version":1},"cited_work":{"arxiv_id":"2310.11611","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11611","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"In defense of parameter sharing for model- compression.arXiv preprint arXiv:2310.11611","venue":null,"work_id":"a51d5bd4-3969-4513-9fc8-6e1789bc645b","year":null},"citing_paper":{"arxiv_id":"2604.21724","last_updated":"2026-04-24T17:56:56Z","snapshot_observed_at":"2026-08-11T12:10:58.520163Z","submitted_at":"2026-04-23T14:27:10Z","title":"Beyond N-gram: Data-Aware X-GRAM Extraction for Efficient Embedding Parameter Scaling","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-09T22:28:26.681945Z"},"links":{"cited_paper":"/paper/2310.11611","citing_paper":"/paper/2604.21724"},"observation_digest":"sha256:56e001280fa206962d46ee98e215ddecf2c0dc7669c141ac8e62fea6a228729f","observation_id":"9b925aa0-d059-42fd-aa11-957429b79f33","resolution":{"observed_at":"2026-05-09T22:29:06.661935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2310.11611/citation-record","integrity":"/paper/2310.11611/integrity","json":"/paper/2310.11611/citation-record.json","paper":"/paper/2310.11611"},"outbound":[],"paper":{"arxiv_id":"2310.11611","last_updated":"2023-10-17T22:08:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T23:40:12.653361Z","submitted_at":"2023-10-17T22:08:01Z","title":"In defense of parameter sharing for model-compression"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2310.11611."}