{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YEMF2GEJY3MANEDIRYOUGEDAJX","short_pith_number":"pith:YEMF2GEJ","canonical_record":{"source":{"id":"1608.08970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-31T18:03:18Z","cross_cats_sorted":[],"title_canon_sha256":"67802cbdff13c02cf0e93cd7e4ee150ec0a99ef20bae45c6f002ca20b38b59b9","abstract_canon_sha256":"10e5d9fb1f2ca8c598c7921998aba582b2b24fca46af3a52eae675fa3f3dbf6d"},"schema_version":"1.0"},"canonical_sha256":"c1185d1889c6d80690688e1d4310604dec7ec04e0315d2868332b9b8332e3b93","source":{"kind":"arxiv","id":"1608.08970","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08970","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08970v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08970","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"YEMF2GEJY3MA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEMF2GEJY3MANEDI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEMF2GEJ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YEMF2GEJY3MANEDIRYOUGEDAJX","target":"record","payload":{"canonical_record":{"source":{"id":"1608.08970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-31T18:03:18Z","cross_cats_sorted":[],"title_canon_sha256":"67802cbdff13c02cf0e93cd7e4ee150ec0a99ef20bae45c6f002ca20b38b59b9","abstract_canon_sha256":"10e5d9fb1f2ca8c598c7921998aba582b2b24fca46af3a52eae675fa3f3dbf6d"},"schema_version":"1.0"},"canonical_sha256":"c1185d1889c6d80690688e1d4310604dec7ec04e0315d2868332b9b8332e3b93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:39.546337Z","signature_b64":"sfIvFKSanXUMFLpzawCqd2lnBSdgFt7/LcY9iv8azdnmG+uHpK8xKbuT7B7SsW7Ge+3Rg4giNkr/PkR3HsGWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1185d1889c6d80690688e1d4310604dec7ec04e0315d2868332b9b8332e3b93","last_reissued_at":"2026-05-18T01:06:39.545641Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:39.545641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.08970","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:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"laPYmc3Gznk0rFOZmKScDjA2HjeC4SKDcc5QyNNRGvWcIEI2z+j20Nyr/SBb9XjXaT64+4D/J6JWZmAfBRY0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:45:58.683657Z"},"content_sha256":"7483c6b6e92e3b8acd9b6670834fd4834b49a86bd094350ae9cc5985bcf12744","schema_version":"1.0","event_id":"sha256:7483c6b6e92e3b8acd9b6670834fd4834b49a86bd094350ae9cc5985bcf12744"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YEMF2GEJY3MANEDIRYOUGEDAJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson","submitted_at":"2016-08-31T18:03:18Z","abstract_excerpt":"We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, which we call the sibling-first recursive (SFR) numbering. The particular graphs we consider are derived from applying Shiver's k-CFA framework to Java bytecode, and our visualizer includes helpful links between the nodes of an input graph and the Java bytecode that produced it, as well as a decompiled version of that Java bytecode. We show through several case studies that the canonical drawing paradigm used in J-Viz "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08970","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:06:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+AsAv7mAS2plrVibHpBVTePxgRbJSGpCWSV4W7HCHAvqMbQT46MM9BW1hr1nbLOohXSTxZzUI3kmMFM5qixDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:45:58.684050Z"},"content_sha256":"fb9400877adc33ac6b1436f2b197bc458c6d5d7fd2ffbb3eb854520f1c34f07e","schema_version":"1.0","event_id":"sha256:fb9400877adc33ac6b1436f2b197bc458c6d5d7fd2ffbb3eb854520f1c34f07e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/bundle.json","state_url":"https://pith.science/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/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-05-28T11:45:58Z","links":{"resolver":"https://pith.science/pith/YEMF2GEJY3MANEDIRYOUGEDAJX","bundle":"https://pith.science/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/bundle.json","state":"https://pith.science/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEMF2GEJY3MANEDIRYOUGEDAJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YEMF2GEJY3MANEDIRYOUGEDAJX","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":"10e5d9fb1f2ca8c598c7921998aba582b2b24fca46af3a52eae675fa3f3dbf6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-31T18:03:18Z","title_canon_sha256":"67802cbdff13c02cf0e93cd7e4ee150ec0a99ef20bae45c6f002ca20b38b59b9"},"schema_version":"1.0","source":{"id":"1608.08970","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08970","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08970v1","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08970","created_at":"2026-05-18T01:06:39Z"},{"alias_kind":"pith_short_12","alias_value":"YEMF2GEJY3MA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YEMF2GEJY3MANEDI","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YEMF2GEJ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:fb9400877adc33ac6b1436f2b197bc458c6d5d7fd2ffbb3eb854520f1c34f07e","target":"graph","created_at":"2026-05-18T01:06:39Z","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":"We describe a graph visualization tool for visualizing Java bytecode. Our tool, which we call J-Viz, visualizes connected directed graphs according to a canonical node ordering, which we call the sibling-first recursive (SFR) numbering. The particular graphs we consider are derived from applying Shiver's k-CFA framework to Java bytecode, and our visualizer includes helpful links between the nodes of an input graph and the Java bytecode that produced it, as well as a decompiled version of that Java bytecode. We show through several case studies that the canonical drawing paradigm used in J-Viz ","authors_text":"Md. Jawaherul Alam, Michael T. Goodrich, Timothy Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-31T18:03:18Z","title":"J-Viz: Sibling-First Recursive Graph Drawing for Visualizing Java Bytecode"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08970","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:7483c6b6e92e3b8acd9b6670834fd4834b49a86bd094350ae9cc5985bcf12744","target":"record","created_at":"2026-05-18T01:06:39Z","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":"10e5d9fb1f2ca8c598c7921998aba582b2b24fca46af3a52eae675fa3f3dbf6d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-31T18:03:18Z","title_canon_sha256":"67802cbdff13c02cf0e93cd7e4ee150ec0a99ef20bae45c6f002ca20b38b59b9"},"schema_version":"1.0","source":{"id":"1608.08970","kind":"arxiv","version":1}},"canonical_sha256":"c1185d1889c6d80690688e1d4310604dec7ec04e0315d2868332b9b8332e3b93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1185d1889c6d80690688e1d4310604dec7ec04e0315d2868332b9b8332e3b93","first_computed_at":"2026-05-18T01:06:39.545641Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:39.545641Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sfIvFKSanXUMFLpzawCqd2lnBSdgFt7/LcY9iv8azdnmG+uHpK8xKbuT7B7SsW7Ge+3Rg4giNkr/PkR3HsGWCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:39.546337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08970","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7483c6b6e92e3b8acd9b6670834fd4834b49a86bd094350ae9cc5985bcf12744","sha256:fb9400877adc33ac6b1436f2b197bc458c6d5d7fd2ffbb3eb854520f1c34f07e"],"state_sha256":"366bb68325a38d8a18839172de12a6cb5055f2a866b15625a09bec0266f5fe91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8N4MLIglI6WxZyEAIaRK9s5SzgPwNpFw0Ob6dckncMro8KOoCYWqjmoN2iap/dibKAFdvrbXPogBOGqcj7pCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:45:58.685911Z","bundle_sha256":"4a7f5bdce29b20cf437ca83bb0f5b62bb84f620b253f7574315b9445a60a12cd"}}