{"as_of":"2026-08-18T17:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b4f616b4a1027c3fb5b4b1c57c81aff85c9ddd701d26b77cbc9bf73c6b502e04","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T15:40:54.979122Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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-07-14T12:52:50.844575Z","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":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.27051","snapshot_observed_at":"2026-07-14T12:52:50.844575Z","title":"Conver: Using contracts and loop invariant synthesis for scalable formal software verification,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.10291","last_updated":"2026-07-11T12:40:22Z","snapshot_observed_at":"2026-08-16T10:10:15.819403Z","submitted_at":"2026-07-11T12:40:22Z","title":"Partial Contracts Suffice: Sound, LLM-Inferred Regression Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-14T12:52:50.844575Z"},"links":{"cited_paper":"/paper/2605.27051","citing_paper":"/paper/2607.10291"},"observation_digest":"sha256:a84696252aaa18b56ea87f36d15cc6400c10a59cff3c779ec533ca307dbd7010","observation_id":"52244186-8ade-48af-a0e1-dc61eb758d8d","resolution":{"observed_at":"2026-07-14T12:52:50.844575Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2605.27051/citation-record","integrity":"/paper/2605.27051/integrity","json":"/paper/2605.27051/citation-record.json","paper":"/paper/2605.27051"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T15:40:54.979122Z","title":"Esbmc v7. 7: Efficient concurrent software verification with scheduling, incremental smt and partial order reduction: (competition contribution),","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:f4cdf9fde6299969c916ab0d6b96fe7c158f3c2366c2da97e7192e21cd60b82d","observation_id":"cf436c4f-1e5e-4bda-b783-564ce287cb23","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Code-level model checking in the software development workflow at amazon web services,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:9b22056eb9bd5e8347e6cc18a59d23a6f372bd4e01cf030d3043a9ea058ac3fc","observation_id":"95f449a2-a944-4499-bcbd-d512a919157f","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Model checking and the state explosion problem,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:071fc85bb9f70de583e45b7f6a882d2a096e04d7de1af78bcaa7b5b440d08f03","observation_id":"fcd1c557-f9e4-4417-bef4-084f1663ebb9","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Counterexample- guided abstraction refinement,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:6e7f1ad896276bd1d6fc7241287f221e0139b2e976c638d0944fe2dcde89cd5b","observation_id":"e667eec8-0a19-4776-8b8a-9e4a7fb61b0d","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Ice: A robust framework for learning invariants,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:7e10051de15618b5d1f151a4fe4efd391de7bcfe439e17aa21e9e5d1f4992551","observation_id":"9da535e8-91e8-4933-b905-46d13e44679d","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Symbolic model checking without bdds,","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:047834d366bae7851c94f3f169570c32a418b959b2c5082acc3f7b2592093760","observation_id":"4600422f-c08a-4232-9f35-cbeec1fcd292","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Bounded model checking","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:87b9453a7a8795249f9f2a9f8f79966f41d5553f47515ff3e27eccdca41fd710","observation_id":"3738da35-e43d-4d2e-b6f3-284970c43aaf","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1003.3830","last_updated":"2010-03-19T16:23:11Z","snapshot_observed_at":"2026-08-15T05:23:47.098971Z","submitted_at":"2010-03-19T16:23:11Z","title":"Bounded Model Checking of Multi-threaded Software using SMT solvers","version":1},"cited_work":{"arxiv_id":"1003.3830","doi":null,"metadata_source":"pith","pith_arxiv_id":"1003.3830","snapshot_observed_at":"2026-06-29T15:43:32.566044Z","title":"Bounded Model Checking of Multi-threaded Software using SMT solvers","venue":"cs.LO","work_id":"a13b2c55-429b-4a3d-a691-ba7b41286ca4","year":2010},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"cited_paper":"/paper/1003.3830","citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:50dd0b06895842b3cf2968f7b4d139f07a711bb1bc7210fd2ae78304abbee68f","observation_id":"4a2cbdf6-32b5-4f68-a710-a132c0e2471a","resolution":{"observed_at":"2026-06-29T15:43:32.567268Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06-29T15:40:54.979122Z","title":"Esbmc 5.0: an industrial-strength c model checker,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:f2cf2e2a5cea96475839286df6443e10ce624e2175e1b9d89c02e9d48115509e","observation_id":"6e8476b2-6470-4c61-bef1-324e52b9b204","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Esbmc v7. 4: Harnessing the power of intervals: (competition contribution),","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:93223fde705f80dac5f08258982b6c6244e651e311ae943c606e2137dd4bda66","observation_id":"3b703263-b2ab-45ca-a851-d23174838b0f","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Large language model (llm) for software security: Code analysis, malware analysis, reverse engineering,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:5ed827aa23368363cf6891e635d6585e6d9ea76e15ee99c820e74e3c92db693a","observation_id":"020a7582-edf7-4a3e-a018-5d5c6161286d","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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":"document/1017280","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T15:43:32.577200Z","title":"Automated Program Repair in the Era of Large Pre-trained Language Models,","venue":null,"work_id":"72c72ba7-d80c-482e-97f3-a8e3f57e2ea1","year":2023},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:732a90eb2412728ed4bc5291b308b0d431ad0af98c4de4937183e59ef46f67c2","observation_id":"92ad243f-7c32-4513-a210-b61e1053e5fb","resolution":{"observed_at":"2026-06-29T15:43:32.578867Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06450","last_updated":"2024-08-12T18:59:13Z","snapshot_observed_at":"2026-08-16T13:26:54.745068Z","submitted_at":"2024-08-12T18:59:13Z","title":"Evaluating Language Models for Efficient Code Generation","version":1},"cited_work":{"arxiv_id":"2408.06450","doi":"10.48550/arxiv.2408.06450","metadata_source":"pith","pith_arxiv_id":"2408.06450","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Evaluating language models for efficient code generation","venue":"cs.SE","work_id":"09560849-dba2-488c-9af2-3ca599c7f32f","year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"cited_paper":"/paper/2408.06450","citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:d1470110f705763eadf15a4dc3cf10cfb97b6b33c6fe7f6e8adf53724c920203","observation_id":"23a2c20a-b34b-45f7-a31a-019910a879bc","resolution":{"observed_at":"2026-06-29T15:43:32.575800Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:40.674264+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-18T06:34:34.496301+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-06-29T15:40:54.979122Z","title":"A new era in software security: Towards self-healing software via large language models and formal verification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:e8f6d85f0f4eb14187d1f7e68ee26d4a0bda8a069322f23ec3dd7e9bbd40681c","observation_id":"6f012377-6ca0-4d59-9358-5b68103e21e3","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"The use of large language models for program repair,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:58b71e25b294af0c6e9378cc307ad46e164f92420c1b288fa62c1896617db1d3","observation_id":"4bc745ca-0ce5-4220-9fbe-1a60111a12de","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.04441","last_updated":"2025-05-07T14:12:41Z","snapshot_observed_at":"2026-08-15T23:26:14.368003Z","submitted_at":"2025-05-07T14:12:41Z","title":"Towards Effectively Leveraging Execution Traces for Program Repair with Code LLMs","version":1},"cited_work":{"arxiv_id":"2505.04441","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.04441","snapshot_observed_at":"2026-06-29T15:43:32.568553Z","title":"Towards Effectively Leveraging Execution Traces for Program Repair with Code LLMs,","venue":null,"work_id":"7436a6ce-0be7-47bf-ab78-e2a54c985146","year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"cited_paper":"/paper/2505.04441","citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:79a7c46d479650ca89c63a0ff61bb511aa6a970b5eb592848b93531c25a174d0","observation_id":"1c4b2c46-8773-4ccf-ba21-ae2b909e99f9","resolution":{"observed_at":"2026-06-29T15:43:32.570128Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06-29T15:40:54.979122Z","title":"Polyver: A compositional approach for polyglot system modeling and verification,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:8d5d56dc40d6776720d401c85716bab2fe2340123bb7d8e4ce841abea061fb9c","observation_id":"4123a2a4-e25a-4ffb-8330-0bacc87f2b94","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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":"2512.24594","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T15:43:32.571238Z","title":"arXiv preprint arXiv:2512.24594 (2025)","venue":null,"work_id":"7f41c36c-fe4f-4990-a27b-9f5c464cbe34","year":2025},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:98064952a747bc6f22e866cf0e34150705df2c3a7d19c16c5d53317c5f12ca11","observation_id":"fdb2591a-88cb-4ed0-a13a-644fe0ecbd92","resolution":{"observed_at":"2026-06-29T15:43:32.573017Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06-29T15:40:54.979122Z","title":"Uclid5: integrating modeling, veri- fication, synthesis and learning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:99d88c9c6431107c15893f56bc84b553ad548f647147a7fed9e03600e1365d8e","observation_id":"766cf004-e706-4702-bf6f-ff8eff18a560","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Array-carrying symbolic execution for function contract generation,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:13a2dbb46e3df2745dfa98355f5cce43c666f20e0b341f9095dc38e018219f71","observation_id":"12b269cf-c148-4340-bd93-bf4887adfa65","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Yesterday, my program worked. today, it does not. why?","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:57ba25df794b1f39b975865893ffe9b0738981c8f8fe594df59d833d76b57ffa","observation_id":"002ca174-61ae-4627-be49-0dbd266a3579","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Simplifying and isolating failure-inducing input,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:9623aeeb48864123e0630e9de3b3ac0c71b4a0c9c64e6a5eef4611f93e2a6875","observation_id":"ae71d537-1cc7-4a8f-999f-5f1d4ffbb0f9","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"ESBMC 7.4: Harnessing the power of intervals,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:5de458994222ff1f37feaf100f88c7e3edabcd2354128ee472081ce9c067fdcc","observation_id":"2c9c63d5-f776-41cd-bda6-b19771fa85d8","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Llm-generated invariants for bounded model checking without loop unrolling,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:d278b4762eb9909ea6dada7f9fbeaff8659152b427216dfd3ee6e22cdc3a3363","observation_id":"295c9b9a-858e-47c5-97ca-a01be372e7ad","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Assume-guarantee abstraction refinement for probabilistic systems,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:09123806145d5ba051ed6a8cfb4c1c4f29ce99bca5946777071f55f88658c420","observation_id":"73bd395e-26a6-405f-a47f-43ef4f852a46","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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":"5581.137559","doi":"10.1145/1375581.1375599","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Sketching concurrent data structures,","venue":null,"work_id":"af0ba116-5ed8-4961-a3ea-b4119c223d3e","year":2008},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:d433ef3fb782ec921a29253b93fc7bb8fb36098911c743f9cfaebb8bcbbeaeed","observation_id":"b0cb7208-8b97-4b6a-bade-0eb70b677f31","resolution":{"observed_at":"2026-06-29T15:43:31.967732Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-06-29T15:40:54.979122Z","title":"A complexity measure,","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:43a89446f798df7cded692347ace10d817a0cd8f901ff0f3fd1463ba6b7b0b1e","observation_id":"fb53cb04-359d-468e-acc8-290f02e2f8e8","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Towards building verifiable cps using lingua franca,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:a9319081cc2f4d9bb56eb0df45571e2dbff7d8ee19ce256e389547ffb141ee34","observation_id":"b98df56f-b529-457e-829e-8cd0b16bbc28","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"Introducing Claude 3.5 Sonnet,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:17aa7d8610b91f328690e68021697914d70cf2a22fe47a2fa4fad6af1a150a9c","observation_id":"5a3399f3-82f7-4ef0-ae74-722a21416ce9","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","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-06-29T15:40:54.979122Z","title":"State of the art in software verification and witness validation: Sv-comp 2024,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-29T15:40:54.979122Z"},"links":{"citing_paper":"/paper/2605.27051"},"observation_digest":"sha256:6d0835ea39d71f7e1c1bdc449e7d4df621ae0a2f9589de79c3aa3e6888e84983","observation_id":"a998e2e6-8d00-4121-82dc-8c04904a466d","resolution":{"observed_at":"2026-06-29T15:40:54.979122Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27051","last_updated":"2026-05-26T14:04:40Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-14T06:30:19.816037Z","submitted_at":"2026-05-26T14:04:40Z","title":"ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":24,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":30},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2605.27051."}