{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:ND3FXW746URDKD3W4FWQRNONEZ","short_pith_number":"pith:ND3FXW74","canonical_record":{"source":{"id":"2506.06986","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T04:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"960f5508a5b86ea8d4755226754ba5873a92fb02d9d793a79079de5c5cc0e31a","abstract_canon_sha256":"6cf1cc152a2ebba15555df031b7663182f96e6b3650f2b34967f02f608d07d20"},"schema_version":"1.0"},"canonical_sha256":"68f65bdbfcf522350f76e16d08b5cd265f4a6d3b98de3f0e57cf837dc908dd9b","source":{"kind":"arxiv","id":"2506.06986","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06986","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06986v1","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06986","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"ND3FXW746URD","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"ND3FXW746URDKD3W","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"ND3FXW74","created_at":"2026-07-05T11:17:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:ND3FXW746URDKD3W4FWQRNONEZ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.06986","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T04:00:22Z","cross_cats_sorted":[],"title_canon_sha256":"960f5508a5b86ea8d4755226754ba5873a92fb02d9d793a79079de5c5cc0e31a","abstract_canon_sha256":"6cf1cc152a2ebba15555df031b7663182f96e6b3650f2b34967f02f608d07d20"},"schema_version":"1.0"},"canonical_sha256":"68f65bdbfcf522350f76e16d08b5cd265f4a6d3b98de3f0e57cf837dc908dd9b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:59.319117Z","signature_b64":"fNpZjL5/aHJEice7vOPWquiEQ7EvPNboff4FCTIxDQSU9izKmo7HS70Om/7aU9xOjVLtgK/GsOZVGMS9g8aLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f65bdbfcf522350f76e16d08b5cd265f4a6d3b98de3f0e57cf837dc908dd9b","last_reissued_at":"2026-07-05T11:17:59.318632Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:59.318632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.06986","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-07-05T11:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ytNyGcZMEytElxkS5EqOgwAH0ckzAuPCvDlX7PAliAHfvEqvShQo6VpNp760BC7SjrsAfeqswUkOh17Dhxn8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:50.289629Z"},"content_sha256":"2a5b3cd413301513e2f942deac9d295fe80b1241eeba3a09e15518a6979818e6","schema_version":"1.0","event_id":"sha256:2a5b3cd413301513e2f942deac9d295fe80b1241eeba3a09e15518a6979818e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:ND3FXW746URDKD3W4FWQRNONEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Explainable Classification Models Using Hyperblocks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Austin Snyder, Boris Kovalerchuk, Ryan Gallagher","submitted_at":"2025-06-08T04:00:22Z","abstract_excerpt":"Building on existing work with Hyperblocks, which classify data using minimum and maximum bounds for each attribute, we focus on enhancing interpretability, decreasing training time, and reducing model complexity without sacrificing accuracy. This system allows subject matter experts (SMEs) to directly inspect and understand the model's decision logic without requiring extensive machine learning expertise. To reduce Hyperblock complexity while retaining performance, we introduce a suite of algorithms for Hyperblock simplification. These include removing redundant attributes, removing redundant"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06986","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/2506.06986/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-05T11:17:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B2r8svvbVbBk/c0hINMuY/RLsDfYcOoRqEI9WiJQeOUPJUt4MiWPboN56bkJQdNmHQ82Ere2rZJvKd++dXdWDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:28:50.289996Z"},"content_sha256":"b33c804520819a5c16f5635318b3e4b8b7ca3c8aab540427d335db0666b93f89","schema_version":"1.0","event_id":"sha256:b33c804520819a5c16f5635318b3e4b8b7ca3c8aab540427d335db0666b93f89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ND3FXW746URDKD3W4FWQRNONEZ/bundle.json","state_url":"https://pith.science/pith/ND3FXW746URDKD3W4FWQRNONEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ND3FXW746URDKD3W4FWQRNONEZ/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-07-06T20:28:50Z","links":{"resolver":"https://pith.science/pith/ND3FXW746URDKD3W4FWQRNONEZ","bundle":"https://pith.science/pith/ND3FXW746URDKD3W4FWQRNONEZ/bundle.json","state":"https://pith.science/pith/ND3FXW746URDKD3W4FWQRNONEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ND3FXW746URDKD3W4FWQRNONEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:ND3FXW746URDKD3W4FWQRNONEZ","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":"6cf1cc152a2ebba15555df031b7663182f96e6b3650f2b34967f02f608d07d20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T04:00:22Z","title_canon_sha256":"960f5508a5b86ea8d4755226754ba5873a92fb02d9d793a79079de5c5cc0e31a"},"schema_version":"1.0","source":{"id":"2506.06986","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.06986","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"arxiv_version","alias_value":"2506.06986v1","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.06986","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_12","alias_value":"ND3FXW746URD","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_16","alias_value":"ND3FXW746URDKD3W","created_at":"2026-07-05T11:17:59Z"},{"alias_kind":"pith_short_8","alias_value":"ND3FXW74","created_at":"2026-07-05T11:17:59Z"}],"graph_snapshots":[{"event_id":"sha256:b33c804520819a5c16f5635318b3e4b8b7ca3c8aab540427d335db0666b93f89","target":"graph","created_at":"2026-07-05T11:17:59Z","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/2506.06986/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Building on existing work with Hyperblocks, which classify data using minimum and maximum bounds for each attribute, we focus on enhancing interpretability, decreasing training time, and reducing model complexity without sacrificing accuracy. This system allows subject matter experts (SMEs) to directly inspect and understand the model's decision logic without requiring extensive machine learning expertise. To reduce Hyperblock complexity while retaining performance, we introduce a suite of algorithms for Hyperblock simplification. These include removing redundant attributes, removing redundant","authors_text":"Austin Snyder, Boris Kovalerchuk, Ryan Gallagher","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T04:00:22Z","title":"Fully Explainable Classification Models Using Hyperblocks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.06986","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:2a5b3cd413301513e2f942deac9d295fe80b1241eeba3a09e15518a6979818e6","target":"record","created_at":"2026-07-05T11:17:59Z","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":"6cf1cc152a2ebba15555df031b7663182f96e6b3650f2b34967f02f608d07d20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-06-08T04:00:22Z","title_canon_sha256":"960f5508a5b86ea8d4755226754ba5873a92fb02d9d793a79079de5c5cc0e31a"},"schema_version":"1.0","source":{"id":"2506.06986","kind":"arxiv","version":1}},"canonical_sha256":"68f65bdbfcf522350f76e16d08b5cd265f4a6d3b98de3f0e57cf837dc908dd9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f65bdbfcf522350f76e16d08b5cd265f4a6d3b98de3f0e57cf837dc908dd9b","first_computed_at":"2026-07-05T11:17:59.318632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:59.318632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fNpZjL5/aHJEice7vOPWquiEQ7EvPNboff4FCTIxDQSU9izKmo7HS70Om/7aU9xOjVLtgK/GsOZVGMS9g8aLBA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:59.319117Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.06986","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a5b3cd413301513e2f942deac9d295fe80b1241eeba3a09e15518a6979818e6","sha256:b33c804520819a5c16f5635318b3e4b8b7ca3c8aab540427d335db0666b93f89"],"state_sha256":"c6f3555139b8f702f6ff61cf760e138455b8d340d58d432b893deb81e2317223"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u1xYbqZGYzZeu5IhnzTa1efY/mbT24xDfIEe281HM4eYKsA9XAr+ePis5Swo+7I9TuOPJEvJDw3vX8h0WxSuCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:28:50.291883Z","bundle_sha256":"c0d38c19bb4b03e28b5e875f8cbf375943c31e7262be2eb35cea6cba41188c2f"}}