{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NPY53EWT4W4HAQOG7ZY5AOPF76","short_pith_number":"pith:NPY53EWT","canonical_record":{"source":{"id":"1911.07323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T19:40:10Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f5c6bbf91c21f4ef138433a86aec2c98b6456a760c4b6c495a2864db8c8c9983","abstract_canon_sha256":"6e20a40c1f0749e55b036434f915374d4464bf5376fde846e4076a2e6b0066f6"},"schema_version":"1.0"},"canonical_sha256":"6bf1dd92d3e5b87041c6fe71d039e5ffa67cc34c10663b7c35d1dc6229bc6cd4","source":{"kind":"arxiv","id":"1911.07323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07323","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07323v1","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07323","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"NPY53EWT4W4H","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_16","alias_value":"NPY53EWT4W4HAQOG","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_8","alias_value":"NPY53EWT","created_at":"2026-07-05T00:19:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NPY53EWT4W4HAQOG7ZY5AOPF76","target":"record","payload":{"canonical_record":{"source":{"id":"1911.07323","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T19:40:10Z","cross_cats_sorted":["cs.SI","stat.ML"],"title_canon_sha256":"f5c6bbf91c21f4ef138433a86aec2c98b6456a760c4b6c495a2864db8c8c9983","abstract_canon_sha256":"6e20a40c1f0749e55b036434f915374d4464bf5376fde846e4076a2e6b0066f6"},"schema_version":"1.0"},"canonical_sha256":"6bf1dd92d3e5b87041c6fe71d039e5ffa67cc34c10663b7c35d1dc6229bc6cd4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:45.502470Z","signature_b64":"UEVpj5ppCEoKa1f0iXhWk2iwIIYVhNenXCnUVdpCG7CHqQwQHLpSlkSwARGSJCgeqby5f0m38TmnbxLuw+FrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bf1dd92d3e5b87041c6fe71d039e5ffa67cc34c10663b7c35d1dc6229bc6cd4","last_reissued_at":"2026-07-05T00:19:45.501977Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:45.501977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.07323","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-05T00:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmWEpT0F7MCdjwGiGfFoEmKTaYAAD8l9noZfQXdXEZEi3u75zz7jj8f9VjcOI+2IKNDHdpTP5hS4smrwJIznAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T20:31:27.236874Z"},"content_sha256":"814d2c62d361ca70398f195002efc78358bcf355a895970c6abef1971e785105","schema_version":"1.0","event_id":"sha256:814d2c62d361ca70398f195002efc78358bcf355a895970c6abef1971e785105"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NPY53EWT4W4HAQOG7ZY5AOPF76","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Difan Zou, Quanquan Gu, Song Jiang, Yewen Wang, Yizhou Sun, Ziniu Hu","submitted_at":"2019-11-17T19:40:10Z","abstract_excerpt":"Graph convolutional networks (GCNs) have recently received wide attentions, due to their successful applications in different graph tasks and different domains. Training GCNs for a large graph, however, is still a challenge. Original full-batch GCN training requires calculating the representation of all the nodes in the graph per GCN layer, which brings in high computation and memory costs. To alleviate this issue, several sampling-based methods have been proposed to train GCNs on a subset of nodes. Among them, the node-wise neighbor-sampling method recursively samples a fixed number of neighb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07323","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/1911.07323/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-05T00:19:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tXATl8HCm7e3ynfHoQPeZANnVCGvGn6a/e3xSYrddYxlS1yp2ILB0i9r8b6W2a+CF9eYzQirBoAyLR38HSeLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T20:31:27.237618Z"},"content_sha256":"8d41a5288cb0552f227723a0a95a89635a54a262016de1d645ed64dcc7f148ae","schema_version":"1.0","event_id":"sha256:8d41a5288cb0552f227723a0a95a89635a54a262016de1d645ed64dcc7f148ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/bundle.json","state_url":"https://pith.science/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/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-15T20:31:27Z","links":{"resolver":"https://pith.science/pith/NPY53EWT4W4HAQOG7ZY5AOPF76","bundle":"https://pith.science/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/bundle.json","state":"https://pith.science/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NPY53EWT4W4HAQOG7ZY5AOPF76/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NPY53EWT4W4HAQOG7ZY5AOPF76","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":"6e20a40c1f0749e55b036434f915374d4464bf5376fde846e4076a2e6b0066f6","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T19:40:10Z","title_canon_sha256":"f5c6bbf91c21f4ef138433a86aec2c98b6456a760c4b6c495a2864db8c8c9983"},"schema_version":"1.0","source":{"id":"1911.07323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.07323","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.07323v1","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.07323","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_12","alias_value":"NPY53EWT4W4H","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_16","alias_value":"NPY53EWT4W4HAQOG","created_at":"2026-07-05T00:19:45Z"},{"alias_kind":"pith_short_8","alias_value":"NPY53EWT","created_at":"2026-07-05T00:19:45Z"}],"graph_snapshots":[{"event_id":"sha256:8d41a5288cb0552f227723a0a95a89635a54a262016de1d645ed64dcc7f148ae","target":"graph","created_at":"2026-07-05T00:19:45Z","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/1911.07323/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph convolutional networks (GCNs) have recently received wide attentions, due to their successful applications in different graph tasks and different domains. Training GCNs for a large graph, however, is still a challenge. Original full-batch GCN training requires calculating the representation of all the nodes in the graph per GCN layer, which brings in high computation and memory costs. To alleviate this issue, several sampling-based methods have been proposed to train GCNs on a subset of nodes. Among them, the node-wise neighbor-sampling method recursively samples a fixed number of neighb","authors_text":"Difan Zou, Quanquan Gu, Song Jiang, Yewen Wang, Yizhou Sun, Ziniu Hu","cross_cats":["cs.SI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T19:40:10Z","title":"Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.07323","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:814d2c62d361ca70398f195002efc78358bcf355a895970c6abef1971e785105","target":"record","created_at":"2026-07-05T00:19:45Z","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":"6e20a40c1f0749e55b036434f915374d4464bf5376fde846e4076a2e6b0066f6","cross_cats_sorted":["cs.SI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-17T19:40:10Z","title_canon_sha256":"f5c6bbf91c21f4ef138433a86aec2c98b6456a760c4b6c495a2864db8c8c9983"},"schema_version":"1.0","source":{"id":"1911.07323","kind":"arxiv","version":1}},"canonical_sha256":"6bf1dd92d3e5b87041c6fe71d039e5ffa67cc34c10663b7c35d1dc6229bc6cd4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bf1dd92d3e5b87041c6fe71d039e5ffa67cc34c10663b7c35d1dc6229bc6cd4","first_computed_at":"2026-07-05T00:19:45.501977Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:45.501977Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UEVpj5ppCEoKa1f0iXhWk2iwIIYVhNenXCnUVdpCG7CHqQwQHLpSlkSwARGSJCgeqby5f0m38TmnbxLuw+FrAw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:45.502470Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.07323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:814d2c62d361ca70398f195002efc78358bcf355a895970c6abef1971e785105","sha256:8d41a5288cb0552f227723a0a95a89635a54a262016de1d645ed64dcc7f148ae"],"state_sha256":"a38f02f0e77b170a7aa67f0d8082b389c16b0b10782a90a1dc7a8c76bcf9053f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0AblEOyYRQzJiJL4J+lZBWx7whous0p2nUh04z63g6K6+8y5doaQ+PaDlWtJTOA9rd9sSKezrOvjGvqQjgqkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T20:31:27.244828Z","bundle_sha256":"752b61c0a0e88b2f111035eb8a295fac0bde011e96c416b1fb5541841a5e326f"}}