{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2NO3ZZJVFIWLPQFFV23WQJXJIG","short_pith_number":"pith:2NO3ZZJV","canonical_record":{"source":{"id":"2412.12887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-17T13:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"69110d7bc995194fe8b8108cacb6333f860329df53b6ff211673569e3e8502a7","abstract_canon_sha256":"3e87436825a2bf5f9fe96d4830f1051c2d42753c233ce47f7df63179b154055d"},"schema_version":"1.0"},"canonical_sha256":"d35dbce5352a2cb7c0a5aeb76826e9418c88806faf9bd1256ba350a3447bd07d","source":{"kind":"arxiv","id":"2412.12887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12887","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12887v1","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12887","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"2NO3ZZJVFIWL","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"2NO3ZZJVFIWLPQFF","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"2NO3ZZJV","created_at":"2026-07-05T09:50:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2NO3ZZJVFIWLPQFFV23WQJXJIG","target":"record","payload":{"canonical_record":{"source":{"id":"2412.12887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-17T13:11:48Z","cross_cats_sorted":[],"title_canon_sha256":"69110d7bc995194fe8b8108cacb6333f860329df53b6ff211673569e3e8502a7","abstract_canon_sha256":"3e87436825a2bf5f9fe96d4830f1051c2d42753c233ce47f7df63179b154055d"},"schema_version":"1.0"},"canonical_sha256":"d35dbce5352a2cb7c0a5aeb76826e9418c88806faf9bd1256ba350a3447bd07d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:22.217551Z","signature_b64":"wp8QP/0rcZ3PHrKz1iM+S8vS37AHf1w9N2E1nT/u6+2+U4cnuI7VAqhSDFz4AOTCj00rhToonAQ5CQJylpl6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d35dbce5352a2cb7c0a5aeb76826e9418c88806faf9bd1256ba350a3447bd07d","last_reissued_at":"2026-07-05T09:50:22.217130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:22.217130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.12887","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-05T09:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07CmCZ/3tRslfT17Ywyn+aKfcmVRGx1WzDYRk/USRSgRhAhusfc0ISmbpo67QqnSswTTbg1i+9oNFnv5s03SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:02.709750Z"},"content_sha256":"2f91eebec0dede3156bf9b54cc3b9a964a6f3f037fd6a0119ffa3f7353276e48","schema_version":"1.0","event_id":"sha256:2f91eebec0dede3156bf9b54cc3b9a964a6f3f037fd6a0119ffa3f7353276e48"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2NO3ZZJVFIWLPQFFV23WQJXJIG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Coarse-to-Fine Pruning of Graph Convolutional Networks for Skeleton-based Recognition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Hichem Sahbi","submitted_at":"2024-12-17T13:11:48Z","abstract_excerpt":"Magnitude Pruning is a staple lightweight network design method which seeks to remove connections with the smallest magnitude. This process is either achieved in a structured or unstructured manner. While structured pruning allows reaching high efficiency, unstructured one is more flexible and leads to better accuracy, but this is achieved at the expense of low computational performance. In this paper, we devise a novel coarse-to-fine (CTF) method that gathers the advantages of structured and unstructured pruning while discarding their inconveniences to some extent. Our method relies on a nove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12887","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/2412.12887/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-05T09:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H8aZmDkqSHpIoAORtUVX54nyHZysUXTIHhvPT0T+eECLjJQzGSHZJl8O8TqLMqlRF3LK+EgPcSoiXHeraWURCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T04:05:02.710676Z"},"content_sha256":"c757361a032ac43c03556d010baa16b94f28f0a1b7f44e42ae84d5d019ed1109","schema_version":"1.0","event_id":"sha256:c757361a032ac43c03556d010baa16b94f28f0a1b7f44e42ae84d5d019ed1109"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/bundle.json","state_url":"https://pith.science/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/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-13T04:05:02Z","links":{"resolver":"https://pith.science/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG","bundle":"https://pith.science/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/bundle.json","state":"https://pith.science/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NO3ZZJVFIWLPQFFV23WQJXJIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2NO3ZZJVFIWLPQFFV23WQJXJIG","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":"3e87436825a2bf5f9fe96d4830f1051c2d42753c233ce47f7df63179b154055d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-17T13:11:48Z","title_canon_sha256":"69110d7bc995194fe8b8108cacb6333f860329df53b6ff211673569e3e8502a7"},"schema_version":"1.0","source":{"id":"2412.12887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.12887","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"2412.12887v1","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12887","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"2NO3ZZJVFIWL","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_16","alias_value":"2NO3ZZJVFIWLPQFF","created_at":"2026-07-05T09:50:22Z"},{"alias_kind":"pith_short_8","alias_value":"2NO3ZZJV","created_at":"2026-07-05T09:50:22Z"}],"graph_snapshots":[{"event_id":"sha256:c757361a032ac43c03556d010baa16b94f28f0a1b7f44e42ae84d5d019ed1109","target":"graph","created_at":"2026-07-05T09:50:22Z","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/2412.12887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Magnitude Pruning is a staple lightweight network design method which seeks to remove connections with the smallest magnitude. This process is either achieved in a structured or unstructured manner. While structured pruning allows reaching high efficiency, unstructured one is more flexible and leads to better accuracy, but this is achieved at the expense of low computational performance. In this paper, we devise a novel coarse-to-fine (CTF) method that gathers the advantages of structured and unstructured pruning while discarding their inconveniences to some extent. Our method relies on a nove","authors_text":"Hichem Sahbi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-17T13:11:48Z","title":"Learning Coarse-to-Fine Pruning of Graph Convolutional Networks for Skeleton-based Recognition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12887","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:2f91eebec0dede3156bf9b54cc3b9a964a6f3f037fd6a0119ffa3f7353276e48","target":"record","created_at":"2026-07-05T09:50:22Z","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":"3e87436825a2bf5f9fe96d4830f1051c2d42753c233ce47f7df63179b154055d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-12-17T13:11:48Z","title_canon_sha256":"69110d7bc995194fe8b8108cacb6333f860329df53b6ff211673569e3e8502a7"},"schema_version":"1.0","source":{"id":"2412.12887","kind":"arxiv","version":1}},"canonical_sha256":"d35dbce5352a2cb7c0a5aeb76826e9418c88806faf9bd1256ba350a3447bd07d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d35dbce5352a2cb7c0a5aeb76826e9418c88806faf9bd1256ba350a3447bd07d","first_computed_at":"2026-07-05T09:50:22.217130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:22.217130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wp8QP/0rcZ3PHrKz1iM+S8vS37AHf1w9N2E1nT/u6+2+U4cnuI7VAqhSDFz4AOTCj00rhToonAQ5CQJylpl6CA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:22.217551Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.12887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f91eebec0dede3156bf9b54cc3b9a964a6f3f037fd6a0119ffa3f7353276e48","sha256:c757361a032ac43c03556d010baa16b94f28f0a1b7f44e42ae84d5d019ed1109"],"state_sha256":"daa7d079c1032073352a674cb7048d0fd39c48a5ef490d932376a026f70f7fc6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aore0H8juw7dD6WElAIfMrbFm59ZU+oj+sjpaDmp78T9kZ5QbukD8zGJLeDwW0PWEpdtyxoDcJ5uELx42GtxAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T04:05:02.764968Z","bundle_sha256":"baf700709f2ed4fd5066ce49bf3ebb47fcbf372b17793caaf6a38c0e80fcb551"}}