{"as_of":"2026-08-12T03:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:70db7727efdfe1fff4e960600f65d93c7170ce88d26b9be5f280f0df6b377761","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-11T06:34:44.6726+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-07T10:28:43.671373Z","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-07-04T15:39:56.714727Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1312.0841","last_updated":"2013-12-03T14:56:28Z","snapshot_observed_at":"2026-08-04T13:12:41.645104Z","submitted_at":"2013-12-03T14:56:28Z","title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.0841","snapshot_observed_at":"2026-08-07T10:28:43.671373Z","title":"Combining simulated annealing and monte carlo tree search for expression simplification","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.05213","last_updated":"2025-06-05T16:27:49Z","snapshot_observed_at":"2026-08-08T16:04:48.106610Z","submitted_at":"2025-06-05T16:27:49Z","title":"LLM-First Search: Self-Guided Exploration of the Solution Space","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T10:28:43.671373Z"},"links":{"cited_paper":"/paper/1312.0841","citing_paper":"/paper/2506.05213"},"observation_digest":"sha256:d6d8f5148407fe1168a7a0275c5b7308003174c8eca61cb97d5e5666b29d68eb","observation_id":"9058539e-e8d2-46e5-b426-5ed4d85f870a","resolution":{"observed_at":"2026-08-07T10:28:43.671373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.0841","last_updated":"2013-12-03T14:56:28Z","snapshot_observed_at":"2026-08-04T13:12:41.645104Z","submitted_at":"2013-12-03T14:56:28Z","title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification","version":1},"cited_work":{"arxiv_id":"1312.0841","doi":null,"metadata_source":"pith","pith_arxiv_id":"1312.0841","snapshot_observed_at":"2026-07-04T15:39:56.714727Z","title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification","venue":"cs.AI","work_id":"f4beacbd-67ce-420e-8f52-2142b2b4a6de","year":2013},"citing_paper":{"arxiv_id":"2606.26399","last_updated":"2026-06-24T21:34:08Z","snapshot_observed_at":"2026-08-08T02:38:29.907041Z","submitted_at":"2026-06-24T21:34:08Z","title":"Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T01:31:06.792515Z"},"links":{"cited_paper":"/paper/1312.0841","citing_paper":"/paper/2606.26399"},"observation_digest":"sha256:dd450c59a26fc01349dde9582b2eef8608cdcb137b907287badc26c6e147b102","observation_id":"24edab8d-036d-44d8-b079-2f31d33a3d49","resolution":{"observed_at":"2026-07-04T15:39:56.716267Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1312.0841/citation-record","integrity":"/paper/1312.0841/integrity","json":"/paper/1312.0841/citation-record.json","paper":"/paper/1312.0841"},"outbound":[],"paper":{"arxiv_id":"1312.0841","last_updated":"2013-12-03T14:56:28Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-04T13:12:41.645104Z","submitted_at":"2013-12-03T14:56:28Z","title":"Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1312.0841."}