{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JSMJS2LXKUL32NZRJODVF6ENFP","short_pith_number":"pith:JSMJS2LX","canonical_record":{"source":{"id":"2208.08643","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-18T05:42:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7f2625778329411decc8587e41b4b93679c57bb422039337898f49842b73dd87","abstract_canon_sha256":"44cdaccde9d5fbefd56543fb8d9b91e7de6a274b5eaf1f512abb749c47b7cced"},"schema_version":"1.0"},"canonical_sha256":"4c989969775517bd37314b8752f88d2bdfdb33108b666dc46a683277366c5865","source":{"kind":"arxiv","id":"2208.08643","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.08643","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"2208.08643v2","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08643","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"JSMJS2LXKUL3","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_16","alias_value":"JSMJS2LXKUL32NZR","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_8","alias_value":"JSMJS2LX","created_at":"2026-07-05T05:31:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JSMJS2LXKUL32NZRJODVF6ENFP","target":"record","payload":{"canonical_record":{"source":{"id":"2208.08643","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-18T05:42:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"7f2625778329411decc8587e41b4b93679c57bb422039337898f49842b73dd87","abstract_canon_sha256":"44cdaccde9d5fbefd56543fb8d9b91e7de6a274b5eaf1f512abb749c47b7cced"},"schema_version":"1.0"},"canonical_sha256":"4c989969775517bd37314b8752f88d2bdfdb33108b666dc46a683277366c5865","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:31:16.493100Z","signature_b64":"dylcYcEqQvgO9futLvy6O/uWpfkJoEZU3+92l/R/IDddLAdx97MxaQj7B54vkzBZJa17cAa/posIzKglLFH/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c989969775517bd37314b8752f88d2bdfdb33108b666dc46a683277366c5865","last_reissued_at":"2026-07-05T05:31:16.492630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:31:16.492630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.08643","source_version":2,"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-07-05T05:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tgg3P6KI+YFLwOTV5CNimDwx+qq34EarV9KxNezaVA4Oz1n0Ipp6owtg5Qth2qYIw9ZC1jF/9DQv0d5NYPr8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:30:57.794360Z"},"content_sha256":"8067059939349b4480a8f23675b89accad16700c8402344120292d1ff8f621f4","schema_version":"1.0","event_id":"sha256:8067059939349b4480a8f23675b89accad16700c8402344120292d1ff8f621f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JSMJS2LXKUL32NZRJODVF6ENFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Program Representations with a Tree-Structured Transformer","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SE","authors_text":"Anran Li, Ge Li, Kechi Zhang, Shangqing Liu, Wenhan Wang, Yang Liu, Zhi Jin","submitted_at":"2022-08-18T05:42:01Z","abstract_excerpt":"Learning vector representations for programs is a critical step in applying deep learning techniques for program understanding tasks. Various neural network models are proposed to learn from tree-structured program representations, e.g., abstract syntax tree (AST) and concrete syntax tree (CST). However, most neural architectures either fail to capture long-range dependencies which are ubiquitous in programs, or cannot learn effective representations for syntax tree nodes, making them incapable of performing the node-level prediction tasks, e.g., bug localization. In this paper, we propose Tre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08643","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/2208.08643/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"},"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-07-05T05:31:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z80uWU1TvsFkSn150/bluv4ddPTv2t8e8SK7du5iBmO3+KTBu3rADPZkjeNU7GQBXoQkrlrGTy2Bn16TBJoIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:30:57.795006Z"},"content_sha256":"bed959606d450598e3060683dcc573ec439d902616f1bc46d8c7403acc3470b7","schema_version":"1.0","event_id":"sha256:bed959606d450598e3060683dcc573ec439d902616f1bc46d8c7403acc3470b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JSMJS2LXKUL32NZRJODVF6ENFP/bundle.json","state_url":"https://pith.science/pith/JSMJS2LXKUL32NZRJODVF6ENFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JSMJS2LXKUL32NZRJODVF6ENFP/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-08-05T12:30:57Z","links":{"resolver":"https://pith.science/pith/JSMJS2LXKUL32NZRJODVF6ENFP","bundle":"https://pith.science/pith/JSMJS2LXKUL32NZRJODVF6ENFP/bundle.json","state":"https://pith.science/pith/JSMJS2LXKUL32NZRJODVF6ENFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JSMJS2LXKUL32NZRJODVF6ENFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JSMJS2LXKUL32NZRJODVF6ENFP","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":"44cdaccde9d5fbefd56543fb8d9b91e7de6a274b5eaf1f512abb749c47b7cced","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-18T05:42:01Z","title_canon_sha256":"7f2625778329411decc8587e41b4b93679c57bb422039337898f49842b73dd87"},"schema_version":"1.0","source":{"id":"2208.08643","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.08643","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"arxiv_version","alias_value":"2208.08643v2","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.08643","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_12","alias_value":"JSMJS2LXKUL3","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_16","alias_value":"JSMJS2LXKUL32NZR","created_at":"2026-07-05T05:31:16Z"},{"alias_kind":"pith_short_8","alias_value":"JSMJS2LX","created_at":"2026-07-05T05:31:16Z"}],"graph_snapshots":[{"event_id":"sha256:bed959606d450598e3060683dcc573ec439d902616f1bc46d8c7403acc3470b7","target":"graph","created_at":"2026-07-05T05:31:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2208.08643/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Learning vector representations for programs is a critical step in applying deep learning techniques for program understanding tasks. Various neural network models are proposed to learn from tree-structured program representations, e.g., abstract syntax tree (AST) and concrete syntax tree (CST). However, most neural architectures either fail to capture long-range dependencies which are ubiquitous in programs, or cannot learn effective representations for syntax tree nodes, making them incapable of performing the node-level prediction tasks, e.g., bug localization. In this paper, we propose Tre","authors_text":"Anran Li, Ge Li, Kechi Zhang, Shangqing Liu, Wenhan Wang, Yang Liu, Zhi Jin","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-18T05:42:01Z","title":"Learning Program Representations with a Tree-Structured Transformer"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.08643","kind":"arxiv","version":2},"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:8067059939349b4480a8f23675b89accad16700c8402344120292d1ff8f621f4","target":"record","created_at":"2026-07-05T05:31:16Z","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":"44cdaccde9d5fbefd56543fb8d9b91e7de6a274b5eaf1f512abb749c47b7cced","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2022-08-18T05:42:01Z","title_canon_sha256":"7f2625778329411decc8587e41b4b93679c57bb422039337898f49842b73dd87"},"schema_version":"1.0","source":{"id":"2208.08643","kind":"arxiv","version":2}},"canonical_sha256":"4c989969775517bd37314b8752f88d2bdfdb33108b666dc46a683277366c5865","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c989969775517bd37314b8752f88d2bdfdb33108b666dc46a683277366c5865","first_computed_at":"2026-07-05T05:31:16.492630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:31:16.492630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dylcYcEqQvgO9futLvy6O/uWpfkJoEZU3+92l/R/IDddLAdx97MxaQj7B54vkzBZJa17cAa/posIzKglLFH/CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:31:16.493100Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.08643","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8067059939349b4480a8f23675b89accad16700c8402344120292d1ff8f621f4","sha256:bed959606d450598e3060683dcc573ec439d902616f1bc46d8c7403acc3470b7"],"state_sha256":"e899107f8f244a0a6e9be97d4f9498ff791a918bf643330759b06afc046eeefe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oBhkrGNZndXPaybnuygrZejSVJGeN8SkkL9y83t7msudACBTWNISK3rcaFzb04+BdpksifY2PugqOYjO/WTqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:30:57.799092Z","bundle_sha256":"b475d4f8d356987f3e3fa72693cb1cb48611d55076e200eba48a07473d1a7f58"}}