{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5NAIJWPNDSSPH7EOFZGXY4P3PG","short_pith_number":"pith:5NAIJWPN","canonical_record":{"source":{"id":"1907.04557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-10T07:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"16cee6afbfd95a1dc21eb5c7ea8c00e8fd5b5fe94827b256e3494fc160783de9","abstract_canon_sha256":"0b57e4b800555e3e3f5d589ef4621a9b98d3c215933da0e77a9aac36add7de63"},"schema_version":"1.0"},"canonical_sha256":"eb4084d9ed1ca4f3fc8e2e4d7c71fb79ab458f1aee8c015522b4047b967fe1dd","source":{"kind":"arxiv","id":"1907.04557","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04557","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04557v1","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04557","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"5NAIJWPNDSSP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5NAIJWPNDSSPH7EO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5NAIJWPN","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5NAIJWPNDSSPH7EOFZGXY4P3PG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04557","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-10T07:58:39Z","cross_cats_sorted":[],"title_canon_sha256":"16cee6afbfd95a1dc21eb5c7ea8c00e8fd5b5fe94827b256e3494fc160783de9","abstract_canon_sha256":"0b57e4b800555e3e3f5d589ef4621a9b98d3c215933da0e77a9aac36add7de63"},"schema_version":"1.0"},"canonical_sha256":"eb4084d9ed1ca4f3fc8e2e4d7c71fb79ab458f1aee8c015522b4047b967fe1dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:59.894062Z","signature_b64":"bRb5+2un81RyZB+cTUj5V8HFVDhXJVO6OMgFZew7oeDeK1zTML/IyqwE1Lw4W25vRahhCfE3W2/38LvPWNETBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb4084d9ed1ca4f3fc8e2e4d7c71fb79ab458f1aee8c015522b4047b967fe1dd","last_reissued_at":"2026-05-17T23:40:59.893455Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:59.893455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04557","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-17T23:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DcNEdy9cu5tKyFEcyZ8xGgSDKDCDhx+4m+6+L0CUpXSc3TL6Y7UeOkrp3UJwB5hH580wYf0wSc/ijSguKK0cBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:17.009939Z"},"content_sha256":"6ed551c4a7dbfb8c6d7d38148b90ee2b713c036d867eccaa68994312631b1d52","schema_version":"1.0","event_id":"sha256:6ed551c4a7dbfb8c6d7d38148b90ee2b713c036d867eccaa68994312631b1d52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5NAIJWPNDSSPH7EOFZGXY4P3PG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying Algorithm Names in Code Comments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Arnon Rungsawang, Bundit Manaskasemsak, Hideaki Hata, Jakapong Klainongsuang, Kenichi Matsumoto, Pattara Leelaprute, Yusuf Sulistyo Nugroho","submitted_at":"2019-07-10T07:58:39Z","abstract_excerpt":"For recent machine-learning-based tasks like API sequence generation, comment generation, and document generation, large amount of data is needed. When software developers implement algorithms in code, we find that they often mention algorithm names in code comments. Code annotated with such algorithm names can be valuable data sources. In this paper, we propose an automatic method of algorithm name identification. The key idea is extracting important N-gram words containing the word `algorithm' in the last. We also consider part of speech patterns to derive rules for appropriate algorithm nam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04557","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-17T23:40:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X4z3ufz802v+1uBljIXS6Tn1RxEtgffNmKkMAnObm209zUM161dc1DjWUmUsh+DkpfTEOjItr1TXzwYJXTCPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:48:17.010671Z"},"content_sha256":"f8b8064f5c9e7d821c9f6beca8fc13e7057a68d51600dda2b9147df954516a2f","schema_version":"1.0","event_id":"sha256:f8b8064f5c9e7d821c9f6beca8fc13e7057a68d51600dda2b9147df954516a2f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/bundle.json","state_url":"https://pith.science/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/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-25T20:48:17Z","links":{"resolver":"https://pith.science/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG","bundle":"https://pith.science/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/bundle.json","state":"https://pith.science/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5NAIJWPNDSSPH7EOFZGXY4P3PG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5NAIJWPNDSSPH7EOFZGXY4P3PG","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":"0b57e4b800555e3e3f5d589ef4621a9b98d3c215933da0e77a9aac36add7de63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-10T07:58:39Z","title_canon_sha256":"16cee6afbfd95a1dc21eb5c7ea8c00e8fd5b5fe94827b256e3494fc160783de9"},"schema_version":"1.0","source":{"id":"1907.04557","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04557","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04557v1","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04557","created_at":"2026-05-17T23:40:59Z"},{"alias_kind":"pith_short_12","alias_value":"5NAIJWPNDSSP","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5NAIJWPNDSSPH7EO","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5NAIJWPN","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f8b8064f5c9e7d821c9f6beca8fc13e7057a68d51600dda2b9147df954516a2f","target":"graph","created_at":"2026-05-17T23:40:59Z","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":"For recent machine-learning-based tasks like API sequence generation, comment generation, and document generation, large amount of data is needed. When software developers implement algorithms in code, we find that they often mention algorithm names in code comments. Code annotated with such algorithm names can be valuable data sources. In this paper, we propose an automatic method of algorithm name identification. The key idea is extracting important N-gram words containing the word `algorithm' in the last. We also consider part of speech patterns to derive rules for appropriate algorithm nam","authors_text":"Arnon Rungsawang, Bundit Manaskasemsak, Hideaki Hata, Jakapong Klainongsuang, Kenichi Matsumoto, Pattara Leelaprute, Yusuf Sulistyo Nugroho","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-10T07:58:39Z","title":"Identifying Algorithm Names in Code Comments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04557","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:6ed551c4a7dbfb8c6d7d38148b90ee2b713c036d867eccaa68994312631b1d52","target":"record","created_at":"2026-05-17T23:40:59Z","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":"0b57e4b800555e3e3f5d589ef4621a9b98d3c215933da0e77a9aac36add7de63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2019-07-10T07:58:39Z","title_canon_sha256":"16cee6afbfd95a1dc21eb5c7ea8c00e8fd5b5fe94827b256e3494fc160783de9"},"schema_version":"1.0","source":{"id":"1907.04557","kind":"arxiv","version":1}},"canonical_sha256":"eb4084d9ed1ca4f3fc8e2e4d7c71fb79ab458f1aee8c015522b4047b967fe1dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb4084d9ed1ca4f3fc8e2e4d7c71fb79ab458f1aee8c015522b4047b967fe1dd","first_computed_at":"2026-05-17T23:40:59.893455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:59.893455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bRb5+2un81RyZB+cTUj5V8HFVDhXJVO6OMgFZew7oeDeK1zTML/IyqwE1Lw4W25vRahhCfE3W2/38LvPWNETBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:59.894062Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04557","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ed551c4a7dbfb8c6d7d38148b90ee2b713c036d867eccaa68994312631b1d52","sha256:f8b8064f5c9e7d821c9f6beca8fc13e7057a68d51600dda2b9147df954516a2f"],"state_sha256":"4428a58118095ac4c2a39c12ec9ece6980a077a9262421a36a88ed76f81b3df9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QtzhVxNFYk1CFGPjV9mV/Fgfc382PJnhiwkkTiaslSTcjBY4tw8012+IwHBgmHqbYHhUNIBnqJz0wPzP/lMGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:48:17.014680Z","bundle_sha256":"55fca1298293e0d3883e04364dee457de33d19c61e5ce2228821bd4ae66ce6d1"}}