{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:J2ZT5MLOLEPYXVBKXM76VOB44Y","short_pith_number":"pith:J2ZT5MLO","canonical_record":{"source":{"id":"1807.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T08:45:45Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"0fb44c20c5bd6556bb953ab7681387d8a54db5d40d57593d7e1137c69c5b6c0b","abstract_canon_sha256":"cbbce85ea5f6e078d19f164dfd5713da890ab115f3b257d37874e46133421fc5"},"schema_version":"1.0"},"canonical_sha256":"4eb33eb16e591f8bd42abb3feab83ce62a1af64b9deecae614fb23cf61f6398f","source":{"kind":"arxiv","id":"1807.04001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04001","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04001v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04001","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"J2ZT5MLOLEPY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J2ZT5MLOLEPYXVBK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J2ZT5MLO","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:J2ZT5MLOLEPYXVBKXM76VOB44Y","target":"record","payload":{"canonical_record":{"source":{"id":"1807.04001","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T08:45:45Z","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"title_canon_sha256":"0fb44c20c5bd6556bb953ab7681387d8a54db5d40d57593d7e1137c69c5b6c0b","abstract_canon_sha256":"cbbce85ea5f6e078d19f164dfd5713da890ab115f3b257d37874e46133421fc5"},"schema_version":"1.0"},"canonical_sha256":"4eb33eb16e591f8bd42abb3feab83ce62a1af64b9deecae614fb23cf61f6398f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:58.356989Z","signature_b64":"ChBchBkgM/uhWcfuvzuTqRRXzWTq18npbVphdBiwRPf48edeTdrenwZ/jk7XEdnrgy/OH5UBrlgsukX/79m+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eb33eb16e591f8bd42abb3feab83ce62a1af64b9deecae614fb23cf61f6398f","last_reissued_at":"2026-05-18T00:10:58.356148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:58.356148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.04001","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zdKeCV3UT1ZYzID5nmMIFo7XW1IXmHWMRyN1n3cRoWdc4oa8JjoPKwWNG3Cr+3PbKHGeamLM7EGbteP7861GBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:12:42.589031Z"},"content_sha256":"4673dd23d48bf04e8cb0d138f00ad22020bd79c6ef31a5ad4fa46e0b67a71171","schema_version":"1.0","event_id":"sha256:4673dd23d48bf04e8cb0d138f00ad22020bd79c6ef31a5ad4fa46e0b67a71171"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:J2ZT5MLOLEPYXVBKXM76VOB44Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Neural Models for End-to-End Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Benjamin Bruno Meier, Ismail Elezi, Mohammadreza Amirian, Oliver Durr, Thilo Stadelmann","submitted_at":"2018-07-11T08:45:45Z","abstract_excerpt":"We propose a novel end-to-end neural network architecture that, once trained, directly outputs a probabilistic clustering of a batch of input examples in one pass. It estimates a distribution over the number of clusters $k$, and for each $1 \\leq k \\leq k_\\mathrm{max}$, a distribution over the individual cluster assignment for each data point. The network is trained in advance in a supervised fashion on separate data to learn grouping by any perceptual similarity criterion based on pairwise labels (same/different group). It can then be applied to different data containing different groups. We d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04001","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:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7rhr/jxB0V26IwBueewu9mgmGda9SlPvKIz5Qs/BddaH3gDgGGs1seZVv8r4cybVRWrUnKLLRNRzdBphBSMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T18:12:42.589399Z"},"content_sha256":"fede1277e008ad0130eb649e28b56b4ee0b84051344d7f4c9d68e80ad4f66b7c","schema_version":"1.0","event_id":"sha256:fede1277e008ad0130eb649e28b56b4ee0b84051344d7f4c9d68e80ad4f66b7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/bundle.json","state_url":"https://pith.science/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/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-05-19T18:12:42Z","links":{"resolver":"https://pith.science/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y","bundle":"https://pith.science/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/bundle.json","state":"https://pith.science/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2ZT5MLOLEPYXVBKXM76VOB44Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:J2ZT5MLOLEPYXVBKXM76VOB44Y","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":"cbbce85ea5f6e078d19f164dfd5713da890ab115f3b257d37874e46133421fc5","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T08:45:45Z","title_canon_sha256":"0fb44c20c5bd6556bb953ab7681387d8a54db5d40d57593d7e1137c69c5b6c0b"},"schema_version":"1.0","source":{"id":"1807.04001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04001","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04001v1","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04001","created_at":"2026-05-18T00:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"J2ZT5MLOLEPY","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"J2ZT5MLOLEPYXVBK","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"J2ZT5MLO","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:fede1277e008ad0130eb649e28b56b4ee0b84051344d7f4c9d68e80ad4f66b7c","target":"graph","created_at":"2026-05-18T00:10:58Z","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 propose a novel end-to-end neural network architecture that, once trained, directly outputs a probabilistic clustering of a batch of input examples in one pass. It estimates a distribution over the number of clusters $k$, and for each $1 \\leq k \\leq k_\\mathrm{max}$, a distribution over the individual cluster assignment for each data point. The network is trained in advance in a supervised fashion on separate data to learn grouping by any perceptual similarity criterion based on pairwise labels (same/different group). It can then be applied to different data containing different groups. We d","authors_text":"Benjamin Bruno Meier, Ismail Elezi, Mohammadreza Amirian, Oliver Durr, Thilo Stadelmann","cross_cats":["cs.AI","cs.CV","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T08:45:45Z","title":"Learning Neural Models for End-to-End Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04001","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:4673dd23d48bf04e8cb0d138f00ad22020bd79c6ef31a5ad4fa46e0b67a71171","target":"record","created_at":"2026-05-18T00:10:58Z","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":"cbbce85ea5f6e078d19f164dfd5713da890ab115f3b257d37874e46133421fc5","cross_cats_sorted":["cs.AI","cs.CV","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-11T08:45:45Z","title_canon_sha256":"0fb44c20c5bd6556bb953ab7681387d8a54db5d40d57593d7e1137c69c5b6c0b"},"schema_version":"1.0","source":{"id":"1807.04001","kind":"arxiv","version":1}},"canonical_sha256":"4eb33eb16e591f8bd42abb3feab83ce62a1af64b9deecae614fb23cf61f6398f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4eb33eb16e591f8bd42abb3feab83ce62a1af64b9deecae614fb23cf61f6398f","first_computed_at":"2026-05-18T00:10:58.356148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:58.356148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ChBchBkgM/uhWcfuvzuTqRRXzWTq18npbVphdBiwRPf48edeTdrenwZ/jk7XEdnrgy/OH5UBrlgsukX/79m+AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:58.356989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4673dd23d48bf04e8cb0d138f00ad22020bd79c6ef31a5ad4fa46e0b67a71171","sha256:fede1277e008ad0130eb649e28b56b4ee0b84051344d7f4c9d68e80ad4f66b7c"],"state_sha256":"bac11ff247bad1d1f8e44409f318e18ec98f1c188f68224bb1b0ccaf58e89652"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OulvzrFxviWZxLwp5sNX0hcdMWiMfxdEhX3uMSoglFBulZw6Ii+B+7X4xPo1hhbjJuav2aMtR1D5N8EpwJGtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T18:12:42.591648Z","bundle_sha256":"6ccf7b2f407de2a54af4ebfd4cefaaad30a1676330c9034a52577046bfdfa34f"}}