{"as_of":"2026-08-13T13:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dfdb4f9885822f434831856f25d5b976ed710eb292f2cccc15e52fe3d19b51a7","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T01:08:26.717718Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2602.10746/citation-record","integrity":"/paper/2602.10746/integrity","json":"/paper/2602.10746/citation-record.json","paper":"/paper/2602.10746"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T01:08:24.610745Z","title":"In: International Con- ference on Automated Deduction","venue":null,"work_id":null,"year":2013},"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":1,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:24.610745Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:a8196d523ff70715c4484ede57d038dcef60ce2ba2987bf10e243a9b823b8961","observation_id":"a4545e81-b80c-4a10-99cf-5b277e430b00","resolution":{"observed_at":"2026-08-03T01:08:24.610745Z","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-03T01:08:24.684086Z","title":"arXiv preprint arXiv:2504.14283 (2025)","venue":null,"work_id":null,"year":2025},"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":2,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:24.684086Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:d8c9ec6ab3b5370bc16f7610a29a5ed354a94854eb5f990f1109f4321f891199","observation_id":"2ff106cc-9239-4383-937a-e1d9aefa7080","resolution":{"observed_at":"2026-08-03T01:08:24.684086Z","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-03T01:08:24.750092Z","title":"In: International Conference on Automated Reasoning with Analytic Tableaux and Related Methods","venue":null,"work_id":null,"year":2015},"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":3,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:24.750092Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:60ad53fef13f953e291285d4b5becb7c6812438880dfe0353a9d31be9ea6de5e","observation_id":"a3ba6849-fe50-4054-a7ae-e52d695bfcae","resolution":{"observed_at":"2026-08-03T01:08:24.750092Z","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-03T01:08:24.818202Z","title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","venue":null,"work_id":null,"year":2019},"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":4,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:24.818202Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:2259bd7585581712e9287c46b60a21261058a7399afce66de07195650049c315","observation_id":"b2da4268-b82a-4497-896d-9dcf78734e3a","resolution":{"observed_at":"2026-08-03T01:08:24.818202Z","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-03T01:08:24.937495Z","title":null,"venue":null,"work_id":null,"year":2018},"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":5,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:24.937495Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:4f7a3c60351959e144c7af522240e59fcaa83ab76c9081a0cf27e752ba80c686","observation_id":"8320714f-e646-499a-92a7-da52346f7fe8","resolution":{"observed_at":"2026-08-03T01:08:24.937495Z","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-03T01:08:25.022692Z","title":"BIT Numerical Mathematics8(3), 174–186 (1968)","venue":null,"work_id":null,"year":1968},"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":6,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.022692Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:e5802fe7ff85a26fecdf4c430211cfcf7a5dfcc409da50d5b7aa28010813b34f","observation_id":"ce90a1d8-2ace-4324-8f33-4438ea50612b","resolution":{"observed_at":"2026-08-03T01:08:25.022692Z","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-03T01:08:25.117189Z","title":"Descriptive Complexity and Finite Models31, 185–214 (1996)","venue":null,"work_id":null,"year":1996},"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":7,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.117189Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:111af75bac779f1dd865f4c6ebf7a79329db3f9f0e8e6203f6ef638b9c220fec","observation_id":"29bff62c-33ff-4251-98d6-cfeedfff55a6","resolution":{"observed_at":"2026-08-03T01:08:25.117189Z","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-03T01:08:25.254096Z","title":"In: Proc","venue":null,"work_id":null,"year":2022},"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":8,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.254096Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:6160da9a697e76e02d15642f935d516f59d70f152a0ad848c944c188ab299242","observation_id":"ea950825-8e7f-4b9a-9b30-9a9c6646208a","resolution":{"observed_at":"2026-08-03T01:08:25.254096Z","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-03T01:08:25.312089Z","title":"In: Proc","venue":null,"work_id":null,"year":2022},"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":9,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.312089Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:d5a31846ae611d3c175c6288fb37fd2282f6a15b001a9cb078a64e718c8ce619","observation_id":"ecfbd3c5-3d69-43d3-b41f-7da24b6cca61","resolution":{"observed_at":"2026-08-03T01:08:25.312089Z","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-03T01:08:25.483146Z","title":"Mathematical Aspects of Computer Science19(19-32), 1 (1967)","venue":null,"work_id":null,"year":1967},"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":10,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.483146Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:db6f7c3b9f3d41db953761b082a679ffa144c4a66ec07747fbcf38be6c8aeb69","observation_id":"6f733c7f-7ab1-4820-9fb9-f1d668ed7a79","resolution":{"observed_at":"2026-08-03T01:08:25.483146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/dagrep.12.11.1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Dagstuhl Reports12(11), 1–27 (2023)","venue":"University of Twente Research Information","work_id":"853a6ba5-deb9-420d-8344-05f123bed532","year":2023},"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":12,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.691041Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:60bb20e69a7c8c6bc77e8dee749fa52004739d1bdb17a4477635b93992d361c6","observation_id":"57a6b702-a133-45ea-bbe7-35427368c41a","resolution":{"observed_at":"2026-08-03T01:13:28.898761Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-03T01:08:25.824996Z","title":"In: Active Object Languages: Current Research Trends, pp","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":13,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.824996Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:92e4899f35e0fbda1a7a8904d8ece1eb2aed93ea838cb5b56f3a20508dc51d5f","observation_id":"8a7be310-09d5-46a3-ae01-6a9f22832b12","resolution":{"observed_at":"2026-08-03T01:08:25.824996Z","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-03T01:08:25.971646Z","title":"Communications of the ACM12(10), 576–580 (1969)","venue":null,"work_id":null,"year":1969},"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":14,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:25.971646Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:fb5427c123e69ca3d195dbcc65b4bf1fe9f3dfba59b8a90c0d18daecb31ee18d","observation_id":"15a170ad-e215-4e6b-8827-06356e75b4cb","resolution":{"observed_at":"2026-08-03T01:08:25.971646Z","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-03T01:08:26.033065Z","title":"ACM Transactions on Programming Languages and Systems (TOPLAS)16(3), 872–923 (1994)","venue":null,"work_id":null,"year":1994},"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":15,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.033065Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:e8c71e36c3b19410c9ae9a598d93a9258a642e5ff42d9c8653474eed082900b5","observation_id":"0a5ae429-20a0-485c-99a6-3dda97c37b85","resolution":{"observed_at":"2026-08-03T01:08:26.033065Z","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-03T01:08:26.183217Z","title":"Formal Aspects of Computing4(2), 195–236 (1992)","venue":null,"work_id":null,"year":1992},"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":16,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.183217Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:feb7081d128692da7f05a112b9939c6f0ff7bbbaf90a6e78264705016cf6c878","observation_id":"288b8520-7bcb-4e32-9bcc-239ec20e5724","resolution":{"observed_at":"2026-08-03T01:08:26.183217Z","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-03T01:08:26.283363Z","title":"Logical Methods in Computer Science11(2015)","venue":null,"work_id":null,"year":2015},"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":17,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.283363Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:04b824ead2d3c798419469e56294a3848802e06be914ea5375b0290135fb6965","observation_id":"3f0da206-5633-4e24-bf63-8ffec1190652","resolution":{"observed_at":"2026-08-03T01:08:26.283363Z","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-03T01:08:26.368143Z","title":"Applied Sciences10(11), 3928 (2020)","venue":null,"work_id":null,"year":2020},"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":18,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.368143Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:165eefbefdcea5bdb35effb2e58134814f64ee1e4a14c8cb661f65ee606c827f","observation_id":"a23161eb-73e3-42dc-b4f3-aec57a80ba3e","resolution":{"observed_at":"2026-08-03T01:08:26.368143Z","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-03T01:08:26.428633Z","title":"In: European Symposium on Program- ming","venue":null,"work_id":null,"year":2025},"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":19,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.428633Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:005aabd6be3a756a900bd4a8c1669282e16e75d5aed537d4e60eee069b6d3eb2","observation_id":"d86ccdac-9b7e-4e8c-ad12-59e41768c496","resolution":{"observed_at":"2026-08-03T01:08:26.428633Z","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-03T01:08:26.513197Z","title":"In: International Conference on Algebraic Methodology and Software Tech- nology","venue":null,"work_id":null,"year":2010},"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":20,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.513197Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:a2c548dcb5a19106cc28be29b80175966937c2a6639987cfc3764625baab45b1","observation_id":"ee390e2c-2016-41ff-b0e5-a8df781e57d1","resolution":{"observed_at":"2026-08-03T01:08:26.513197Z","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-03T01:08:26.582211Z","title":"Annals of Mathematics and Artificial Intelligence (AMAI)71, 1–44 (2014)","venue":null,"work_id":null,"year":2014},"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":21,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.582211Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:b4a50f4f478b18f18a207beac89f36aef67c7148a8296f3512e67482a609730c","observation_id":"906ce034-dc16-4a1e-add8-b3d2e7a2c4e4","resolution":{"observed_at":"2026-08-03T01:08:26.582211Z","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-03T01:08:26.638350Z","title":"In: The Logic of Software","venue":null,"work_id":null,"year":2022},"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":22,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.638350Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:1a209e5da20f879f83fd51cb52e51b701c64d80956e58fed28eb77cd210f1875","observation_id":"2a48e0ee-ee42-457f-9e8a-ec2b6ec19353","resolution":{"observed_at":"2026-08-03T01:08:26.638350Z","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-03T01:08:26.717718Z","title":"Software & Systems Modeling14(1), 83–100 (2015) 14","venue":null,"work_id":null,"year":2015},"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":23,"source":"pdf_text","source_observed_at":"2026-08-03T01:08:26.717718Z"},"links":{"citing_paper":"/paper/2602.10746"},"observation_digest":"sha256:7a3771b83b5e0dd84692805351b6c0459e14e4e2fdb880129e4b28c348f7f814","observation_id":"cb8c4694-db54-4008-8875-7971c6ad68d7","resolution":{"observed_at":"2026-08-03T01:08:26.717718Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.10746","last_updated":"2026-07-09T15:25:45Z","latest_version":2,"primary_category":"cs.LO","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"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":23},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2602.10746."}