{"as_of":"2026-08-23T05:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5cd9eb254a27be74c348620d00a1d9e83ab338a2e5c9fbac419fc0c56621b4ab","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-09T20:48:14.468676Z","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-11T14:56:08.323700Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2103.10406","last_updated":"2021-03-18T17:42:20Z","snapshot_observed_at":"2026-08-16T18:37:55.913343Z","submitted_at":"2021-03-18T17:42:20Z","title":"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More","version":1},"cited_work":{"arxiv_id":"2103.10406","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2103.10406","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2103.10406 , year=","venue":null,"work_id":"7bb2578e-f9ea-4529-9a5d-9c1a6a7987f6","year":null},"citing_paper":{"arxiv_id":"2605.05233","last_updated":"2026-04-30T08:25:10Z","snapshot_observed_at":"2026-08-17T12:26:17.101224Z","submitted_at":"2026-04-30T08:25:10Z","title":"Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-05-09T20:48:14.468676Z"},"links":{"cited_paper":"/paper/2103.10406","citing_paper":"/paper/2605.05233"},"observation_digest":"sha256:651ace6a138f71fb3178463fdf25e161f69fea9f66e88d421e24b0049bd8b0ce","observation_id":"b91154b1-02fc-4183-8b1c-bffb3da5b2d5","resolution":{"observed_at":"2026-05-11T14:56:08.326566Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2103.10406/citation-record","integrity":"/paper/2103.10406/integrity","json":"/paper/2103.10406/citation-record.json","paper":"/paper/2103.10406"},"outbound":[],"paper":{"arxiv_id":"2103.10406","last_updated":"2021-03-18T17:42:20Z","latest_version":1,"primary_category":"cs.CG","snapshot_observed_at":"2026-08-16T18:37:55.913343Z","submitted_at":"2021-03-18T17:42:20Z","title":"Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More"},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2103.10406."}