{"as_of":"2026-08-10T07:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:19f64d5338ef85e59f8c7c655195ec4c0dd76cf43d734d5fbc0e4e93ed3c0645","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T21:19:39.248766Z","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-20T19:33:42.331727Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2308.14929","last_updated":"2024-06-14T17:40:29Z","snapshot_observed_at":"2026-08-01T20:58:46.699588Z","submitted_at":"2023-08-28T23:08:15Z","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14929","snapshot_observed_at":"2026-08-08T21:19:39.248766Z","title":"Maestro: Uncovering low-rank structures via trainable decomposition","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04850","last_updated":"2025-07-13T02:51:38Z","snapshot_observed_at":"2026-08-09T03:05:22.348093Z","submitted_at":"2025-02-07T11:39:27Z","title":"Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T21:19:39.248766Z"},"links":{"cited_paper":"/paper/2308.14929","citing_paper":"/paper/2502.04850"},"observation_digest":"sha256:74fca995a6723f91f8fe83f4214c6130a9718172bbf16856db21004e6a4c2846","observation_id":"a6caecd1-51d3-4de4-ac5b-3637adbc0d13","resolution":{"observed_at":"2026-08-08T21:19:39.248766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14929","last_updated":"2024-06-14T17:40:29Z","snapshot_observed_at":"2026-08-01T20:58:46.699588Z","submitted_at":"2023-08-28T23:08:15Z","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14929","snapshot_observed_at":"2026-08-07T19:04:45.574257Z","title":"Horvath, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10216","last_updated":"2025-08-12T07:34:30Z","snapshot_observed_at":"2026-08-08T07:46:40.733541Z","submitted_at":"2025-02-14T15:10:43Z","title":"Forget the Data and Fine-Tuning! Just Fold the Network to Compress","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T19:04:45.574257Z"},"links":{"cited_paper":"/paper/2308.14929","citing_paper":"/paper/2502.10216"},"observation_digest":"sha256:3c1a6ae1f05f89c248edaf6f7f913a53fab511e37b2f188cb4c9961a4c53c485","observation_id":"74d17b3a-fa00-451d-a0f1-0e6c992e4ce2","resolution":{"observed_at":"2026-08-07T19:04:45.574257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14929","last_updated":"2024-06-14T17:40:29Z","snapshot_observed_at":"2026-08-01T20:58:46.699588Z","submitted_at":"2023-08-28T23:08:15Z","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","version":2},"cited_work":{"arxiv_id":"2308.14929","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.14929","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2308.14929 , year=","venue":null,"work_id":"9ec70fbf-1d9b-43e2-8121-297426e4eff4","year":null},"citing_paper":{"arxiv_id":"2605.15573","last_updated":"2026-05-15T03:33:20Z","snapshot_observed_at":"2026-07-06T23:26:51.110846Z","submitted_at":"2026-05-15T03:33:20Z","title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","version":1},"reference_index":114,"source":"arxiv_source","source_observed_at":"2026-05-20T19:30:13.469451Z"},"links":{"cited_paper":"/paper/2308.14929","citing_paper":"/paper/2605.15573"},"observation_digest":"sha256:1ecd27ec77aeaea6e501f9e19356a982e3796ab9430457e1acf56938a4039583","observation_id":"9764ebea-c89f-4da1-b8eb-fbe53c0211a3","resolution":{"observed_at":"2026-05-20T19:33:42.334728Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2308.14929/citation-record","integrity":"/paper/2308.14929/integrity","json":"/paper/2308.14929/citation-record.json","paper":"/paper/2308.14929"},"outbound":[],"paper":{"arxiv_id":"2308.14929","last_updated":"2024-06-14T17:40:29Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-01T20:58:46.699588Z","submitted_at":"2023-08-28T23:08:15Z","title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition"},"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 3 inbound Pith citation observations for arXiv:2308.14929."}