{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:MQLPFE3VUEHSAX5FXWWJETFJIV","short_pith_number":"pith:MQLPFE3V","canonical_record":{"source":{"id":"2201.08481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-01-20T22:43:37Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"0a51b3232f44376195349abb112df2d1353584976c353de9eaf5c0549d4d9e03","abstract_canon_sha256":"508b2c37c89bebc8ea18ab5d77147cd815b246a3ad0094da5822952303418e32"},"schema_version":"1.0"},"canonical_sha256":"6416f29375a10f205fa5bdac924ca9457db3c926765a294ea80d9e26bedd6bfc","source":{"kind":"arxiv","id":"2201.08481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08481","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08481v1","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08481","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_12","alias_value":"MQLPFE3VUEHS","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_16","alias_value":"MQLPFE3VUEHSAX5F","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_8","alias_value":"MQLPFE3V","created_at":"2026-07-05T03:50:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:MQLPFE3VUEHSAX5FXWWJETFJIV","target":"record","payload":{"canonical_record":{"source":{"id":"2201.08481","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-01-20T22:43:37Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"0a51b3232f44376195349abb112df2d1353584976c353de9eaf5c0549d4d9e03","abstract_canon_sha256":"508b2c37c89bebc8ea18ab5d77147cd815b246a3ad0094da5822952303418e32"},"schema_version":"1.0"},"canonical_sha256":"6416f29375a10f205fa5bdac924ca9457db3c926765a294ea80d9e26bedd6bfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:50:28.713897Z","signature_b64":"PkyrYklbrmFKo4hsmWLb9qS6lkfhzpDaS1hhOy6svm2QZOV6gjoVMEzJeVoYrmFrFUgK7O4j6tKygDoWu+eODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6416f29375a10f205fa5bdac924ca9457db3c926765a294ea80d9e26bedd6bfc","last_reissued_at":"2026-07-05T03:50:28.713491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:50:28.713491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.08481","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-05T03:50:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I35n1L2bq/ys2E+FY+MmD0r6gAgk/sU41XRCA6yHNxCTp7fszPdBylAj6ouuqacKG5HSaTb2rW559NOVnh4tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:21:22.183655Z"},"content_sha256":"57abf0ea7a4536f85605dce82cb572390f77aa135f315e104a9f753e3cf21dbe","schema_version":"1.0","event_id":"sha256:57abf0ea7a4536f85605dce82cb572390f77aa135f315e104a9f753e3cf21dbe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:MQLPFE3VUEHSAX5FXWWJETFJIV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.SI","authors_text":"Andrew Stolman, Aneesh Sharma, Caleb Levy, C. Seshadhri","submitted_at":"2022-01-20T22:43:37Z","abstract_excerpt":"Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding methods aim to capture graph structure by learning a low-dimensional vector representation (the embedding) for each node. Despite the widespread use of these embeddings for a variety of downstream transductive machine learning tasks, there is little principled analysis of the effectiveness of this approach for common tasks. In this work, we provide an empirical and theoretical analysis for the performance of a class o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08481","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/2201.08481/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-05T03:50:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MStfNhw2/TIAuXkeTmXGAOSD085E0+YEbtV2vrS4H4VUZDMcN1S+65F0dMCx+0+vdE72Q1NbkR6f8HGDLCjzBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T16:21:22.184203Z"},"content_sha256":"e93dcd179ae817fb783986a41cc815c1573cd194778a56be84bf0813007f22fb","schema_version":"1.0","event_id":"sha256:e93dcd179ae817fb783986a41cc815c1573cd194778a56be84bf0813007f22fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/bundle.json","state_url":"https://pith.science/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/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-19T16:21:22Z","links":{"resolver":"https://pith.science/pith/MQLPFE3VUEHSAX5FXWWJETFJIV","bundle":"https://pith.science/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/bundle.json","state":"https://pith.science/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQLPFE3VUEHSAX5FXWWJETFJIV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:MQLPFE3VUEHSAX5FXWWJETFJIV","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":"508b2c37c89bebc8ea18ab5d77147cd815b246a3ad0094da5822952303418e32","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-01-20T22:43:37Z","title_canon_sha256":"0a51b3232f44376195349abb112df2d1353584976c353de9eaf5c0549d4d9e03"},"schema_version":"1.0","source":{"id":"2201.08481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.08481","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"arxiv_version","alias_value":"2201.08481v1","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.08481","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_12","alias_value":"MQLPFE3VUEHS","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_16","alias_value":"MQLPFE3VUEHSAX5F","created_at":"2026-07-05T03:50:28Z"},{"alias_kind":"pith_short_8","alias_value":"MQLPFE3V","created_at":"2026-07-05T03:50:28Z"}],"graph_snapshots":[{"event_id":"sha256:e93dcd179ae817fb783986a41cc815c1573cd194778a56be84bf0813007f22fb","target":"graph","created_at":"2026-07-05T03:50:28Z","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/2201.08481/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph representation learning (also called graph embeddings) is a popular technique for incorporating network structure into machine learning models. Unsupervised graph embedding methods aim to capture graph structure by learning a low-dimensional vector representation (the embedding) for each node. Despite the widespread use of these embeddings for a variety of downstream transductive machine learning tasks, there is little principled analysis of the effectiveness of this approach for common tasks. In this work, we provide an empirical and theoretical analysis for the performance of a class o","authors_text":"Andrew Stolman, Aneesh Sharma, Caleb Levy, C. Seshadhri","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-01-20T22:43:37Z","title":"Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.08481","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:57abf0ea7a4536f85605dce82cb572390f77aa135f315e104a9f753e3cf21dbe","target":"record","created_at":"2026-07-05T03:50:28Z","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":"508b2c37c89bebc8ea18ab5d77147cd815b246a3ad0094da5822952303418e32","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2022-01-20T22:43:37Z","title_canon_sha256":"0a51b3232f44376195349abb112df2d1353584976c353de9eaf5c0549d4d9e03"},"schema_version":"1.0","source":{"id":"2201.08481","kind":"arxiv","version":1}},"canonical_sha256":"6416f29375a10f205fa5bdac924ca9457db3c926765a294ea80d9e26bedd6bfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6416f29375a10f205fa5bdac924ca9457db3c926765a294ea80d9e26bedd6bfc","first_computed_at":"2026-07-05T03:50:28.713491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:50:28.713491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PkyrYklbrmFKo4hsmWLb9qS6lkfhzpDaS1hhOy6svm2QZOV6gjoVMEzJeVoYrmFrFUgK7O4j6tKygDoWu+eODg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:50:28.713897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.08481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57abf0ea7a4536f85605dce82cb572390f77aa135f315e104a9f753e3cf21dbe","sha256:e93dcd179ae817fb783986a41cc815c1573cd194778a56be84bf0813007f22fb"],"state_sha256":"fa17e7e53eefe9658cbc28493346cf168850129e040fef60a57493c62ac6431b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MblezvtSO3wJF3qg/AcydrezJu8ndVpHQ9IQIWWOjmYqHiKlRogoJ/aKXe8TcSKRJ9Yh4Jaihla1IWJdhwjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T16:21:22.189745Z","bundle_sha256":"b939e121841ce1da738a894c114fd31faca5377bbdbd1f986bfed18554bf589c"}}