{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ESGM7J6JYVB3FV7AR6LUCLUMAK","short_pith_number":"pith:ESGM7J6J","schema_version":"1.0","canonical_sha256":"248ccfa7c9c543b2d7e08f97412e8c02b41570b3160ffe55825f6cfec513248b","source":{"kind":"arxiv","id":"2605.19499","version":1},"attestation_state":"computed","paper":{"title":"Accelerating Loops with Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Florian Frohn, J\\\"urgen Giesl","submitted_at":"2026-05-19T07:51:40Z","abstract_excerpt":"We propose a novel acceleration technique for loops operating on arrays. The goal of acceleration is to characterize the transitive closure of loops in a logic which is suitable for automated reasoning. Using the new notion of inductive lvalues, our technique can handle loops where previous techniques fail, and it unifies acceleration for arrays and scalar variables by regarding scalars as arrays of dimension 0. Moreover, our approach uses {\\lambda}s instead of quantifiers. Then the resulting SMT problems can be solved via lemmas on demand. An empirical evaluation of our implementation in the "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.19499","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-19T07:51:40Z","cross_cats_sorted":[],"title_canon_sha256":"9018ac668258f3c6ef4c85a72b7abbbda2bdc14e561c98fb9e0dcf1152baebf0","abstract_canon_sha256":"b56eb8e6e85cf1d5595f6059003b9ac1ed75a39a81e7945bb019598e772b9e66"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:48.777732Z","signature_b64":"a4IfiRDyGDUQPPufuRxoJNV1dQHk9ZggzfZ73GyLrf6YnMvTtRuGa95rp4SbH/JWYXs8MgsMAwWcW8eAbIv+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"248ccfa7c9c543b2d7e08f97412e8c02b41570b3160ffe55825f6cfec513248b","last_reissued_at":"2026-05-20T01:05:48.776966Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:48.776966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Loops with Arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Florian Frohn, J\\\"urgen Giesl","submitted_at":"2026-05-19T07:51:40Z","abstract_excerpt":"We propose a novel acceleration technique for loops operating on arrays. The goal of acceleration is to characterize the transitive closure of loops in a logic which is suitable for automated reasoning. Using the new notion of inductive lvalues, our technique can handle loops where previous techniques fail, and it unifies acceleration for arrays and scalar variables by regarding scalars as arrays of dimension 0. Moreover, our approach uses {\\lambda}s instead of quantifiers. Then the resulting SMT problems can be solved via lemmas on demand. An empirical evaluation of our implementation in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.19499","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.19499/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.19499","created_at":"2026-05-20T01:05:48.777098+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.19499v1","created_at":"2026-05-20T01:05:48.777098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.19499","created_at":"2026-05-20T01:05:48.777098+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESGM7J6JYVB3","created_at":"2026-05-20T01:05:48.777098+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESGM7J6JYVB3FV7A","created_at":"2026-05-20T01:05:48.777098+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESGM7J6J","created_at":"2026-05-20T01:05:48.777098+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK","json":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK.json","graph_json":"https://pith.science/api/pith-number/ESGM7J6JYVB3FV7AR6LUCLUMAK/graph.json","events_json":"https://pith.science/api/pith-number/ESGM7J6JYVB3FV7AR6LUCLUMAK/events.json","paper":"https://pith.science/paper/ESGM7J6J"},"agent_actions":{"view_html":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK","download_json":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK.json","view_paper":"https://pith.science/paper/ESGM7J6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.19499&json=true","fetch_graph":"https://pith.science/api/pith-number/ESGM7J6JYVB3FV7AR6LUCLUMAK/graph.json","fetch_events":"https://pith.science/api/pith-number/ESGM7J6JYVB3FV7AR6LUCLUMAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK/action/storage_attestation","attest_author":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK/action/author_attestation","sign_citation":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK/action/citation_signature","submit_replication":"https://pith.science/pith/ESGM7J6JYVB3FV7AR6LUCLUMAK/action/replication_record"}},"created_at":"2026-05-20T01:05:48.777098+00:00","updated_at":"2026-05-20T01:05:48.777098+00:00"}