{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KLZXI47YT4L7GQAKY7P2KBSL5E","short_pith_number":"pith:KLZXI47Y","canonical_record":{"source":{"id":"1604.08714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-29T07:39:08Z","cross_cats_sorted":[],"title_canon_sha256":"85a175a25e5c8caea1c01a1450bf8596d3851d5a80e82f0a0a07a1894dbc7d58","abstract_canon_sha256":"40502de6c9f4ba54e978ee0ba7831fb1e31212d1414936f45edb2950514e8569"},"schema_version":"1.0"},"canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","source":{"kind":"arxiv","id":"1604.08714","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08714","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08714v2","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08714","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"KLZXI47YT4L7","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KLZXI47YT4L7GQAK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KLZXI47Y","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KLZXI47YT4L7GQAKY7P2KBSL5E","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08714","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-29T07:39:08Z","cross_cats_sorted":[],"title_canon_sha256":"85a175a25e5c8caea1c01a1450bf8596d3851d5a80e82f0a0a07a1894dbc7d58","abstract_canon_sha256":"40502de6c9f4ba54e978ee0ba7831fb1e31212d1414936f45edb2950514e8569"},"schema_version":"1.0"},"canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:54.868606Z","signature_b64":"VvljptifNt0oD4RDo23RZZRwhOZrJYJV5rB8vUmYlvIbntg7zoYy2/EEYvvxU69qc8gSxRXk325xhxdw1afCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","last_reissued_at":"2026-05-17T23:58:54.868127Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:54.868127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08714","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-17T23:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8UU+kWDcpp8ceSw2A7Yocj3BnjKKeED8GGd82YOdQD6kQSqJ9xfPhr+vDEDdr1+QNLh9S8GZtPs7dCClRIYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:40:03.756974Z"},"content_sha256":"1b05dc4b35ee604caea6607de7bc5875d514a20ceb350090c211628a19fbbf94","schema_version":"1.0","event_id":"sha256:1b05dc4b35ee604caea6607de7bc5875d514a20ceb350090c211628a19fbbf94"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KLZXI47YT4L7GQAKY7P2KBSL5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iterative Multiplicative Filters for Data Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Gabriele Steidl, Jan Henrik Fitschen, Johannes Persch, Ronny Bergmann","submitted_at":"2016-04-29T07:39:08Z","abstract_excerpt":"Based on an idea in [4] we propose a new iterative multiplicative filtering algorithm for label assignment matrices which can be used for the supervised partitioning of data. Starting with a row-normalized matrix containing the averaged distances between prior features and the observed ones the method assigns in a very efficient way labels to the data. We interpret the algorithm as a gradient ascent method with respect to a certain function on the product manifold of positive numbers followed by a reprojection onto a subset of the probability simplex consisting of vectors whose components are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08714","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-17T23:58:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jq0sIayhmNBMSxgGZJNOPe/ShaNsRYte4xxM+EsVisrfoMkTJ2RSorqVB/MSSUycEeeclKnquGQ01O/DObMvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:40:03.757326Z"},"content_sha256":"ae42aec5ff14eff8e5cb4f16a46d05dc066dda34b2e4e6335ccbc8bf5cad9b84","schema_version":"1.0","event_id":"sha256:ae42aec5ff14eff8e5cb4f16a46d05dc066dda34b2e4e6335ccbc8bf5cad9b84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/bundle.json","state_url":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/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-01T09:40:03Z","links":{"resolver":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E","bundle":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/bundle.json","state":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KLZXI47YT4L7GQAKY7P2KBSL5E","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":"40502de6c9f4ba54e978ee0ba7831fb1e31212d1414936f45edb2950514e8569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-29T07:39:08Z","title_canon_sha256":"85a175a25e5c8caea1c01a1450bf8596d3851d5a80e82f0a0a07a1894dbc7d58"},"schema_version":"1.0","source":{"id":"1604.08714","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08714","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08714v2","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08714","created_at":"2026-05-17T23:58:54Z"},{"alias_kind":"pith_short_12","alias_value":"KLZXI47YT4L7","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KLZXI47YT4L7GQAK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KLZXI47Y","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:ae42aec5ff14eff8e5cb4f16a46d05dc066dda34b2e4e6335ccbc8bf5cad9b84","target":"graph","created_at":"2026-05-17T23:58:54Z","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":"Based on an idea in [4] we propose a new iterative multiplicative filtering algorithm for label assignment matrices which can be used for the supervised partitioning of data. Starting with a row-normalized matrix containing the averaged distances between prior features and the observed ones the method assigns in a very efficient way labels to the data. We interpret the algorithm as a gradient ascent method with respect to a certain function on the product manifold of positive numbers followed by a reprojection onto a subset of the probability simplex consisting of vectors whose components are ","authors_text":"Gabriele Steidl, Jan Henrik Fitschen, Johannes Persch, Ronny Bergmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-29T07:39:08Z","title":"Iterative Multiplicative Filters for Data Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08714","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:1b05dc4b35ee604caea6607de7bc5875d514a20ceb350090c211628a19fbbf94","target":"record","created_at":"2026-05-17T23:58:54Z","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":"40502de6c9f4ba54e978ee0ba7831fb1e31212d1414936f45edb2950514e8569","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2016-04-29T07:39:08Z","title_canon_sha256":"85a175a25e5c8caea1c01a1450bf8596d3851d5a80e82f0a0a07a1894dbc7d58"},"schema_version":"1.0","source":{"id":"1604.08714","kind":"arxiv","version":2}},"canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","first_computed_at":"2026-05-17T23:58:54.868127Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:54.868127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VvljptifNt0oD4RDo23RZZRwhOZrJYJV5rB8vUmYlvIbntg7zoYy2/EEYvvxU69qc8gSxRXk325xhxdw1afCBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:54.868606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08714","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b05dc4b35ee604caea6607de7bc5875d514a20ceb350090c211628a19fbbf94","sha256:ae42aec5ff14eff8e5cb4f16a46d05dc066dda34b2e4e6335ccbc8bf5cad9b84"],"state_sha256":"bfc121b73021be80b43c399c16bd43c6a0e841bdd377a622c9d057b14bb3a2bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GeJEkwSW8SpvMR82i+IkSMvcUl72GJB+SrFJ0CKscc8uPfO9uLrh3L4tmBXNNcRftDjgmhz6MKeTcP4hQXH5CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:40:03.759216Z","bundle_sha256":"8de66802c58f5da2ed3e9a5a58805fc69f0b5125ef5bbade74629b41de05b4ee"}}