{"as_of":"2026-08-18T09:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed4bb89176ab0d400843fb5d3373a52476f70d5b45aece90cdef7b855c7d0578","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-18T06:34:40.430872+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-12T00:16:16.754749Z","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-12T00:16:19.618929Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1502.04048","last_updated":"2017-11-03T17:22:24Z","snapshot_observed_at":"2026-08-14T23:00:06.571597Z","submitted_at":"2015-02-13T16:22:18Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts","version":3},"cited_work":{"arxiv_id":"1502.04048","doi":null,"metadata_source":"pith","pith_arxiv_id":"1502.04048","snapshot_observed_at":"2026-08-12T00:16:19.618929Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts","venue":"cs.DS","work_id":"acc5d2eb-d812-4c56-8c9e-c683befe8337","year":2015},"citing_paper":{"arxiv_id":"2608.08348","last_updated":"2026-08-08T22:04:57Z","snapshot_observed_at":"2026-08-16T19:36:16.594550Z","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T00:16:16.754749Z"},"links":{"cited_paper":"/paper/1502.04048","citing_paper":"/paper/2608.08348"},"observation_digest":"sha256:37c203641f9bd2e9c976c60780c5cf27970198d52ed1b8d37273b82a22a4b79d","observation_id":"7ca4db05-f978-4ffd-9b00-b183499b22b1","resolution":{"observed_at":"2026-08-12T00:16:19.674749Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1502.04048/citation-record","integrity":"/paper/1502.04048/integrity","json":"/paper/1502.04048/citation-record.json","paper":"/paper/1502.04048"},"outbound":[],"paper":{"arxiv_id":"1502.04048","last_updated":"2017-11-03T17:22:24Z","latest_version":3,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T23:00:06.571597Z","submitted_at":"2015-02-13T16:22:18Z","title":"Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1502.04048."}