{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UHWSRVHMAXCZM3SOUQ7FLRD77S","short_pith_number":"pith:UHWSRVHM","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"},"canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","source":{"kind":"arxiv","id":"2308.05043","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.05043","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2308.05043v1","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05043","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"UHWSRVHMAXCZ","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHWSRVHMAXCZM3SO","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHWSRVHM","created_at":"2026-07-05T06:39:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UHWSRVHMAXCZM3SOUQ7FLRD77S","target":"record","payload":{"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"},"canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","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"},"source_kind":"arxiv","source_id":"2308.05043","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-05T06:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDkruE9RmX9gkb+yEOIOBTU7DE6ZWrH6oGUvIKlsMd9DkLAnPXSu3ohfhUPT3pbd8KR42zsNTAl6zO2pSMnKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:03:27.042753Z"},"content_sha256":"08396830ed432924a975c5e52ccf2b9a1b36bdc9d6e307193ce458df4ab79a04","schema_version":"1.0","event_id":"sha256:08396830ed432924a975c5e52ccf2b9a1b36bdc9d6e307193ce458df4ab79a04"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UHWSRVHMAXCZM3SOUQ7FLRD77S","target":"graph","payload":{"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"},"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-05T06:39:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lEbEwraeFfgvOuYrCPjM2S6SpQy0a1XEFFH15f6/ubWN5e6nD2WMX7bBEXVCagKQFMOiMJ1hnXSGGEXdwgHCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:03:27.043647Z"},"content_sha256":"ebd90e903392629d8845c4c4dbd8d5b04e4cc539b3182d764e88490f1f288648","schema_version":"1.0","event_id":"sha256:ebd90e903392629d8845c4c4dbd8d5b04e4cc539b3182d764e88490f1f288648"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/bundle.json","state_url":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/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-15T03:03:27Z","links":{"resolver":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S","bundle":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/bundle.json","state":"https://pith.science/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHWSRVHMAXCZM3SOUQ7FLRD77S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UHWSRVHMAXCZM3SOUQ7FLRD77S","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":"84b8d9d41eeed817feeea9d7173c44a6cf945eda5ad493e07be01945f0c60716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2023-08-09T16:17:55Z","title_canon_sha256":"921be3d9f3fc70a5019c8e0437eab0d4224732f63d2ed1d3b21edf4ed866c838"},"schema_version":"1.0","source":{"id":"2308.05043","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.05043","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"arxiv_version","alias_value":"2308.05043v1","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.05043","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_12","alias_value":"UHWSRVHMAXCZ","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHWSRVHMAXCZM3SO","created_at":"2026-07-05T06:39:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHWSRVHM","created_at":"2026-07-05T06:39:46Z"}],"graph_snapshots":[{"event_id":"sha256:ebd90e903392629d8845c4c4dbd8d5b04e4cc539b3182d764e88490f1f288648","target":"graph","created_at":"2026-07-05T06:39:46Z","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/2308.05043/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Eugene Zhang, Peter Oliver, Yue Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2023-08-09T16:17:55Z","title":"Scalable Hypergraph Visualization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.05043","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:08396830ed432924a975c5e52ccf2b9a1b36bdc9d6e307193ce458df4ab79a04","target":"record","created_at":"2026-07-05T06:39:46Z","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":"84b8d9d41eeed817feeea9d7173c44a6cf945eda5ad493e07be01945f0c60716","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2023-08-09T16:17:55Z","title_canon_sha256":"921be3d9f3fc70a5019c8e0437eab0d4224732f63d2ed1d3b21edf4ed866c838"},"schema_version":"1.0","source":{"id":"2308.05043","kind":"arxiv","version":1}},"canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1ed28d4ec05c5966e4ea43e55c47ffcb93e1bc3664ea486abea3d20063efc8a","first_computed_at":"2026-07-05T06:39:46.239846Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:39:46.239846Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uAjkbKQiIzjKFpL5MfnnjUt9ralPOQ3qS3RI+tMS1TknA6e6bI5wfm/ctXvSaQOMs3mMkqGxUenlAYwQh/+pAA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:39:46.240242Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.05043","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08396830ed432924a975c5e52ccf2b9a1b36bdc9d6e307193ce458df4ab79a04","sha256:ebd90e903392629d8845c4c4dbd8d5b04e4cc539b3182d764e88490f1f288648"],"state_sha256":"5d735a1af0b9ba9e04c51eb99d840366937f89600d20241d115999f5a2201a7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qvriYb2ACLdW5K5ziwPkPv2Oh5k0Ggl+Lupds6ArRL/i+lD7IuqAcbUxoN1kb4pe8RqpYf37PACXhHNSrBaHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T03:03:27.052694Z","bundle_sha256":"6cd74dcdc17db16314aa2826ad8a1312d429808fde7d57aa6ed6277d8ce374aa"}}