{"as_of":"2026-08-10T07:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1aaaacc176ca24659caa746bca7b94fce941663a00df2597c5cbcc18f8979b70","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T22:08:48.372194Z","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-13T16:48:02.696505Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.03514","snapshot_observed_at":"2026-08-09T22:08:48.372194Z","title":"Low-complexity probing via finding subnetworks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.18887","last_updated":"2025-05-29T16:49:00Z","snapshot_observed_at":"2026-08-09T22:01:38.611459Z","submitted_at":"2025-01-31T04:42:45Z","title":"Towards Unified Attribution in Explainable AI, Data-Centric AI, and Mechanistic Interpretability","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-09T22:08:48.372194Z"},"links":{"cited_paper":"/paper/2104.03514","citing_paper":"/paper/2501.18887"},"observation_digest":"sha256:5c8fdd42d8b92dc5c095c14861f9ad8bf838c82fc6af67b4e041ae5118f56f43","observation_id":"a3957521-c2a9-49bf-bd59-609e85985399","resolution":{"observed_at":"2026-08-09T22:08:48.372194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.03514","snapshot_observed_at":"2026-08-06T22:48:35.984336Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.20790","last_updated":"2025-09-04T11:41:34Z","snapshot_observed_at":"2026-08-09T03:26:19.673933Z","submitted_at":"2025-06-25T19:26:31Z","title":"Stochastic Parameter Decomposition","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T22:48:35.984336Z"},"links":{"cited_paper":"/paper/2104.03514","citing_paper":"/paper/2506.20790"},"observation_digest":"sha256:2bfa959d3579bfeb78978429d6715aba83bd972146b3bbb400e2c3a64c39c0aa","observation_id":"7b8617a8-a9e2-4799-98ea-716abd58697b","resolution":{"observed_at":"2026-08-06T22:48:35.984336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.03514","snapshot_observed_at":"2026-08-05T17:37:55.484055Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2508.16109","last_updated":"2025-08-22T05:54:11Z","snapshot_observed_at":"2026-08-10T03:57:56.248075Z","submitted_at":"2025-08-22T05:54:11Z","title":"From Indirect Object Identification to Syllogisms: Exploring Binary Mechanisms in Transformer Circuits","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T17:37:55.484055Z"},"links":{"cited_paper":"/paper/2104.03514","citing_paper":"/paper/2508.16109"},"observation_digest":"sha256:138f9686867d16a45e7ed46f6167596bc04541c4054abd20d0a2c95163e87cfe","observation_id":"07486dce-7db7-427b-a6e4-46b73a072bc6","resolution":{"observed_at":"2026-08-05T17:37:55.484055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks","version":1},"cited_work":{"arxiv_id":"2104.03514","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2104.03514","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"746bf128-9222-4d5e-9c59-70321d6e1082","year":2021},"citing_paper":{"arxiv_id":"2604.04982","last_updated":"2026-04-04T23:13:55Z","snapshot_observed_at":"2026-08-02T14:39:32.415726Z","submitted_at":"2026-04-04T23:13:55Z","title":"CURE:Circuit-Aware Unlearning for LLM-based Recommendation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T16:47:25.256063Z"},"links":{"cited_paper":"/paper/2104.03514","citing_paper":"/paper/2604.04982"},"observation_digest":"sha256:6402e8ffe6522f9c6cc58d27d01bef2226a67a566b433739ab93176ebf891172","observation_id":"00d1c81a-9a0c-4374-9d0e-086723d2d830","resolution":{"observed_at":"2026-05-13T16:48:02.698176Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.03514","snapshot_observed_at":"2026-07-13T12:04:13.336341Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2604.04984","last_updated":"2026-05-12T14:04:41Z","snapshot_observed_at":"2026-08-06T05:41:23.373110Z","submitted_at":"2026-04-05T00:44:02Z","title":"A Numerical PDEs Approach to Evolution Equations in Shape Analysis Based on Regularized Morphoelasticity","version":5},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T12:04:13.336341Z"},"links":{"cited_paper":"/paper/2104.03514","citing_paper":"/paper/2604.04984"},"observation_digest":"sha256:6615b7a819324bc8fc9312197581370de4c613d342b7532538015ac0fbb69124","observation_id":"4f1d4ea4-999d-4fbb-9212-3b726ca56dcf","resolution":{"observed_at":"2026-07-13T12:04:13.336341Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2104.03514/citation-record","integrity":"/paper/2104.03514/integrity","json":"/paper/2104.03514/citation-record.json","paper":"/paper/2104.03514"},"outbound":[],"paper":{"arxiv_id":"2104.03514","last_updated":"2021-04-08T05:11:21Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T09:36:53.061945Z","submitted_at":"2021-04-08T05:11:21Z","title":"Low-Complexity Probing via Finding Subnetworks"},"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 5 inbound Pith citation observations for arXiv:2104.03514."}