{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:Q7YLY3HTQWMHUMN4BYIOVUYU23","short_pith_number":"pith:Q7YLY3HT","canonical_record":{"source":{"id":"2307.14669","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-27T07:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"77d551fadc56ac2fe6a8974a09b4f15103708fb5002f1f7c8c8f2ab716fd0c40","abstract_canon_sha256":"6c55d1f5c7a4e00713ee40f8b089fcf206796ea9b5606b3a37522931ab9d2987"},"schema_version":"1.0"},"canonical_sha256":"87f0bc6cf385987a31bc0e10ead314d6e4b00278bb2c5994c11ad78d04438d8c","source":{"kind":"arxiv","id":"2307.14669","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.14669","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.14669v2","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14669","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q7YLY3HTQWMH","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_16","alias_value":"Q7YLY3HTQWMHUMN4","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_8","alias_value":"Q7YLY3HT","created_at":"2026-07-05T07:16:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:Q7YLY3HTQWMHUMN4BYIOVUYU23","target":"record","payload":{"canonical_record":{"source":{"id":"2307.14669","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-27T07:47:54Z","cross_cats_sorted":[],"title_canon_sha256":"77d551fadc56ac2fe6a8974a09b4f15103708fb5002f1f7c8c8f2ab716fd0c40","abstract_canon_sha256":"6c55d1f5c7a4e00713ee40f8b089fcf206796ea9b5606b3a37522931ab9d2987"},"schema_version":"1.0"},"canonical_sha256":"87f0bc6cf385987a31bc0e10ead314d6e4b00278bb2c5994c11ad78d04438d8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:16:44.540844Z","signature_b64":"YE/XN33isxzRw8Q7PVfsKUqBYPA75Ga3cHToTrRSfPfGSyVecuT1XBOnWgG4JIXMyOKQbFTTOpYNfVmYON+RBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87f0bc6cf385987a31bc0e10ead314d6e4b00278bb2c5994c11ad78d04438d8c","last_reissued_at":"2026-07-05T07:16:44.540378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:16:44.540378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.14669","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-07-05T07:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1e5FlI+BU/H9toBZj/y48ghnt8uwWpno7fvSXAeWNJ19b3oKHA1u/bKPNsDG4aB056aBy72nHTpesvViLyHwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:31:26.329545Z"},"content_sha256":"8f39f181fa40f445544fcb2c9358e4b9e9bf648f20675a6c60406c443123dc56","schema_version":"1.0","event_id":"sha256:8f39f181fa40f445544fcb2c9358e4b9e9bf648f20675a6c60406c443123dc56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:Q7YLY3HTQWMHUMN4BYIOVUYU23","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fuzzy order-sorted feature logic","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Gabriella Pasi, Gian Carlo Milanese","submitted_at":"2023-07-27T07:47:54Z","abstract_excerpt":"Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. OSF logic allows the construction of record-like terms that represent classes of entities and that are themselves ordered in a subsumption relation. The unification algorithm for such structures provides an efficient calculus of type subsumption, which has been applied in computational linguistics and implemented in constraint logic programming languages such as LOGIN and LIFE and automated reasoners suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14669","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.14669/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:16:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C6rMD24lu65xCyAiwNvAwpFZizE5qT0USDdDgi18NHEBuD5CmKlW08xzyC5mpQNgLvycbTD6lLRw4gjaZKzUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T12:31:26.330038Z"},"content_sha256":"d5984ee2b79df9faa8d69e664b79c38959a4883c9641de3297a9fcff786aa482","schema_version":"1.0","event_id":"sha256:d5984ee2b79df9faa8d69e664b79c38959a4883c9641de3297a9fcff786aa482"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/bundle.json","state_url":"https://pith.science/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/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-08-20T12:31:26Z","links":{"resolver":"https://pith.science/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23","bundle":"https://pith.science/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/bundle.json","state":"https://pith.science/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q7YLY3HTQWMHUMN4BYIOVUYU23/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:Q7YLY3HTQWMHUMN4BYIOVUYU23","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":"6c55d1f5c7a4e00713ee40f8b089fcf206796ea9b5606b3a37522931ab9d2987","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-27T07:47:54Z","title_canon_sha256":"77d551fadc56ac2fe6a8974a09b4f15103708fb5002f1f7c8c8f2ab716fd0c40"},"schema_version":"1.0","source":{"id":"2307.14669","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.14669","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"arxiv_version","alias_value":"2307.14669v2","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.14669","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_12","alias_value":"Q7YLY3HTQWMH","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_16","alias_value":"Q7YLY3HTQWMHUMN4","created_at":"2026-07-05T07:16:44Z"},{"alias_kind":"pith_short_8","alias_value":"Q7YLY3HT","created_at":"2026-07-05T07:16:44Z"}],"graph_snapshots":[{"event_id":"sha256:d5984ee2b79df9faa8d69e664b79c38959a4883c9641de3297a9fcff786aa482","target":"graph","created_at":"2026-07-05T07:16:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.14669/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Order-Sorted Feature (OSF) logic is a knowledge representation and reasoning language based on function-denoting feature symbols and set-denoting sort symbols ordered in a subsumption lattice. OSF logic allows the construction of record-like terms that represent classes of entities and that are themselves ordered in a subsumption relation. The unification algorithm for such structures provides an efficient calculus of type subsumption, which has been applied in computational linguistics and implemented in constraint logic programming languages such as LOGIN and LIFE and automated reasoners suc","authors_text":"Gabriella Pasi, Gian Carlo Milanese","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-27T07:47:54Z","title":"Fuzzy order-sorted feature logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.14669","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:8f39f181fa40f445544fcb2c9358e4b9e9bf648f20675a6c60406c443123dc56","target":"record","created_at":"2026-07-05T07:16:44Z","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":"6c55d1f5c7a4e00713ee40f8b089fcf206796ea9b5606b3a37522931ab9d2987","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2023-07-27T07:47:54Z","title_canon_sha256":"77d551fadc56ac2fe6a8974a09b4f15103708fb5002f1f7c8c8f2ab716fd0c40"},"schema_version":"1.0","source":{"id":"2307.14669","kind":"arxiv","version":2}},"canonical_sha256":"87f0bc6cf385987a31bc0e10ead314d6e4b00278bb2c5994c11ad78d04438d8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87f0bc6cf385987a31bc0e10ead314d6e4b00278bb2c5994c11ad78d04438d8c","first_computed_at":"2026-07-05T07:16:44.540378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:16:44.540378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YE/XN33isxzRw8Q7PVfsKUqBYPA75Ga3cHToTrRSfPfGSyVecuT1XBOnWgG4JIXMyOKQbFTTOpYNfVmYON+RBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:16:44.540844Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.14669","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f39f181fa40f445544fcb2c9358e4b9e9bf648f20675a6c60406c443123dc56","sha256:d5984ee2b79df9faa8d69e664b79c38959a4883c9641de3297a9fcff786aa482"],"state_sha256":"6b88472e8fa5be6e72fb189b727cb56ba785cbc9159a04e7c9250725df39b8f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fyDEdijiMd88eKEbL8+IGbpLh3febhz76P9lXjqzBVKxOVRmJscF+bl+BG7wVzmV8ACmDaMIp6p2bgCngwy+Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T12:31:26.386802Z","bundle_sha256":"1e5cf7d4939e815348765e73fa6990326d8925d6c437ee98540abc02f4277b9a"}}