{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MJARRMTI3PRJUX7XKGT7QIT6I6","short_pith_number":"pith:MJARRMTI","canonical_record":{"source":{"id":"1908.08151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T00:24:06Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"24f8a94590d01a1cad1129c301a8ca87e4759585cb69b3b0ef0d00aac665bff8","abstract_canon_sha256":"7d9d385fd3d70b6dd1a99da10736a1d7d98c8260541093e5e1d66e81831f3edf"},"schema_version":"1.0"},"canonical_sha256":"624118b268dbe29a5ff751a7f8227e479d58ed1557dc52af318a11ab5186ead6","source":{"kind":"arxiv","id":"1908.08151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08151","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08151v1","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08151","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"MJARRMTI3PRJ","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"MJARRMTI3PRJUX7X","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"MJARRMTI","created_at":"2026-07-04T23:59:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MJARRMTI3PRJUX7XKGT7QIT6I6","target":"record","payload":{"canonical_record":{"source":{"id":"1908.08151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T00:24:06Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"24f8a94590d01a1cad1129c301a8ca87e4759585cb69b3b0ef0d00aac665bff8","abstract_canon_sha256":"7d9d385fd3d70b6dd1a99da10736a1d7d98c8260541093e5e1d66e81831f3edf"},"schema_version":"1.0"},"canonical_sha256":"624118b268dbe29a5ff751a7f8227e479d58ed1557dc52af318a11ab5186ead6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:10.064892Z","signature_b64":"tOz+da1Cl/vn5w0K3pfupxK6Z+M+OrIv3OmPfgVGnyvbv5+1TTyZOLfeEN0fsFTDD3xm47cckLxtFK9XzMPlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"624118b268dbe29a5ff751a7f8227e479d58ed1557dc52af318a11ab5186ead6","last_reissued_at":"2026-07-04T23:59:10.064499Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:10.064499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.08151","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-04T23:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2C9aR7DETOsG4JmwZLtIYCRZ+v8gVX/K5iPH8B2RtJVIih12+yKi6zwPCZEXdwV61vp1hVF0xnaKRfnOAsEbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:43:03.541598Z"},"content_sha256":"8e363e018505734ee91e8d78ebd3fd8130c5875cb95b69e09658cef08b154029","schema_version":"1.0","event_id":"sha256:8e363e018505734ee91e8d78ebd3fd8130c5875cb95b69e09658cef08b154029"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MJARRMTI3PRJUX7XKGT7QIT6I6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-level Graph Drawing using Infomap Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.DS","authors_text":"Daniel Langerenken, David Chae, Hassan Chafi, Marnijati Torkel, Peter Eades, Seok-Hee Hong, Sungpack Hong, Ziyang Wang","submitted_at":"2019-08-22T00:24:06Z","abstract_excerpt":"Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the effectiveness of Infomap clustering combined with the multi-level graph drawing paradigm. Experiments show that our new Infomap based multi-level algorithm produces good visualization of large and complex networks, with significant improvement in quality metrics."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08151","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/1908.08151/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-04T23:59:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lcdCn398zFTA3YgF42DZkQLsmEs4bWJizZjIcLX1MsuCS0rT3Csve7I0Grjgg2qUVB/K7JoU8m/6iSyv4ZPfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T00:43:03.541987Z"},"content_sha256":"f81948895a20df12d9867a6d5e1c9ef0bf722929deeef3a2b641e1784bc14c3f","schema_version":"1.0","event_id":"sha256:f81948895a20df12d9867a6d5e1c9ef0bf722929deeef3a2b641e1784bc14c3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/bundle.json","state_url":"https://pith.science/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/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-04T00:43:03Z","links":{"resolver":"https://pith.science/pith/MJARRMTI3PRJUX7XKGT7QIT6I6","bundle":"https://pith.science/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/bundle.json","state":"https://pith.science/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MJARRMTI3PRJUX7XKGT7QIT6I6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MJARRMTI3PRJUX7XKGT7QIT6I6","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":"7d9d385fd3d70b6dd1a99da10736a1d7d98c8260541093e5e1d66e81831f3edf","cross_cats_sorted":["cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T00:24:06Z","title_canon_sha256":"24f8a94590d01a1cad1129c301a8ca87e4759585cb69b3b0ef0d00aac665bff8"},"schema_version":"1.0","source":{"id":"1908.08151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.08151","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"arxiv_version","alias_value":"1908.08151v1","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08151","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_12","alias_value":"MJARRMTI3PRJ","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_16","alias_value":"MJARRMTI3PRJUX7X","created_at":"2026-07-04T23:59:10Z"},{"alias_kind":"pith_short_8","alias_value":"MJARRMTI","created_at":"2026-07-04T23:59:10Z"}],"graph_snapshots":[{"event_id":"sha256:f81948895a20df12d9867a6d5e1c9ef0bf722929deeef3a2b641e1784bc14c3f","target":"graph","created_at":"2026-07-04T23:59:10Z","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/1908.08151/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Infomap clustering finds the community structures that minimize the expected description length of a random walk trajectory; algorithms for infomap clustering run fast in practice for large graphs. In this paper we leverage the effectiveness of Infomap clustering combined with the multi-level graph drawing paradigm. Experiments show that our new Infomap based multi-level algorithm produces good visualization of large and complex networks, with significant improvement in quality metrics.","authors_text":"Daniel Langerenken, David Chae, Hassan Chafi, Marnijati Torkel, Peter Eades, Seok-Hee Hong, Sungpack Hong, Ziyang Wang","cross_cats":["cs.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T00:24:06Z","title":"Multi-level Graph Drawing using Infomap Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08151","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:8e363e018505734ee91e8d78ebd3fd8130c5875cb95b69e09658cef08b154029","target":"record","created_at":"2026-07-04T23:59:10Z","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":"7d9d385fd3d70b6dd1a99da10736a1d7d98c8260541093e5e1d66e81831f3edf","cross_cats_sorted":["cs.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-22T00:24:06Z","title_canon_sha256":"24f8a94590d01a1cad1129c301a8ca87e4759585cb69b3b0ef0d00aac665bff8"},"schema_version":"1.0","source":{"id":"1908.08151","kind":"arxiv","version":1}},"canonical_sha256":"624118b268dbe29a5ff751a7f8227e479d58ed1557dc52af318a11ab5186ead6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"624118b268dbe29a5ff751a7f8227e479d58ed1557dc52af318a11ab5186ead6","first_computed_at":"2026-07-04T23:59:10.064499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:10.064499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tOz+da1Cl/vn5w0K3pfupxK6Z+M+OrIv3OmPfgVGnyvbv5+1TTyZOLfeEN0fsFTDD3xm47cckLxtFK9XzMPlCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:10.064892Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.08151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8e363e018505734ee91e8d78ebd3fd8130c5875cb95b69e09658cef08b154029","sha256:f81948895a20df12d9867a6d5e1c9ef0bf722929deeef3a2b641e1784bc14c3f"],"state_sha256":"cdaf830f328c3f54eca37aa25ca47c6de078d4f102d08ec4a3f26f70d14d685f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5ND1HOnFZWPwmrbRw7aGqsZBHQonwXqggxvpI7uEmGojLtOWZeYpFVqXJn3fEKcrTJmdaBoW4EH+gN9/WJ/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T00:43:03.545238Z","bundle_sha256":"e8002580dfdb9a7630675fe1290924ab46bb4461e60eb05cfd5d28eeffe372b1"}}