{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:IZMN7QSWUN3YVQ4SOHJBOBKDZK","short_pith_number":"pith:IZMN7QSW","canonical_record":{"source":{"id":"1505.02878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-12T05:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"9e74d5a2c155460b5653254bdcf686d7a4b2edfe9f274d38c7390c5bbd6b4336","abstract_canon_sha256":"d9250c9c5bf110e17ddfaca74682ded340b5e3fd949883b4c1807223d681d4ba"},"schema_version":"1.0"},"canonical_sha256":"4658dfc256a3778ac39271d2170543ca97f3b547e76a2ebb41ead61f82483808","source":{"kind":"arxiv","id":"1505.02878","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02878","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02878v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02878","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"IZMN7QSWUN3Y","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZMN7QSWUN3YVQ4S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZMN7QSW","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:IZMN7QSWUN3YVQ4SOHJBOBKDZK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.02878","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-12T05:38:53Z","cross_cats_sorted":[],"title_canon_sha256":"9e74d5a2c155460b5653254bdcf686d7a4b2edfe9f274d38c7390c5bbd6b4336","abstract_canon_sha256":"d9250c9c5bf110e17ddfaca74682ded340b5e3fd949883b4c1807223d681d4ba"},"schema_version":"1.0"},"canonical_sha256":"4658dfc256a3778ac39271d2170543ca97f3b547e76a2ebb41ead61f82483808","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:26.150044Z","signature_b64":"5mYXXSYNwji8hfvg6axduMc1JwBhVZ4bjYdGg/DE3Hnlt0vbIOVrddXvpuqIpCHQJm78Q2C80IxhpRQYjEApCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4658dfc256a3778ac39271d2170543ca97f3b547e76a2ebb41ead61f82483808","last_reissued_at":"2026-05-18T02:07:26.149603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:26.149603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.02878","source_version":2,"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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TLgcCU25s2GI0IN2P+giaVq9zf4x/PysXWGuJPZrj1PpJ+gID1kAYpRHMeX+3Lm9O31l0bT/ZfWO+m8y1cc/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:31.751269Z"},"content_sha256":"57ee03c21406cae5dc26a258a3962a4c2762c3f33f68b11acfff2a3c76c35777","schema_version":"1.0","event_id":"sha256:57ee03c21406cae5dc26a258a3962a4c2762c3f33f68b11acfff2a3c76c35777"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:IZMN7QSWUN3YVQ4SOHJBOBKDZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Refinement Type Inference via Horn Constraint Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Hiroshi Unno, Kodai Hashimoto","submitted_at":"2015-05-12T05:38:53Z","abstract_excerpt":"We propose a novel method for inferring refinement types of higher-order functional programs. The main advantage of the proposed method is that it can infer maximally preferred (i.e., Pareto optimal) refinement types with respect to a user-specified preference order. The flexible optimization of refinement types enabled by the proposed method paves the way for interesting applications, such as inferring most-general characterization of inputs for which a given program satisfies (or violates) a given safety (or termination) property. Our method reduces such a type optimization problem to a Horn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02878","kind":"arxiv","version":2},"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-18T02:07:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+bwL9ARTyl8J4XFMOxiX5cvrlzzbAVM97ApRM35jSf0K/nECTRLrdttsogMs6mT1Wxm3HaoAk+Ntlnbu9dZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:51:31.751953Z"},"content_sha256":"cba81879dc937f85fac3ee1bb4c7662eae96450c73f58867ce73da66fe936ecf","schema_version":"1.0","event_id":"sha256:cba81879dc937f85fac3ee1bb4c7662eae96450c73f58867ce73da66fe936ecf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/bundle.json","state_url":"https://pith.science/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/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-05-26T06:51:31Z","links":{"resolver":"https://pith.science/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK","bundle":"https://pith.science/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/bundle.json","state":"https://pith.science/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZMN7QSWUN3YVQ4SOHJBOBKDZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:IZMN7QSWUN3YVQ4SOHJBOBKDZK","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":"d9250c9c5bf110e17ddfaca74682ded340b5e3fd949883b4c1807223d681d4ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-12T05:38:53Z","title_canon_sha256":"9e74d5a2c155460b5653254bdcf686d7a4b2edfe9f274d38c7390c5bbd6b4336"},"schema_version":"1.0","source":{"id":"1505.02878","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.02878","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"arxiv_version","alias_value":"1505.02878v2","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.02878","created_at":"2026-05-18T02:07:26Z"},{"alias_kind":"pith_short_12","alias_value":"IZMN7QSWUN3Y","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"IZMN7QSWUN3YVQ4S","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"IZMN7QSW","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:cba81879dc937f85fac3ee1bb4c7662eae96450c73f58867ce73da66fe936ecf","target":"graph","created_at":"2026-05-18T02:07:26Z","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 propose a novel method for inferring refinement types of higher-order functional programs. The main advantage of the proposed method is that it can infer maximally preferred (i.e., Pareto optimal) refinement types with respect to a user-specified preference order. The flexible optimization of refinement types enabled by the proposed method paves the way for interesting applications, such as inferring most-general characterization of inputs for which a given program satisfies (or violates) a given safety (or termination) property. Our method reduces such a type optimization problem to a Horn","authors_text":"Hiroshi Unno, Kodai Hashimoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-12T05:38:53Z","title":"Refinement Type Inference via Horn Constraint Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.02878","kind":"arxiv","version":2},"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:57ee03c21406cae5dc26a258a3962a4c2762c3f33f68b11acfff2a3c76c35777","target":"record","created_at":"2026-05-18T02:07:26Z","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":"d9250c9c5bf110e17ddfaca74682ded340b5e3fd949883b4c1807223d681d4ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-12T05:38:53Z","title_canon_sha256":"9e74d5a2c155460b5653254bdcf686d7a4b2edfe9f274d38c7390c5bbd6b4336"},"schema_version":"1.0","source":{"id":"1505.02878","kind":"arxiv","version":2}},"canonical_sha256":"4658dfc256a3778ac39271d2170543ca97f3b547e76a2ebb41ead61f82483808","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4658dfc256a3778ac39271d2170543ca97f3b547e76a2ebb41ead61f82483808","first_computed_at":"2026-05-18T02:07:26.149603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:26.149603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5mYXXSYNwji8hfvg6axduMc1JwBhVZ4bjYdGg/DE3Hnlt0vbIOVrddXvpuqIpCHQJm78Q2C80IxhpRQYjEApCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:26.150044Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.02878","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57ee03c21406cae5dc26a258a3962a4c2762c3f33f68b11acfff2a3c76c35777","sha256:cba81879dc937f85fac3ee1bb4c7662eae96450c73f58867ce73da66fe936ecf"],"state_sha256":"903ea00fa4c5c2752e6b17aef31eb25ddce17aac6942e86b74f4741d1e26c3ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9jQb5AesarKm45WoD2qI1AePDVep2yhBIPP8/IpqndW6zCoT78UgUGa98IizRpceZtTKnHmwbF7llu+ArhR8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:51:31.755847Z","bundle_sha256":"2c0bf45ae52ae9b85ad88d949dbdbc7ef48a40c62c65b651f8cbc92f50205414"}}