{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:CMMDI2WQM6RYF74NRW32GKQLI3","short_pith_number":"pith:CMMDI2WQ","canonical_record":{"source":{"id":"2407.08064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2de0356438f84c3c403dd5567b57085a7040f802425fe728763910250968aef7","abstract_canon_sha256":"9e4c3474b663084c8b763b5b198f8fceea24970453b52751ea34a5b2f08848ad"},"schema_version":"1.0"},"canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","source":{"kind":"arxiv","id":"2407.08064","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.08064","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"2407.08064v1","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08064","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"CMMDI2WQM6RY","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_16","alias_value":"CMMDI2WQM6RYF74N","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_8","alias_value":"CMMDI2WQ","created_at":"2026-07-05T08:42:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:CMMDI2WQM6RYF74NRW32GKQLI3","target":"record","payload":{"canonical_record":{"source":{"id":"2407.08064","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"2de0356438f84c3c403dd5567b57085a7040f802425fe728763910250968aef7","abstract_canon_sha256":"9e4c3474b663084c8b763b5b198f8fceea24970453b52751ea34a5b2f08848ad"},"schema_version":"1.0"},"canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:42.670729Z","signature_b64":"8jzvIgXpPH2HKlBw7kGJwGT7jXCtGuvY6h/1tTOxI2KYYpLoSqkzLUgWzNO2rL00Qka+ECiK4/vykSmFRio2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","last_reissued_at":"2026-07-05T08:42:42.670310Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:42.670310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2407.08064","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-05T08:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oxVB8Sf+1jEETd4U82a4+Gggtrg8DNY7SCNIobBEb6euL9fGEFUWje6/EfpgJfeC8E4MKbfjHgU+3zHTmXY3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:24:20.311098Z"},"content_sha256":"7958c587ba2f7c5ca711ee08d939bdca070eca9f4aaecae03bd7efcc8385139b","schema_version":"1.0","event_id":"sha256:7958c587ba2f7c5ca711ee08d939bdca070eca9f4aaecae03bd7efcc8385139b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:CMMDI2WQM6RYF74NRW32GKQLI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Yanning Shen, Yezi Liu","submitted_at":"2024-07-10T21:54:12Z","abstract_excerpt":"Training graph neural networks (GNNs) on large-scale graphs can be challenging due to the high computational expense caused by the massive number of nodes and high-dimensional nodal features. Existing graph condensation studies tackle this problem only by reducing the number of nodes in the graph. However, the resulting condensed graph data can still be cumbersome. Specifically, although the nodes of the Citeseer dataset are reduced to 0.9% (30 nodes) in training, the number of features is 3,703, severely exceeding the training sample magnitude. Faced with this challenge, we study the problem "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08064","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/2407.08064/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-05T08:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AMx0tBfJYc3WLbqhTbe/OoeSfMqE5HGOOa/Gbd+9Vjp+dHPfSKKFviMzzPmxxmq1hAG4uKli3V6R1HbP5s44Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:24:20.311723Z"},"content_sha256":"a6c4f5d8dfbc1b8e32fb007d33956566f178e2e5e35674477723b02998dae370","schema_version":"1.0","event_id":"sha256:a6c4f5d8dfbc1b8e32fb007d33956566f178e2e5e35674477723b02998dae370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/bundle.json","state_url":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMMDI2WQM6RYF74NRW32GKQLI3/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-16T23:24:20Z","links":{"resolver":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3","bundle":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/bundle.json","state":"https://pith.science/pith/CMMDI2WQM6RYF74NRW32GKQLI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMMDI2WQM6RYF74NRW32GKQLI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:CMMDI2WQM6RYF74NRW32GKQLI3","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":"9e4c3474b663084c8b763b5b198f8fceea24970453b52751ea34a5b2f08848ad","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","title_canon_sha256":"2de0356438f84c3c403dd5567b57085a7040f802425fe728763910250968aef7"},"schema_version":"1.0","source":{"id":"2407.08064","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2407.08064","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"2407.08064v1","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08064","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"CMMDI2WQM6RY","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_16","alias_value":"CMMDI2WQM6RYF74N","created_at":"2026-07-05T08:42:42Z"},{"alias_kind":"pith_short_8","alias_value":"CMMDI2WQ","created_at":"2026-07-05T08:42:42Z"}],"graph_snapshots":[{"event_id":"sha256:a6c4f5d8dfbc1b8e32fb007d33956566f178e2e5e35674477723b02998dae370","target":"graph","created_at":"2026-07-05T08:42:42Z","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/2407.08064/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Training graph neural networks (GNNs) on large-scale graphs can be challenging due to the high computational expense caused by the massive number of nodes and high-dimensional nodal features. Existing graph condensation studies tackle this problem only by reducing the number of nodes in the graph. However, the resulting condensed graph data can still be cumbersome. Specifically, although the nodes of the Citeseer dataset are reduced to 0.9% (30 nodes) in training, the number of features is 3,703, severely exceeding the training sample magnitude. Faced with this challenge, we study the problem ","authors_text":"Yanning Shen, Yezi Liu","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","title":"TinyGraph: Joint Feature and Node Condensation for Graph Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08064","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:7958c587ba2f7c5ca711ee08d939bdca070eca9f4aaecae03bd7efcc8385139b","target":"record","created_at":"2026-07-05T08:42:42Z","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":"9e4c3474b663084c8b763b5b198f8fceea24970453b52751ea34a5b2f08848ad","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-07-10T21:54:12Z","title_canon_sha256":"2de0356438f84c3c403dd5567b57085a7040f802425fe728763910250968aef7"},"schema_version":"1.0","source":{"id":"2407.08064","kind":"arxiv","version":1}},"canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1318346ad067a382ff8d8db7a32a0b46e9d6800286ca6fe000c6b7d2c4547d41","first_computed_at":"2026-07-05T08:42:42.670310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:42:42.670310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8jzvIgXpPH2HKlBw7kGJwGT7jXCtGuvY6h/1tTOxI2KYYpLoSqkzLUgWzNO2rL00Qka+ECiK4/vykSmFRio2Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T08:42:42.670729Z","signed_message":"canonical_sha256_bytes"},"source_id":"2407.08064","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7958c587ba2f7c5ca711ee08d939bdca070eca9f4aaecae03bd7efcc8385139b","sha256:a6c4f5d8dfbc1b8e32fb007d33956566f178e2e5e35674477723b02998dae370"],"state_sha256":"23f60979d54ad3691b226b05a0c1ff6046f9f997cd239c39eaa7d4f3de23040b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a3yLvLGPORJGl89vMrqlbGUw/IBYJZ92zZ+0U+rCYNaecz6d/u1sX9bz5UuvnUrXfVYUTrYNwcmVLQsHS3kODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:24:20.318199Z","bundle_sha256":"3a4b4a132d28572bd43316801f67b36e5c4afc0c4751661efb71d2237ff6bc11"}}