{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:OKYIM2BTR4F7BF7O6GKTJAFVRN","short_pith_number":"pith:OKYIM2BT","schema_version":"1.0","canonical_sha256":"72b08668338f0bf097eef1953480b58b71682c9245fd1073a71c9ccc73212b81","source":{"kind":"arxiv","id":"2206.07245","version":2},"attestation_state":"computed","paper":{"title":"An Extractive-and-Abstractive Framework for Source Code Summarization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Bin Luo, Chunrong Fang, Guanhong Tao, Quanjun Zhang, Tingxu Han, Weisong Sun, Yifei Ge, Yuchen Chen, Yudu You","submitted_at":"2022-06-15T02:14:24Z","abstract_excerpt":"(Source) Code summarization aims to automatically generate summaries/comments for a given code snippet in the form of natural language. Such summaries play a key role in helping developers understand and maintain source code. Existing code summarization techniques can be categorized into extractive methods and abstractive methods. The extractive methods extract a subset of important statements and keywords from the code snippet using retrieval techniques, and generate a summary that preserves factual details in important statements and keywords. However, such a subset may miss identifier or en"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2206.07245","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-06-15T02:14:24Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"e9491a1437d0901dd29e5fdb94b569a1e62459a9b6323627c5a2619a4a76df43","abstract_canon_sha256":"8231a605446314e2bbd5b5344787df23ae75a047c9f1d4c5bcc0ab4b3daefa89"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:08:52.472085Z","signature_b64":"Ey2sDd1qgqMjE5Scua25SNbiikRiitcYIacMIzbJxYvlaXz4LgJfbIAXhwlknrixGs1NvW+8deXtahsxvYEsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72b08668338f0bf097eef1953480b58b71682c9245fd1073a71c9ccc73212b81","last_reissued_at":"2026-07-05T07:08:52.471594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:08:52.471594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Extractive-and-Abstractive Framework for Source Code Summarization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.SE","authors_text":"Bin Luo, Chunrong Fang, Guanhong Tao, Quanjun Zhang, Tingxu Han, Weisong Sun, Yifei Ge, Yuchen Chen, Yudu You","submitted_at":"2022-06-15T02:14:24Z","abstract_excerpt":"(Source) Code summarization aims to automatically generate summaries/comments for a given code snippet in the form of natural language. Such summaries play a key role in helping developers understand and maintain source code. Existing code summarization techniques can be categorized into extractive methods and abstractive methods. The extractive methods extract a subset of important statements and keywords from the code snippet using retrieval techniques, and generate a summary that preserves factual details in important statements and keywords. However, such a subset may miss identifier or en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.07245","kind":"arxiv","version":2},"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/2206.07245/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2206.07245","created_at":"2026-07-05T07:08:52.471651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.07245v2","created_at":"2026-07-05T07:08:52.471651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.07245","created_at":"2026-07-05T07:08:52.471651+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKYIM2BTR4F7","created_at":"2026-07-05T07:08:52.471651+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKYIM2BTR4F7BF7O","created_at":"2026-07-05T07:08:52.471651+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKYIM2BT","created_at":"2026-07-05T07:08:52.471651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09062","citing_title":"Variational Prefix Tuning for Diverse and Accurate Code Summarization Using Pre-trained Language Models","ref_index":50,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN","json":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN.json","graph_json":"https://pith.science/api/pith-number/OKYIM2BTR4F7BF7O6GKTJAFVRN/graph.json","events_json":"https://pith.science/api/pith-number/OKYIM2BTR4F7BF7O6GKTJAFVRN/events.json","paper":"https://pith.science/paper/OKYIM2BT"},"agent_actions":{"view_html":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN","download_json":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN.json","view_paper":"https://pith.science/paper/OKYIM2BT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.07245&json=true","fetch_graph":"https://pith.science/api/pith-number/OKYIM2BTR4F7BF7O6GKTJAFVRN/graph.json","fetch_events":"https://pith.science/api/pith-number/OKYIM2BTR4F7BF7O6GKTJAFVRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN/action/storage_attestation","attest_author":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN/action/author_attestation","sign_citation":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN/action/citation_signature","submit_replication":"https://pith.science/pith/OKYIM2BTR4F7BF7O6GKTJAFVRN/action/replication_record"}},"created_at":"2026-07-05T07:08:52.471651+00:00","updated_at":"2026-07-05T07:08:52.471651+00:00"}