{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AJLH3OBNSYEO4N2T7CHVBGAM74","short_pith_number":"pith:AJLH3OBN","canonical_record":{"source":{"id":"1506.06745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-22T17:17:34Z","cross_cats_sorted":["cs.DM","cs.MS","cs.SI"],"title_canon_sha256":"a33dc4b293f3d6d36ef60e511a9c936d93a87a3251496fb3455ac6410fea58b8","abstract_canon_sha256":"002b438cea46352c4614febae98db4613a4b448a299fcf0929a025d7de253d73"},"schema_version":"1.0"},"canonical_sha256":"02567db82d9608ee3753f88f50980cff2f7111c82744382ab10f00bf62f9a36d","source":{"kind":"arxiv","id":"1506.06745","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06745","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06745v1","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06745","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"AJLH3OBNSYEO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AJLH3OBNSYEO4N2T","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AJLH3OBN","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AJLH3OBNSYEO4N2T7CHVBGAM74","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-22T17:17:34Z","cross_cats_sorted":["cs.DM","cs.MS","cs.SI"],"title_canon_sha256":"a33dc4b293f3d6d36ef60e511a9c936d93a87a3251496fb3455ac6410fea58b8","abstract_canon_sha256":"002b438cea46352c4614febae98db4613a4b448a299fcf0929a025d7de253d73"},"schema_version":"1.0"},"canonical_sha256":"02567db82d9608ee3753f88f50980cff2f7111c82744382ab10f00bf62f9a36d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:56.010551Z","signature_b64":"LH0sMHVXZOLJoPrxojAr/Rpq9BgeCnXeCXgh3LyboFmIeekFza7MoMCHmCpX5hLuivTYAxPjuD1PjKOeQvDGCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02567db82d9608ee3753f88f50980cff2f7111c82744382ab10f00bf62f9a36d","last_reissued_at":"2026-05-18T01:40:56.009899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:56.009899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06745","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-05-18T01:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PpOdP0r3j/6GEntGASVdtyYKaPvV0bIu8Ptp9/ze4H6XR4Opaz7neU6KiI5kBjSIUH1J+FG1p1saE9SGwLDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:15.588817Z"},"content_sha256":"cc2306d2ab5dff9f77cfcba06fd24a195bc47bd18150caf145edbdf5bb252172","schema_version":"1.0","event_id":"sha256:cc2306d2ab5dff9f77cfcba06fd24a195bc47bd18150caf145edbdf5bb252172"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AJLH3OBNSYEO4N2T7CHVBGAM74","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GraphMaps: Browsing Large Graphs as Interactive Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.MS","cs.SI"],"primary_cat":"cs.GR","authors_text":"Alexander E. Holroyd, Bongshin Lee, Lev Nachmanson, Nathalie Henry Riche, Roman Prutkin, Xiaoji Chen","submitted_at":"2015-06-22T17:17:34Z","abstract_excerpt":"Algorithms for laying out large graphs have seen significant progress in the past decade. However, browsing large graphs remains a challenge. Rendering thousands of graphical elements at once often results in a cluttered image, and navigating these elements naively can cause disorientation. To address this challenge we propose a method called GraphMaps, mimicking the browsing experience of online geographic maps.\n  GraphMaps creates a sequence of layers, where each layer refines the previous one. During graph browsing, GraphMaps chooses the layer corresponding to the zoom level, and renders on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06745","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":""},"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-05-18T01:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ijqa0/YZYZn2Hoali6QLjXhRABju5JX8iSVf6SNppVgH/ZE5gsRr0FTlGVWk3yIuVw0fR48FiRmDartBfwrPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:55:15.589166Z"},"content_sha256":"9cb7577a3e310c0c83551b98cfa42d51f4b4766035c602bf68e350e38ee316ec","schema_version":"1.0","event_id":"sha256:9cb7577a3e310c0c83551b98cfa42d51f4b4766035c602bf68e350e38ee316ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/bundle.json","state_url":"https://pith.science/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/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-06-09T13:55:15Z","links":{"resolver":"https://pith.science/pith/AJLH3OBNSYEO4N2T7CHVBGAM74","bundle":"https://pith.science/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/bundle.json","state":"https://pith.science/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJLH3OBNSYEO4N2T7CHVBGAM74/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AJLH3OBNSYEO4N2T7CHVBGAM74","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":"002b438cea46352c4614febae98db4613a4b448a299fcf0929a025d7de253d73","cross_cats_sorted":["cs.DM","cs.MS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-22T17:17:34Z","title_canon_sha256":"a33dc4b293f3d6d36ef60e511a9c936d93a87a3251496fb3455ac6410fea58b8"},"schema_version":"1.0","source":{"id":"1506.06745","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06745","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06745v1","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06745","created_at":"2026-05-18T01:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"AJLH3OBNSYEO","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AJLH3OBNSYEO4N2T","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AJLH3OBN","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:9cb7577a3e310c0c83551b98cfa42d51f4b4766035c602bf68e350e38ee316ec","target":"graph","created_at":"2026-05-18T01:40:56Z","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"},"paper":{"abstract_excerpt":"Algorithms for laying out large graphs have seen significant progress in the past decade. However, browsing large graphs remains a challenge. Rendering thousands of graphical elements at once often results in a cluttered image, and navigating these elements naively can cause disorientation. To address this challenge we propose a method called GraphMaps, mimicking the browsing experience of online geographic maps.\n  GraphMaps creates a sequence of layers, where each layer refines the previous one. During graph browsing, GraphMaps chooses the layer corresponding to the zoom level, and renders on","authors_text":"Alexander E. Holroyd, Bongshin Lee, Lev Nachmanson, Nathalie Henry Riche, Roman Prutkin, Xiaoji Chen","cross_cats":["cs.DM","cs.MS","cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-22T17:17:34Z","title":"GraphMaps: Browsing Large Graphs as Interactive Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06745","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:cc2306d2ab5dff9f77cfcba06fd24a195bc47bd18150caf145edbdf5bb252172","target":"record","created_at":"2026-05-18T01:40:56Z","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":"002b438cea46352c4614febae98db4613a4b448a299fcf0929a025d7de253d73","cross_cats_sorted":["cs.DM","cs.MS","cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2015-06-22T17:17:34Z","title_canon_sha256":"a33dc4b293f3d6d36ef60e511a9c936d93a87a3251496fb3455ac6410fea58b8"},"schema_version":"1.0","source":{"id":"1506.06745","kind":"arxiv","version":1}},"canonical_sha256":"02567db82d9608ee3753f88f50980cff2f7111c82744382ab10f00bf62f9a36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02567db82d9608ee3753f88f50980cff2f7111c82744382ab10f00bf62f9a36d","first_computed_at":"2026-05-18T01:40:56.009899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:40:56.009899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LH0sMHVXZOLJoPrxojAr/Rpq9BgeCnXeCXgh3LyboFmIeekFza7MoMCHmCpX5hLuivTYAxPjuD1PjKOeQvDGCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:40:56.010551Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06745","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc2306d2ab5dff9f77cfcba06fd24a195bc47bd18150caf145edbdf5bb252172","sha256:9cb7577a3e310c0c83551b98cfa42d51f4b4766035c602bf68e350e38ee316ec"],"state_sha256":"3584356452117ee9f97c53137f395edffed33ca91393947d75f121b29335c35a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T/AQBc/xgchj33HalDl0IOEZ7OM0gum3LCqDNhTL8gv8E77FVu52w5pMFs/9TaCEr9AM5RY7iLGcbWoH/XBZCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:55:15.591100Z","bundle_sha256":"4c9357a775f5cb6d10b3f614c11aa3329c87256f84e9ba6f4070d856201009e9"}}