{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S7KZBYST34OMZWLTXF5HAEM6MG","short_pith_number":"pith:S7KZBYST","canonical_record":{"source":{"id":"1707.07872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-25T09:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"051c1b79b4173e129b9a31914311d3d3585bc2786480d33270047890c32314e3","abstract_canon_sha256":"881711cc6ef64b054dc672b478ae60bf05d58111859c9b80484d1c8548847a30"},"schema_version":"1.0"},"canonical_sha256":"97d590e253df1cccd973b97a70119e61a91f9e049c72ae83ad22c66a813701ac","source":{"kind":"arxiv","id":"1707.07872","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07872","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07872v2","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07872","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"S7KZBYST34OM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7KZBYST34OMZWLT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7KZBYST","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S7KZBYST34OMZWLTXF5HAEM6MG","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07872","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-25T09:36:10Z","cross_cats_sorted":[],"title_canon_sha256":"051c1b79b4173e129b9a31914311d3d3585bc2786480d33270047890c32314e3","abstract_canon_sha256":"881711cc6ef64b054dc672b478ae60bf05d58111859c9b80484d1c8548847a30"},"schema_version":"1.0"},"canonical_sha256":"97d590e253df1cccd973b97a70119e61a91f9e049c72ae83ad22c66a813701ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:30.817060Z","signature_b64":"a14XgWFafuLEctS/yILN8CSWZFUuVh2qmjiqL06DhD9yIN2Xvc7JsXZwt1h7UWbKb4EQz1AMNXFiTzKsL+H5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97d590e253df1cccd973b97a70119e61a91f9e049c72ae83ad22c66a813701ac","last_reissued_at":"2026-05-18T00:35:30.816623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:30.816623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07872","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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BWA11Tt6rzzGV5L6hCYFi+qGv5sd++adIEIMY7fnzgu7R50J6r/ZAYAr8YboAR+8PX/SeDe998iUO49NkbfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:46.265902Z"},"content_sha256":"0b43a6143872abab1e98189fbf481d91210def0257e4378d9a9a00b513dabadf","schema_version":"1.0","event_id":"sha256:0b43a6143872abab1e98189fbf481d91210def0257e4378d9a9a00b513dabadf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S7KZBYST34OMZWLTXF5HAEM6MG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Ki Yung Ahn","submitted_at":"2017-07-25T09:36:10Z","abstract_excerpt":"Type inference is an application domain that is a natural fit for logic programming (LP). LP systems natively support unification, which serves as a basic building block of typical type inference algorithms. In particular, polymorphic type inference in the Hindley--Milner type system (HM) can be succinctly specified and executed in Prolog. In our previous work, we have demonstrated that more advanced features of parametric polymorphism beyond HM, such as type-constructor polymorphism and kind polymorphism, can be similarly specified in Prolog. Here, we demonstrate a specification for records, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07872","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-18T00:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rN8cvOs+SWA4esjtkAmBRsuUSfkB0iA2lVnqDL6gvFNdKFn4ZPUqZvsGYTYmpKbhmZq9huqPdQccYJCMuW/zCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:46.266580Z"},"content_sha256":"628756d8aad03047c8387b9a2c69beeb9c861e0c499bc7c8b68c7de4ad38f44a","schema_version":"1.0","event_id":"sha256:628756d8aad03047c8387b9a2c69beeb9c861e0c499bc7c8b68c7de4ad38f44a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S7KZBYST34OMZWLTXF5HAEM6MG/bundle.json","state_url":"https://pith.science/pith/S7KZBYST34OMZWLTXF5HAEM6MG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S7KZBYST34OMZWLTXF5HAEM6MG/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-27T06:51:46Z","links":{"resolver":"https://pith.science/pith/S7KZBYST34OMZWLTXF5HAEM6MG","bundle":"https://pith.science/pith/S7KZBYST34OMZWLTXF5HAEM6MG/bundle.json","state":"https://pith.science/pith/S7KZBYST34OMZWLTXF5HAEM6MG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S7KZBYST34OMZWLTXF5HAEM6MG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S7KZBYST34OMZWLTXF5HAEM6MG","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":"881711cc6ef64b054dc672b478ae60bf05d58111859c9b80484d1c8548847a30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-25T09:36:10Z","title_canon_sha256":"051c1b79b4173e129b9a31914311d3d3585bc2786480d33270047890c32314e3"},"schema_version":"1.0","source":{"id":"1707.07872","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07872","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07872v2","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07872","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"S7KZBYST34OM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S7KZBYST34OMZWLT","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S7KZBYST","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:628756d8aad03047c8387b9a2c69beeb9c861e0c499bc7c8b68c7de4ad38f44a","target":"graph","created_at":"2026-05-18T00:35:30Z","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":"Type inference is an application domain that is a natural fit for logic programming (LP). LP systems natively support unification, which serves as a basic building block of typical type inference algorithms. In particular, polymorphic type inference in the Hindley--Milner type system (HM) can be succinctly specified and executed in Prolog. In our previous work, we have demonstrated that more advanced features of parametric polymorphism beyond HM, such as type-constructor polymorphism and kind polymorphism, can be similarly specified in Prolog. Here, we demonstrate a specification for records, ","authors_text":"Ki Yung Ahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-25T09:36:10Z","title":"An Executable Specification of Typing Rules for Extensible Records based on Row Polymorphism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07872","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:0b43a6143872abab1e98189fbf481d91210def0257e4378d9a9a00b513dabadf","target":"record","created_at":"2026-05-18T00:35:30Z","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":"881711cc6ef64b054dc672b478ae60bf05d58111859c9b80484d1c8548847a30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2017-07-25T09:36:10Z","title_canon_sha256":"051c1b79b4173e129b9a31914311d3d3585bc2786480d33270047890c32314e3"},"schema_version":"1.0","source":{"id":"1707.07872","kind":"arxiv","version":2}},"canonical_sha256":"97d590e253df1cccd973b97a70119e61a91f9e049c72ae83ad22c66a813701ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97d590e253df1cccd973b97a70119e61a91f9e049c72ae83ad22c66a813701ac","first_computed_at":"2026-05-18T00:35:30.816623Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:30.816623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a14XgWFafuLEctS/yILN8CSWZFUuVh2qmjiqL06DhD9yIN2Xvc7JsXZwt1h7UWbKb4EQz1AMNXFiTzKsL+H5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:30.817060Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07872","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b43a6143872abab1e98189fbf481d91210def0257e4378d9a9a00b513dabadf","sha256:628756d8aad03047c8387b9a2c69beeb9c861e0c499bc7c8b68c7de4ad38f44a"],"state_sha256":"9cb73247c8c1e210fe32fcf8f130879d7283a4a81afc53fe7333a73099154817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEjsLwzQpX2bJXV0oUrRUQMdr8zqdIPuKA233rXrdSfcC7dU3dBXrpO99aCtj/T/7b58nfa0wEOZUM9r6GKPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:51:46.270177Z","bundle_sha256":"6cb510beaf435679073885ed551730a4da5ee5ba09535acc451518fc82a340f7"}}