{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5P5XUNXOUVOT5OM7XUIZY2KP5J","short_pith_number":"pith:5P5XUNXO","canonical_record":{"source":{"id":"1609.09709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"80c9a9e5e98f41d9293480587dbf4497f1b0542eebf63dd76375b7025a8c8688","abstract_canon_sha256":"e90fa51c29651b436af67f15202085f22b35a1ed14cd2e0785bfd824f844336c"},"schema_version":"1.0"},"canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","source":{"kind":"arxiv","id":"1609.09709","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09709","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09709v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09709","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"5P5XUNXOUVOT","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5P5XUNXOUVOT5OM7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5P5XUNXO","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5P5XUNXOUVOT5OM7XUIZY2KP5J","target":"record","payload":{"canonical_record":{"source":{"id":"1609.09709","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","cross_cats_sorted":[],"title_canon_sha256":"80c9a9e5e98f41d9293480587dbf4497f1b0542eebf63dd76375b7025a8c8688","abstract_canon_sha256":"e90fa51c29651b436af67f15202085f22b35a1ed14cd2e0785bfd824f844336c"},"schema_version":"1.0"},"canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:33.619776Z","signature_b64":"B0k0n1ZnNuK3qovZBQedoGHyb7owoErFOXqysjgkiYpywP4qENZQHnEv0SNxHiXLKNSTfDKQ9IzMWWUNxe12Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","last_reissued_at":"2026-05-18T01:03:33.619180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:33.619180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.09709","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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9VK1lwSq6O7gU1TZNgtWxb0+MoxvQYWgrih8t8cRVrcaD+zd9ShRFhsjOj9PMUo5/44pLPdoKyOjF6u73N9HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:16:24.171134Z"},"content_sha256":"cd7963de9907cc9ee4211e24042b56c707526258918288b8da9a59d19bd93d75","schema_version":"1.0","event_id":"sha256:cd7963de9907cc9ee4211e24042b56c707526258918288b8da9a59d19bd93d75"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5P5XUNXOUVOT5OM7XUIZY2KP5J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Type checking through unification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andreas Abel, Francesco Mazzoli","submitted_at":"2016-09-30T13:03:25Z","abstract_excerpt":"In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source of complexity in the type-checking algorithm for existing dependently typed programming languages. We propose an algorithm that encodes a type-checking problem entirely in the form of unification constra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09709","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-18T01:03:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQ0lmWoZJcIa9aJMj3vzmZ4t2OZUf2dtnw8Cj1BkijgaH3sjwFAf9Xz7mMeQtaDGCeIy/IpUVE7lBO4FIgguBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:16:24.171493Z"},"content_sha256":"4f4c3352f0ddb67135e8ea642984ac8030671a6921b5ab7267fba6212dcc9f5f","schema_version":"1.0","event_id":"sha256:4f4c3352f0ddb67135e8ea642984ac8030671a6921b5ab7267fba6212dcc9f5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/bundle.json","state_url":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/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-08T14:16:24Z","links":{"resolver":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J","bundle":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/bundle.json","state":"https://pith.science/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5P5XUNXOUVOT5OM7XUIZY2KP5J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5P5XUNXOUVOT5OM7XUIZY2KP5J","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":"e90fa51c29651b436af67f15202085f22b35a1ed14cd2e0785bfd824f844336c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","title_canon_sha256":"80c9a9e5e98f41d9293480587dbf4497f1b0542eebf63dd76375b7025a8c8688"},"schema_version":"1.0","source":{"id":"1609.09709","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.09709","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"arxiv_version","alias_value":"1609.09709v1","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.09709","created_at":"2026-05-18T01:03:33Z"},{"alias_kind":"pith_short_12","alias_value":"5P5XUNXOUVOT","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5P5XUNXOUVOT5OM7","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5P5XUNXO","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4f4c3352f0ddb67135e8ea642984ac8030671a6921b5ab7267fba6212dcc9f5f","target":"graph","created_at":"2026-05-18T01:03:33Z","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":"In this paper we describe how to leverage higher-order unification to type check a dependently typed language with meta-variables. The literature usually presents the unification algorithm as a standalone component, however the need to check definitional equality of terms while type checking gives rise to a tight interplay between type checking and unification. This interplay is a major source of complexity in the type-checking algorithm for existing dependently typed programming languages. We propose an algorithm that encodes a type-checking problem entirely in the form of unification constra","authors_text":"Andreas Abel, Francesco Mazzoli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","title":"Type checking through unification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.09709","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:cd7963de9907cc9ee4211e24042b56c707526258918288b8da9a59d19bd93d75","target":"record","created_at":"2026-05-18T01:03:33Z","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":"e90fa51c29651b436af67f15202085f22b35a1ed14cd2e0785bfd824f844336c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-09-30T13:03:25Z","title_canon_sha256":"80c9a9e5e98f41d9293480587dbf4497f1b0542eebf63dd76375b7025a8c8688"},"schema_version":"1.0","source":{"id":"1609.09709","kind":"arxiv","version":1}},"canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ebfb7a36eea55d3eb99fbd119c694fea7ae4c09e7333987e0d472deb81524fe0","first_computed_at":"2026-05-18T01:03:33.619180Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:33.619180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0k0n1ZnNuK3qovZBQedoGHyb7owoErFOXqysjgkiYpywP4qENZQHnEv0SNxHiXLKNSTfDKQ9IzMWWUNxe12Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:33.619776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.09709","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd7963de9907cc9ee4211e24042b56c707526258918288b8da9a59d19bd93d75","sha256:4f4c3352f0ddb67135e8ea642984ac8030671a6921b5ab7267fba6212dcc9f5f"],"state_sha256":"ffda5036c5f2a29178a78016619b0e5d06839ce5689c561c560a2f66e7a76f59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EC/vOJu+xAbZWB6d235uLq7Xzp/U1NJfdO4L+KMpUQd5aK1A6Ea5Qd9eB7rsaVuyVOmg+/5nAAaEq0MbHruDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:16:24.173599Z","bundle_sha256":"159b5beef10f4c15f4b9c68cbe8e5b9b86321c89877b5ec2fd8062c7699f86c6"}}