{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:VFXC5BSUTM45CXHEKROTTSSRMU","short_pith_number":"pith:VFXC5BSU","canonical_record":{"source":{"id":"2208.10741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-23T05:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f43c202da38b8f36edde232f7d127674f7f1fe265046fa64ae7cba633f9de6c","abstract_canon_sha256":"9f11111e4c82cee4e9ff1c7ac4e54eb11bddd16a8688b0fe3099d9b75f4057db"},"schema_version":"1.0"},"canonical_sha256":"a96e2e86549b39d15ce4545d39ca5165380dc2ee67b9b5462423022aaacaebc0","source":{"kind":"arxiv","id":"2208.10741","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10741","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10741v3","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10741","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"VFXC5BSUTM45","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_16","alias_value":"VFXC5BSUTM45CXHE","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_8","alias_value":"VFXC5BSU","created_at":"2026-07-05T06:32:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:VFXC5BSUTM45CXHEKROTTSSRMU","target":"record","payload":{"canonical_record":{"source":{"id":"2208.10741","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-23T05:27:32Z","cross_cats_sorted":[],"title_canon_sha256":"2f43c202da38b8f36edde232f7d127674f7f1fe265046fa64ae7cba633f9de6c","abstract_canon_sha256":"9f11111e4c82cee4e9ff1c7ac4e54eb11bddd16a8688b0fe3099d9b75f4057db"},"schema_version":"1.0"},"canonical_sha256":"a96e2e86549b39d15ce4545d39ca5165380dc2ee67b9b5462423022aaacaebc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:34.144852Z","signature_b64":"xO0Vz69MYkpKnDJ0CTKnYFIz28gEjRJLI48A1vquilxw3rc3VCycDYMUaCNSw6qNwkviDBz9ylbey2klsSagCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a96e2e86549b39d15ce4545d39ca5165380dc2ee67b9b5462423022aaacaebc0","last_reissued_at":"2026-07-05T06:32:34.144307Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:34.144307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2208.10741","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-07-05T06:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+92CMyf3lxIQBZiX3jjaM4Bl+J+Fi7pv+WxHfGy+ozGkxTITqfRjAVKYctbtv0/EIRXvxbbisfechuOQUPtNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:45:25.027742Z"},"content_sha256":"ba0d3fd904629ad963f61006939706a341812182f2cf654138626746d53da86e","schema_version":"1.0","event_id":"sha256:ba0d3fd904629ad963f61006939706a341812182f2cf654138626746d53da86e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:VFXC5BSUTM45CXHEKROTTSSRMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchically Decomposed Graph Convolutional Networks for Skeleton-Based Action Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Dogyoon Lee, Jungho Lee, Minhyeok Lee, Sangyoun Lee","submitted_at":"2022-08-23T05:27:32Z","abstract_excerpt":"Graph convolutional networks (GCNs) are the most commonly used methods for skeleton-based action recognition and have achieved remarkable performance. Generating adjacency matrices with semantically meaningful edges is particularly important for this task, but extracting such edges is challenging problem. To solve this, we propose a hierarchically decomposed graph convolutional network (HD-GCN) architecture with a novel hierarchically decomposed graph (HD-Graph). The proposed HD-GCN effectively decomposes every joint node into several sets to extract major structurally adjacent and distant edg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10741","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2208.10741/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-05T06:32:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KK7p/d+HLOjBw6XiIrzxWlowB66184cUi7NOSTnk6riGsfzIdI5ZjQE6KJJPtyrTlRbqfQ9il2EqTRy3F9QOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T03:45:25.028612Z"},"content_sha256":"3c274558d0c776bcf2141da88ea027f8ae18032ad165db2a02e009f12275691f","schema_version":"1.0","event_id":"sha256:3c274558d0c776bcf2141da88ea027f8ae18032ad165db2a02e009f12275691f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFXC5BSUTM45CXHEKROTTSSRMU/bundle.json","state_url":"https://pith.science/pith/VFXC5BSUTM45CXHEKROTTSSRMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFXC5BSUTM45CXHEKROTTSSRMU/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-11T03:45:25Z","links":{"resolver":"https://pith.science/pith/VFXC5BSUTM45CXHEKROTTSSRMU","bundle":"https://pith.science/pith/VFXC5BSUTM45CXHEKROTTSSRMU/bundle.json","state":"https://pith.science/pith/VFXC5BSUTM45CXHEKROTTSSRMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFXC5BSUTM45CXHEKROTTSSRMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:VFXC5BSUTM45CXHEKROTTSSRMU","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":"9f11111e4c82cee4e9ff1c7ac4e54eb11bddd16a8688b0fe3099d9b75f4057db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-23T05:27:32Z","title_canon_sha256":"2f43c202da38b8f36edde232f7d127674f7f1fe265046fa64ae7cba633f9de6c"},"schema_version":"1.0","source":{"id":"2208.10741","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2208.10741","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"arxiv_version","alias_value":"2208.10741v3","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.10741","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_12","alias_value":"VFXC5BSUTM45","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_16","alias_value":"VFXC5BSUTM45CXHE","created_at":"2026-07-05T06:32:34Z"},{"alias_kind":"pith_short_8","alias_value":"VFXC5BSU","created_at":"2026-07-05T06:32:34Z"}],"graph_snapshots":[{"event_id":"sha256:3c274558d0c776bcf2141da88ea027f8ae18032ad165db2a02e009f12275691f","target":"graph","created_at":"2026-07-05T06:32:34Z","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.10741/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph convolutional networks (GCNs) are the most commonly used methods for skeleton-based action recognition and have achieved remarkable performance. Generating adjacency matrices with semantically meaningful edges is particularly important for this task, but extracting such edges is challenging problem. To solve this, we propose a hierarchically decomposed graph convolutional network (HD-GCN) architecture with a novel hierarchically decomposed graph (HD-Graph). The proposed HD-GCN effectively decomposes every joint node into several sets to extract major structurally adjacent and distant edg","authors_text":"Dogyoon Lee, Jungho Lee, Minhyeok Lee, Sangyoun Lee","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-23T05:27:32Z","title":"Hierarchically Decomposed Graph Convolutional Networks for Skeleton-Based Action Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.10741","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:ba0d3fd904629ad963f61006939706a341812182f2cf654138626746d53da86e","target":"record","created_at":"2026-07-05T06:32:34Z","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":"9f11111e4c82cee4e9ff1c7ac4e54eb11bddd16a8688b0fe3099d9b75f4057db","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-08-23T05:27:32Z","title_canon_sha256":"2f43c202da38b8f36edde232f7d127674f7f1fe265046fa64ae7cba633f9de6c"},"schema_version":"1.0","source":{"id":"2208.10741","kind":"arxiv","version":3}},"canonical_sha256":"a96e2e86549b39d15ce4545d39ca5165380dc2ee67b9b5462423022aaacaebc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a96e2e86549b39d15ce4545d39ca5165380dc2ee67b9b5462423022aaacaebc0","first_computed_at":"2026-07-05T06:32:34.144307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:32:34.144307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xO0Vz69MYkpKnDJ0CTKnYFIz28gEjRJLI48A1vquilxw3rc3VCycDYMUaCNSw6qNwkviDBz9ylbey2klsSagCg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:32:34.144852Z","signed_message":"canonical_sha256_bytes"},"source_id":"2208.10741","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba0d3fd904629ad963f61006939706a341812182f2cf654138626746d53da86e","sha256:3c274558d0c776bcf2141da88ea027f8ae18032ad165db2a02e009f12275691f"],"state_sha256":"8007fef0e5ea68f982c386995ca2b4028dd5edc02a9e40864feb2a05bab533eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5BMdM1c78XgZceIDLLQ+sc/bkXAeV4Ik5gyxzdk9Og/XSIAy4Dw8SV9SdnV6xkuWY2Ddfr/B/mQILiI/rjGAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T03:45:25.043264Z","bundle_sha256":"b5371535eb14dbc65fd605c048fdd024e7124beeae3e384f0c2c43f2945f000f"}}