{"as_of":"2026-08-08T04:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:77784d0164a4d1fe1944ff57d328cf6fe3d0be39d2ef6e454bce0ef9ace7f6d9","coverage":[{"denominator":27,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":27,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:26:42.087326Z","state":"measured"},{"denominator":27,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":27,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.08238/citation-record","integrity":"/paper/2506.08238/integrity","json":"/paper/2506.08238/citation-record.json","paper":"/paper/2506.08238"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:26:42.542008Z","title":"Optimal stateless model checking under the release-acquire semantics","venue":null,"work_id":"d0af8193-145a-49ab-aee4-071bb6164887","year":2018},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.955558Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:e14a7319844c169259a3027c6f1fb408d14770f515782f485c7d606c10b29133","observation_id":"58b46732-aae5-48f9-8be0-40c88a72efd9","resolution":{"observed_at":"2026-08-07T05:26:42.547041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.526597Z","title":"General decidability theorems for infinite-state systems","venue":null,"work_id":"b177f1b2-9c43-4be8-8e1c-a5af23b45e3a","year":1996},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.961019Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:a044cbbcacc23456c9505459ed2f8543eab42b00ce73d0a1cda7e3ea11a8a977","observation_id":"12f5f101-f6a3-40cc-b79e-995427b4a12e","resolution":{"observed_at":"2026-08-07T05:26:42.531540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.511394Z","title":"Burns, Prince Kohli, and Phillip W","venue":null,"work_id":"6c107c0b-3bf7-4ae7-be58-996434d005e8","year":1995},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.966343Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:c939eba4bf7a687ada607ba0d1c5a7587d6d1535f03e444cc93501dbade0468e","observation_id":"905d3952-4681-41fd-9e8a-e27597e42d8e","resolution":{"observed_at":"2026-08-07T05:26:42.516367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.495134Z","title":"Herding cats: Modelling, simulation, testing, and data mining for weak memory","venue":null,"work_id":"0efc96cc-ee63-4886-9102-fc6da388e4ae","year":2014},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.971601Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:59de288a9c95befdd336021bd4ed81d31ac28c21f98b49ac1efbcaa547634cc6","observation_id":"9b9c032f-9c11-4470-92fd-e6e0a5645dac","resolution":{"observed_at":"2026-08-07T05:26:42.500347Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.479547Z","title":"McMillan, and Doron A","venue":null,"work_id":"b9504380-bb01-4f9c-92de-9266b8245390","year":2000},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.976517Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:34127e361a33be4d5490ace3a6976edf7f04d38fdcdc5666a8e0c5f4439f06b0","observation_id":"d1fec5cc-bfb0-456c-8084-41622ad7fe5b","resolution":{"observed_at":"2026-08-07T05:26:42.484308Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.463558Z","title":"Ccchecker","venue":null,"work_id":"e1ace4c8-a044-482d-82da-e5e16fe8475f","year":null},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.981436Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:585ee302af004020ee30e74d8c24c4c87b97d7c8cb8c0b2da814e9b7b0968737","observation_id":"68e84219-3adb-4bd9-96e6-89588683196f","resolution":{"observed_at":"2026-08-07T05:26:42.468779Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.448129Z","title":"Clarifying and compiling C/C++ concurrency: from C++11 to POWER","venue":null,"work_id":"447422ff-1180-4be1-ac4d-d050bd332529","year":2012},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.986506Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:cb66695087747eb3a81f1f6a17bc42665a3271fd1461cdd6693f75efb0f0a622","observation_id":"b8f4868d-97df-427a-8216-7d4577b1fd9c","resolution":{"observed_at":"2026-08-07T05:26:42.453169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.433083Z","title":"Mathematizing C++ concurrency","venue":null,"work_id":"63421aa7-f823-4282-8791-5f0abb628ed6","year":2011},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.991760Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:89cf17ca66fc80868d680c3432b6d8d409e0122f2bac3c44019a2c83ab5df8fb","observation_id":"dc8de62d-db4d-4e98-b24d-ed18303cb83c","resolution":{"observed_at":"2026-08-07T05:26:42.437825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.416993Z","title":"On verifying causal consistency","venue":null,"work_id":"9706fb97-056a-459a-af7e-b58ec3955c2f","year":2017},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:41.996409Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:a3b943f2a110e87c79b88522c372055ee03a185e5cd00c1697acef0b4580411a","observation_id":"dfa02c44-a4d5-47c5-8ad7-49c14b37f2e6","resolution":{"observed_at":"2026-08-07T05:26:42.422526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.401787Z","title":"Principles of eventual consistency","venue":null,"work_id":"1854e927-919f-471b-991c-9f0bda5b5fff","year":2014},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.001179Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:6b083a5c321343a91550dd8e3a922de78dc0f428e71518294a6e2c7d768a1960","observation_id":"1b4d8a42-08b3-4a0b-9ac0-589b78083a60","resolution":{"observed_at":"2026-08-07T05:26:42.406637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.386258Z","title":"Constraint-based verification of parameterized cache coherence protocols","venue":null,"work_id":"bd8f074f-6709-4856-99a2-2a738344b0e4","year":2003},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.006079Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:546f352fb268d66a0a3f548f19912ccc1e1f564c11e7b6f13bc628e2fa3416a6","observation_id":"13278ac1-2808-4a7c-8997-059a7073a8f6","resolution":{"observed_at":"2026-08-07T05:26:42.391283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.370834Z","title":"Scalable tree-based register automata learning","venue":null,"work_id":"9315420e-57cb-4acc-971e-d842cfe97225","year":2024},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.010808Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:fc2300e87324fac3bf8f2162b7fe82b2bcd91b9110f1b5c33ede667e988a5676","observation_id":"08ce7289-b3b7-4b8a-a43a-39f7ece3cbca","resolution":{"observed_at":"2026-08-07T05:26:42.375738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.355268Z","title":"Well-structured transition systems everywhere! Theor","venue":null,"work_id":"d22ff9b4-2f13-4b00-859c-fe9a4a26dd8b","year":2001},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.015894Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:dc46021ef81fcf5b83db9030fc87e76d69d7d7be18a12f926460d6aeba58bfdf","observation_id":"bd981e39-3179-4d23-9352-e673847ad97d","resolution":{"observed_at":"2026-08-07T05:26:42.360341Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.339342Z","title":"Automata-based automated detection of state machine bugs in protocol implementations","venue":null,"work_id":"cf990607-0d4f-4112-b83f-d148ef6c6412","year":2023},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.020572Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:cbb7122286b8bba8b1af580a44015a166ae7da8e6e7e469dd1e8320f08a1863d","observation_id":"3fa5293c-60c7-452e-8aa0-3d325757a24e","resolution":{"observed_at":"2026-08-07T05:26:42.344846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.324575Z","title":"Gibbons and Ephraim Korach","venue":null,"work_id":"b48eec6e-3b33-488a-86d0-eb40c2b68cc4","year":1997},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.025243Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:9e8c9ca29bb3e3fa617f6096e63767d82b0c41a3e657ceb948c3ca13e22e3dc3","observation_id":"8645d81d-fddd-4363-a3ac-3b9db11c951e","resolution":{"observed_at":"2026-08-07T05:26:42.329214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.307577Z","title":"Effective stateless model checking for C/C++ concurrency","venue":null,"work_id":"b2fecc0a-21d9-4d53-b31b-3d9fc9078e96","year":2018},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.030153Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:8644295e01ea8a8798dfd28986e007b691086e75578fc5968664cb9da4cf0a6a","observation_id":"f23b5983-5c7c-47ed-a236-5399995b0148","resolution":{"observed_at":"2026-08-07T05:26:42.313496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.291271Z","title":"Kater: Automating weak memory model metatheory and consistency checking","venue":null,"work_id":"7a714bf0-9b43-43cd-b99e-38713eea87c1","year":2023},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.035248Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:5a35cb1b22f255404d12f38131e834431fa6cf11256e5da8a2c96a71cebc6612","observation_id":"96a170d0-8685-4194-8ff4-23332b0b8a6c","resolution":{"observed_at":"2026-08-07T05:26:42.296420Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.275163Z","title":"What's decidable about causally consistent shared memory? ACM Trans","venue":null,"work_id":"1a893cb6-33e9-49b5-aff9-e2b0a5c63c86","year":2022},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.039917Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:4ede681aa81c80c0db141e98a658c2f034a26e438af3b85f41197e4539cd78c4","observation_id":"2230b0fa-73e5-49fa-8ed0-b45fe487ce6d","resolution":{"observed_at":"2026-08-07T05:26:42.280261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.259414Z","title":"Taming release-acquire consistency","venue":null,"work_id":"c26d0042-e128-4cb1-b306-f07927932a9e","year":2016},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.044667Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:df52b8be2fcc228580e7cdccc30b3b4f0a4c1e8953f62f7217ba8905bf9459c4","observation_id":"f174a503-193c-4c9d-9d8f-f17e848cca49","resolution":{"observed_at":"2026-08-07T05:26:42.264360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.243463Z","title":"C11tester: a race detector for C/C++ atomics","venue":null,"work_id":"b2d4c61e-180c-4467-a15c-c9a1ec16d562","year":2021},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.049339Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:e0aac2edc0edb1da12cf8d52db91d38dbc6156bb528151ecdd0791301ee46ccd","observation_id":"23048938-0410-4835-847e-2536892b57b8","resolution":{"observed_at":"2026-08-07T05:26:42.248328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.227749Z","title":"Causal consistency: beyond memory","venue":null,"work_id":"5674bb6b-0bc4-44ac-adef-71c5b720280c","year":2016},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.058197Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:0c621cb4354fa8e14823f50f52338ffac978634017ca11e1a509517bf003e425","observation_id":"478187cc-ef00-456a-a8c2-5d9a24028fee","resolution":{"observed_at":"2026-08-07T05:26:42.232819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.209987Z","title":"On parallel snapshot isolation and release/acquire consistency","venue":null,"work_id":"bac99e38-cc84-4eac-bfae-a1be253b9991","year":2018},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.063347Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:9d9640dd005c7f5afb0917312540102576406770e6a84a8b0257e9ccf039807f","observation_id":"88fab388-d99a-4170-9f0f-8843a2c029b2","resolution":{"observed_at":"2026-08-07T05:26:42.216040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.189941Z","title":"Synchronising C/C++ and POWER","venue":null,"work_id":"bbda7169-772b-4305-b24b-52e0165408ef","year":2012},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.067965Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:64fc46c7839a691886dfc124f96faff0719134b7a728de204372d26eaa3c4e63","observation_id":"d43d686e-2156-4ed3-9b84-a8fc1089f83d","resolution":{"observed_at":"2026-08-07T05:26:42.195897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.172974Z","title":"Efficient and correct execution of parallel programs that share memory","venue":null,"work_id":"858c183d-7505-4f04-9c2a-7d7fcd69af1e","year":1988},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.073260Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:cca09da8351e2c3711652759c238d28639817a123df1c572502e603a545994a3","observation_id":"ff530481-0c4b-4224-8a05-c999ad0fbb27","resolution":{"observed_at":"2026-08-07T05:26:42.178307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.155102Z","title":"Aguilera, and Jinyang Li","venue":null,"work_id":"3e2f4560-8382-449c-afef-b1173e4923d1","year":2011},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.077937Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:6cfc6d35a63c6e351ba15d87e98e6e21b79a5980a56e25250df5b22138e1b870","observation_id":"29597515-94cf-42b9-a0e8-c25f4775dc46","resolution":{"observed_at":"2026-08-07T05:26:42.160170Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.138097Z","title":"Optimal reads-from consistency checking for c11-style memory models","venue":null,"work_id":"544ce2fe-3f47-40fd-8e67-871e0c0d10c6","year":2023},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.082575Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:a84e6f33b8a12c53bd2a7e3b1f9809249cffcd34b1c78e4db6e6831c0b9080e6","observation_id":"a6b45398-20cc-4d3d-bfed-ac93997807b1","resolution":{"observed_at":"2026-08-07T05:26:42.143796Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:26:42.119360Z","title":"Expressing interesting properties of programs in propositional temporal logic","venue":null,"work_id":"fa2e698e-91e1-40f2-82f9-e5072c91e2b5","year":1986},"citing_paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines","version":3},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:26:42.087326Z"},"links":{"citing_paper":"/paper/2506.08238"},"observation_digest":"sha256:ce6143daa707d57ed0560e1d34cce343a21733dd6e77d0f7fdc921b7df8f5909","observation_id":"f81d43fc-547f-4a35-af74-443c72f44b94","resolution":{"observed_at":"2026-08-07T05:26:42.126610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.08238","last_updated":"2026-06-10T10:07:43Z","latest_version":3,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-07T05:14:34.137407Z","submitted_at":"2025-06-09T21:15:18Z","title":"The complexity of verifying the release-acquire semantics over register machines"},"reference_resolution":{"displayed":27,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":27},"total_outbound_references":27},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 27 of 27 outbound references and 0 inbound Pith citation observations for arXiv:2506.08238."}