{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KLZXI47YT4L7GQAKY7P2KBSL5E","short_pith_number":"pith:KLZXI47Y","schema_version":"1.0","canonical_sha256":"52f37473f89f17f3400ac7dfa5064be90c954fa667351facd91801384ba39839","source":{"kind":"arxiv","id":"1604.08714","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.08714","created_at":"2026-05-17T23:58:54.868188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.08714v2","created_at":"2026-05-17T23:58:54.868188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08714","created_at":"2026-05-17T23:58:54.868188+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLZXI47YT4L7","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLZXI47YT4L7GQAK","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLZXI47Y","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E","json":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E.json","graph_json":"https://pith.science/api/pith-number/KLZXI47YT4L7GQAKY7P2KBSL5E/graph.json","events_json":"https://pith.science/api/pith-number/KLZXI47YT4L7GQAKY7P2KBSL5E/events.json","paper":"https://pith.science/paper/KLZXI47Y"},"agent_actions":{"view_html":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E","download_json":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E.json","view_paper":"https://pith.science/paper/KLZXI47Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.08714&json=true","fetch_graph":"https://pith.science/api/pith-number/KLZXI47YT4L7GQAKY7P2KBSL5E/graph.json","fetch_events":"https://pith.science/api/pith-number/KLZXI47YT4L7GQAKY7P2KBSL5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/action/storage_attestation","attest_author":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/action/author_attestation","sign_citation":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/action/citation_signature","submit_replication":"https://pith.science/pith/KLZXI47YT4L7GQAKY7P2KBSL5E/action/replication_record"}},"created_at":"2026-05-17T23:58:54.868188+00:00","updated_at":"2026-05-17T23:58:54.868188+00:00"}