{"as_of":"2026-08-16T06:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e4ba5bb9554a5534b8aec8e1034bac0686a42d51b3188afc61853a009e1df5c","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-16T06:30:59.297886+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-08-14T12:53:03.419457Z","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-14T12:53:03.681008Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.05554","last_updated":"2018-07-15T14:16:22Z","snapshot_observed_at":"2026-08-14T18:51:49.923261Z","submitted_at":"2018-07-15T14:16:22Z","title":"A new lower bound for classic online bin packing","version":1},"cited_work":{"arxiv_id":"1807.05554","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.05554","snapshot_observed_at":"2026-08-14T12:53:03.681008Z","title":"A new lower bound for classic online bin packing","venue":"cs.DS","work_id":"837cd25e-0735-4448-aa37-8cb0eb1887b7","year":2018},"citing_paper":{"arxiv_id":"1908.06727","last_updated":"2019-08-19T12:16:50Z","snapshot_observed_at":"2026-08-15T07:43:41.673197Z","submitted_at":"2019-08-19T12:16:50Z","title":"On bin packing with clustering and bin packing with delays","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T12:53:03.419457Z"},"links":{"cited_paper":"/paper/1807.05554","citing_paper":"/paper/1908.06727"},"observation_digest":"sha256:1795b0583b882dc27691641ce08d1d0994082baf453858bf8c3c62026aaa89e8","observation_id":"aea28559-0510-4b50-9370-d2775cbb7fee","resolution":{"observed_at":"2026-08-14T12:53:03.696041Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1807.05554/citation-record","integrity":"/paper/1807.05554/integrity","json":"/paper/1807.05554/citation-record.json","paper":"/paper/1807.05554"},"outbound":[],"paper":{"arxiv_id":"1807.05554","last_updated":"2018-07-15T14:16:22Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T18:51:49.923261Z","submitted_at":"2018-07-15T14:16:22Z","title":"A new lower bound for classic online bin packing"},"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 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1807.05554."}