{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:QPVMIJKQDHPV6GAPCAZLW3XRVX","short_pith_number":"pith:QPVMIJKQ","canonical_record":{"source":{"id":"2009.06693","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-14T19:03:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48f2297de29def509eceaf58774610a8a801c35588b57b598d87314a5a29d4b3","abstract_canon_sha256":"cde5f63d75f269689d73c3128647080a61e1636283db326cd077695c4983d73e"},"schema_version":"1.0"},"canonical_sha256":"83eac4255019df5f180f1032bb6ef1adfff54c265a63fe4441add8c5c2781ac1","source":{"kind":"arxiv","id":"2009.06693","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.06693","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2009.06693v4","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06693","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"QPVMIJKQDHPV","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_16","alias_value":"QPVMIJKQDHPV6GAP","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_8","alias_value":"QPVMIJKQ","created_at":"2026-07-05T02:39:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:QPVMIJKQDHPV6GAPCAZLW3XRVX","target":"record","payload":{"canonical_record":{"source":{"id":"2009.06693","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-14T19:03:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"48f2297de29def509eceaf58774610a8a801c35588b57b598d87314a5a29d4b3","abstract_canon_sha256":"cde5f63d75f269689d73c3128647080a61e1636283db326cd077695c4983d73e"},"schema_version":"1.0"},"canonical_sha256":"83eac4255019df5f180f1032bb6ef1adfff54c265a63fe4441add8c5c2781ac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:39:05.051606Z","signature_b64":"NzFeItYklanNRRfz+qjqSKOeO6pyzjXlFH6Z2V7pMlVhFfGCV/4VkhfU3D+5AvmO9Ls2KyF4VFUgTH5D4LWdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83eac4255019df5f180f1032bb6ef1adfff54c265a63fe4441add8c5c2781ac1","last_reissued_at":"2026-07-05T02:39:05.051163Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:39:05.051163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.06693","source_version":4,"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-05T02:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YThuXzfQpFFfbjtKjthFLKsTo7NWh9LXlWjzfUr+1lgIgAzCioGKXGPLgmrZ4O+KD573ClAUuWniiXXvkAbsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:00:56.608294Z"},"content_sha256":"d7aece1064c52cebfbf9860e9fa3fab979ffbc5fb386924af60241bd5d8f7075","schema_version":"1.0","event_id":"sha256:d7aece1064c52cebfbf9860e9fa3fab979ffbc5fb386924af60241bd5d8f7075"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:QPVMIJKQDHPV6GAPCAZLW3XRVX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Graph Sampling for Graph Machine Learning using GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Abhinav Jangda, Arjun Guha, Marco Serafini, Sandeep Polisetty","submitted_at":"2020-09-14T19:03:33Z","abstract_excerpt":"Representation learning algorithms automatically learn the features of data. Several representation learning algorithms for graph data, such as DeepWalk, node2vec, and GraphSAGE, sample the graph to produce mini-batches that are suitable for training a DNN. However, sampling time can be a significant fraction of training time, and existing systems do not efficiently parallelize sampling.\n  Sampling is an embarrassingly parallel problem and may appear to lend itself to GPU acceleration, but the irregularity of graphs makes it hard to use GPU resources effectively. This paper presents NextDoor, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06693","kind":"arxiv","version":4},"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/2009.06693/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-05T02:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EBqmm2wA+GMUaTnfJESFXmudd+ZV0ZS8K3YtAL1ESR3eE5t7PxYAzL3zenBaFAM50Ifi4D+L8j74K3Eoi5L8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T01:00:56.608931Z"},"content_sha256":"0ba660d8fb0de7589db331951321d8a8024a57a412aa0d8265658c4b5e4e602d","schema_version":"1.0","event_id":"sha256:0ba660d8fb0de7589db331951321d8a8024a57a412aa0d8265658c4b5e4e602d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/bundle.json","state_url":"https://pith.science/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/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-22T01:00:56Z","links":{"resolver":"https://pith.science/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX","bundle":"https://pith.science/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/bundle.json","state":"https://pith.science/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPVMIJKQDHPV6GAPCAZLW3XRVX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:QPVMIJKQDHPV6GAPCAZLW3XRVX","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":"cde5f63d75f269689d73c3128647080a61e1636283db326cd077695c4983d73e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-14T19:03:33Z","title_canon_sha256":"48f2297de29def509eceaf58774610a8a801c35588b57b598d87314a5a29d4b3"},"schema_version":"1.0","source":{"id":"2009.06693","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.06693","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2009.06693v4","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.06693","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"QPVMIJKQDHPV","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_16","alias_value":"QPVMIJKQDHPV6GAP","created_at":"2026-07-05T02:39:05Z"},{"alias_kind":"pith_short_8","alias_value":"QPVMIJKQ","created_at":"2026-07-05T02:39:05Z"}],"graph_snapshots":[{"event_id":"sha256:0ba660d8fb0de7589db331951321d8a8024a57a412aa0d8265658c4b5e4e602d","target":"graph","created_at":"2026-07-05T02:39:05Z","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/2009.06693/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Representation learning algorithms automatically learn the features of data. Several representation learning algorithms for graph data, such as DeepWalk, node2vec, and GraphSAGE, sample the graph to produce mini-batches that are suitable for training a DNN. However, sampling time can be a significant fraction of training time, and existing systems do not efficiently parallelize sampling.\n  Sampling is an embarrassingly parallel problem and may appear to lend itself to GPU acceleration, but the irregularity of graphs makes it hard to use GPU resources effectively. This paper presents NextDoor, ","authors_text":"Abhinav Jangda, Arjun Guha, Marco Serafini, Sandeep Polisetty","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-14T19:03:33Z","title":"Accelerating Graph Sampling for Graph Machine Learning using GPUs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.06693","kind":"arxiv","version":4},"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:d7aece1064c52cebfbf9860e9fa3fab979ffbc5fb386924af60241bd5d8f7075","target":"record","created_at":"2026-07-05T02:39:05Z","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":"cde5f63d75f269689d73c3128647080a61e1636283db326cd077695c4983d73e","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-14T19:03:33Z","title_canon_sha256":"48f2297de29def509eceaf58774610a8a801c35588b57b598d87314a5a29d4b3"},"schema_version":"1.0","source":{"id":"2009.06693","kind":"arxiv","version":4}},"canonical_sha256":"83eac4255019df5f180f1032bb6ef1adfff54c265a63fe4441add8c5c2781ac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83eac4255019df5f180f1032bb6ef1adfff54c265a63fe4441add8c5c2781ac1","first_computed_at":"2026-07-05T02:39:05.051163Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:39:05.051163Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NzFeItYklanNRRfz+qjqSKOeO6pyzjXlFH6Z2V7pMlVhFfGCV/4VkhfU3D+5AvmO9Ls2KyF4VFUgTH5D4LWdAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:39:05.051606Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.06693","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7aece1064c52cebfbf9860e9fa3fab979ffbc5fb386924af60241bd5d8f7075","sha256:0ba660d8fb0de7589db331951321d8a8024a57a412aa0d8265658c4b5e4e602d"],"state_sha256":"66b37286efbe4390b2e42e36655d2075b7cf7317022a63b66ad42f978eae6f6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kPmeusUxK4S+9PKkNJr1cVfMsxfnCdDPcskXjh+dF+YN1AxZitlveZ8ZVDd01j8ZnSmrMnXvA9z8P1onlfw8CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T01:00:56.615192Z","bundle_sha256":"59d48bb438f98fa53a6403a0d2557e1d55e74465ae2a2cd654a6ae6a13cf116c"}}