{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:J2NMCSZFBMZ5IKG7CCNMJKEJ5E","short_pith_number":"pith:J2NMCSZF","canonical_record":{"source":{"id":"1602.03942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T01:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"3acd9f153d4cfb93e6169b6f62ecbf48fbee1b302ae77a364238b12a73d4409d","abstract_canon_sha256":"4356fe7875de4f9032244ffd835037b51a161ed7c814170c46c9f75a90f59cd1"},"schema_version":"1.0"},"canonical_sha256":"4e9ac14b250b33d428df109ac4a889e9088e11f42febade9c5b55227f64c7b30","source":{"kind":"arxiv","id":"1602.03942","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03942","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03942v1","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03942","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"J2NMCSZFBMZ5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2NMCSZFBMZ5IKG7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2NMCSZF","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:J2NMCSZFBMZ5IKG7CCNMJKEJ5E","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03942","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T01:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"3acd9f153d4cfb93e6169b6f62ecbf48fbee1b302ae77a364238b12a73d4409d","abstract_canon_sha256":"4356fe7875de4f9032244ffd835037b51a161ed7c814170c46c9f75a90f59cd1"},"schema_version":"1.0"},"canonical_sha256":"4e9ac14b250b33d428df109ac4a889e9088e11f42febade9c5b55227f64c7b30","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:55.113112Z","signature_b64":"0prObEOaPUk0vQrwV6K/SLzs25/Ce3+R8nWclIJd7ussIJfgHTt7cj7McvjgWBcAxGxJY0oBbPJ3TmA/mAnHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e9ac14b250b33d428df109ac4a889e9088e11f42febade9c5b55227f64c7b30","last_reissued_at":"2026-05-18T01:20:55.112554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:55.112554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03942","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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ouxr7McXhRxbaPxHzFBodxZqEDxvvhCQ11QyWLHtPDfSq49Ijv3+RRKSHKkBOqfATZWk08qEx4GeEcBBynPkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:51:43.776619Z"},"content_sha256":"5ccc42f6dc9fd844358d774c37f1f8a895cad51774c2d16d5fccb690fb097554","schema_version":"1.0","event_id":"sha256:5ccc42f6dc9fd844358d774c37f1f8a895cad51774c2d16d5fccb690fb097554"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:J2NMCSZFBMZ5IKG7CCNMJKEJ5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Call Path Detection for Android-OS Size of Huge Source Code","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Koji Yamamoto, Taka Matsutsuka","submitted_at":"2016-02-12T01:29:08Z","abstract_excerpt":"Today most developers utilize source code written by other parties. Because the code is modified frequently, the developers need to grasp the impact of the modification repeatedly. A call graph and especially its special type, a call path, help the developers comprehend the modification. Source code written by other parties, however, becomes too huge to be held in memory in the form of parsed data for a call graph or path. This paper offers a bidirectional search algorithm for a call graph of too huge amount of source code to store all parse results of the code in memory. It refers to a method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03942","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:20:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ax1I/F68kIS9bE1JIWs8Gc44h10fIiX0Yg9+cwBobe7+TZ+X0ClSTv/b2WmEdBhqczYgCeBcxXIC6KULowvsCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:51:43.777264Z"},"content_sha256":"b6de527169ed4442f94305edcfe182b0aea780737db668d45fa3b0be4f2e1929","schema_version":"1.0","event_id":"sha256:b6de527169ed4442f94305edcfe182b0aea780737db668d45fa3b0be4f2e1929"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/bundle.json","state_url":"https://pith.science/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/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-04T06:51:43Z","links":{"resolver":"https://pith.science/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E","bundle":"https://pith.science/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/bundle.json","state":"https://pith.science/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J2NMCSZFBMZ5IKG7CCNMJKEJ5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:J2NMCSZFBMZ5IKG7CCNMJKEJ5E","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":"4356fe7875de4f9032244ffd835037b51a161ed7c814170c46c9f75a90f59cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T01:29:08Z","title_canon_sha256":"3acd9f153d4cfb93e6169b6f62ecbf48fbee1b302ae77a364238b12a73d4409d"},"schema_version":"1.0","source":{"id":"1602.03942","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03942","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03942v1","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03942","created_at":"2026-05-18T01:20:55Z"},{"alias_kind":"pith_short_12","alias_value":"J2NMCSZFBMZ5","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"J2NMCSZFBMZ5IKG7","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"J2NMCSZF","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:b6de527169ed4442f94305edcfe182b0aea780737db668d45fa3b0be4f2e1929","target":"graph","created_at":"2026-05-18T01:20:55Z","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":"Today most developers utilize source code written by other parties. Because the code is modified frequently, the developers need to grasp the impact of the modification repeatedly. A call graph and especially its special type, a call path, help the developers comprehend the modification. Source code written by other parties, however, becomes too huge to be held in memory in the form of parsed data for a call graph or path. This paper offers a bidirectional search algorithm for a call graph of too huge amount of source code to store all parse results of the code in memory. It refers to a method","authors_text":"Koji Yamamoto, Taka Matsutsuka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T01:29:08Z","title":"Efficient Call Path Detection for Android-OS Size of Huge Source Code"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03942","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:5ccc42f6dc9fd844358d774c37f1f8a895cad51774c2d16d5fccb690fb097554","target":"record","created_at":"2026-05-18T01:20:55Z","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":"4356fe7875de4f9032244ffd835037b51a161ed7c814170c46c9f75a90f59cd1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-12T01:29:08Z","title_canon_sha256":"3acd9f153d4cfb93e6169b6f62ecbf48fbee1b302ae77a364238b12a73d4409d"},"schema_version":"1.0","source":{"id":"1602.03942","kind":"arxiv","version":1}},"canonical_sha256":"4e9ac14b250b33d428df109ac4a889e9088e11f42febade9c5b55227f64c7b30","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e9ac14b250b33d428df109ac4a889e9088e11f42febade9c5b55227f64c7b30","first_computed_at":"2026-05-18T01:20:55.112554Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:55.112554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0prObEOaPUk0vQrwV6K/SLzs25/Ce3+R8nWclIJd7ussIJfgHTt7cj7McvjgWBcAxGxJY0oBbPJ3TmA/mAnHBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:55.113112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03942","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ccc42f6dc9fd844358d774c37f1f8a895cad51774c2d16d5fccb690fb097554","sha256:b6de527169ed4442f94305edcfe182b0aea780737db668d45fa3b0be4f2e1929"],"state_sha256":"45c167feb6a1dc91cb322cd4d66a26eb93c5278410db92ba87460982f154de19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"78vVu25wOABOt0xdYWw7vMqfxv9gfNPn8c7FcHhawci4PUH1Pe+2xqnYnSGVCqS9S6bZIokMzlKjt0mGGtCMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:51:43.779783Z","bundle_sha256":"39cbfa5c628fdb3ff5d9b6ddb7f56f1f85a33a76bc45ac6e9fa38513969bb4d7"}}