{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GX3TQ2AXKPA74DSSV2K6HPW6JG","short_pith_number":"pith:GX3TQ2AX","schema_version":"1.0","canonical_sha256":"35f738681753c1fe0e52ae95e3bede499671cb34c7286ed105ce103ca1d35b94","source":{"kind":"arxiv","id":"2410.03351","version":1},"attestation_state":"computed","paper":{"title":"Generating Equivalent Representations of Code By A Self-Reflection Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.CL","authors_text":"Ge Li, Hao Zhu, Jia Li, Lecheng Wang, Zhi Jin","submitted_at":"2024-10-04T12:17:08Z","abstract_excerpt":"Equivalent Representations (ERs) of code are textual representations that preserve the same semantics as the code itself, e.g., natural language comments and pseudocode. ERs play a critical role in software development and maintenance. However, how to automatically generate ERs of code remains an open challenge. In this paper, we propose a self-reflection approach to generating ERs of code. It enables two Large Language Models (LLMs) to work mutually and produce an ER through a reflection process. Depending on whether constraints on ERs are applied, our approach generates ERs in both open and "},"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":"2410.03351","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2024-10-04T12:17:08Z","cross_cats_sorted":["cs.PL","cs.SE"],"title_canon_sha256":"8af0cdf14885b30ade243fd318d13ccdacfca9c3c269ef44d4a08ecc84eba500","abstract_canon_sha256":"171ae86896f3c1728bea2a2fa8ca7dc05d7f1940997c66254ec1c85962659404"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:15:48.125079Z","signature_b64":"3EhqV/PZ6v2VwRTYzBusU7TShglQyW9vJnokRKjjoGltPeTbNlklIhG9Ecb1d8GZ2oE5mucATG4AaWbiokCKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35f738681753c1fe0e52ae95e3bede499671cb34c7286ed105ce103ca1d35b94","last_reissued_at":"2026-07-05T09:15:48.124594Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:15:48.124594Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating Equivalent Representations of Code By A Self-Reflection Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","cs.SE"],"primary_cat":"cs.CL","authors_text":"Ge Li, Hao Zhu, Jia Li, Lecheng Wang, Zhi Jin","submitted_at":"2024-10-04T12:17:08Z","abstract_excerpt":"Equivalent Representations (ERs) of code are textual representations that preserve the same semantics as the code itself, e.g., natural language comments and pseudocode. ERs play a critical role in software development and maintenance. However, how to automatically generate ERs of code remains an open challenge. In this paper, we propose a self-reflection approach to generating ERs of code. It enables two Large Language Models (LLMs) to work mutually and produce an ER through a reflection process. Depending on whether constraints on ERs are applied, our approach generates ERs in both open and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.03351","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2410.03351/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":"2410.03351","created_at":"2026-07-05T09:15:48.124646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.03351v1","created_at":"2026-07-05T09:15:48.124646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.03351","created_at":"2026-07-05T09:15:48.124646+00:00"},{"alias_kind":"pith_short_12","alias_value":"GX3TQ2AXKPA7","created_at":"2026-07-05T09:15:48.124646+00:00"},{"alias_kind":"pith_short_16","alias_value":"GX3TQ2AXKPA74DSS","created_at":"2026-07-05T09:15:48.124646+00:00"},{"alias_kind":"pith_short_8","alias_value":"GX3TQ2AX","created_at":"2026-07-05T09:15:48.124646+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.00699","citing_title":"A Hierarchical and Evolvable Benchmark for Fine-Grained Code Instruction Following with Multi-Turn Feedback","ref_index":40,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG","json":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG.json","graph_json":"https://pith.science/api/pith-number/GX3TQ2AXKPA74DSSV2K6HPW6JG/graph.json","events_json":"https://pith.science/api/pith-number/GX3TQ2AXKPA74DSSV2K6HPW6JG/events.json","paper":"https://pith.science/paper/GX3TQ2AX"},"agent_actions":{"view_html":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG","download_json":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG.json","view_paper":"https://pith.science/paper/GX3TQ2AX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.03351&json=true","fetch_graph":"https://pith.science/api/pith-number/GX3TQ2AXKPA74DSSV2K6HPW6JG/graph.json","fetch_events":"https://pith.science/api/pith-number/GX3TQ2AXKPA74DSSV2K6HPW6JG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG/action/storage_attestation","attest_author":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG/action/author_attestation","sign_citation":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG/action/citation_signature","submit_replication":"https://pith.science/pith/GX3TQ2AXKPA74DSSV2K6HPW6JG/action/replication_record"}},"created_at":"2026-07-05T09:15:48.124646+00:00","updated_at":"2026-07-05T09:15:48.124646+00:00"}