{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:72HZABLNZHUWEI3FUTJOMA5GQ4","short_pith_number":"pith:72HZABLN","canonical_record":{"source":{"id":"1708.00551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-01T23:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"6d6bf384f18837800c3f403fe52a6b438604f7c0eda8ef4f9ef39423b2dfdbdc","abstract_canon_sha256":"314a7b0702c57426e0ff1af42d18c7c545cf10a48e97ab4b40cf95871b4811c8"},"schema_version":"1.0"},"canonical_sha256":"fe8f90056dc9e9622365a4d2e603a687058a1d25b6ef81a7215e98a07b1c85b9","source":{"kind":"arxiv","id":"1708.00551","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00551","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00551v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00551","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"72HZABLNZHUW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"72HZABLNZHUWEI3F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"72HZABLN","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:72HZABLNZHUWEI3FUTJOMA5GQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00551","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-01T23:31:35Z","cross_cats_sorted":[],"title_canon_sha256":"6d6bf384f18837800c3f403fe52a6b438604f7c0eda8ef4f9ef39423b2dfdbdc","abstract_canon_sha256":"314a7b0702c57426e0ff1af42d18c7c545cf10a48e97ab4b40cf95871b4811c8"},"schema_version":"1.0"},"canonical_sha256":"fe8f90056dc9e9622365a4d2e603a687058a1d25b6ef81a7215e98a07b1c85b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.447799Z","signature_b64":"KoGeX3iqmK7YWP1WNGIsLm5WYmlw9pcKYybLisfT8he1YQHR0aT5hudp2r1tWWlvQoDxyNk5MACbJf66Qc7tAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe8f90056dc9e9622365a4d2e603a687058a1d25b6ef81a7215e98a07b1c85b9","last_reissued_at":"2026-05-18T00:38:45.447356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.447356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00551","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:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FNhZC6LuLcAM2IHXiUe6kDpui2Y9cg2J5hd3ApueS4AEJ49S8Sr7YLfDfWx9rDN1tYbE6S2v9V5y5t9W+dLpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:37.507527Z"},"content_sha256":"0fdea0a02062923b676dd80899bf4497f8907dea73469c2926cff822b2b958e3","schema_version":"1.0","event_id":"sha256:0fdea0a02062923b676dd80899bf4497f8907dea73469c2926cff822b2b958e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:72HZABLNZHUWEI3FUTJOMA5GQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bonsai: Synthesis-Based Reasoning for Type Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Kartik Chandra, Rastislav Bodik","submitted_at":"2017-08-01T23:31:35Z","abstract_excerpt":"We describe algorithms for symbolic reasoning about executable models of type systems, supporting three queries intended for designers of type systems. First, we check for type soundness bugs and synthesize a counterexample program if such a bug is found. Second, we compare two versions of a type system, synthesizing a program accepted by one but rejected by the other. Third, we minimize the size of synthesized counterexample programs.\n  These algorithms symbolically evaluate typecheckers and interpreters, producing formulas that characterize the set of programs that fail or succeed in the typ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00551","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:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j3Mea7U7M6RsU0dVQdpgvtU8cxH6DSZ2YIuB9/sJIPQN7Owzid2wYiY1mxIYAgxQkhtm33hq6XRO56gYPmB8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T18:56:37.508166Z"},"content_sha256":"4371c64a868daccee7b8681125328e6bb49f9cf0796f28388684e6b143d59d04","schema_version":"1.0","event_id":"sha256:4371c64a868daccee7b8681125328e6bb49f9cf0796f28388684e6b143d59d04"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/bundle.json","state_url":"https://pith.science/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/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-06T18:56:37Z","links":{"resolver":"https://pith.science/pith/72HZABLNZHUWEI3FUTJOMA5GQ4","bundle":"https://pith.science/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/bundle.json","state":"https://pith.science/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/72HZABLNZHUWEI3FUTJOMA5GQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:72HZABLNZHUWEI3FUTJOMA5GQ4","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":"314a7b0702c57426e0ff1af42d18c7c545cf10a48e97ab4b40cf95871b4811c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-01T23:31:35Z","title_canon_sha256":"6d6bf384f18837800c3f403fe52a6b438604f7c0eda8ef4f9ef39423b2dfdbdc"},"schema_version":"1.0","source":{"id":"1708.00551","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00551","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00551v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00551","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"72HZABLNZHUW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"72HZABLNZHUWEI3F","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"72HZABLN","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:4371c64a868daccee7b8681125328e6bb49f9cf0796f28388684e6b143d59d04","target":"graph","created_at":"2026-05-18T00:38:45Z","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":"We describe algorithms for symbolic reasoning about executable models of type systems, supporting three queries intended for designers of type systems. First, we check for type soundness bugs and synthesize a counterexample program if such a bug is found. Second, we compare two versions of a type system, synthesizing a program accepted by one but rejected by the other. Third, we minimize the size of synthesized counterexample programs.\n  These algorithms symbolically evaluate typecheckers and interpreters, producing formulas that characterize the set of programs that fail or succeed in the typ","authors_text":"Kartik Chandra, Rastislav Bodik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-01T23:31:35Z","title":"Bonsai: Synthesis-Based Reasoning for Type Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00551","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:0fdea0a02062923b676dd80899bf4497f8907dea73469c2926cff822b2b958e3","target":"record","created_at":"2026-05-18T00:38:45Z","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":"314a7b0702c57426e0ff1af42d18c7c545cf10a48e97ab4b40cf95871b4811c8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-08-01T23:31:35Z","title_canon_sha256":"6d6bf384f18837800c3f403fe52a6b438604f7c0eda8ef4f9ef39423b2dfdbdc"},"schema_version":"1.0","source":{"id":"1708.00551","kind":"arxiv","version":1}},"canonical_sha256":"fe8f90056dc9e9622365a4d2e603a687058a1d25b6ef81a7215e98a07b1c85b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe8f90056dc9e9622365a4d2e603a687058a1d25b6ef81a7215e98a07b1c85b9","first_computed_at":"2026-05-18T00:38:45.447356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:45.447356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KoGeX3iqmK7YWP1WNGIsLm5WYmlw9pcKYybLisfT8he1YQHR0aT5hudp2r1tWWlvQoDxyNk5MACbJf66Qc7tAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:45.447799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00551","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0fdea0a02062923b676dd80899bf4497f8907dea73469c2926cff822b2b958e3","sha256:4371c64a868daccee7b8681125328e6bb49f9cf0796f28388684e6b143d59d04"],"state_sha256":"e2d3738321ba182bb818f170c2e73b9a77a92b087085b9900cf543240b23cee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"In05t09PFLYriDzkPqGGjwzjPsIItAi6Ox4KExRy1tKU4X8nJB3CqNl69KJPFwrlt1Z9x1muukYjWjoAT/pAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T18:56:37.511204Z","bundle_sha256":"aaf5eb2aa9a418872aa239b889a2d5057e3f347735b63a8d059d3c4875f160ef"}}