{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:UHWSRVHMAXCZM3SOUQ7FLRD77S","short_pith_number":"pith:UHWSRVHM","schema_version":"1.0","canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","source":{"kind":"arxiv","id":"2308.05043","version":1},"attestation_state":"computed","paper":{"title":"Scalable Hypergraph Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Eugene Zhang, Peter Oliver, Yue Zhang","submitted_at":"2023-08-09T16:17:55Z","abstract_excerpt":"Hypergraph visualization has many applications in network data analysis. Recently, a polygon-based representation for hypergraphs has been proposed with demonstrated benefits. However, the polygon-based layout often suffers from excessive self-intersections when the input dataset is relatively large. In this paper, we propose a framework in which the hypergraph is iteratively simplified through a set of atomic operations. Then, the layout of the simplest hypergraph is optimized and used as the foundation for a reverse process that brings the simplest hypergraph back to the original one, but wi"},"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":"2308.05043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2023-08-09T16:17:55Z","cross_cats_sorted":[],"title_canon_sha256":"921be3d9f3fc70a5019c8e0437eab0d4224732f63d2ed1d3b21edf4ed866c838","abstract_canon_sha256":"84b8d9d41eeed817feeea9d7173c44a6cf945eda5ad493e07be01945f0c60716"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:39:46.240242Z","signature_b64":"uAjkbKQiIzjKFpL5MfnnjUt9ralPOQ3qS3RI+tMS1TknA6e6bI5wfm/ctXvSaQOMs3mMkqGxUenlAYwQh/+pAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","last_reissued_at":"2026-07-05T06:39:46.239846Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:39:46.239846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Hypergraph Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Eugene Zhang, Peter Oliver, Yue Zhang","submitted_at":"2023-08-09T16:17:55Z","abstract_excerpt":"Hypergraph visualization has many applications in network data analysis. Recently, a polygon-based representation for hypergraphs has been proposed with demonstrated benefits. However, the polygon-based layout often suffers from excessive self-intersections when the input dataset is relatively large. In this paper, we propose a framework in which the hypergraph is iteratively simplified through a set of atomic operations. Then, the layout of the simplest hypergraph is optimized and used as the foundation for a reverse process that brings the simplest hypergraph back to the original one, but wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05043","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/2308.05043/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":"2308.05043","created_at":"2026-07-05T06:39:46.239902+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.05043v1","created_at":"2026-07-05T06:39:46.239902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05043","created_at":"2026-07-05T06:39:46.239902+00:00"},{"alias_kind":"pith_short_12","alias_value":"UHWSRVHMAXCZ","created_at":"2026-07-05T06:39:46.239902+00:00"},{"alias_kind":"pith_short_16","alias_value":"UHWSRVHMAXCZM3SO","created_at":"2026-07-05T06:39:46.239902+00:00"},{"alias_kind":"pith_short_8","alias_value":"UHWSRVHM","created_at":"2026-07-05T06:39:46.239902+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/UHWSRVHMAXCZM3SOUQ7FLRD77S","json":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S.json","graph_json":"https://pith.science/api/pith-number/UHWSRVHMAXCZM3SOUQ7FLRD77S/graph.json","events_json":"https://pith.science/api/pith-number/UHWSRVHMAXCZM3SOUQ7FLRD77S/events.json","paper":"https://pith.science/paper/UHWSRVHM"},"agent_actions":{"view_html":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S","download_json":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S.json","view_paper":"https://pith.science/paper/UHWSRVHM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.05043&json=true","fetch_graph":"https://pith.science/api/pith-number/UHWSRVHMAXCZM3SOUQ7FLRD77S/graph.json","fetch_events":"https://pith.science/api/pith-number/UHWSRVHMAXCZM3SOUQ7FLRD77S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/action/storage_attestation","attest_author":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/action/author_attestation","sign_citation":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/action/citation_signature","submit_replication":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/action/replication_record"}},"created_at":"2026-07-05T06:39:46.239902+00:00","updated_at":"2026-07-05T06:39:46.239902+00:00"}