{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:FITIHWNWSVJEJVHNMNHTAPL6C7","short_pith_number":"pith:FITIHWNW","canonical_record":{"source":{"id":"1009.4962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-09-25T00:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"7a693572330ec804bf9c9761f46f41750c47ab41da3707581d19546ddf9d7b86","abstract_canon_sha256":"dcb05659b05ec90fbedee29efe980c0ba78ed59006fc58e738fd312fb00ee530"},"schema_version":"1.0"},"canonical_sha256":"2a2683d9b6955244d4ed634f303d7e17ea88a479641db45cbfe95446d56d3ca4","source":{"kind":"arxiv","id":"1009.4962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4962","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4962v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4962","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"FITIHWNWSVJE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FITIHWNWSVJEJVHN","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FITIHWNW","created_at":"2026-05-18T12:26:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:FITIHWNWSVJEJVHNMNHTAPL6C7","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-09-25T00:59:18Z","cross_cats_sorted":[],"title_canon_sha256":"7a693572330ec804bf9c9761f46f41750c47ab41da3707581d19546ddf9d7b86","abstract_canon_sha256":"dcb05659b05ec90fbedee29efe980c0ba78ed59006fc58e738fd312fb00ee530"},"schema_version":"1.0"},"canonical_sha256":"2a2683d9b6955244d4ed634f303d7e17ea88a479641db45cbfe95446d56d3ca4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:19.682237Z","signature_b64":"59QNgfvfSlz/tdzKOsbYIawRxin7X/cSEj4RA1MfAae6U9y0gVW++mSnu/CuzGPuZ5Ra+d/En3eEQ4GDIkwgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a2683d9b6955244d4ed634f303d7e17ea88a479641db45cbfe95446d56d3ca4","last_reissued_at":"2026-05-18T04:40:19.681421Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:19.681421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4962","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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dhG8dQB81nlloVcQ/+0iDZKhKHJLzMu/tblKLaPb2KF48Iq+Tx0LDOmmGu/8fk6Xp0VNYBr8KPNG25OfKpaBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:22.237339Z"},"content_sha256":"082a868f0d11adf3a3ac59af8df7e7d9b8f305e15eca01bf2ddbeaddfcc9490c","schema_version":"1.0","event_id":"sha256:082a868f0d11adf3a3ac59af8df7e7d9b8f305e15eca01bf2ddbeaddfcc9490c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:FITIHWNWSVJEJVHNMNHTAPL6C7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"RGANN: An Efficient Algorithm to Extract Rules from ANNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"S. M. Kamruzzaman","submitted_at":"2010-09-25T00:59:18Z","abstract_excerpt":"This paper describes an efficient rule generation algorithm, called rule generation from artificial neural networks (RGANN) to generate symbolic rules from ANNs. Classification rules are sought in many areas from automatic knowledge acquisition to data mining and ANN rule extraction. This is because classification rules possess some attractive features. They are explicit, understandable and verifiable by domain experts, and can be modified, extended and passed on as modular knowledge. A standard three-layer feedforward ANN is the basis of the algorithm. A four-phase training algorithm is propo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4962","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:40:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rlz10g9hGb7BfRkdY1zna2h7A4veYIYa0WzN9BC3fFZ35uyLJRuc2rqMVUTrkyxzPMl+NvEN1TW71Ca/bJm9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:59:22.237690Z"},"content_sha256":"33601edc99669e6b7be322013a4430452e725cb01f53987cd56ce72fc2784911","schema_version":"1.0","event_id":"sha256:33601edc99669e6b7be322013a4430452e725cb01f53987cd56ce72fc2784911"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/bundle.json","state_url":"https://pith.science/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/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-08T09:59:22Z","links":{"resolver":"https://pith.science/pith/FITIHWNWSVJEJVHNMNHTAPL6C7","bundle":"https://pith.science/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/bundle.json","state":"https://pith.science/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FITIHWNWSVJEJVHNMNHTAPL6C7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:FITIHWNWSVJEJVHNMNHTAPL6C7","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":"dcb05659b05ec90fbedee29efe980c0ba78ed59006fc58e738fd312fb00ee530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-09-25T00:59:18Z","title_canon_sha256":"7a693572330ec804bf9c9761f46f41750c47ab41da3707581d19546ddf9d7b86"},"schema_version":"1.0","source":{"id":"1009.4962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4962","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4962v1","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4962","created_at":"2026-05-18T04:40:19Z"},{"alias_kind":"pith_short_12","alias_value":"FITIHWNWSVJE","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_16","alias_value":"FITIHWNWSVJEJVHN","created_at":"2026-05-18T12:26:07Z"},{"alias_kind":"pith_short_8","alias_value":"FITIHWNW","created_at":"2026-05-18T12:26:07Z"}],"graph_snapshots":[{"event_id":"sha256:33601edc99669e6b7be322013a4430452e725cb01f53987cd56ce72fc2784911","target":"graph","created_at":"2026-05-18T04:40:19Z","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 describes an efficient rule generation algorithm, called rule generation from artificial neural networks (RGANN) to generate symbolic rules from ANNs. Classification rules are sought in many areas from automatic knowledge acquisition to data mining and ANN rule extraction. This is because classification rules possess some attractive features. They are explicit, understandable and verifiable by domain experts, and can be modified, extended and passed on as modular knowledge. A standard three-layer feedforward ANN is the basis of the algorithm. A four-phase training algorithm is propo","authors_text":"S. M. Kamruzzaman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-09-25T00:59:18Z","title":"RGANN: An Efficient Algorithm to Extract Rules from ANNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4962","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:082a868f0d11adf3a3ac59af8df7e7d9b8f305e15eca01bf2ddbeaddfcc9490c","target":"record","created_at":"2026-05-18T04:40:19Z","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":"dcb05659b05ec90fbedee29efe980c0ba78ed59006fc58e738fd312fb00ee530","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2010-09-25T00:59:18Z","title_canon_sha256":"7a693572330ec804bf9c9761f46f41750c47ab41da3707581d19546ddf9d7b86"},"schema_version":"1.0","source":{"id":"1009.4962","kind":"arxiv","version":1}},"canonical_sha256":"2a2683d9b6955244d4ed634f303d7e17ea88a479641db45cbfe95446d56d3ca4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a2683d9b6955244d4ed634f303d7e17ea88a479641db45cbfe95446d56d3ca4","first_computed_at":"2026-05-18T04:40:19.681421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:40:19.681421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"59QNgfvfSlz/tdzKOsbYIawRxin7X/cSEj4RA1MfAae6U9y0gVW++mSnu/CuzGPuZ5Ra+d/En3eEQ4GDIkwgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:40:19.682237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:082a868f0d11adf3a3ac59af8df7e7d9b8f305e15eca01bf2ddbeaddfcc9490c","sha256:33601edc99669e6b7be322013a4430452e725cb01f53987cd56ce72fc2784911"],"state_sha256":"ac4acbf11d5afc9d1a16e148fe4b9b7380bbd11193da28e10392fe96807eecf4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6JK6TJEYC9j+6n9CYqT/3Sx4ZV160Mz+fAICZZeQM/aChXwEaQaE3YpCYqpXSdyQHldtr2aDon0mQGIoPmxOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:59:22.239859Z","bundle_sha256":"b4d79247e883b4e30559e3aab9cc8227d5ccd25ceaa88d9be08fa09413d67e04"}}