{"as_of":"2026-08-18T02:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1a5e0b6f9d22e9e2261375139747cd5f1c5470759da20c64a5ff2b0cc4667f39","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-17T06:30:58.91139+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-15T18:00:16.569359Z","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-15T18:00:17.322981Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1212.2497","last_updated":"2012-10-19T15:07:27Z","snapshot_observed_at":"2026-08-15T00:42:29.278114Z","submitted_at":"2012-10-19T15:07:27Z","title":"Solving MAP Exactly using Systematic Search","version":1},"cited_work":{"arxiv_id":"1212.2497","doi":null,"metadata_source":"pith","pith_arxiv_id":"1212.2497","snapshot_observed_at":"2026-08-15T18:00:17.322981Z","title":"Solving MAP Exactly using Systematic Search","venue":"cs.AI","work_id":"15bbec20-4d66-4e3e-b043-d16594c6a4a7","year":2012},"citing_paper":{"arxiv_id":"2507.19338","last_updated":"2025-07-25T14:48:34Z","snapshot_observed_at":"2026-08-16T14:08:17.348449Z","submitted_at":"2025-07-25T14:48:34Z","title":"Branch-and-bound method for calculating Viterbi path in triplet Markov models","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T18:00:16.569359Z"},"links":{"cited_paper":"/paper/1212.2497","citing_paper":"/paper/2507.19338"},"observation_digest":"sha256:0b0681de49874a8b17871c81278ac84be96096a41c9ab49ba59ad836405e1f1f","observation_id":"d9a7a5c0-f531-40dc-8b59-ed03c598f21f","resolution":{"observed_at":"2026-08-15T18:00:17.330673Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1212.2497/citation-record","integrity":"/paper/1212.2497/integrity","json":"/paper/1212.2497/citation-record.json","paper":"/paper/1212.2497"},"outbound":[],"paper":{"arxiv_id":"1212.2497","last_updated":"2012-10-19T15:07:27Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-15T00:42:29.278114Z","submitted_at":"2012-10-19T15:07:27Z","title":"Solving MAP Exactly using Systematic Search"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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:1212.2497."}