{"as_of":"2026-08-10T14:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:17865d586c4f7fe300fa998d1b562e665a5ec8a9995854d343335dc36afd0a9c","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T00:26:05.296940Z","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-23T19:35:47.194799Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":"2401.02731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameter-efficient sparsity crafting from dense to mixture-of-experts for instruction tuning on general tasks.arXiv preprint arXiv: 2401.02731, 2024b","venue":null,"work_id":"cfd3defe-374d-459e-837a-094682fa8e48","year":2024},"citing_paper":{"arxiv_id":"2410.06431","last_updated":"2026-05-13T22:22:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-09T00:09:15Z","title":"Functional-level Uncertainty Quantification for Calibrated Fine-tuning on LLMs","version":5},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T19:35:29.917096Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2410.06431"},"observation_digest":"sha256:c24021502ee78ad6bb8bbd33d57a68460f23aadcc4f71cb1e91a5c1cd69a1eb3","observation_id":"97432e10-64b2-461b-82af-8cc2d4e5d893","resolution":{"observed_at":"2026-05-23T19:35:47.199646Z","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":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-08-09T00:26:05.296940Z","title":"Parameter-efficient sparsity crafting from dense to mixture-of-experts for instruction tuning on gen- eral tasks","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.03884","last_updated":"2025-02-06T08:58:03Z","snapshot_observed_at":"2026-08-09T00:19:38.091491Z","submitted_at":"2025-02-06T08:58:03Z","title":"Rank Also Matters: Hierarchical Configuration for Mixture of Adapter Experts in LLM Fine-Tuning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T00:26:05.296940Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2502.03884"},"observation_digest":"sha256:6360ad4d24e101f9d3eed7ce90894074b60cee86f0a8b2894b0b0eac1db86f44","observation_id":"e32b3fa7-b9e7-4485-9bb8-363f58235f74","resolution":{"observed_at":"2026-08-09T00:26:05.296940Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":"2401.02731","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parameter-efficient sparsity crafting from dense to mixture-of-experts for instruction tuning on general tasks.arXiv preprint arXiv: 2401.02731, 2024b","venue":null,"work_id":"cfd3defe-374d-459e-837a-094682fa8e48","year":2024},"citing_paper":{"arxiv_id":"2502.04416","last_updated":"2026-04-23T00:51:26Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-06T14:05:30Z","title":"Analytical FFN-to-MoE Restructuring via Activation Pattern Analysis","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-23T04:08:29.089438Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2502.04416"},"observation_digest":"sha256:0f27bd140628da5b8f3de417f52086417097faf1fee86c5eb5cc6bf159bd1512","observation_id":"8f966aee-302a-47f6-a284-cce04a95b592","resolution":{"observed_at":"2026-05-23T04:12:31.017530Z","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":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-07-13T14:28:05.261852Z","title":"Parameter-efficient sparsity crafting from dense to mixture-of- experts for instruction tuning on general tasks.arXiv preprint arXiv:2401.02731, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.01313","last_updated":"2026-07-13T21:14:32Z","snapshot_observed_at":"2026-08-05T01:00:36.896864Z","submitted_at":"2026-04-01T18:36:47Z","title":"ScatterPrism: convergence for generative simulation and inverse problems in particle and nuclear physics","version":2},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-13T14:28:05.261852Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2604.01313"},"observation_digest":"sha256:c7b7761e9ce20fb5728783fcbf9a4310bd9d08749c5f2ba03b14134dc9088786","observation_id":"3f674f04-8516-4eda-9050-f91e7bb0753b","resolution":{"observed_at":"2026-07-13T14:28:05.261852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-07-15T11:44:19.622453Z","title":"Parameter-efficient sparsity crafting from dense to mixture-of- experts for instruction tuning on general tasks.arXiv preprint arXiv:2401.02731, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.01313","last_updated":"2026-07-13T21:14:32Z","snapshot_observed_at":"2026-08-05T01:00:36.896864Z","submitted_at":"2026-04-01T18:36:47Z","title":"ScatterPrism: convergence for generative simulation and inverse problems in particle and nuclear physics","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-07-15T11:44:19.622453Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2604.01313"},"observation_digest":"sha256:9938cdb8f2e47c7ad7c919f9423ae765661a7c849dba76fa5ab021768fb69f35","observation_id":"f7f1333c-443a-4c26-be52-aed296853966","resolution":{"observed_at":"2026-07-15T11:44:19.622453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02731","last_updated":"2024-09-24T14:14:40Z","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02731","snapshot_observed_at":"2026-08-02T13:37:02.107259Z","title":"Parameter-","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.21610","last_updated":"2026-05-20T04:43:02Z","snapshot_observed_at":"2026-08-06T13:09:35.487490Z","submitted_at":"2026-05-20T04:43:02Z","title":"SCOPE and SCION: A Benchmark and an Auditable Reference Pipeline for Schema Induction and Fusion from Text","version":1},"reference_index":163,"source":"arxiv_source","source_observed_at":"2026-08-02T13:37:02.107259Z"},"links":{"cited_paper":"/paper/2401.02731","citing_paper":"/paper/2607.21610"},"observation_digest":"sha256:abeaffca997ba347b0ac8b9e77566994e33b241cd093f47d434e1236c81f17ef","observation_id":"3326e600-c94e-4ec2-b772-09dfcf48ce47","resolution":{"observed_at":"2026-08-02T13:37:02.107259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2401.02731/citation-record","integrity":"/paper/2401.02731/integrity","json":"/paper/2401.02731/citation-record.json","paper":"/paper/2401.02731"},"outbound":[],"paper":{"arxiv_id":"2401.02731","last_updated":"2024-09-24T14:14:40Z","latest_version":4,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T07:40:38.399489Z","submitted_at":"2024-01-05T09:58:09Z","title":"Parameter-Efficient Sparsity Crafting from Dense to Mixture-of-Experts for Instruction Tuning on General Tasks"},"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 6 inbound Pith citation observations for arXiv:2401.02731."}