{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WSW3SXEV7AACVDS2GYBH4FIEYD","short_pith_number":"pith:WSW3SXEV","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"},"canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","source":{"kind":"arxiv","id":"1705.05769","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05769","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05769v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05769","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"WSW3SXEV7AAC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSW3SXEV7AACVDS2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSW3SXEV","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WSW3SXEV7AACVDS2GYBH4FIEYD","target":"record","payload":{"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"},"canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","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"},"source_kind":"arxiv","source_id":"1705.05769","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+l/jUXIBKjyYmjICfXVs8beyLpLYxx03cZL9CJR83BREybea5VTZjzvBOLUz+W8UAKbUvyAGFEkUz61iIPrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:58:58.250195Z"},"content_sha256":"f19a44b64f1f1d5cce3b81700bcb1a91744b4c50f6d70ebe3d5cda4a03ee6a93","schema_version":"1.0","event_id":"sha256:f19a44b64f1f1d5cce3b81700bcb1a91744b4c50f6d70ebe3d5cda4a03ee6a93"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WSW3SXEV7AACVDS2GYBH4FIEYD","target":"graph","payload":{"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"},"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:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8Q/VYaWZksAoQXtQ0X8iLc/6JjKcnE7JQqUeT4gG6Pef//cSJGmnskSU7kim9Je1NRec7kEWhjArxTznc/aDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T13:58:58.250561Z"},"content_sha256":"3c012609bd6b435da9ae500188733a6d5c7af3b77d2ce6acb03bc1553fe601a6","schema_version":"1.0","event_id":"sha256:3c012609bd6b435da9ae500188733a6d5c7af3b77d2ce6acb03bc1553fe601a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/bundle.json","state_url":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/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-06-30T13:58:58Z","links":{"resolver":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD","bundle":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/bundle.json","state":"https://pith.science/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSW3SXEV7AACVDS2GYBH4FIEYD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WSW3SXEV7AACVDS2GYBH4FIEYD","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":"f0cfb00649a756c527189ed001b38d104f5af1083333a5554dc474805865e8eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:34:19Z","title_canon_sha256":"5ff96cb836eb66a5abd43d1876b8e30be73a5d0042bd676255102fc4090e2efc"},"schema_version":"1.0","source":{"id":"1705.05769","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05769","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05769v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05769","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"WSW3SXEV7AAC","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WSW3SXEV7AACVDS2","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WSW3SXEV","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:3c012609bd6b435da9ae500188733a6d5c7af3b77d2ce6acb03bc1553fe601a6","target":"graph","created_at":"2026-05-18T00:44:20Z","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":"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","authors_text":"Ajith Abraham, Vaclav Snasel, Varun Kumar Ojha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:34:19Z","title":"Multiobjective Programming for Type-2 Hierarchical Fuzzy Inference Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05769","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:f19a44b64f1f1d5cce3b81700bcb1a91744b4c50f6d70ebe3d5cda4a03ee6a93","target":"record","created_at":"2026-05-18T00:44:20Z","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":"f0cfb00649a756c527189ed001b38d104f5af1083333a5554dc474805865e8eb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-05-16T15:34:19Z","title_canon_sha256":"5ff96cb836eb66a5abd43d1876b8e30be73a5d0042bd676255102fc4090e2efc"},"schema_version":"1.0","source":{"id":"1705.05769","kind":"arxiv","version":1}},"canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4adb95c95f8002a8e5a36027e1504c0e9d6ecc230cb44ad560fec41d9c1112f","first_computed_at":"2026-05-18T00:44:20.222765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:20.222765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WX1pfvc4fydeExX5BTthQUsMDOUKAkXT+15bw2ztlSt+8zviUJjGyE97Ob6vJge0uY1zw9vn6Ih4fpDznvKeCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:20.223152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05769","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f19a44b64f1f1d5cce3b81700bcb1a91744b4c50f6d70ebe3d5cda4a03ee6a93","sha256:3c012609bd6b435da9ae500188733a6d5c7af3b77d2ce6acb03bc1553fe601a6"],"state_sha256":"0e2f082c1f1137d8b265c978008bf547d77d92a45480bfed710116ee4fe3b75e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFYqRRjxsXDa2UgwG8sSj6RRiML8asiAy0n9L/V+XtG1zMwn5FnZZ1+hT80K/7nS8c7z+pPIebf9jMU9rD/IAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T13:58:58.252430Z","bundle_sha256":"5addf85b5089f2a00a1660d1a14482838b2b6eccaa41dedda1a28a5ca42afd39"}}