{"as_of":"2026-08-10T05:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:80367934320cd7386f25bd4388396503ab5b773ada5cfb1c57a294f4a983a2ab","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-09T06:31:02.800959+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-05T22:46:27.446192Z","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-19T18:22:43.258909Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.11447","last_updated":"2025-06-14T06:10:04Z","snapshot_observed_at":"2026-08-08T15:33:47.404614Z","submitted_at":"2024-12-16T04:58:42Z","title":"Decouple and Decompose: Scaling Resource Allocation with DeDe","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.11447","snapshot_observed_at":"2026-08-05T22:46:27.446192Z","title":"Zeal: Rethinking Large-Scale Re- source Allocation with “Decouple and Decompose“,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.06432","last_updated":"2025-08-08T16:20:24Z","snapshot_observed_at":"2026-08-09T21:32:23.547254Z","submitted_at":"2025-08-08T16:20:24Z","title":"Hierarchical Placement Learning for Network Slice Provisioning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T22:46:27.446192Z"},"links":{"cited_paper":"/paper/2412.11447","citing_paper":"/paper/2508.06432"},"observation_digest":"sha256:50f75cbfb97459a918c87d1ff1e1b80ab158faf274148d2e7b939de1788316f2","observation_id":"5803df4c-6fcf-4dce-8762-7107311b1620","resolution":{"observed_at":"2026-08-05T22:46:27.446192Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.11447","last_updated":"2025-06-14T06:10:04Z","snapshot_observed_at":"2026-08-08T15:33:47.404614Z","submitted_at":"2024-12-16T04:58:42Z","title":"Decouple and Decompose: Scaling Resource Allocation with DeDe","version":3},"cited_work":{"arxiv_id":"2412.11447","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.11447","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4b56e79d-cf29-4794-ac4a-f55657be1090","year":2025},"citing_paper":{"arxiv_id":"2605.16187","last_updated":"2026-05-15T17:06:56Z","snapshot_observed_at":"2026-08-02T18:39:12.506039Z","submitted_at":"2026-05-15T17:06:56Z","title":"Near-optimal Online Traffic Engineering","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-19T18:20:56.647639Z"},"links":{"cited_paper":"/paper/2412.11447","citing_paper":"/paper/2605.16187"},"observation_digest":"sha256:d300d545a2e7c0d67956d1bfa6d89bb57e95df21e0485f5c324168fa2a13892e","observation_id":"4055e1aa-b814-4868-870d-7cb5aead8616","resolution":{"observed_at":"2026-05-19T18:22:43.260528Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.11447/citation-record","integrity":"/paper/2412.11447/integrity","json":"/paper/2412.11447/citation-record.json","paper":"/paper/2412.11447"},"outbound":[],"paper":{"arxiv_id":"2412.11447","last_updated":"2025-06-14T06:10:04Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-08T15:33:47.404614Z","submitted_at":"2024-12-16T04:58:42Z","title":"Decouple and Decompose: Scaling Resource Allocation with DeDe"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2412.11447."}