{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GCZ3HK6OXYY7BFYGFNWRO3HRNZ","short_pith_number":"pith:GCZ3HK6O","schema_version":"1.0","canonical_sha256":"30b3b3abcebe31f097062b6d176cf16e4238871cfaf46ff512aedffef79646ba","source":{"kind":"arxiv","id":"1411.1646","version":1},"attestation_state":"computed","paper":{"title":"Metric and non-metric proximity transformations at linear costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Gisbrecht, Frank-Michael Schleif","submitted_at":"2014-11-06T16:03:26Z","abstract_excerpt":"Domain specific (dis-)similarity or proximity measures used e.g. in alignment algorithms of sequence data, are popular to analyze complex data objects and to cover domain specific data properties. Without an underlying vector space these data are given as pairwise (dis-)similarities only. The few available methods for such data focus widely on similarities and do not scale to large data sets. Kernel methods are very effective for metric similarity matrices, also at large scale, but costly transformations are necessary starting with non-metric (dis-) similarities. We propose an integrative comb"},"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":"1411.1646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-06T16:03:26Z","cross_cats_sorted":[],"title_canon_sha256":"87ade03486a435a3e64d3b2a3d525f98d6238e899f6c3750c32bbfbd5ba603d3","abstract_canon_sha256":"c62b3be52249c35b79eba37af8735f699afeaca7e281036325961cf44ffc21f6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:27.290498Z","signature_b64":"A0sVhgGDlEyeXyiFG/q4yjH14qDM2OtfcRsvtm/IBjipmzc8ZOoPXfBCnLCl4SHKvDkDQ4AL4xtsjOJcSUW4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30b3b3abcebe31f097062b6d176cf16e4238871cfaf46ff512aedffef79646ba","last_reissued_at":"2026-05-18T02:38:27.289969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:27.289969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric and non-metric proximity transformations at linear costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrej Gisbrecht, Frank-Michael Schleif","submitted_at":"2014-11-06T16:03:26Z","abstract_excerpt":"Domain specific (dis-)similarity or proximity measures used e.g. in alignment algorithms of sequence data, are popular to analyze complex data objects and to cover domain specific data properties. Without an underlying vector space these data are given as pairwise (dis-)similarities only. The few available methods for such data focus widely on similarities and do not scale to large data sets. Kernel methods are very effective for metric similarity matrices, also at large scale, but costly transformations are necessary starting with non-metric (dis-) similarities. We propose an integrative comb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1646","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1411.1646","created_at":"2026-05-18T02:38:27.290053+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.1646v1","created_at":"2026-05-18T02:38:27.290053+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1646","created_at":"2026-05-18T02:38:27.290053+00:00"},{"alias_kind":"pith_short_12","alias_value":"GCZ3HK6OXYY7","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GCZ3HK6OXYY7BFYG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GCZ3HK6O","created_at":"2026-05-18T12:28:30.664211+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/GCZ3HK6OXYY7BFYGFNWRO3HRNZ","json":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ.json","graph_json":"https://pith.science/api/pith-number/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/graph.json","events_json":"https://pith.science/api/pith-number/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/events.json","paper":"https://pith.science/paper/GCZ3HK6O"},"agent_actions":{"view_html":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ","download_json":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ.json","view_paper":"https://pith.science/paper/GCZ3HK6O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.1646&json=true","fetch_graph":"https://pith.science/api/pith-number/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/action/storage_attestation","attest_author":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/action/author_attestation","sign_citation":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/action/citation_signature","submit_replication":"https://pith.science/pith/GCZ3HK6OXYY7BFYGFNWRO3HRNZ/action/replication_record"}},"created_at":"2026-05-18T02:38:27.290053+00:00","updated_at":"2026-05-18T02:38:27.290053+00:00"}