{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WSW3SXEV7AACVDS2GYBH4FIEYD","short_pith_number":"pith:WSW3SXEV","schema_version":"1.0","canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","source":{"kind":"arxiv","id":"1705.05769","version":1},"attestation_state":"computed","paper":{"title":"Multiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ajith Abraham, Vaclav Snasel, Varun Kumar Ojha","submitted_at":"2017-05-16T15:34:19Z","abstract_excerpt":"This paper proposes a design of hierarchical fuzzy inference tree (HFIT). An HFIT produces an optimum treelike structure, i.e., a natural hierarchical structure that accommodates simplicity by combining several low-dimensional fuzzy inference systems (FISs). Such a natural hierarchical structure provides a high degree of approximation accuracy. The construction of HFIT takes place in two phases. Firstly, a nondominated sorting based multiobjective genetic programming (MOGP) is applied to obtain a simple tree structure (a low complexity model) with a high accuracy. Secondly, the differential ev"},"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":"1705.05769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:34:19Z","cross_cats_sorted":[],"title_canon_sha256":"5ff96cb836eb66a5abd43d1876b8e30be73a5d0042bd676255102fc4090e2efc","abstract_canon_sha256":"f0cfb00649a756c527189ed001b38d104f5af1083333a5554dc474805865e8eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:20.223152Z","signature_b64":"WX1pfvc4fydeExX5BTthQUsMDOUKAkXT+15bw2ztlSt+8zviUJjGyE97Ob6vJge0uY1zw9vn6Ih4fpDznvKeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","last_reissued_at":"2026-05-18T00:44:20.222765Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:20.222765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ajith Abraham, Vaclav Snasel, Varun Kumar Ojha","submitted_at":"2017-05-16T15:34:19Z","abstract_excerpt":"This paper proposes a design of hierarchical fuzzy inference tree (HFIT). An HFIT produces an optimum treelike structure, i.e., a natural hierarchical structure that accommodates simplicity by combining several low-dimensional fuzzy inference systems (FISs). Such a natural hierarchical structure provides a high degree of approximation accuracy. The construction of HFIT takes place in two phases. Firstly, a nondominated sorting based multiobjective genetic programming (MOGP) is applied to obtain a simple tree structure (a low complexity model) with a high accuracy. Secondly, the differential ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05769","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.05769","created_at":"2026-05-18T00:44:20.222823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05769v1","created_at":"2026-05-18T00:44:20.222823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05769","created_at":"2026-05-18T00:44:20.222823+00:00"},{"alias_kind":"pith_short_12","alias_value":"WSW3SXEV7AAC","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WSW3SXEV7AACVDS2","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WSW3SXEV","created_at":"2026-05-18T12:31:53.515858+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD","json":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD.json","graph_json":"https://pith.science/api/pith-number/WSW3SXEV7AACVDS2GYBH4FIEYD/graph.json","events_json":"https://pith.science/api/pith-number/WSW3SXEV7AACVDS2GYBH4FIEYD/events.json","paper":"https://pith.science/paper/WSW3SXEV"},"agent_actions":{"view_html":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD","download_json":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD.json","view_paper":"https://pith.science/paper/WSW3SXEV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05769&json=true","fetch_graph":"https://pith.science/api/pith-number/WSW3SXEV7AACVDS2GYBH4FIEYD/graph.json","fetch_events":"https://pith.science/api/pith-number/WSW3SXEV7AACVDS2GYBH4FIEYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/action/storage_attestation","attest_author":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/action/author_attestation","sign_citation":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/action/citation_signature","submit_replication":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/action/replication_record"}},"created_at":"2026-05-18T00:44:20.222823+00:00","updated_at":"2026-05-18T00:44:20.222823+00:00"}