{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D354HN4FAOFMD2XPTSM52HXB3N","short_pith_number":"pith:D354HN4F","schema_version":"1.0","canonical_sha256":"1efbc3b785038ac1eaef9c99dd1ee1db5027ee4b0c22cfc3a98bce9029c143a3","source":{"kind":"arxiv","id":"2409.04469","version":1},"attestation_state":"computed","paper":{"title":"Intensional FOL: Many-Sorted Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Zoran Majkic","submitted_at":"2024-09-03T19:50:57Z","abstract_excerpt":"The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2409.04469","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-09-03T19:50:57Z","cross_cats_sorted":[],"title_canon_sha256":"42e47dc6b1b755edcc14f4d38d484d23c35f22d24f5e6c9cb8742f25289528d5","abstract_canon_sha256":"f43e0d79245058c33dd29783e788d30b4938c59caaef086d4ccde67eb2acdc0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:04:12.588925Z","signature_b64":"J0jVMFbCxv89i2VEyqwjBHMvJffZDFD0PxdzRCZdzj01j+pqr3xO8j6YDgH7Eq52uRpQC5GDHX9BMViPpCfaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1efbc3b785038ac1eaef9c99dd1ee1db5027ee4b0c22cfc3a98bce9029c143a3","last_reissued_at":"2026-07-05T09:04:12.588587Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:04:12.588587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intensional FOL: Many-Sorted Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Zoran Majkic","submitted_at":"2024-09-03T19:50:57Z","abstract_excerpt":"The concepts used in IFOL have associated to them a list of sorted attributes, and the sorts are the intensional concepts as well. The requirement to extend the unsorted IFOL (Intensional FOL) to many-sorted IFOL is mainly based on the fact that a natural language is implicitly many-sorted and that we intend to use IFOL to support applications that use natural languages. Thus, the proposed version of many-sorted IFOL is just the completion of this conceptual feature of the IFOL."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.04469","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.04469/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2409.04469","created_at":"2026-07-05T09:04:12.588644+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.04469v1","created_at":"2026-07-05T09:04:12.588644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.04469","created_at":"2026-07-05T09:04:12.588644+00:00"},{"alias_kind":"pith_short_12","alias_value":"D354HN4FAOFM","created_at":"2026-07-05T09:04:12.588644+00:00"},{"alias_kind":"pith_short_16","alias_value":"D354HN4FAOFMD2XP","created_at":"2026-07-05T09:04:12.588644+00:00"},{"alias_kind":"pith_short_8","alias_value":"D354HN4F","created_at":"2026-07-05T09:04:12.588644+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09567","citing_title":"Neuro-Symbolic Strong-AI Robots with Closed Knowledge Assumption: Learning and Deductions","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N","json":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N.json","graph_json":"https://pith.science/api/pith-number/D354HN4FAOFMD2XPTSM52HXB3N/graph.json","events_json":"https://pith.science/api/pith-number/D354HN4FAOFMD2XPTSM52HXB3N/events.json","paper":"https://pith.science/paper/D354HN4F"},"agent_actions":{"view_html":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N","download_json":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N.json","view_paper":"https://pith.science/paper/D354HN4F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.04469&json=true","fetch_graph":"https://pith.science/api/pith-number/D354HN4FAOFMD2XPTSM52HXB3N/graph.json","fetch_events":"https://pith.science/api/pith-number/D354HN4FAOFMD2XPTSM52HXB3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N/action/storage_attestation","attest_author":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N/action/author_attestation","sign_citation":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N/action/citation_signature","submit_replication":"https://pith.science/pith/D354HN4FAOFMD2XPTSM52HXB3N/action/replication_record"}},"created_at":"2026-07-05T09:04:12.588644+00:00","updated_at":"2026-07-05T09:04:12.588644+00:00"}