{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TURBA3B52T6MTR4L2SX5MM7DZK","short_pith_number":"pith:TURBA3B5","schema_version":"1.0","canonical_sha256":"9d22106c3dd4fcc9c78bd4afd633e3ca96942bc482fe2134a97971cb6e575093","source":{"kind":"arxiv","id":"2606.31119","version":1},"attestation_state":"computed","paper":{"title":"Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"(2) School of Computation, Germany), Heilbronn, Information, Jacob Miller (2), Northeastern University, Peng Zhang (1), Seattle, Stephen Kobourov (2), Technical University of Munich, Technology, Timo Brand (2), Xuefeng Li (1), Ya Ji (1), Yifan Hu (1) ((1) Khoury College of Computer Sciences","submitted_at":"2026-06-30T04:28:26Z","abstract_excerpt":"Graphs are commonly visualized in 2D, where humans readily interpret spatial relationships, yet such layouts often distort higher-dimensional structure. We propose to embed graphs in high-dimensional space and search for informative 2D viewpoints that optimize aesthetic and readability metrics (e.g., edge crossings and angular resolution), enabled by a novel differentiable surrogate for edge crossings. Numerical experiments show that these viewpoints consistently outperform standard 2D layouts, and can even surpass methods explicitly designed to optimize these metrics. We further introduce Dat"},"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":"2606.31119","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-06-30T04:28:26Z","cross_cats_sorted":[],"title_canon_sha256":"bbc70d0a7e94cfbdccaa2b3146b75887b2845bd6293a7cfc7dfde687d2524770","abstract_canon_sha256":"5025edbcd492355c8815d7fc6182ec49b3f1403590b43d3eb6064594f264aebb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:29.760033Z","signature_b64":"q94pOz88ojZHOKu2YKz2qxuAoul+RVcbqCB/Ta+bxwKePcDa8noj90ft7+oYmYtLgDUp6EOVYcCkys/04LdmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d22106c3dd4fcc9c78bd4afd633e3ca96942bc482fe2134a97971cb6e575093","last_reissued_at":"2026-07-01T01:17:29.759582Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:29.759582Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Visualizing High-Dimensional Graph Embeddings via Informed Multi-View Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"(2) School of Computation, Germany), Heilbronn, Information, Jacob Miller (2), Northeastern University, Peng Zhang (1), Seattle, Stephen Kobourov (2), Technical University of Munich, Technology, Timo Brand (2), Xuefeng Li (1), Ya Ji (1), Yifan Hu (1) ((1) Khoury College of Computer Sciences","submitted_at":"2026-06-30T04:28:26Z","abstract_excerpt":"Graphs are commonly visualized in 2D, where humans readily interpret spatial relationships, yet such layouts often distort higher-dimensional structure. We propose to embed graphs in high-dimensional space and search for informative 2D viewpoints that optimize aesthetic and readability metrics (e.g., edge crossings and angular resolution), enabled by a novel differentiable surrogate for edge crossings. Numerical experiments show that these viewpoints consistently outperform standard 2D layouts, and can even surpass methods explicitly designed to optimize these metrics. We further introduce Dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31119","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/2606.31119/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":"2606.31119","created_at":"2026-07-01T01:17:29.759648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.31119v1","created_at":"2026-07-01T01:17:29.759648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31119","created_at":"2026-07-01T01:17:29.759648+00:00"},{"alias_kind":"pith_short_12","alias_value":"TURBA3B52T6M","created_at":"2026-07-01T01:17:29.759648+00:00"},{"alias_kind":"pith_short_16","alias_value":"TURBA3B52T6MTR4L","created_at":"2026-07-01T01:17:29.759648+00:00"},{"alias_kind":"pith_short_8","alias_value":"TURBA3B5","created_at":"2026-07-01T01:17:29.759648+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/TURBA3B52T6MTR4L2SX5MM7DZK","json":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK.json","graph_json":"https://pith.science/api/pith-number/TURBA3B52T6MTR4L2SX5MM7DZK/graph.json","events_json":"https://pith.science/api/pith-number/TURBA3B52T6MTR4L2SX5MM7DZK/events.json","paper":"https://pith.science/paper/TURBA3B5"},"agent_actions":{"view_html":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK","download_json":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK.json","view_paper":"https://pith.science/paper/TURBA3B5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.31119&json=true","fetch_graph":"https://pith.science/api/pith-number/TURBA3B52T6MTR4L2SX5MM7DZK/graph.json","fetch_events":"https://pith.science/api/pith-number/TURBA3B52T6MTR4L2SX5MM7DZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK/action/storage_attestation","attest_author":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK/action/author_attestation","sign_citation":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK/action/citation_signature","submit_replication":"https://pith.science/pith/TURBA3B52T6MTR4L2SX5MM7DZK/action/replication_record"}},"created_at":"2026-07-01T01:17:29.759648+00:00","updated_at":"2026-07-01T01:17:29.759648+00:00"}