{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:UVNT7HF2SVKUXAW654Z4GUTEAQ","short_pith_number":"pith:UVNT7HF2","canonical_record":{"source":{"id":"2202.06866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T16:48:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"73ee915ebd3aa3dbdbe38dbde84bc25284e3d77e41070cc91866454bdc7e81f8","abstract_canon_sha256":"122c6559a415bc202a9a53c2a4a1ba186e57c750123c074abe46fc2cebec08c5"},"schema_version":"1.0"},"canonical_sha256":"a55b3f9cba95554b82deef33c352640422c420a5a34f5cfae19dd844d07d3708","source":{"kind":"arxiv","id":"2202.06866","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06866","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06866v1","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06866","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_12","alias_value":"UVNT7HF2SVKU","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_16","alias_value":"UVNT7HF2SVKUXAW6","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_8","alias_value":"UVNT7HF2","created_at":"2026-07-05T03:56:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:UVNT7HF2SVKUXAW654Z4GUTEAQ","target":"record","payload":{"canonical_record":{"source":{"id":"2202.06866","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T16:48:23Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"73ee915ebd3aa3dbdbe38dbde84bc25284e3d77e41070cc91866454bdc7e81f8","abstract_canon_sha256":"122c6559a415bc202a9a53c2a4a1ba186e57c750123c074abe46fc2cebec08c5"},"schema_version":"1.0"},"canonical_sha256":"a55b3f9cba95554b82deef33c352640422c420a5a34f5cfae19dd844d07d3708","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:56:42.317062Z","signature_b64":"fAS7BkuUXJdeP9+fVbxukTCShp4ypOHV3dzCWgTHO6HMzhH/VZ6s05KtBFaOYO751F1DczHCwFqSgz9dykWRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a55b3f9cba95554b82deef33c352640422c420a5a34f5cfae19dd844d07d3708","last_reissued_at":"2026-07-05T03:56:42.316667Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:56:42.316667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.06866","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-07-05T03:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCQcWFsG199coMNguGdFVNhF8B0QMaFvl16vNj54KKAa4fbXln9OWK22EFsSRTlw7F6sLQSMmDnMHPZY2EBPBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:03.717609Z"},"content_sha256":"48759eb1ca9b6fc9505f2952c0ffc072a42ede3b44fe1578c9e272364af1c93f","schema_version":"1.0","event_id":"sha256:48759eb1ca9b6fc9505f2952c0ffc072a42ede3b44fe1578c9e272364af1c93f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:UVNT7HF2SVKUXAW654Z4GUTEAQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Delaunay Component Analysis for Evaluation of Data Representations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anastasia Varava, Danica Kragic, Florian Pokorny, Petra Poklukar, Vladislav Polianskii","submitted_at":"2022-02-14T16:48:23Z","abstract_excerpt":"Advanced representation learning techniques require reliable and general evaluation methods. Recently, several algorithms based on the common idea of geometric and topological analysis of a manifold approximated from the learned data representations have been proposed. In this work, we introduce Delaunay Component Analysis (DCA) - an evaluation algorithm which approximates the data manifold using a more suitable neighbourhood graph called Delaunay graph. This provides a reliable manifold estimation even for challenging geometric arrangements of representations such as clusters with varying sha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06866","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.06866/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:56:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ph61VAdAWs0jk1V9c+Kjr/VhsDXAhTGgw/fd9nfimwe1kRvLRFGW2aTKZ8HGW8WkolqwJSLD/kKzQSCmFgXUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T15:51:03.718177Z"},"content_sha256":"4b203bb1a85afd76b13473b4f5e9a464e7d3b120cda7e41414752e436dafe8d1","schema_version":"1.0","event_id":"sha256:4b203bb1a85afd76b13473b4f5e9a464e7d3b120cda7e41414752e436dafe8d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/bundle.json","state_url":"https://pith.science/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/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-08-03T15:51:03Z","links":{"resolver":"https://pith.science/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ","bundle":"https://pith.science/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/bundle.json","state":"https://pith.science/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UVNT7HF2SVKUXAW654Z4GUTEAQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:UVNT7HF2SVKUXAW654Z4GUTEAQ","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":"122c6559a415bc202a9a53c2a4a1ba186e57c750123c074abe46fc2cebec08c5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T16:48:23Z","title_canon_sha256":"73ee915ebd3aa3dbdbe38dbde84bc25284e3d77e41070cc91866454bdc7e81f8"},"schema_version":"1.0","source":{"id":"2202.06866","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06866","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06866v1","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06866","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_12","alias_value":"UVNT7HF2SVKU","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_16","alias_value":"UVNT7HF2SVKUXAW6","created_at":"2026-07-05T03:56:42Z"},{"alias_kind":"pith_short_8","alias_value":"UVNT7HF2","created_at":"2026-07-05T03:56:42Z"}],"graph_snapshots":[{"event_id":"sha256:4b203bb1a85afd76b13473b4f5e9a464e7d3b120cda7e41414752e436dafe8d1","target":"graph","created_at":"2026-07-05T03:56:42Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2202.06866/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Advanced representation learning techniques require reliable and general evaluation methods. Recently, several algorithms based on the common idea of geometric and topological analysis of a manifold approximated from the learned data representations have been proposed. In this work, we introduce Delaunay Component Analysis (DCA) - an evaluation algorithm which approximates the data manifold using a more suitable neighbourhood graph called Delaunay graph. This provides a reliable manifold estimation even for challenging geometric arrangements of representations such as clusters with varying sha","authors_text":"Anastasia Varava, Danica Kragic, Florian Pokorny, Petra Poklukar, Vladislav Polianskii","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T16:48:23Z","title":"Delaunay Component Analysis for Evaluation of Data Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06866","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:48759eb1ca9b6fc9505f2952c0ffc072a42ede3b44fe1578c9e272364af1c93f","target":"record","created_at":"2026-07-05T03:56:42Z","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":"122c6559a415bc202a9a53c2a4a1ba186e57c750123c074abe46fc2cebec08c5","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-02-14T16:48:23Z","title_canon_sha256":"73ee915ebd3aa3dbdbe38dbde84bc25284e3d77e41070cc91866454bdc7e81f8"},"schema_version":"1.0","source":{"id":"2202.06866","kind":"arxiv","version":1}},"canonical_sha256":"a55b3f9cba95554b82deef33c352640422c420a5a34f5cfae19dd844d07d3708","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a55b3f9cba95554b82deef33c352640422c420a5a34f5cfae19dd844d07d3708","first_computed_at":"2026-07-05T03:56:42.316667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:56:42.316667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fAS7BkuUXJdeP9+fVbxukTCShp4ypOHV3dzCWgTHO6HMzhH/VZ6s05KtBFaOYO751F1DczHCwFqSgz9dykWRCA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:56:42.317062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.06866","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48759eb1ca9b6fc9505f2952c0ffc072a42ede3b44fe1578c9e272364af1c93f","sha256:4b203bb1a85afd76b13473b4f5e9a464e7d3b120cda7e41414752e436dafe8d1"],"state_sha256":"a5fdb3d0faef20575cfba3800c7e4c475a71edeaf68efa27c48be33d1e0cc96d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cMuI9ZcStVOzzR/Xm7KZkYn79y/z4+Kq6xJ5uRKwUEiwGtfCBDmDQJHW/Ez3Y5exczfVKzTkxJpB+YHYmqowDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T15:51:03.723717Z","bundle_sha256":"f0e8de32f4bfdd20fd3826bfbe43a898cc56d83aece755a69548068ec32ffbed"}}