{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ABGJM2AEHZT5NT3IZWM2C2DZIA","short_pith_number":"pith:ABGJM2AE","canonical_record":{"source":{"id":"1503.04059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-03-13T13:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"83cdb6cdaac71afdcd6bed520f77340f0a85a56b764e43ab8437b51237ded0c9","abstract_canon_sha256":"d97844d1b172a06346e8372e1abc2d67ef2a45f4a8429beeec55471d7d8245a1"},"schema_version":"1.0"},"canonical_sha256":"004c9668043e67d6cf68cd99a16879401265a2e61088c94b8659c4178189b144","source":{"kind":"arxiv","id":"1503.04059","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04059","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04059v2","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04059","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"ABGJM2AEHZT5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ABGJM2AEHZT5NT3I","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ABGJM2AE","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ABGJM2AEHZT5NT3IZWM2C2DZIA","target":"record","payload":{"canonical_record":{"source":{"id":"1503.04059","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-03-13T13:30:36Z","cross_cats_sorted":[],"title_canon_sha256":"83cdb6cdaac71afdcd6bed520f77340f0a85a56b764e43ab8437b51237ded0c9","abstract_canon_sha256":"d97844d1b172a06346e8372e1abc2d67ef2a45f4a8429beeec55471d7d8245a1"},"schema_version":"1.0"},"canonical_sha256":"004c9668043e67d6cf68cd99a16879401265a2e61088c94b8659c4178189b144","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:18.853406Z","signature_b64":"hcvDHZp4shX7qK8kuoljUZ05yNOi7L8DN3t8kjabJrL1l2YZDawqQUBs0haoWk/inKkrTGq7v8D+8DcvmT33Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"004c9668043e67d6cf68cd99a16879401265a2e61088c94b8659c4178189b144","last_reissued_at":"2026-05-18T01:16:18.852715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:18.852715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.04059","source_version":2,"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-18T01:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BgFZhoUPZwNOy7diZWP6t1REiW9OWwywUn00SycaEeH/dKErjUqYxWw03s9l7PAmcaxoT5HO9qeff0obZlZiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:30:10.679730Z"},"content_sha256":"3fc948be522d5f7509d0b1aaf0874c408f4982768f38446b6e340a43d9da7f97","schema_version":"1.0","event_id":"sha256:3fc948be522d5f7509d0b1aaf0874c408f4982768f38446b6e340a43d9da7f97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ABGJM2AEHZT5NT3IZWM2C2DZIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Expectation-Maximization Binary Clustering for Behavioural Annotation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.QM","authors_text":"Aitana Oltra, Frederic Bartumeus, Joan Garriga, John R. Palmer","submitted_at":"2015-03-13T13:30:36Z","abstract_excerpt":"We present a variant of the well sounded Expectation-Maximization Clustering algorithm that is constrained to generate partitions of the input space into high and low values. The motivation of splitting input variables into high and low values is to favour the semantic interpretation of the final clustering. The Expectation-Maximization binary Clustering is specially useful when a bimodal conditional distribution of the variables is expected or at least when a binary discretization of the input space is deemed meaningful. Furthermore, the algorithm deals with the reliability of the input data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04059","kind":"arxiv","version":2},"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-18T01:16:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NO5sj22OnhdPpU3MoJikvmFG+kKd0QFbFTBIqTQ2RK+AYhZBHmcceCRjTm3nQ8hARdAdW/+wo+K1sFLWDmcICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:30:10.680078Z"},"content_sha256":"c892aa1f4324d74b6dbe291c77471aaed14d07d22cda8c90bd096b25ffcf1183","schema_version":"1.0","event_id":"sha256:c892aa1f4324d74b6dbe291c77471aaed14d07d22cda8c90bd096b25ffcf1183"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/bundle.json","state_url":"https://pith.science/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/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-24T04:30:10Z","links":{"resolver":"https://pith.science/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA","bundle":"https://pith.science/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/bundle.json","state":"https://pith.science/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ABGJM2AEHZT5NT3IZWM2C2DZIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ABGJM2AEHZT5NT3IZWM2C2DZIA","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":"d97844d1b172a06346e8372e1abc2d67ef2a45f4a8429beeec55471d7d8245a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-03-13T13:30:36Z","title_canon_sha256":"83cdb6cdaac71afdcd6bed520f77340f0a85a56b764e43ab8437b51237ded0c9"},"schema_version":"1.0","source":{"id":"1503.04059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04059","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04059v2","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04059","created_at":"2026-05-18T01:16:18Z"},{"alias_kind":"pith_short_12","alias_value":"ABGJM2AEHZT5","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"ABGJM2AEHZT5NT3I","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"ABGJM2AE","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c892aa1f4324d74b6dbe291c77471aaed14d07d22cda8c90bd096b25ffcf1183","target":"graph","created_at":"2026-05-18T01:16:18Z","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":"We present a variant of the well sounded Expectation-Maximization Clustering algorithm that is constrained to generate partitions of the input space into high and low values. The motivation of splitting input variables into high and low values is to favour the semantic interpretation of the final clustering. The Expectation-Maximization binary Clustering is specially useful when a bimodal conditional distribution of the variables is expected or at least when a binary discretization of the input space is deemed meaningful. Furthermore, the algorithm deals with the reliability of the input data ","authors_text":"Aitana Oltra, Frederic Bartumeus, Joan Garriga, John R. Palmer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-03-13T13:30:36Z","title":"Expectation-Maximization Binary Clustering for Behavioural Annotation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04059","kind":"arxiv","version":2},"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:3fc948be522d5f7509d0b1aaf0874c408f4982768f38446b6e340a43d9da7f97","target":"record","created_at":"2026-05-18T01:16:18Z","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":"d97844d1b172a06346e8372e1abc2d67ef2a45f4a8429beeec55471d7d8245a1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2015-03-13T13:30:36Z","title_canon_sha256":"83cdb6cdaac71afdcd6bed520f77340f0a85a56b764e43ab8437b51237ded0c9"},"schema_version":"1.0","source":{"id":"1503.04059","kind":"arxiv","version":2}},"canonical_sha256":"004c9668043e67d6cf68cd99a16879401265a2e61088c94b8659c4178189b144","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"004c9668043e67d6cf68cd99a16879401265a2e61088c94b8659c4178189b144","first_computed_at":"2026-05-18T01:16:18.852715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:18.852715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hcvDHZp4shX7qK8kuoljUZ05yNOi7L8DN3t8kjabJrL1l2YZDawqQUBs0haoWk/inKkrTGq7v8D+8DcvmT33Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:18.853406Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fc948be522d5f7509d0b1aaf0874c408f4982768f38446b6e340a43d9da7f97","sha256:c892aa1f4324d74b6dbe291c77471aaed14d07d22cda8c90bd096b25ffcf1183"],"state_sha256":"e24350bccc1cad6469cdb770605913cbc269c537f93b23b1420f2e3d10894d15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL6R0X58DL52rOG8rqwWVNySvjIL/pBQUCKMPf0UfspS7J4ftnUtL9vvYjcqAd8NTf2oDCu2+WT/dpWmXeCwCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:30:10.682010Z","bundle_sha256":"5733aeff60bac6624dad7d1a1028f4aadb186d8525c890fe6d93ab98a8cef957"}}