{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:S6JIMDG5WU42PMONUZYDGLE3FL","short_pith_number":"pith:S6JIMDG5","canonical_record":{"source":{"id":"2203.14285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-03-27T11:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"e65e963650134a69b48b73c22614c24cf30de4c1274c925bf21424e0b21bfd5c","abstract_canon_sha256":"a46fb5efa170ed66698adf8220c9872e7f3ae1ad912a185c274dfe749f4d07d1"},"schema_version":"1.0"},"canonical_sha256":"9792860cddb539a7b1cda670332c9b2aec3b5ddae1e1d8ff9c00225a8b97b8d1","source":{"kind":"arxiv","id":"2203.14285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.14285","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2203.14285v1","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14285","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"S6JIMDG5WU42","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"S6JIMDG5WU42PMON","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"S6JIMDG5","created_at":"2026-07-05T04:08:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:S6JIMDG5WU42PMONUZYDGLE3FL","target":"record","payload":{"canonical_record":{"source":{"id":"2203.14285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-03-27T11:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"e65e963650134a69b48b73c22614c24cf30de4c1274c925bf21424e0b21bfd5c","abstract_canon_sha256":"a46fb5efa170ed66698adf8220c9872e7f3ae1ad912a185c274dfe749f4d07d1"},"schema_version":"1.0"},"canonical_sha256":"9792860cddb539a7b1cda670332c9b2aec3b5ddae1e1d8ff9c00225a8b97b8d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:08:49.577185Z","signature_b64":"+a2zYqeaXyzqOu614Dp0BVBahqKPXFGb5++yyUiopOnSf19WubcmBrT5CBtZbtK1k9DIn2ECKzPUkLsZly15CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9792860cddb539a7b1cda670332c9b2aec3b5ddae1e1d8ff9c00225a8b97b8d1","last_reissued_at":"2026-07-05T04:08:49.576720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:08:49.576720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.14285","source_version":1,"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-05T04:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AazOo1v9BAR+tCLErgObgk31CKmqEr1AYLnthlMDOercIVlB1nK2Tawe7Femw+56Z5ZiUrajPZxzcI9FK4gjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:59:18.397720Z"},"content_sha256":"d95b5f91fecdbd2afc27b419c45abf8a5ae3e862351e0b9bed2e3458de0b6c82","schema_version":"1.0","event_id":"sha256:d95b5f91fecdbd2afc27b419c45abf8a5ae3e862351e0b9bed2e3458de0b6c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:S6JIMDG5WU42PMONUZYDGLE3FL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"HELoC: Hierarchical Contrastive Learning of Source Code Representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Chen Lyu, Hongyu Zhang, Lei Lyu, Qiong Wu, Songlin Hu, Xiao Wang, Xue Jiang, Zhuoran Zheng","submitted_at":"2022-03-27T11:59:10Z","abstract_excerpt":"Abstract syntax trees (ASTs) play a crucial role in source code representation. However, due to the large number of nodes in an AST and the typically deep AST hierarchy, it is challenging to learn the hierarchical structure of an AST effectively. In this paper, we propose HELoC, a hierarchical contrastive learning model for source code representation. To effectively learn the AST hierarchy, we use contrastive learning to allow the network to predict the AST node level and learn the hierarchical relationships between nodes in a self-supervised manner, which makes the representation vectors of n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14285","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/2203.14285/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-05T04:08:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kS2eDtZ7YbIghGBkZVaX9BZaSmXx9T8dDinLRp2xlV9/yndewCFzsshRzGbO6wUn+nFJOSas9vwWyOUi4HYGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:59:18.398104Z"},"content_sha256":"140e3acc3fe082b001f16c450a27c3b4e84bf1d6c0a0e8dacb2337f64f2398be","schema_version":"1.0","event_id":"sha256:140e3acc3fe082b001f16c450a27c3b4e84bf1d6c0a0e8dacb2337f64f2398be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S6JIMDG5WU42PMONUZYDGLE3FL/bundle.json","state_url":"https://pith.science/pith/S6JIMDG5WU42PMONUZYDGLE3FL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S6JIMDG5WU42PMONUZYDGLE3FL/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-07-07T05:59:18Z","links":{"resolver":"https://pith.science/pith/S6JIMDG5WU42PMONUZYDGLE3FL","bundle":"https://pith.science/pith/S6JIMDG5WU42PMONUZYDGLE3FL/bundle.json","state":"https://pith.science/pith/S6JIMDG5WU42PMONUZYDGLE3FL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S6JIMDG5WU42PMONUZYDGLE3FL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:S6JIMDG5WU42PMONUZYDGLE3FL","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":"a46fb5efa170ed66698adf8220c9872e7f3ae1ad912a185c274dfe749f4d07d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-03-27T11:59:10Z","title_canon_sha256":"e65e963650134a69b48b73c22614c24cf30de4c1274c925bf21424e0b21bfd5c"},"schema_version":"1.0","source":{"id":"2203.14285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.14285","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"arxiv_version","alias_value":"2203.14285v1","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.14285","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_12","alias_value":"S6JIMDG5WU42","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_16","alias_value":"S6JIMDG5WU42PMON","created_at":"2026-07-05T04:08:49Z"},{"alias_kind":"pith_short_8","alias_value":"S6JIMDG5","created_at":"2026-07-05T04:08:49Z"}],"graph_snapshots":[{"event_id":"sha256:140e3acc3fe082b001f16c450a27c3b4e84bf1d6c0a0e8dacb2337f64f2398be","target":"graph","created_at":"2026-07-05T04:08:49Z","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/2203.14285/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Abstract syntax trees (ASTs) play a crucial role in source code representation. However, due to the large number of nodes in an AST and the typically deep AST hierarchy, it is challenging to learn the hierarchical structure of an AST effectively. In this paper, we propose HELoC, a hierarchical contrastive learning model for source code representation. To effectively learn the AST hierarchy, we use contrastive learning to allow the network to predict the AST node level and learn the hierarchical relationships between nodes in a self-supervised manner, which makes the representation vectors of n","authors_text":"Chen Lyu, Hongyu Zhang, Lei Lyu, Qiong Wu, Songlin Hu, Xiao Wang, Xue Jiang, Zhuoran Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-03-27T11:59:10Z","title":"HELoC: Hierarchical Contrastive Learning of Source Code Representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.14285","kind":"arxiv","version":1},"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:d95b5f91fecdbd2afc27b419c45abf8a5ae3e862351e0b9bed2e3458de0b6c82","target":"record","created_at":"2026-07-05T04:08:49Z","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":"a46fb5efa170ed66698adf8220c9872e7f3ae1ad912a185c274dfe749f4d07d1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2022-03-27T11:59:10Z","title_canon_sha256":"e65e963650134a69b48b73c22614c24cf30de4c1274c925bf21424e0b21bfd5c"},"schema_version":"1.0","source":{"id":"2203.14285","kind":"arxiv","version":1}},"canonical_sha256":"9792860cddb539a7b1cda670332c9b2aec3b5ddae1e1d8ff9c00225a8b97b8d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9792860cddb539a7b1cda670332c9b2aec3b5ddae1e1d8ff9c00225a8b97b8d1","first_computed_at":"2026-07-05T04:08:49.576720Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:08:49.576720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+a2zYqeaXyzqOu614Dp0BVBahqKPXFGb5++yyUiopOnSf19WubcmBrT5CBtZbtK1k9DIn2ECKzPUkLsZly15CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:08:49.577185Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.14285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d95b5f91fecdbd2afc27b419c45abf8a5ae3e862351e0b9bed2e3458de0b6c82","sha256:140e3acc3fe082b001f16c450a27c3b4e84bf1d6c0a0e8dacb2337f64f2398be"],"state_sha256":"99ee4f105dbd95b5e4f0c16766c2af987372c5778888198209efcf20ce6263fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2aJEJ5wQedhUhapPvin/9gmJ+ztpcjRwLkXv2Qp82BoA6b6SlNpJrEeafGTqPrgV4UTGGJ3EaC/A9XCfRDMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:59:18.400377Z","bundle_sha256":"059d6832fd4ee5fa4b68382e14f0eccb8a1a9b82911c8a6c6940309ce7e85b8c"}}