{"as_of":"2026-08-17T00:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3fd4db94bb3115e7ebeed7ef1d2b847a72f83467e26eb8a07a81d4c74a62e737","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-15T20:56:48.414539Z","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-09T17:01:02.933127Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.06921","last_updated":"2025-08-07T10:57:05Z","snapshot_observed_at":"2026-08-16T12:51:40.218921Z","submitted_at":"2025-03-10T05:00:24Z","title":"Task Vector Quantization for Memory-Efficient Model Merging","version":2},"cited_work":{"arxiv_id":"2503.06921","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.06921","snapshot_observed_at":"2026-08-09T17:01:02.933127Z","title":"Task Vector Quantization for Memory-Efficient Model Merging","venue":"cs.LG","work_id":"e66510dd-0b3b-4d6f-8620-adba035931bb","year":2025},"citing_paper":{"arxiv_id":"2502.01015","last_updated":"2026-06-23T02:24:17Z","snapshot_observed_at":"2026-08-15T15:11:48.357266Z","submitted_at":"2025-02-03T03:18:26Z","title":"Task Vector Bases: A Unified and Scalable Framework for Compressed Task Arithmetic","version":5},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T17:01:02.159139Z"},"links":{"cited_paper":"/paper/2503.06921","citing_paper":"/paper/2502.01015"},"observation_digest":"sha256:df620e51dd6d57673d0d1973b0503b8788beafd660909a869046c90f9eeeed9b","observation_id":"0e80aa86-95bd-49e9-aeb3-fcc4ce81baf1","resolution":{"observed_at":"2026-08-09T17:01:02.938641Z","resolver_source":"local_arxiv","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"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06921","last_updated":"2025-08-07T10:57:05Z","snapshot_observed_at":"2026-08-16T12:51:40.218921Z","submitted_at":"2025-03-10T05:00:24Z","title":"Task Vector Quantization for Memory-Efficient Model Merging","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06921","snapshot_observed_at":"2026-08-15T20:56:48.414539Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.11344","last_updated":"2025-05-16T15:11:19Z","snapshot_observed_at":"2026-08-16T11:01:30.862569Z","submitted_at":"2025-05-16T15:11:19Z","title":"Dynamic Base model Shift for Delta Compression","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T20:56:48.414539Z"},"links":{"cited_paper":"/paper/2503.06921","citing_paper":"/paper/2505.11344"},"observation_digest":"sha256:0dfd713951ee336a733231a119fa23d7f91ad1ab8cc3ef2a8539a879376bb232","observation_id":"7694e47b-8e17-478b-89f9-52c90f75c6d6","resolution":{"observed_at":"2026-08-15T20:56:48.414539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2503.06921/citation-record","integrity":"/paper/2503.06921/integrity","json":"/paper/2503.06921/citation-record.json","paper":"/paper/2503.06921"},"outbound":[],"paper":{"arxiv_id":"2503.06921","last_updated":"2025-08-07T10:57:05Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:51:40.218921Z","submitted_at":"2025-03-10T05:00:24Z","title":"Task Vector Quantization for Memory-Efficient Model Merging"},"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 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2503.06921."}