{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:J74NYVRQAOLJOHIQY3SZZCKUJK","short_pith_number":"pith:J74NYVRQ","canonical_record":{"source":{"id":"1104.2825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-14T16:37:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3a4557363ee5318a4cffccf37eaec9e4854df70a1743c000aef8b08501743886","abstract_canon_sha256":"dda63fb7931185055b958d73b61ce78bb4245c6192103fa481c8fb53cf93bf62"},"schema_version":"1.0"},"canonical_sha256":"4ff8dc56300396971d10c6e59c89544a87e3f7471d09353c3382ae08e87bd577","source":{"kind":"arxiv","id":"1104.2825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2825","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2825v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2825","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"J74NYVRQAOLJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J74NYVRQAOLJOHIQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J74NYVRQ","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:J74NYVRQAOLJOHIQY3SZZCKUJK","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2825","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-14T16:37:48Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3a4557363ee5318a4cffccf37eaec9e4854df70a1743c000aef8b08501743886","abstract_canon_sha256":"dda63fb7931185055b958d73b61ce78bb4245c6192103fa481c8fb53cf93bf62"},"schema_version":"1.0"},"canonical_sha256":"4ff8dc56300396971d10c6e59c89544a87e3f7471d09353c3382ae08e87bd577","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:26.745744Z","signature_b64":"MqTp7KNq3tpZWG8Q4SvTq6o9ECTkuYIMSh0gzOVF+08ttNOWLMNLJ+SikPXzp2nFHroQX2F0hPBHJDZ4+crgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ff8dc56300396971d10c6e59c89544a87e3f7471d09353c3382ae08e87bd577","last_reissued_at":"2026-05-18T04:24:26.745263Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:26.745263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2825","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0/NWz2TzO+ASjYLLIZNyO7sXiSToX35QXWK9t5jZujcNpsjMQ8xSXj86Yfphu29l5b0/xOb2tUmQi0+bjCRGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:18:52.052452Z"},"content_sha256":"2616666c82aae4a9402bbf05e70b27b3acf9b19b00ceb913d64baa8a6b0be534","schema_version":"1.0","event_id":"sha256:2616666c82aae4a9402bbf05e70b27b3acf9b19b00ceb913d64baa8a6b0be534"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:J74NYVRQAOLJOHIQY3SZZCKUJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Carsten Lutz, Frank Wolter","submitted_at":"2011-04-14T16:37:48Z","abstract_excerpt":"We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for deciding the existence of uniform interpolants, an approach to computing interpolants when they exist, and tight bounds on their size. We use a mix of model- theoretic and automata-theoretic methods that, as a by-product, also provides characterizations of and decision procedures for conservative extensions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2825","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-18T04:24:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRSgiOPHbDkie0989nWqUq3SSwzuXb/nw8Rh4TLsxD730OvnLmw1KhMCkXmctIfV9iY2Qsi8jpKQw6H08RSfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:18:52.053048Z"},"content_sha256":"055a5457a6f5e3ffc8507ce20b2ea7872f8bda3b20ff62c3c121a7ac2deeeab9","schema_version":"1.0","event_id":"sha256:055a5457a6f5e3ffc8507ce20b2ea7872f8bda3b20ff62c3c121a7ac2deeeab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/bundle.json","state_url":"https://pith.science/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/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-31T19:18:52Z","links":{"resolver":"https://pith.science/pith/J74NYVRQAOLJOHIQY3SZZCKUJK","bundle":"https://pith.science/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/bundle.json","state":"https://pith.science/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J74NYVRQAOLJOHIQY3SZZCKUJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:J74NYVRQAOLJOHIQY3SZZCKUJK","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":"dda63fb7931185055b958d73b61ce78bb4245c6192103fa481c8fb53cf93bf62","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-14T16:37:48Z","title_canon_sha256":"3a4557363ee5318a4cffccf37eaec9e4854df70a1743c000aef8b08501743886"},"schema_version":"1.0","source":{"id":"1104.2825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2825","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2825v1","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2825","created_at":"2026-05-18T04:24:26Z"},{"alias_kind":"pith_short_12","alias_value":"J74NYVRQAOLJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"J74NYVRQAOLJOHIQ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"J74NYVRQ","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:055a5457a6f5e3ffc8507ce20b2ea7872f8bda3b20ff62c3c121a7ac2deeeab9","target":"graph","created_at":"2026-05-18T04:24: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 study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform inter- polants and their existence in terms of bisimula- tions, tight complexity bounds for deciding the existence of uniform interpolants, an approach to computing interpolants when they exist, and tight bounds on their size. We use a mix of model- theoretic and automata-theoretic methods that, as a by-product, also provides characterizations of and decision procedures for conservative extensions.","authors_text":"Carsten Lutz, Frank Wolter","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-14T16:37:48Z","title":"Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2825","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:2616666c82aae4a9402bbf05e70b27b3acf9b19b00ceb913d64baa8a6b0be534","target":"record","created_at":"2026-05-18T04:24: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":"dda63fb7931185055b958d73b61ce78bb4245c6192103fa481c8fb53cf93bf62","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-04-14T16:37:48Z","title_canon_sha256":"3a4557363ee5318a4cffccf37eaec9e4854df70a1743c000aef8b08501743886"},"schema_version":"1.0","source":{"id":"1104.2825","kind":"arxiv","version":1}},"canonical_sha256":"4ff8dc56300396971d10c6e59c89544a87e3f7471d09353c3382ae08e87bd577","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ff8dc56300396971d10c6e59c89544a87e3f7471d09353c3382ae08e87bd577","first_computed_at":"2026-05-18T04:24:26.745263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:26.745263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MqTp7KNq3tpZWG8Q4SvTq6o9ECTkuYIMSh0gzOVF+08ttNOWLMNLJ+SikPXzp2nFHroQX2F0hPBHJDZ4+crgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:26.745744Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2616666c82aae4a9402bbf05e70b27b3acf9b19b00ceb913d64baa8a6b0be534","sha256:055a5457a6f5e3ffc8507ce20b2ea7872f8bda3b20ff62c3c121a7ac2deeeab9"],"state_sha256":"ff7758ed5de5cb91d64f7a7fe2299253ff4456614ba995ffedcc06c6aed65f76"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbvwyK8tVro7XsZVCBX6JefdN3L3qID5gQg3tR08Aee3fQkhNVi04wVD/nkP1gwbTQSfyfBk/QzGCl7VnW+hCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:18:52.056289Z","bundle_sha256":"564be0bb992a5ec08a4be5d7ed23737641d76b744dcc0c4f108b3c263f88c223"}}