{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YZK3O3CJERA47GXTMPXOU2WMYW","short_pith_number":"pith:YZK3O3CJ","schema_version":"1.0","canonical_sha256":"c655b76c492441cf9af363eeea6accc5a914ed7f30158331c06b4a78a53ce8da","source":{"kind":"arxiv","id":"2411.17920","version":1},"attestation_state":"computed","paper":{"title":"Visual Complexity of Point Set Mappings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arjen Simons, Kevin Verbeek, Wouter Meulemans","submitted_at":"2024-11-26T22:25:20Z","abstract_excerpt":"We study the visual complexity of animated transitions between point sets. Although there exist many metrics for point set similarity, these metrics are not adequate for this purpose, as they typically treat each point separately. Instead, we propose to look at translations of entire subsets/groups of points to measure the visual complexity of a transition between two point sets. Specifically, given two labeled point sets A and B in R^d, the goal is to compute the cheapest transformation that maps all points in A to their corresponding point in B, where the translation of a group of points cou"},"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":"2411.17920","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2024-11-26T22:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"a31061b83afdbb0259d79455fe970b2dc693cafab9652b1bf28e875692691dad","abstract_canon_sha256":"2e67acdd46939d6684376eb8fe5b1fbb8c08442c22ef8dd6df79d8dfa48d8c5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:15:23.370491Z","signature_b64":"HZssQgL0+LgYXPsECRu1/QdGwUG+wDF8uG2Jrq/BIeLfny9aA/pch6Yfp4F/87zqht9hRGu3AKb+31eT72cEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c655b76c492441cf9af363eeea6accc5a914ed7f30158331c06b4a78a53ce8da","last_reissued_at":"2026-07-05T10:15:23.369994Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:15:23.369994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visual Complexity of Point Set Mappings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Arjen Simons, Kevin Verbeek, Wouter Meulemans","submitted_at":"2024-11-26T22:25:20Z","abstract_excerpt":"We study the visual complexity of animated transitions between point sets. Although there exist many metrics for point set similarity, these metrics are not adequate for this purpose, as they typically treat each point separately. Instead, we propose to look at translations of entire subsets/groups of points to measure the visual complexity of a transition between two point sets. Specifically, given two labeled point sets A and B in R^d, the goal is to compute the cheapest transformation that maps all points in A to their corresponding point in B, where the translation of a group of points cou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.17920","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/2411.17920/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.17920","created_at":"2026-07-05T10:15:23.370055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.17920v1","created_at":"2026-07-05T10:15:23.370055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.17920","created_at":"2026-07-05T10:15:23.370055+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZK3O3CJERA4","created_at":"2026-07-05T10:15:23.370055+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZK3O3CJERA47GXT","created_at":"2026-07-05T10:15:23.370055+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZK3O3CJ","created_at":"2026-07-05T10:15:23.370055+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/YZK3O3CJERA47GXTMPXOU2WMYW","json":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW.json","graph_json":"https://pith.science/api/pith-number/YZK3O3CJERA47GXTMPXOU2WMYW/graph.json","events_json":"https://pith.science/api/pith-number/YZK3O3CJERA47GXTMPXOU2WMYW/events.json","paper":"https://pith.science/paper/YZK3O3CJ"},"agent_actions":{"view_html":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW","download_json":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW.json","view_paper":"https://pith.science/paper/YZK3O3CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.17920&json=true","fetch_graph":"https://pith.science/api/pith-number/YZK3O3CJERA47GXTMPXOU2WMYW/graph.json","fetch_events":"https://pith.science/api/pith-number/YZK3O3CJERA47GXTMPXOU2WMYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW/action/storage_attestation","attest_author":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW/action/author_attestation","sign_citation":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW/action/citation_signature","submit_replication":"https://pith.science/pith/YZK3O3CJERA47GXTMPXOU2WMYW/action/replication_record"}},"created_at":"2026-07-05T10:15:23.370055+00:00","updated_at":"2026-07-05T10:15:23.370055+00:00"}