{"as_of":"2026-08-13T04:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f3ee161d44d2a53810e614f7926cd880ed4c0b2792540a428da1cc85cde02a62","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:59:11.477815Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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-03T01:08:25.593164Z","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":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.13125","snapshot_observed_at":"2026-08-03T01:08:25.593164Z","title":"arXiv preprint arXiv:2411.13125 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.10746","last_updated":"2026-07-09T15:25:45Z","snapshot_observed_at":"2026-08-13T00:42:21.073040Z","submitted_at":"2026-02-11T11:19:31Z","title":"Weakest Precondition Rules for Programs with Linear Temporal Specifications","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.593164Z"},"links":{"cited_paper":"/paper/2411.13125","citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:a329e5dbe1f48eb7745bc1cd8709dd0f9380ae5600e4cbe902cfa7c731972bbc","observation_id":"75c17f55-c725-49c1-aae7-457b42e6cc6f","resolution":{"observed_at":"2026-08-03T01:08:25.593164Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2411.13125/citation-record","integrity":"/paper/2411.13125/integrity","json":"/paper/2411.13125/citation-record.json","paper":"/paper/2411.13125"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.427460Z","title":"13 Lars-Åke Fredlund, Dilian Gurov, Thomas Noll, Mads Dam, Thomas Arts, and Gennady Chugunov","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.427460Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:aad7344dbae6342ef32489d54c2be2b3b569b9d20412c0cc084e34ca39ca5ea2","observation_id":"1a847ccf-2b33-4779-9e45-ee0bdf0d356d","resolution":{"observed_at":"2026-08-12T16:59:11.427460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3369.34337","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.794563Z","title":"20 Leslie Lamport","venue":null,"work_id":"2276e5d5-ad18-4292-8ad1-ddd2c8b8c1b1","year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.440556Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:7e5e436ab7a16ea23f4ce0554800327b205cd4d71e50f160b0cf1fe55aab1aee","observation_id":"e635c6cc-1d95-4a01-9006-9edfa47d4b75","resolution":{"observed_at":"2026-08-12T16:59:11.801581Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:12.030065Z","title":"A modal fixpoint logic with chop","venue":null,"work_id":"46eebe2b-b2e7-491e-86ec-bd3da50496a7","year":1999},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.453864Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:988d4060cfda1eb4aaffa81c157155ee8fc05c35e6c243ec636b72877ec2aa51","observation_id":"8afa65f9-a638-495c-9a5c-8a84fe22ab0d","resolution":{"observed_at":"2026-08-12T16:59:12.034812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0304-3975(76)90022-0","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.516982Z","title":"29 Gordon D","venue":null,"work_id":"2b99c2c3-a7a5-4b2a-b294-b1a5f6dcdaa0","year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":1976,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.473272Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:1059c7fa7cf2c9d04c6b5179170e2fd9d575654fe5d7141c2970e2d9c788ad35","observation_id":"7e812c5e-7970-4ad7-9ef5-c9b1b3541144","resolution":{"observed_at":"2026-08-12T16:59:11.521552Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.444840Z","title":"21 Martin Lange and Rafał Somla","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.444840Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:1d08fe04432eb6e56792fd8c4e03e69b300d0a9a358602a23ea1ba8d201f26f1","observation_id":"5a26eeb6-f590-485e-80eb-46ae39aba60f","resolution":{"observed_at":"2026-08-12T16:59:11.444840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.436268Z","title":"19 Dexter Kozen","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.436268Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:3bf35f84e5f563eb5f02d7de09f0353b98777f361c81427e1b5206f2b4f37a79","observation_id":"e91cf461-31c2-4c64-9b9b-788b36f16a99","resolution":{"observed_at":"2026-08-12T16:59:11.436268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.458331Z","title":"doi:10.1007/3-540-49116-3\\_48","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.458331Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:4f9de885e69fc5172b699f3bec7d9360bfdda777e40c102453f91cd26626e815","observation_id":"e1740c15-e17b-4a81-bd4b-696b7bfc4d2f","resolution":{"observed_at":"2026-08-12T16:59:11.458331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"5694.32569","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.933897Z","title":"9 Mads Dam and Dilian Gurov.µ-calculus with explicit points and approximations.J","venue":null,"work_id":"d0fd2c46-bb29-4bb5-a893-e0391577cd5a","year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.422970Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:08d4d5fa00ae5b3f398fcb27b846c2517c41044811d6d114974fb59bc0c2efda","observation_id":"a6ac8625-0fa1-4a29-a00d-b686d08f6b0c","resolution":{"observed_at":"2026-08-12T16:59:11.941008Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.29007/vdfd","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.577398Z","title":"Trace-based deductive verification","venue":null,"work_id":"d57323ad-5fd1-405e-bd9f-a656f4d9c413","year":2023},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.418079Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:2356b91852209fa20b7e9e1c2b5b5cb7cab85c9388b6302b02171ce4676a6eb4","observation_id":"b35e085e-744b-4a78-98f2-ce6a63eb18ac","resolution":{"observed_at":"2026-08-12T16:59:11.582895Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.449057Z","title":"IPL.2006.04.019","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.449057Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:252555655818a12a79018bd2d5c6db4d3e952cc549c785d2a6311d3049ac9d42","observation_id":"08a11457-749c-4640-bd64-a9c8f596112e","resolution":{"observed_at":"2026-08-12T16:59:11.449057Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2168/lmcs-4(4:11)2008","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.601127Z","title":"2 Gilles Barthe, Renate Eilers, Pamina Georgiou, Bernhard Gleiss, Laura Kovács, and Matteo Maffei","venue":null,"work_id":"165ceeb1-a940-4fc0-be10-ac35aec8537d","year":2008},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.403743Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:f38866b101e1766f82f2fecab792ff82d46ed53f831244397504d6f00ffd34c4","observation_id":"7be65d82-6098-4b66-a118-de30dffa54c5","resolution":{"observed_at":"2026-08-12T16:59:11.605951Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.463092Z","title":"26 Hanne Riis Nielson and Flemming Nielson","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.463092Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:ed819c05874accc2ab3549d94e6fd8a2a9416b928e3830f0e0ff5f258f455941","observation_id":"ce7e9850-a880-4cf4-9e5d-a07e60aafd08","resolution":{"observed_at":"2026-08-12T16:59:11.463092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.477815Z","title":"31 Colin Stirling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.477815Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:d71c894194df37df5a855ad10f96ae29a23480866b1a7fd0bb684cb4f691d32a","observation_id":"7fa74b15-aa82-412d-981b-4cf1c754a0c8","resolution":{"observed_at":"2026-08-12T16:59:11.477815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.408936Z","title":"doi:10.23919/FMCAD.2019.8894277","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.408936Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:043ad256265411c21d4de8fb005933383e6504c680ac53e2cf269ad36884d28b","observation_id":"5b07f2f7-a1a6-4fe7-a12d-74ecf7a10080","resolution":{"observed_at":"2026-08-12T16:59:11.408936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.413324Z","title":null,"venue":null,"work_id":null,"year":1936},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.413324Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:679021d1c2aaefdea3e45691d80059e23b6cb98cd5d8d380b5cce659b8f6328f","observation_id":"e818a614-9ca6-4674-b8a1-f364403eab2a","resolution":{"observed_at":"2026-08-12T16:59:11.413324Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bfb0059696","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:59:11.556421Z","title":null,"venue":null,"work_id":"83a3e084-70fe-46c8-be7a-47138e882d7b","year":1971},"citing_paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-12T16:59:11.431831Z"},"links":{"citing_paper":"/paper/2411.13125"},"observation_digest":"sha256:af92837bd07f44e963e87af29dbc3937de86a10798d605633a23019e4193ecc2","observation_id":"1ac9069c-0338-4712-9867-9bc2f1654595","resolution":{"observed_at":"2026-08-12T16:59:11.559950Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13125","last_updated":"2024-11-20T08:35:29Z","latest_version":1,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-12T16:46:03.851124Z","submitted_at":"2024-11-20T08:35:29Z","title":"An Expressive Trace Logic for Recursive Programs"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":2,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":8,"verified_exact":3,"verified_fuzzy":1},"total_outbound_references":16},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 1 inbound Pith citation observation for arXiv:2411.13125."}