{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TYQMUUDF5XPY5GQLIVQXWCQV27","short_pith_number":"pith:TYQMUUDF","canonical_record":{"source":{"id":"1704.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"ae8ceec7edee8a092f548ba7d8a71876a9849cfc9cd90a2bb044390e4f99d841","abstract_canon_sha256":"d6ba6e64174ac6a3982c377d818e5040f6b9ad2c0553c72654cbc7a55d921e43"},"schema_version":"1.0"},"canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","source":{"kind":"arxiv","id":"1704.04558","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04558","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04558v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04558","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"TYQMUUDF5XPY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYQMUUDF5XPY5GQL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYQMUUDF","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TYQMUUDF5XPY5GQLIVQXWCQV27","target":"record","payload":{"canonical_record":{"source":{"id":"1704.04558","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","cross_cats_sorted":[],"title_canon_sha256":"ae8ceec7edee8a092f548ba7d8a71876a9849cfc9cd90a2bb044390e4f99d841","abstract_canon_sha256":"d6ba6e64174ac6a3982c377d818e5040f6b9ad2c0553c72654cbc7a55d921e43"},"schema_version":"1.0"},"canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.190664Z","signature_b64":"HmEirolO4dcxgeiqy7OOLxFkmdziw7y033pas7B8Z1ed2W2iSpsXbFI1i4X/2RbVH0Ac1TDKPsVlRHQN7lQgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","last_reissued_at":"2026-05-18T00:46:18.190276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.190276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.04558","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-05-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VDT3fMJL6cUaRY0OnvJ3bI/q8rEl37j+9IaQ/ygxHCiAdMTR7A7luSFyo/h4X7p/1bG+zHnZTPUB10dA4YnuDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:25:25.578643Z"},"content_sha256":"99d5f399d0c3706e5f2126d6c4c61ab579c0a7e204f474d3b66de4aa46a44461","schema_version":"1.0","event_id":"sha256:99d5f399d0c3706e5f2126d6c4c61ab579c0a7e204f474d3b66de4aa46a44461"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TYQMUUDF5XPY5GQLIVQXWCQV27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Verifying Safety of Functional Programs with Rosette/Unbound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Dmitry Mordvinov, Grigory Fedyukovich","submitted_at":"2017-04-15T00:07:31Z","abstract_excerpt":"The goal of unbounded program verification is to discover an inductive invariant that safely over-approximates all possible program behaviors. Functional languages featuring higher order and recursive functions become more popular due to the domain-specific needs of big data analytics, web, and security. We present Rosette/Unbound, the first program verifier for Racket exploiting the automated constrained Horn solver on its backend. One of the key features of Rosette/Unbound is the ability to synchronize recursive computations over the same inputs allowing to verify programs that iterate over "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04558","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":""},"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-05-18T00:46:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5GFzQPUJRMEFOwFblTZjw+OXLuDJ9gGXp85b/LwEKuggowEe6qWFH+q3d/GRuEspOarNmbeaw4HsyMDfw+KPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:25:25.579438Z"},"content_sha256":"db714b7defebb322d36294fbe37f068c52ed04356e0862f4f8fe66f64de337c2","schema_version":"1.0","event_id":"sha256:db714b7defebb322d36294fbe37f068c52ed04356e0862f4f8fe66f64de337c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/bundle.json","state_url":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/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-06-11T01:25:25Z","links":{"resolver":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27","bundle":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/bundle.json","state":"https://pith.science/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYQMUUDF5XPY5GQLIVQXWCQV27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TYQMUUDF5XPY5GQLIVQXWCQV27","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":"d6ba6e64174ac6a3982c377d818e5040f6b9ad2c0553c72654cbc7a55d921e43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","title_canon_sha256":"ae8ceec7edee8a092f548ba7d8a71876a9849cfc9cd90a2bb044390e4f99d841"},"schema_version":"1.0","source":{"id":"1704.04558","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04558","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04558v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04558","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"TYQMUUDF5XPY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TYQMUUDF5XPY5GQL","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TYQMUUDF","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:db714b7defebb322d36294fbe37f068c52ed04356e0862f4f8fe66f64de337c2","target":"graph","created_at":"2026-05-18T00:46:18Z","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"},"paper":{"abstract_excerpt":"The goal of unbounded program verification is to discover an inductive invariant that safely over-approximates all possible program behaviors. Functional languages featuring higher order and recursive functions become more popular due to the domain-specific needs of big data analytics, web, and security. We present Rosette/Unbound, the first program verifier for Racket exploiting the automated constrained Horn solver on its backend. One of the key features of Rosette/Unbound is the ability to synchronize recursive computations over the same inputs allowing to verify programs that iterate over ","authors_text":"Dmitry Mordvinov, Grigory Fedyukovich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","title":"Verifying Safety of Functional Programs with Rosette/Unbound"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04558","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:99d5f399d0c3706e5f2126d6c4c61ab579c0a7e204f474d3b66de4aa46a44461","target":"record","created_at":"2026-05-18T00:46:18Z","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":"d6ba6e64174ac6a3982c377d818e5040f6b9ad2c0553c72654cbc7a55d921e43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2017-04-15T00:07:31Z","title_canon_sha256":"ae8ceec7edee8a092f548ba7d8a71876a9849cfc9cd90a2bb044390e4f99d841"},"schema_version":"1.0","source":{"id":"1704.04558","kind":"arxiv","version":1}},"canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e20ca5065eddf8e9a0b45617b0a15d7d4138a37106d0b73216358254eeab9e3","first_computed_at":"2026-05-18T00:46:18.190276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.190276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HmEirolO4dcxgeiqy7OOLxFkmdziw7y033pas7B8Z1ed2W2iSpsXbFI1i4X/2RbVH0Ac1TDKPsVlRHQN7lQgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.190664Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04558","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99d5f399d0c3706e5f2126d6c4c61ab579c0a7e204f474d3b66de4aa46a44461","sha256:db714b7defebb322d36294fbe37f068c52ed04356e0862f4f8fe66f64de337c2"],"state_sha256":"6b918e0323eed75ff61fd85f6c6febf8c14074211141e3496b7af8f282434076"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oa0UnCeSfPP0/XJNXRFbtAKVP3T8BEUCoQABTinJ4hSOZ/89cUya++Im06wz0FIIBlkAkus1bxKRmiZGMrKNBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:25:25.583663Z","bundle_sha256":"38e881a45d0e99a6a22ba4975dd5ed27146ab8f56dc5814d3c6f87ced9893f1f"}}