{"as_of":"2026-08-15T12:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5eeb28a84ddf34da3a42ddcfff86fa7fba3723e65da6cbf310560f6c3b96a041","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:18:24.645694Z","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-07-04T17:20:01.543672Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.10889","last_updated":"2025-08-21T10:39:45Z","snapshot_observed_at":"2026-08-12T23:00:40.618408Z","submitted_at":"2024-08-20T14:20:19Z","title":"On Learning Action Costs from Input Plans","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10889","snapshot_observed_at":"2026-08-07T04:18:24.645694Z","title":"On learning action costs from input plans.arXiv preprint arXiv:2408.10889, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.10897","last_updated":"2025-06-12T17:02:27Z","snapshot_observed_at":"2026-08-12T06:57:13.173792Z","submitted_at":"2025-06-12T17:02:27Z","title":"GenPlanX. Generation of Plans and Execution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:18:24.645694Z"},"links":{"cited_paper":"/paper/2408.10889","citing_paper":"/paper/2506.10897"},"observation_digest":"sha256:39ea60145a7d46459e0b2a89b23fb7ef7a77b57f5c6de3f1c29015746e24c6ee","observation_id":"30425c6d-da13-48fc-9427-3199309372f4","resolution":{"observed_at":"2026-08-07T04:18:24.645694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10889","last_updated":"2025-08-21T10:39:45Z","snapshot_observed_at":"2026-08-12T23:00:40.618408Z","submitted_at":"2024-08-20T14:20:19Z","title":"On Learning Action Costs from Input Plans","version":3},"cited_work":{"arxiv_id":"2408.10889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.10889","snapshot_observed_at":"2026-07-04T17:20:01.543672Z","title":"arXiv preprint arXiv:2408.10889 , year=","venue":null,"work_id":"0a2e7479-b102-463e-b57d-53a7b1095917","year":2024},"citing_paper":{"arxiv_id":"2605.02603","last_updated":"2026-05-04T13:50:59Z","snapshot_observed_at":"2026-08-11T08:20:43.574315Z","submitted_at":"2026-05-04T13:50:59Z","title":"Counterfactual Reasoning in Automated Planning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-09T15:51:36.334189Z"},"links":{"cited_paper":"/paper/2408.10889","citing_paper":"/paper/2605.02603"},"observation_digest":"sha256:31b3f81718e5571c038b2eaf24ce8072265f344c6d68de127f3281136b808503","observation_id":"04d8dfa2-4e44-44fc-b865-071a9dacb581","resolution":{"observed_at":"2026-05-11T16:36:09.474359Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10889","last_updated":"2025-08-21T10:39:45Z","snapshot_observed_at":"2026-08-12T23:00:40.618408Z","submitted_at":"2024-08-20T14:20:19Z","title":"On Learning Action Costs from Input Plans","version":3},"cited_work":{"arxiv_id":"2408.10889","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.10889","snapshot_observed_at":"2026-07-04T17:20:01.543672Z","title":"arXiv preprint arXiv:2408.10889 , year=","venue":null,"work_id":"0a2e7479-b102-463e-b57d-53a7b1095917","year":2024},"citing_paper":{"arxiv_id":"2606.24414","last_updated":"2026-06-23T10:51:54Z","snapshot_observed_at":"2026-08-08T08:17:54.414527Z","submitted_at":"2026-06-23T10:51:54Z","title":"Cycle-Consistent Neural Explanation of Formal Verification Certificates","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-25T23:44:27.663072Z"},"links":{"cited_paper":"/paper/2408.10889","citing_paper":"/paper/2606.24414"},"observation_digest":"sha256:ace7004959e8e377303b628f2d4a8c723b54a42e2a8870cf409683b65a6d7d19","observation_id":"526930c4-b250-439c-b488-0d23ea8bbf6a","resolution":{"observed_at":"2026-07-04T17:20:01.545254Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.10889/citation-record","integrity":"/paper/2408.10889/integrity","json":"/paper/2408.10889/citation-record.json","paper":"/paper/2408.10889"},"outbound":[],"paper":{"arxiv_id":"2408.10889","last_updated":"2025-08-21T10:39:45Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-12T23:00:40.618408Z","submitted_at":"2024-08-20T14:20:19Z","title":"On Learning Action Costs from Input Plans"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.10889."}