{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5V4RK32HQQTHSLMDP4Z6HNUS3O","short_pith_number":"pith:5V4RK32H","schema_version":"1.0","canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","source":{"kind":"arxiv","id":"1803.09544","version":3},"attestation_state":"computed","paper":{"title":"A General Path-Based Representation for Predicting Program Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Eran Yahav, Meital Zilberstein, Omer Levy, Uri Alon","submitted_at":"2018-03-26T12:30:21Z","abstract_excerpt":"Predicting program properties such as names or expression types has a wide range of applications. It can ease the task of programming and increase programmer productivity. A major challenge when learning from programs is $\\textit{how to represent programs in a way that facilitates effective learning}$.\n  We present a $\\textit{general path-based representation}$ for learning from programs. Our representation is purely syntactic and extracted automatically. The main idea is to represent a program using paths in its abstract syntax tree (AST). This allows a learning model to leverage the structur"},"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":"1803.09544","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-26T12:30:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8a0873412446bc4d7ae5f8f2d847759eb0613313050b13e60134f5af4e1a9c0c","abstract_canon_sha256":"f7aca6437700eb15c8b2e4ab0f8391711e63a873ac508c9804fc0c28030943e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:53.191953Z","signature_b64":"Owm5uX5B2uBlsBfK9prQj+zj1fuOY7V/o7jqV0G22Ol3ncvKo3vNhZK07HhOzfb5PCqkfT5nWu7qmp8U/Q0FAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","last_reissued_at":"2026-05-18T00:17:53.191347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:53.191347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A General Path-Based Representation for Predicting Program Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Eran Yahav, Meital Zilberstein, Omer Levy, Uri Alon","submitted_at":"2018-03-26T12:30:21Z","abstract_excerpt":"Predicting program properties such as names or expression types has a wide range of applications. It can ease the task of programming and increase programmer productivity. A major challenge when learning from programs is $\\textit{how to represent programs in a way that facilitates effective learning}$.\n  We present a $\\textit{general path-based representation}$ for learning from programs. Our representation is purely syntactic and extracted automatically. The main idea is to represent a program using paths in its abstract syntax tree (AST). This allows a learning model to leverage the structur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09544","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.09544","created_at":"2026-05-18T00:17:53.191438+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.09544v3","created_at":"2026-05-18T00:17:53.191438+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09544","created_at":"2026-05-18T00:17:53.191438+00:00"},{"alias_kind":"pith_short_12","alias_value":"5V4RK32HQQTH","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5V4RK32HQQTHSLMD","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5V4RK32H","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O","json":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O.json","graph_json":"https://pith.science/api/pith-number/5V4RK32HQQTHSLMDP4Z6HNUS3O/graph.json","events_json":"https://pith.science/api/pith-number/5V4RK32HQQTHSLMDP4Z6HNUS3O/events.json","paper":"https://pith.science/paper/5V4RK32H"},"agent_actions":{"view_html":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O","download_json":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O.json","view_paper":"https://pith.science/paper/5V4RK32H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.09544&json=true","fetch_graph":"https://pith.science/api/pith-number/5V4RK32HQQTHSLMDP4Z6HNUS3O/graph.json","fetch_events":"https://pith.science/api/pith-number/5V4RK32HQQTHSLMDP4Z6HNUS3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/action/storage_attestation","attest_author":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/action/author_attestation","sign_citation":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/action/citation_signature","submit_replication":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/action/replication_record"}},"created_at":"2026-05-18T00:17:53.191438+00:00","updated_at":"2026-05-18T00:17:53.191438+00:00"}