{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5V4RK32HQQTHSLMDP4Z6HNUS3O","short_pith_number":"pith:5V4RK32H","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"},"canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","source":{"kind":"arxiv","id":"1803.09544","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09544","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09544v3","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09544","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"5V4RK32HQQTH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5V4RK32HQQTHSLMD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5V4RK32H","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5V4RK32HQQTHSLMDP4Z6HNUS3O","target":"record","payload":{"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"},"canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","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"},"source_kind":"arxiv","source_id":"1803.09544","source_version":3,"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:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"77QFogZ8umyA3gxSZ+aNmmj0N+Z9zciSTSCVRmEaxANtV95JoRrLEY7+8ICJQ41aXXWnvusz0bQyS4/9GUk3Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:42:38.011718Z"},"content_sha256":"61c14ae042cccac02eba1e485620f034ce71c0486987c1f0c01ceb87d8867dfc","schema_version":"1.0","event_id":"sha256:61c14ae042cccac02eba1e485620f034ce71c0486987c1f0c01ceb87d8867dfc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5V4RK32HQQTHSLMDP4Z6HNUS3O","target":"graph","payload":{"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"},"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:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SDji/e5KKfsX7nM57SkLz6xdLlJYPvJICWS3dXyw1mXuX3RoPCslG/SnOa5EkfIQ7akrWLz0fWa2Uf3aeHhXBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:42:38.012057Z"},"content_sha256":"413b7f1f1d6552b0380d32c40d6db5303a4ecd7af962dd613e8bee4e5149929e","schema_version":"1.0","event_id":"sha256:413b7f1f1d6552b0380d32c40d6db5303a4ecd7af962dd613e8bee4e5149929e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/bundle.json","state_url":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/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-06-28T12:42:38Z","links":{"resolver":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O","bundle":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/bundle.json","state":"https://pith.science/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5V4RK32HQQTHSLMDP4Z6HNUS3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5V4RK32HQQTHSLMDP4Z6HNUS3O","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":"f7aca6437700eb15c8b2e4ab0f8391711e63a873ac508c9804fc0c28030943e4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-26T12:30:21Z","title_canon_sha256":"8a0873412446bc4d7ae5f8f2d847759eb0613313050b13e60134f5af4e1a9c0c"},"schema_version":"1.0","source":{"id":"1803.09544","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09544","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09544v3","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09544","created_at":"2026-05-18T00:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"5V4RK32HQQTH","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5V4RK32HQQTHSLMD","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5V4RK32H","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:413b7f1f1d6552b0380d32c40d6db5303a4ecd7af962dd613e8bee4e5149929e","target":"graph","created_at":"2026-05-18T00:17:53Z","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":"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","authors_text":"Eran Yahav, Meital Zilberstein, Omer Levy, Uri Alon","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-26T12:30:21Z","title":"A General Path-Based Representation for Predicting Program Properties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09544","kind":"arxiv","version":3},"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:61c14ae042cccac02eba1e485620f034ce71c0486987c1f0c01ceb87d8867dfc","target":"record","created_at":"2026-05-18T00:17:53Z","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":"f7aca6437700eb15c8b2e4ab0f8391711e63a873ac508c9804fc0c28030943e4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-03-26T12:30:21Z","title_canon_sha256":"8a0873412446bc4d7ae5f8f2d847759eb0613313050b13e60134f5af4e1a9c0c"},"schema_version":"1.0","source":{"id":"1803.09544","kind":"arxiv","version":3}},"canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed79156f478426792d837f33e3b692dba3f33af41fa1c7b3ce74d68d98f8c7ad","first_computed_at":"2026-05-18T00:17:53.191347Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:53.191347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Owm5uX5B2uBlsBfK9prQj+zj1fuOY7V/o7jqV0G22Ol3ncvKo3vNhZK07HhOzfb5PCqkfT5nWu7qmp8U/Q0FAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:53.191953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09544","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61c14ae042cccac02eba1e485620f034ce71c0486987c1f0c01ceb87d8867dfc","sha256:413b7f1f1d6552b0380d32c40d6db5303a4ecd7af962dd613e8bee4e5149929e"],"state_sha256":"5216b8d0aa2e9df3d954ad24146455090135e335d18f085830fe932ec3fd016c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j2X8eS3TnCbv89UgWy0L6FnJQw9rer1L5oYU48B3g3FBRcjt2IS8bDf3XwtkIuFextv0yi7fSmS0Hf8NPn8kAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:42:38.013928Z","bundle_sha256":"b797960559a55d34223b2717abd9f545fcb597f774675a7d90d75fac1936fc17"}}