{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XS55H5TK5HXKFJRPW2LZLAKHL7","short_pith_number":"pith:XS55H5TK","canonical_record":{"source":{"id":"2106.00937","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-06-02T04:51:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d60251dccdf4aacb8a18f27b31ec0be73b02203d048ff03c12fc2c4055487051","abstract_canon_sha256":"fccb864f82a866446e033d8e0e2ae6e97e24d6f16a8573fc9014971ac7120141"},"schema_version":"1.0"},"canonical_sha256":"bcbbd3f66ae9eea2a62fb6979581475ffb30caa946ddf2c15b7c2ba6db5c7e28","source":{"kind":"arxiv","id":"2106.00937","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00937","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00937v1","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00937","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"XS55H5TK5HXK","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"XS55H5TK5HXKFJRP","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"XS55H5TK","created_at":"2026-07-05T02:45:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XS55H5TK5HXKFJRPW2LZLAKHL7","target":"record","payload":{"canonical_record":{"source":{"id":"2106.00937","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-06-02T04:51:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d60251dccdf4aacb8a18f27b31ec0be73b02203d048ff03c12fc2c4055487051","abstract_canon_sha256":"fccb864f82a866446e033d8e0e2ae6e97e24d6f16a8573fc9014971ac7120141"},"schema_version":"1.0"},"canonical_sha256":"bcbbd3f66ae9eea2a62fb6979581475ffb30caa946ddf2c15b7c2ba6db5c7e28","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:45:41.793940Z","signature_b64":"5FEDUNNN/OkpXDa4hFQvZ1kDxnJI1YiH4dQPIxyEVJq6jC9YH/RQFt+vb6qocQrqB4/LsdsNGOiiLOwtXLE2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcbbd3f66ae9eea2a62fb6979581475ffb30caa946ddf2c15b7c2ba6db5c7e28","last_reissued_at":"2026-07-05T02:45:41.793518Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:45:41.793518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.00937","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"evPJl4cTPPth6K9L2/0AEwOTy0xhokiWSq3N5CUAJ/FXMszLuvOnZznc08qcrjfMwWKLMxag4Fa/ucoXMkHiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:35:20.592411Z"},"content_sha256":"2e4a80f43119a7407dac8ae9a9166973cc70a7a307afb81750b3149fae287fc3","schema_version":"1.0","event_id":"sha256:2e4a80f43119a7407dac8ae9a9166973cc70a7a307afb81750b3149fae287fc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XS55H5TK5HXKFJRPW2LZLAKHL7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.PL","authors_text":"Noam Rinetzky, Oren Ish Shalom, Shachar Itzhaky, Sharon Shoham","submitted_at":"2021-06-02T04:51:35Z","abstract_excerpt":"Automatic verification of array manipulating programs is a challenging problem because it often amounts to the inference of in ductive quantified loop invariants which, in some cases, may not even be firstorder expressible. In this paper, we suggest a novel verification tech nique that is based on induction on userdefined rank of program states as an alternative to loopinvariants. Our technique, dubbed inductive rank reduction, works in two steps. Firstly, we simplify the verification problem and prove that the program is correct when the input state con tains an input array of length B or les"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00937","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/2106.00937/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:45:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53ZVzQjiQrOhGN+zwXG2bMsWYaFKEUApJutoB6lZWmWs7BlSmg5XI1w20v57hhXs5nLAiwVahbHQ1lw3wki9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T12:35:20.592942Z"},"content_sha256":"41dc625633a7e39ea92f31ca0af4b9096884427f377288d0717b79e36b17694e","schema_version":"1.0","event_id":"sha256:41dc625633a7e39ea92f31ca0af4b9096884427f377288d0717b79e36b17694e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/bundle.json","state_url":"https://pith.science/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-18T12:35:20Z","links":{"resolver":"https://pith.science/pith/XS55H5TK5HXKFJRPW2LZLAKHL7","bundle":"https://pith.science/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/bundle.json","state":"https://pith.science/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS55H5TK5HXKFJRPW2LZLAKHL7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XS55H5TK5HXKFJRPW2LZLAKHL7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fccb864f82a866446e033d8e0e2ae6e97e24d6f16a8573fc9014971ac7120141","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-06-02T04:51:35Z","title_canon_sha256":"d60251dccdf4aacb8a18f27b31ec0be73b02203d048ff03c12fc2c4055487051"},"schema_version":"1.0","source":{"id":"2106.00937","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.00937","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"arxiv_version","alias_value":"2106.00937v1","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.00937","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_12","alias_value":"XS55H5TK5HXK","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_16","alias_value":"XS55H5TK5HXKFJRP","created_at":"2026-07-05T02:45:41Z"},{"alias_kind":"pith_short_8","alias_value":"XS55H5TK","created_at":"2026-07-05T02:45:41Z"}],"graph_snapshots":[{"event_id":"sha256:41dc625633a7e39ea92f31ca0af4b9096884427f377288d0717b79e36b17694e","target":"graph","created_at":"2026-07-05T02:45:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2106.00937/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Automatic verification of array manipulating programs is a challenging problem because it often amounts to the inference of in ductive quantified loop invariants which, in some cases, may not even be firstorder expressible. In this paper, we suggest a novel verification tech nique that is based on induction on userdefined rank of program states as an alternative to loopinvariants. Our technique, dubbed inductive rank reduction, works in two steps. Firstly, we simplify the verification problem and prove that the program is correct when the input state con tains an input array of length B or les","authors_text":"Noam Rinetzky, Oren Ish Shalom, Shachar Itzhaky, Sharon Shoham","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-06-02T04:51:35Z","title":"Putting the Squeeze on Array Programs: Loop Verification via Inductive Rank Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.00937","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e4a80f43119a7407dac8ae9a9166973cc70a7a307afb81750b3149fae287fc3","target":"record","created_at":"2026-07-05T02:45:41Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fccb864f82a866446e033d8e0e2ae6e97e24d6f16a8573fc9014971ac7120141","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2021-06-02T04:51:35Z","title_canon_sha256":"d60251dccdf4aacb8a18f27b31ec0be73b02203d048ff03c12fc2c4055487051"},"schema_version":"1.0","source":{"id":"2106.00937","kind":"arxiv","version":1}},"canonical_sha256":"bcbbd3f66ae9eea2a62fb6979581475ffb30caa946ddf2c15b7c2ba6db5c7e28","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcbbd3f66ae9eea2a62fb6979581475ffb30caa946ddf2c15b7c2ba6db5c7e28","first_computed_at":"2026-07-05T02:45:41.793518Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:45:41.793518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5FEDUNNN/OkpXDa4hFQvZ1kDxnJI1YiH4dQPIxyEVJq6jC9YH/RQFt+vb6qocQrqB4/LsdsNGOiiLOwtXLE2BA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:45:41.793940Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.00937","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e4a80f43119a7407dac8ae9a9166973cc70a7a307afb81750b3149fae287fc3","sha256:41dc625633a7e39ea92f31ca0af4b9096884427f377288d0717b79e36b17694e"],"state_sha256":"b43c2ab785491f5e0fbcb9b387de246164543b08e6e2f1245c49a7b78da6a1b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IoTkVU/QnGwHFYDrLCacR7RhPPDztLIk/bmAQS2p2KMIcu6Wtqyv7/zualbDicSRFxoTwcAzS60lcHKlWer+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T12:35:20.597621Z","bundle_sha256":"908c97480ec076f3e50f4ad655ff995c1829fe19a803b04d465608d7553923b1"}}