{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CZQYUZ2247RY4YBIPGHPUJRFSE","short_pith_number":"pith:CZQYUZ22","canonical_record":{"source":{"id":"1701.04391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-16T18:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"bc02fd2e6a2598d17f81f28ade2566b946f36e2b14af39493229d53883553ae0","abstract_canon_sha256":"51ff1dde03a90c10fd854e9bbdd8e39f2955bdd3faaafb1e065d11b0a7cbd471"},"schema_version":"1.0"},"canonical_sha256":"16618a675ae7e38e6028798efa26259136a8dc8a2457f97d37f14fa59a4f4df3","source":{"kind":"arxiv","id":"1701.04391","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04391","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04391v2","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04391","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"CZQYUZ2247RY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZQYUZ2247RY4YBI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZQYUZ22","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CZQYUZ2247RY4YBIPGHPUJRFSE","target":"record","payload":{"canonical_record":{"source":{"id":"1701.04391","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-16T18:40:09Z","cross_cats_sorted":[],"title_canon_sha256":"bc02fd2e6a2598d17f81f28ade2566b946f36e2b14af39493229d53883553ae0","abstract_canon_sha256":"51ff1dde03a90c10fd854e9bbdd8e39f2955bdd3faaafb1e065d11b0a7cbd471"},"schema_version":"1.0"},"canonical_sha256":"16618a675ae7e38e6028798efa26259136a8dc8a2457f97d37f14fa59a4f4df3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:51.774521Z","signature_b64":"W/bF2vHUgP1sO/yLtOTA3u9gSyAkcUbxuCQmZ67XKBKGrUlOVZ96M4kjjhH11JlNbfmQNvlwCzzpSxDa5JS5DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16618a675ae7e38e6028798efa26259136a8dc8a2457f97d37f14fa59a4f4df3","last_reissued_at":"2026-05-18T00:44:51.773879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:51.773879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.04391","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:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jD0h6JfHyN7k7zs8Z6w3kH0mpj7xWdErrXx4aAkGmqZu3c2sYQZEEj+kHunzPrxwZ92+V0X46wwTVTTy8gpcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:55:07.963736Z"},"content_sha256":"8eb72b287fbf431282de784eb4888faa563405ac4e35d298c15aa4e3cb1718b5","schema_version":"1.0","event_id":"sha256:8eb72b287fbf431282de784eb4888faa563405ac4e35d298c15aa4e3cb1718b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CZQYUZ2247RY4YBIPGHPUJRFSE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Congruence Closure in Intensional Type Theory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Selsam, Leonardo de Moura","submitted_at":"2017-01-16T18:40:09Z","abstract_excerpt":"Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics based on intensional type theory (ITT), which form the basis of many interactive theorem provers. The main source of expressiveness in these logics is dependent types, and yet existing congruence closure procedures found in interactive theorem provers based on ITT do not handle dependent types at all and only work on the simply-typed subsets of the logics. Here "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04391","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:44:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oCoC4WA4lSzNwi89fgrPmln9hMfAofVj59F7mzz9LIjBXf5pBePAprfds7tX4asNfuHmFvq3cKm9yELltxHEDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:55:07.964351Z"},"content_sha256":"f72906477603cb9fa6facfaf7c5c80f22991f49b694e0a37adf28b4b94a5691e","schema_version":"1.0","event_id":"sha256:f72906477603cb9fa6facfaf7c5c80f22991f49b694e0a37adf28b4b94a5691e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/bundle.json","state_url":"https://pith.science/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/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-30T23:55:07Z","links":{"resolver":"https://pith.science/pith/CZQYUZ2247RY4YBIPGHPUJRFSE","bundle":"https://pith.science/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/bundle.json","state":"https://pith.science/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CZQYUZ2247RY4YBIPGHPUJRFSE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CZQYUZ2247RY4YBIPGHPUJRFSE","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":"51ff1dde03a90c10fd854e9bbdd8e39f2955bdd3faaafb1e065d11b0a7cbd471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-16T18:40:09Z","title_canon_sha256":"bc02fd2e6a2598d17f81f28ade2566b946f36e2b14af39493229d53883553ae0"},"schema_version":"1.0","source":{"id":"1701.04391","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.04391","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"arxiv_version","alias_value":"1701.04391v2","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.04391","created_at":"2026-05-18T00:44:51Z"},{"alias_kind":"pith_short_12","alias_value":"CZQYUZ2247RY","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CZQYUZ2247RY4YBI","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CZQYUZ22","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:f72906477603cb9fa6facfaf7c5c80f22991f49b694e0a37adf28b4b94a5691e","target":"graph","created_at":"2026-05-18T00:44:51Z","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":"Congruence closure procedures are used extensively in automated reasoning and are a core component of most satisfiability modulo theories solvers. However, no known congruence closure algorithms can support any of the expressive logics based on intensional type theory (ITT), which form the basis of many interactive theorem provers. The main source of expressiveness in these logics is dependent types, and yet existing congruence closure procedures found in interactive theorem provers based on ITT do not handle dependent types at all and only work on the simply-typed subsets of the logics. Here ","authors_text":"Daniel Selsam, Leonardo de Moura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-16T18:40:09Z","title":"Congruence Closure in Intensional Type Theory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.04391","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:8eb72b287fbf431282de784eb4888faa563405ac4e35d298c15aa4e3cb1718b5","target":"record","created_at":"2026-05-18T00:44:51Z","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":"51ff1dde03a90c10fd854e9bbdd8e39f2955bdd3faaafb1e065d11b0a7cbd471","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-16T18:40:09Z","title_canon_sha256":"bc02fd2e6a2598d17f81f28ade2566b946f36e2b14af39493229d53883553ae0"},"schema_version":"1.0","source":{"id":"1701.04391","kind":"arxiv","version":2}},"canonical_sha256":"16618a675ae7e38e6028798efa26259136a8dc8a2457f97d37f14fa59a4f4df3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"16618a675ae7e38e6028798efa26259136a8dc8a2457f97d37f14fa59a4f4df3","first_computed_at":"2026-05-18T00:44:51.773879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:51.773879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W/bF2vHUgP1sO/yLtOTA3u9gSyAkcUbxuCQmZ67XKBKGrUlOVZ96M4kjjhH11JlNbfmQNvlwCzzpSxDa5JS5DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:51.774521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.04391","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eb72b287fbf431282de784eb4888faa563405ac4e35d298c15aa4e3cb1718b5","sha256:f72906477603cb9fa6facfaf7c5c80f22991f49b694e0a37adf28b4b94a5691e"],"state_sha256":"36606e170a5a1856d139e45b544c900e698dd85c548f933bd48432728c21b0bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WKfp4V9q5B2ZpVPWS/yzDquy3TCsA3S7+nPTO+dWgLRhx9DmRws1yrdrml3bv7wtRPEThkoFutW3UXH2PeUwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:55:07.967532Z","bundle_sha256":"9011a47f069ca6d5cb10dccd07c928e5b9030b64159bd69fa667566257f4766d"}}