{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:FSISMUTZZZVRTLPAP5D2L3XVGU","short_pith_number":"pith:FSISMUTZ","canonical_record":{"source":{"id":"2007.02817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T15:22:25Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8f55883e4c6b31b63a18e95ac5ac62a2e35ac0ed479ab970b8ddf4237570dd7f","abstract_canon_sha256":"c83ddc20c67b41731ad7501c165d6be53a2ab2c89cdb5ed4395bd32423f55d55"},"schema_version":"1.0"},"canonical_sha256":"2c91265279ce6b19ade07f47a5eef53502174ca4c4331002554d70d8c637695a","source":{"kind":"arxiv","id":"2007.02817","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02817","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02817v3","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02817","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"FSISMUTZZZVR","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"FSISMUTZZZVRTLPA","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"FSISMUTZ","created_at":"2026-07-05T08:32:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:FSISMUTZZZVRTLPAP5D2L3XVGU","target":"record","payload":{"canonical_record":{"source":{"id":"2007.02817","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T15:22:25Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"8f55883e4c6b31b63a18e95ac5ac62a2e35ac0ed479ab970b8ddf4237570dd7f","abstract_canon_sha256":"c83ddc20c67b41731ad7501c165d6be53a2ab2c89cdb5ed4395bd32423f55d55"},"schema_version":"1.0"},"canonical_sha256":"2c91265279ce6b19ade07f47a5eef53502174ca4c4331002554d70d8c637695a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:32:58.536713Z","signature_b64":"KH+NcmHjqTGf+37fbIyC7toWGvlWmG06g9MqcSOznVYyNesL3hfmQJhxpe4xC6g0E+OfrAJfF6oV+0L2LlqsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c91265279ce6b19ade07f47a5eef53502174ca4c4331002554d70d8c637695a","last_reissued_at":"2026-07-05T08:32:58.536223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:32:58.536223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.02817","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-05T08:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KPyTtHJkHD+GUP66+6jHnnj2Ip6A3XFgz3QxCPaBTRs1iU6/9xBDEYJCOM4JX3Tn1Dk+XdvLawndfvmHWfe3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:14:04.821012Z"},"content_sha256":"8be26b018cc693d586c9a36e67ec6c0aa981d3fb971a10ee768e5473ef49628b","schema_version":"1.0","event_id":"sha256:8be26b018cc693d586c9a36e67ec6c0aa981d3fb971a10ee768e5473ef49628b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:FSISMUTZZZVRTLPAP5D2L3XVGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Graph Embeddings via Coarsening","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi Wang, Gramoz Goranci, Matthew Fahrbach, Richard Peng, Sushant Sachdeva","submitted_at":"2020-07-06T15:22:25Z","abstract_excerpt":"Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inefficient even if we are interested only in a small subset of relevant vertices. To address this, we present an efficient graph coarsening approach, based on Schur complements, for computing the embedding of the relevant vertices. We prove that these embeddings are preserved exactly by the Schur complement graph that is obtained via Gaussian elimination on the non-relevant vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02817","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/2007.02817/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:32:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9Md93MTZWveKZoq2YOldANSySqLO9KWpW3c6I7WqZifRPTVyDhMF3aszFiqSaaBrcX3VaPGHAOZ8HJYiB++Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T14:14:04.821423Z"},"content_sha256":"38561ec76805c0f2f0ab46c189eced9cfe6cac34e13028ad19785fefc998657e","schema_version":"1.0","event_id":"sha256:38561ec76805c0f2f0ab46c189eced9cfe6cac34e13028ad19785fefc998657e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/bundle.json","state_url":"https://pith.science/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/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-07-10T14:14:04Z","links":{"resolver":"https://pith.science/pith/FSISMUTZZZVRTLPAP5D2L3XVGU","bundle":"https://pith.science/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/bundle.json","state":"https://pith.science/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSISMUTZZZVRTLPAP5D2L3XVGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:FSISMUTZZZVRTLPAP5D2L3XVGU","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":"c83ddc20c67b41731ad7501c165d6be53a2ab2c89cdb5ed4395bd32423f55d55","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T15:22:25Z","title_canon_sha256":"8f55883e4c6b31b63a18e95ac5ac62a2e35ac0ed479ab970b8ddf4237570dd7f"},"schema_version":"1.0","source":{"id":"2007.02817","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.02817","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"arxiv_version","alias_value":"2007.02817v3","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.02817","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_12","alias_value":"FSISMUTZZZVR","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_16","alias_value":"FSISMUTZZZVRTLPA","created_at":"2026-07-05T08:32:58Z"},{"alias_kind":"pith_short_8","alias_value":"FSISMUTZ","created_at":"2026-07-05T08:32:58Z"}],"graph_snapshots":[{"event_id":"sha256:38561ec76805c0f2f0ab46c189eced9cfe6cac34e13028ad19785fefc998657e","target":"graph","created_at":"2026-07-05T08:32:58Z","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/2007.02817/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph embeddings are a ubiquitous tool for machine learning tasks, such as node classification and link prediction, on graph-structured data. However, computing the embeddings for large-scale graphs is prohibitively inefficient even if we are interested only in a small subset of relevant vertices. To address this, we present an efficient graph coarsening approach, based on Schur complements, for computing the embedding of the relevant vertices. We prove that these embeddings are preserved exactly by the Schur complement graph that is obtained via Gaussian elimination on the non-relevant vertic","authors_text":"Chi Wang, Gramoz Goranci, Matthew Fahrbach, Richard Peng, Sushant Sachdeva","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T15:22:25Z","title":"Faster Graph Embeddings via Coarsening"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.02817","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:8be26b018cc693d586c9a36e67ec6c0aa981d3fb971a10ee768e5473ef49628b","target":"record","created_at":"2026-07-05T08:32:58Z","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":"c83ddc20c67b41731ad7501c165d6be53a2ab2c89cdb5ed4395bd32423f55d55","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-07-06T15:22:25Z","title_canon_sha256":"8f55883e4c6b31b63a18e95ac5ac62a2e35ac0ed479ab970b8ddf4237570dd7f"},"schema_version":"1.0","source":{"id":"2007.02817","kind":"arxiv","version":3}},"canonical_sha256":"2c91265279ce6b19ade07f47a5eef53502174ca4c4331002554d70d8c637695a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c91265279ce6b19ade07f47a5eef53502174ca4c4331002554d70d8c637695a","first_computed_at":"2026-07-05T08:32:58.536223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:32:58.536223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KH+NcmHjqTGf+37fbIyC7toWGvlWmG06g9MqcSOznVYyNesL3hfmQJhxpe4xC6g0E+OfrAJfF6oV+0L2LlqsAg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:32:58.536713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.02817","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8be26b018cc693d586c9a36e67ec6c0aa981d3fb971a10ee768e5473ef49628b","sha256:38561ec76805c0f2f0ab46c189eced9cfe6cac34e13028ad19785fefc998657e"],"state_sha256":"15696f45cdbc6cc65584e8b8315a4a543d7c87aaccef8decac13b4eb316dc988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulDbBWlTJb5gdGCHqAfGOh7aNar2JIHYAe4cfeZ8j5eaQZZHMrKVs0Fg7Q+vRGg2m0YDOG0BcwszYFi38AUdDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T14:14:04.823679Z","bundle_sha256":"37566e8d38049938374339b6fe49b802a0b3fe6b463226b1a902c2040268edb5"}}