{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XDJYWASRVSUIAUSBGNJJOYJNPV","short_pith_number":"pith:XDJYWASR","canonical_record":{"source":{"id":"1809.03041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-09T20:37:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef6bbe9b615b29799b0443348dd55d6eb448dbf19f81cc339bf96cd85c5f3745","abstract_canon_sha256":"f184c4ffba1aba64df97f7d53ac5c17b4132d20d9bb5f9896fee98a392d9a7c2"},"schema_version":"1.0"},"canonical_sha256":"b8d38b0251aca8805241335297612d7d7e7bcac103962ae6fd051aba4e20a8e2","source":{"kind":"arxiv","id":"1809.03041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03041","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03041v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03041","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"XDJYWASRVSUI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XDJYWASRVSUIAUSB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XDJYWASR","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XDJYWASRVSUIAUSBGNJJOYJNPV","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-09T20:37:10Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ef6bbe9b615b29799b0443348dd55d6eb448dbf19f81cc339bf96cd85c5f3745","abstract_canon_sha256":"f184c4ffba1aba64df97f7d53ac5c17b4132d20d9bb5f9896fee98a392d9a7c2"},"schema_version":"1.0"},"canonical_sha256":"b8d38b0251aca8805241335297612d7d7e7bcac103962ae6fd051aba4e20a8e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:10.257786Z","signature_b64":"twTg7yQquaD1aAew57mdtpOu8iN2CSyb6Uo86i9DfqOBsAVEz9DuhwWHRlfeeZOuFZy9tia+jvslncxr92lKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8d38b0251aca8805241335297612d7d7e7bcac103962ae6fd051aba4e20a8e2","last_reissued_at":"2026-05-18T00:06:10.257193Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:10.257193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03041","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb5skbomfBOQaHkzppeukFLYJDwvlizc42AGRMVBwC8LC1ujQDeyKOftZx8gI8VyEanXZQW2llxU8V9qGIIJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:42:55.087802Z"},"content_sha256":"ef37b14a58136e28c9c71f707cdbaf9ca565c2b4977f49812cd66d5c2919106f","schema_version":"1.0","event_id":"sha256:ef37b14a58136e28c9c71f707cdbaf9ca565c2b4977f49812cd66d5c2919106f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XDJYWASRVSUIAUSBGNJJOYJNPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An iterative method for classification of binary data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Deanna Needell, Denali Molitor","submitted_at":"2018-09-09T20:37:10Z","abstract_excerpt":"In today's data driven world, storing, processing, and gleaning insights from large-scale data are major challenges. Data compression is often required in order to store large amounts of high-dimensional data, and thus, efficient inference methods for analyzing compressed data are necessary. Building on a recently designed simple framework for classification using binary data, we demonstrate that one can improve classification accuracy of this approach through iterative applications whose output serves as input to the next application. As a side consequence, we show that the original framework"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03041","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:06:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYPimN7RWgysZ3i5ldW7C4WIZaKClI7bDs22Uc/4mjdpvc+dYvfe4x85euzklOvbtjfV0JEJLzPt2wJx5bi6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T23:42:55.088142Z"},"content_sha256":"8d5178d9839ba1103e0424335ceaa2e4e69a68e6e1223215f32c561dc3ba277d","schema_version":"1.0","event_id":"sha256:8d5178d9839ba1103e0424335ceaa2e4e69a68e6e1223215f32c561dc3ba277d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/bundle.json","state_url":"https://pith.science/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/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-30T23:42:55Z","links":{"resolver":"https://pith.science/pith/XDJYWASRVSUIAUSBGNJJOYJNPV","bundle":"https://pith.science/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/bundle.json","state":"https://pith.science/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDJYWASRVSUIAUSBGNJJOYJNPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XDJYWASRVSUIAUSBGNJJOYJNPV","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":"f184c4ffba1aba64df97f7d53ac5c17b4132d20d9bb5f9896fee98a392d9a7c2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-09T20:37:10Z","title_canon_sha256":"ef6bbe9b615b29799b0443348dd55d6eb448dbf19f81cc339bf96cd85c5f3745"},"schema_version":"1.0","source":{"id":"1809.03041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03041","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03041v1","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03041","created_at":"2026-05-18T00:06:10Z"},{"alias_kind":"pith_short_12","alias_value":"XDJYWASRVSUI","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XDJYWASRVSUIAUSB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XDJYWASR","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:8d5178d9839ba1103e0424335ceaa2e4e69a68e6e1223215f32c561dc3ba277d","target":"graph","created_at":"2026-05-18T00:06:10Z","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":"In today's data driven world, storing, processing, and gleaning insights from large-scale data are major challenges. Data compression is often required in order to store large amounts of high-dimensional data, and thus, efficient inference methods for analyzing compressed data are necessary. Building on a recently designed simple framework for classification using binary data, we demonstrate that one can improve classification accuracy of this approach through iterative applications whose output serves as input to the next application. As a side consequence, we show that the original framework","authors_text":"Deanna Needell, Denali Molitor","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-09T20:37:10Z","title":"An iterative method for classification of binary data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03041","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:ef37b14a58136e28c9c71f707cdbaf9ca565c2b4977f49812cd66d5c2919106f","target":"record","created_at":"2026-05-18T00:06:10Z","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":"f184c4ffba1aba64df97f7d53ac5c17b4132d20d9bb5f9896fee98a392d9a7c2","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-09-09T20:37:10Z","title_canon_sha256":"ef6bbe9b615b29799b0443348dd55d6eb448dbf19f81cc339bf96cd85c5f3745"},"schema_version":"1.0","source":{"id":"1809.03041","kind":"arxiv","version":1}},"canonical_sha256":"b8d38b0251aca8805241335297612d7d7e7bcac103962ae6fd051aba4e20a8e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8d38b0251aca8805241335297612d7d7e7bcac103962ae6fd051aba4e20a8e2","first_computed_at":"2026-05-18T00:06:10.257193Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:10.257193Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"twTg7yQquaD1aAew57mdtpOu8iN2CSyb6Uo86i9DfqOBsAVEz9DuhwWHRlfeeZOuFZy9tia+jvslncxr92lKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:10.257786Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef37b14a58136e28c9c71f707cdbaf9ca565c2b4977f49812cd66d5c2919106f","sha256:8d5178d9839ba1103e0424335ceaa2e4e69a68e6e1223215f32c561dc3ba277d"],"state_sha256":"12f0ace5ccd685f19709167c3e4ef8270446b3865186345650ddde92e22e876a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/IkluMNqYBVPtZQ9z+c8n8u2+Rz3wRDtnXOi1iXEQIhD3CqNM4uyvBscys5/u2S81jx2BFY+5U5Y3huU2TiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T23:42:55.090124Z","bundle_sha256":"473ab275869b8b0c171db4691c58461273affc1a5a00f5c6fa6a2e8867317516"}}