{"as_of":"2026-08-08T07:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c95efc3166d2113448f32ff5d9dad3372cd68937e14388c5f30a564f4cc95fd0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:07:39.624213Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1705.02955","last_updated":"2017-11-16T23:12:15Z","snapshot_observed_at":"2026-07-06T05:41:45.343378Z","submitted_at":"2017-05-08T16:27:48Z","title":"Safe and Nested Subgame Solving for Imperfect-Information Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.02955","snapshot_observed_at":"2026-08-07T05:07:39.624213Z","title":"Safe and nested subgame solving for imperfect-information games,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2507.00004","last_updated":"2025-07-10T17:08:40Z","snapshot_observed_at":"2026-08-07T04:57:52.653569Z","submitted_at":"2025-06-10T14:47:48Z","title":"A Theory of Inference Compute Scaling: Reasoning through Directed Stochastic Skill Search","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T05:07:39.624213Z"},"links":{"cited_paper":"/paper/1705.02955","citing_paper":"/paper/2507.00004"},"observation_digest":"sha256:783d900b5bf2be1eb181cc2dc26b68988a54b9369a1dcf1c007a7f58553f6f3d","observation_id":"638d68f3-0448-4836-bc9a-b4bb22aa41b0","resolution":{"observed_at":"2026-08-07T05:07:39.624213Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.02955","last_updated":"2017-11-16T23:12:15Z","snapshot_observed_at":"2026-07-06T05:41:45.343378Z","submitted_at":"2017-05-08T16:27:48Z","title":"Safe and Nested Subgame Solving for Imperfect-Information Games","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.02955","snapshot_observed_at":"2026-08-04T10:40:56.531803Z","title":"InAdvances in Neural Information Processing Systems (NeurIPS)","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.09330","last_updated":"2026-05-31T10:03:39Z","snapshot_observed_at":"2026-08-06T10:10:13.146102Z","submitted_at":"2025-10-10T12:32:43Z","title":"Safety Game: Inference-Time Alignment of Black-Box LLMs via Constrained Optimization","version":3},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-04T10:40:56.531803Z"},"links":{"cited_paper":"/paper/1705.02955","citing_paper":"/paper/2510.09330"},"observation_digest":"sha256:2bf8bf417502721504ce9ab9b86d130f1511bb7fa797cfc7cb78f4c39b0c317c","observation_id":"40159f0c-40ff-4505-b72c-d5f481005ebf","resolution":{"observed_at":"2026-08-04T10:40:56.531803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1705.02955/citation-record","integrity":"/paper/1705.02955/integrity","json":"/paper/1705.02955/citation-record.json","paper":"/paper/1705.02955"},"outbound":[],"paper":{"arxiv_id":"1705.02955","last_updated":"2017-11-16T23:12:15Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T05:41:45.343378Z","submitted_at":"2017-05-08T16:27:48Z","title":"Safe and Nested Subgame Solving for Imperfect-Information Games"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1705.02955."}