{"as_of":"2026-08-14T20:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ec6cd9cf769aff7f2e6deaa1569ad0510595efbba3cfc4f7f42a23c0f02f3f94","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-14T06:32:32.682623+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-09T18:06:03.553672Z","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-11T16:16:10.120251Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.07112","last_updated":"2024-03-11T19:05:59Z","snapshot_observed_at":"2026-08-13T18:43:57.540165Z","submitted_at":"2024-03-11T19:05:59Z","title":"Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components","version":1},"cited_work":{"arxiv_id":"2403.07112","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.07112","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parame- terized Task Graph Scheduling Algorithm for Comparing Algorithmic Components","venue":null,"work_id":"a9c17ed9-3353-4462-9aec-8685562594a4","year":2024},"citing_paper":{"arxiv_id":"2605.01094","last_updated":"2026-05-01T20:58:59Z","snapshot_observed_at":"2026-08-13T14:22:15.593197Z","submitted_at":"2026-05-01T20:58:59Z","title":"ncsim: A Lightweight Simulator for Networked Edge Computing with Wireless Interference Modeling","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-09T18:06:03.553672Z"},"links":{"cited_paper":"/paper/2403.07112","citing_paper":"/paper/2605.01094"},"observation_digest":"sha256:613d6125b3c9a2351fe6d54d4538bae706d62a87643cd3fd23297cdbcfe58208","observation_id":"0eaef729-0097-499d-9f34-858e0136897c","resolution":{"observed_at":"2026-05-11T16:16:10.123840Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2403.07112/citation-record","integrity":"/paper/2403.07112/integrity","json":"/paper/2403.07112/citation-record.json","paper":"/paper/2403.07112"},"outbound":[],"paper":{"arxiv_id":"2403.07112","last_updated":"2024-03-11T19:05:59Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-13T18:43:57.540165Z","submitted_at":"2024-03-11T19:05:59Z","title":"Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2403.07112."}