{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FTQNG6UUQBRBVCPMEQ2KBQPPOO","short_pith_number":"pith:FTQNG6UU","canonical_record":{"source":{"id":"1811.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-11-17T22:21:12Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b337884abb7e15da5b65e7b48a3124936908f340633c16c6a512f5ac778c1c77","abstract_canon_sha256":"b0b476e358fe6b1dadca144b0d3ab4f7fc4e9052398ce26c121ad5e571d69eb9"},"schema_version":"1.0"},"canonical_sha256":"2ce0d37a9480621a89ec2434a0c1ef738f679f146e2cb8e06867f50ab7d6a147","source":{"kind":"arxiv","id":"1811.07234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07234","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07234v1","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07234","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"FTQNG6UUQBRB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FTQNG6UUQBRBVCPM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FTQNG6UU","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FTQNG6UUQBRBVCPMEQ2KBQPPOO","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-11-17T22:21:12Z","cross_cats_sorted":["cs.CL","cs.LG"],"title_canon_sha256":"b337884abb7e15da5b65e7b48a3124936908f340633c16c6a512f5ac778c1c77","abstract_canon_sha256":"b0b476e358fe6b1dadca144b0d3ab4f7fc4e9052398ce26c121ad5e571d69eb9"},"schema_version":"1.0"},"canonical_sha256":"2ce0d37a9480621a89ec2434a0c1ef738f679f146e2cb8e06867f50ab7d6a147","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:28.558189Z","signature_b64":"izeLfX4hgcHz9W3We4TuAkowAwTEkFh5hDXVew9ia+K28defKgrAuP3kKCo+DBn7+1Xhz5qZnftNDjrW2k16CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce0d37a9480621a89ec2434a0c1ef738f679f146e2cb8e06867f50ab7d6a147","last_reissued_at":"2026-05-18T00:00:28.557607Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:28.557607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07234","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-18T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UX96jLP99YttxN4gifz1lMy5YfVo5FPlLdEYVp+1HtJJzSBZM4nohr/KgR5vQCCCDrXH+W6XLtR32plqlh9rCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:31:42.990984Z"},"content_sha256":"2b4bfca1903aca876b34d9d00d305f8756ea8097d48a709369e52863004340f0","schema_version":"1.0","event_id":"sha256:2b4bfca1903aca876b34d9d00d305f8756ea8097d48a709369e52863004340f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FTQNG6UUQBRBVCPMEQ2KBQPPOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Automatic Source Code Summarization via Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.LG"],"primary_cat":"cs.SE","authors_text":"Guandong Xu, Haochao Ying, Jian Wu, Min Yang, Philip S. Yu, Yao Wan, Zhou Zhao","submitted_at":"2018-11-17T22:21:12Z","abstract_excerpt":"Code summarization provides a high level natural language description of the function performed by code, as it can benefit the software maintenance, code categorization and retrieval. To the best of our knowledge, most state-of-the-art approaches follow an encoder-decoder framework which encodes the code into a hidden space and then decode it into natural language space, suffering from two major drawbacks: a) Their encoders only consider the sequential content of code, ignoring the tree structure which is also critical for the task of code summarization, b) Their decoders are typically trained"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07234","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-18T00:00:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zoYb09/l/ngWTs062x5ndC5+4OJ1ynkJ2s5N7DVpz8cEaoY73Mdhv9HOCg9ugHTk170zY/x9MC5TcQ6FXf6YCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T07:31:42.991339Z"},"content_sha256":"1577e27b20c3adaa37f510aa1556b4a10a5140cf9c3ed81c1f7974d72210c3ca","schema_version":"1.0","event_id":"sha256:1577e27b20c3adaa37f510aa1556b4a10a5140cf9c3ed81c1f7974d72210c3ca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/bundle.json","state_url":"https://pith.science/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/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-19T07:31:42Z","links":{"resolver":"https://pith.science/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO","bundle":"https://pith.science/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/bundle.json","state":"https://pith.science/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTQNG6UUQBRBVCPMEQ2KBQPPOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FTQNG6UUQBRBVCPMEQ2KBQPPOO","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":"b0b476e358fe6b1dadca144b0d3ab4f7fc4e9052398ce26c121ad5e571d69eb9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-11-17T22:21:12Z","title_canon_sha256":"b337884abb7e15da5b65e7b48a3124936908f340633c16c6a512f5ac778c1c77"},"schema_version":"1.0","source":{"id":"1811.07234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07234","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07234v1","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07234","created_at":"2026-05-18T00:00:28Z"},{"alias_kind":"pith_short_12","alias_value":"FTQNG6UUQBRB","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FTQNG6UUQBRBVCPM","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FTQNG6UU","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:1577e27b20c3adaa37f510aa1556b4a10a5140cf9c3ed81c1f7974d72210c3ca","target":"graph","created_at":"2026-05-18T00:00:28Z","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":"Code summarization provides a high level natural language description of the function performed by code, as it can benefit the software maintenance, code categorization and retrieval. To the best of our knowledge, most state-of-the-art approaches follow an encoder-decoder framework which encodes the code into a hidden space and then decode it into natural language space, suffering from two major drawbacks: a) Their encoders only consider the sequential content of code, ignoring the tree structure which is also critical for the task of code summarization, b) Their decoders are typically trained","authors_text":"Guandong Xu, Haochao Ying, Jian Wu, Min Yang, Philip S. Yu, Yao Wan, Zhou Zhao","cross_cats":["cs.CL","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-11-17T22:21:12Z","title":"Improving Automatic Source Code Summarization via Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07234","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:2b4bfca1903aca876b34d9d00d305f8756ea8097d48a709369e52863004340f0","target":"record","created_at":"2026-05-18T00:00:28Z","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":"b0b476e358fe6b1dadca144b0d3ab4f7fc4e9052398ce26c121ad5e571d69eb9","cross_cats_sorted":["cs.CL","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2018-11-17T22:21:12Z","title_canon_sha256":"b337884abb7e15da5b65e7b48a3124936908f340633c16c6a512f5ac778c1c77"},"schema_version":"1.0","source":{"id":"1811.07234","kind":"arxiv","version":1}},"canonical_sha256":"2ce0d37a9480621a89ec2434a0c1ef738f679f146e2cb8e06867f50ab7d6a147","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ce0d37a9480621a89ec2434a0c1ef738f679f146e2cb8e06867f50ab7d6a147","first_computed_at":"2026-05-18T00:00:28.557607Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:28.557607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"izeLfX4hgcHz9W3We4TuAkowAwTEkFh5hDXVew9ia+K28defKgrAuP3kKCo+DBn7+1Xhz5qZnftNDjrW2k16CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:28.558189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b4bfca1903aca876b34d9d00d305f8756ea8097d48a709369e52863004340f0","sha256:1577e27b20c3adaa37f510aa1556b4a10a5140cf9c3ed81c1f7974d72210c3ca"],"state_sha256":"e7a4889073e4dd3b6eab6e1c06744b07774bcf7f73ab9d85d0cb3ef961d8d9e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oz6tXQ1D8JtLV0KoPtafI4CK3CAdjftO22pcSPzFz20lCkNfbwsT9Klh7EEJmYv3hu/ZfvPQp+hdByFvHhJjDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T07:31:42.993000Z","bundle_sha256":"da6e18e4f43456c10f5a1b47a5b8173ff7489e156f6ea507001d8e540319e546"}}