{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:TZBYIXNMYV4245T34NLLFTVXJH","short_pith_number":"pith:TZBYIXNM","schema_version":"1.0","canonical_sha256":"9e43845dacc579ae767be356b2ceb749d9d7124b8a097524e53b83f544bceaf3","source":{"kind":"arxiv","id":"1804.00656","version":3},"attestation_state":"computed","paper":{"title":"mQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.HC","authors_text":"Claudio Sanhueza, Francia Jim\\'enez, Pablo Moscato, Regina Berretta","submitted_at":"2018-04-02T09:55:10Z","abstract_excerpt":"Algorithms for data visualizations are essential tools for transforming data into useful narratives. Unfortunately, very few visualization algorithms can handle the large datasets of many real-world scenarios. In this study, we address the visualization of these datasets as a Multi-Objective Optimization Problem. We propose mQAPViz, a divide-and-conquer multi-objective optimization algorithm to compute large-scale data visualizations. Our method employs the Multi-Objective Quadratic Assignment Problem (mQAP) as the mathematical foundation to solve the visualization task at hand. The algorithm "},"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":"1804.00656","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2018-04-02T09:55:10Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"341c6612eeffe8890e3dd9b48b9dd135bfb1eabb6a61e1f7dacb168c804e64fb","abstract_canon_sha256":"ab96d95f9e9bd867209ad7f7f8e1eefe8fb176122956fa0a2f3e28d57cd00a0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:01.371718Z","signature_b64":"fJXuvatLyoyJu5YzhG6Phldq+U+abWky0j6bIc+F7+mzg87foOjLXqUrQlvWQT+Pqt5/jtcdN1k+Ei5dEQKZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e43845dacc579ae767be356b2ceb749d9d7124b8a097524e53b83f544bceaf3","last_reissued_at":"2026-05-18T00:02:01.371141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:01.371141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"mQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE"],"primary_cat":"cs.HC","authors_text":"Claudio Sanhueza, Francia Jim\\'enez, Pablo Moscato, Regina Berretta","submitted_at":"2018-04-02T09:55:10Z","abstract_excerpt":"Algorithms for data visualizations are essential tools for transforming data into useful narratives. Unfortunately, very few visualization algorithms can handle the large datasets of many real-world scenarios. In this study, we address the visualization of these datasets as a Multi-Objective Optimization Problem. We propose mQAPViz, a divide-and-conquer multi-objective optimization algorithm to compute large-scale data visualizations. Our method employs the Multi-Objective Quadratic Assignment Problem (mQAP) as the mathematical foundation to solve the visualization task at hand. The algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.00656","kind":"arxiv","version":3},"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":"1804.00656","created_at":"2026-05-18T00:02:01.371222+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.00656v3","created_at":"2026-05-18T00:02:01.371222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.00656","created_at":"2026-05-18T00:02:01.371222+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZBYIXNMYV42","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZBYIXNMYV4245T3","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZBYIXNM","created_at":"2026-05-18T12:32:56.356000+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/TZBYIXNMYV4245T34NLLFTVXJH","json":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH.json","graph_json":"https://pith.science/api/pith-number/TZBYIXNMYV4245T34NLLFTVXJH/graph.json","events_json":"https://pith.science/api/pith-number/TZBYIXNMYV4245T34NLLFTVXJH/events.json","paper":"https://pith.science/paper/TZBYIXNM"},"agent_actions":{"view_html":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH","download_json":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH.json","view_paper":"https://pith.science/paper/TZBYIXNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.00656&json=true","fetch_graph":"https://pith.science/api/pith-number/TZBYIXNMYV4245T34NLLFTVXJH/graph.json","fetch_events":"https://pith.science/api/pith-number/TZBYIXNMYV4245T34NLLFTVXJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH/action/storage_attestation","attest_author":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH/action/author_attestation","sign_citation":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH/action/citation_signature","submit_replication":"https://pith.science/pith/TZBYIXNMYV4245T34NLLFTVXJH/action/replication_record"}},"created_at":"2026-05-18T00:02:01.371222+00:00","updated_at":"2026-05-18T00:02:01.371222+00:00"}