{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:5DGR27GQ5SBWDTK4WXN5LJYF5K","short_pith_number":"pith:5DGR27GQ","canonical_record":{"source":{"id":"2204.01376","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:48:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a5843b9717e21a2e3badf02ac5c27caf01acb53513119c49abe60835d7235f89","abstract_canon_sha256":"1191fd2352dda0d775668a1ed0ac7e439e8751cf3fe1c62d168d604ea482417d"},"schema_version":"1.0"},"canonical_sha256":"e8cd1d7cd0ec8361cd5cb5dbd5a705eaa733c8cf4b3d8d0c7342cab72ea1f564","source":{"kind":"arxiv","id":"2204.01376","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.01376","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2204.01376v1","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01376","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"5DGR27GQ5SBW","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"5DGR27GQ5SBWDTK4","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"5DGR27GQ","created_at":"2026-07-05T04:11:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:5DGR27GQ5SBWDTK4WXN5LJYF5K","target":"record","payload":{"canonical_record":{"source":{"id":"2204.01376","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:48:32Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a5843b9717e21a2e3badf02ac5c27caf01acb53513119c49abe60835d7235f89","abstract_canon_sha256":"1191fd2352dda0d775668a1ed0ac7e439e8751cf3fe1c62d168d604ea482417d"},"schema_version":"1.0"},"canonical_sha256":"e8cd1d7cd0ec8361cd5cb5dbd5a705eaa733c8cf4b3d8d0c7342cab72ea1f564","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:11:18.242882Z","signature_b64":"QYz1S3kAJ3NNgByuiMbY3eZEFL4ONv5rqtkd8QYGPJ3d7Ck/AAFvonbUbrWzU2MzcR5bdB+7g3H6XQ/CMTuvDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8cd1d7cd0ec8361cd5cb5dbd5a705eaa733c8cf4b3d8d0c7342cab72ea1f564","last_reissued_at":"2026-07-05T04:11:18.242437Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:11:18.242437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.01376","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-05T04:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VQh623kUuanjNbYDNKicCPhRQ/d/4t+eNuX1TlYFHCviizEeCLe9z69Lhw3jbpnx0Rjg2x74Z0Cm8jk0Qw2HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:26:00.128877Z"},"content_sha256":"493d23fb4994dca05f2e1f068c49dbf6102c6a3e92ed2292c068522d4292dfdc","schema_version":"1.0","event_id":"sha256:493d23fb4994dca05f2e1f068c49dbf6102c6a3e92ed2292c068522d4292dfdc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:5DGR27GQ5SBWDTK4WXN5LJYF5K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Synthetic Graph Generation to Benchmark Graph Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anton Tsitsulin, Benedek Rozemberczki, Bryan Perozzi, John Palowitch","submitted_at":"2022-04-04T10:48:32Z","abstract_excerpt":"Graph learning algorithms have attained state-of-the-art performance on many graph analysis tasks such as node classification, link prediction, and clustering. It has, however, become hard to track the field's burgeoning progress. One reason is due to the very small number of datasets used in practice to benchmark the performance of graph learning algorithms. This shockingly small sample size (~10) allows for only limited scientific insight into the problem.\n  In this work, we aim to address this deficiency. We propose to generate synthetic graphs, and study the behaviour of graph learning alg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01376","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/2204.01376/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-05T04:11:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5sg54wtcAE3KnR1JdvsUr1janprJx6WOWd8yn7I4oR4svGnWTF4XuOLGpvB9SIZPmb35Zm1MFBhtM4I6IPlFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:26:00.129808Z"},"content_sha256":"451ef5f13f243d2cbb91a1bbb1ad973404612c477f3a3810b223d773c3fa7b43","schema_version":"1.0","event_id":"sha256:451ef5f13f243d2cbb91a1bbb1ad973404612c477f3a3810b223d773c3fa7b43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/bundle.json","state_url":"https://pith.science/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/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-17T03:26:00Z","links":{"resolver":"https://pith.science/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K","bundle":"https://pith.science/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/bundle.json","state":"https://pith.science/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DGR27GQ5SBWDTK4WXN5LJYF5K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:5DGR27GQ5SBWDTK4WXN5LJYF5K","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":"1191fd2352dda0d775668a1ed0ac7e439e8751cf3fe1c62d168d604ea482417d","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:48:32Z","title_canon_sha256":"a5843b9717e21a2e3badf02ac5c27caf01acb53513119c49abe60835d7235f89"},"schema_version":"1.0","source":{"id":"2204.01376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.01376","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"arxiv_version","alias_value":"2204.01376v1","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.01376","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_12","alias_value":"5DGR27GQ5SBW","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_16","alias_value":"5DGR27GQ5SBWDTK4","created_at":"2026-07-05T04:11:18Z"},{"alias_kind":"pith_short_8","alias_value":"5DGR27GQ","created_at":"2026-07-05T04:11:18Z"}],"graph_snapshots":[{"event_id":"sha256:451ef5f13f243d2cbb91a1bbb1ad973404612c477f3a3810b223d773c3fa7b43","target":"graph","created_at":"2026-07-05T04:11:18Z","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/2204.01376/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph learning algorithms have attained state-of-the-art performance on many graph analysis tasks such as node classification, link prediction, and clustering. It has, however, become hard to track the field's burgeoning progress. One reason is due to the very small number of datasets used in practice to benchmark the performance of graph learning algorithms. This shockingly small sample size (~10) allows for only limited scientific insight into the problem.\n  In this work, we aim to address this deficiency. We propose to generate synthetic graphs, and study the behaviour of graph learning alg","authors_text":"Anton Tsitsulin, Benedek Rozemberczki, Bryan Perozzi, John Palowitch","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:48:32Z","title":"Synthetic Graph Generation to Benchmark Graph Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.01376","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:493d23fb4994dca05f2e1f068c49dbf6102c6a3e92ed2292c068522d4292dfdc","target":"record","created_at":"2026-07-05T04:11:18Z","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":"1191fd2352dda0d775668a1ed0ac7e439e8751cf3fe1c62d168d604ea482417d","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-04T10:48:32Z","title_canon_sha256":"a5843b9717e21a2e3badf02ac5c27caf01acb53513119c49abe60835d7235f89"},"schema_version":"1.0","source":{"id":"2204.01376","kind":"arxiv","version":1}},"canonical_sha256":"e8cd1d7cd0ec8361cd5cb5dbd5a705eaa733c8cf4b3d8d0c7342cab72ea1f564","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8cd1d7cd0ec8361cd5cb5dbd5a705eaa733c8cf4b3d8d0c7342cab72ea1f564","first_computed_at":"2026-07-05T04:11:18.242437Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:11:18.242437Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYz1S3kAJ3NNgByuiMbY3eZEFL4ONv5rqtkd8QYGPJ3d7Ck/AAFvonbUbrWzU2MzcR5bdB+7g3H6XQ/CMTuvDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:11:18.242882Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.01376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:493d23fb4994dca05f2e1f068c49dbf6102c6a3e92ed2292c068522d4292dfdc","sha256:451ef5f13f243d2cbb91a1bbb1ad973404612c477f3a3810b223d773c3fa7b43"],"state_sha256":"23cc55951d1a00cbfabf25f57aaecfc790c75b8f34b7695d5b13bb15a29d5c7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nBo6tXILbi1HJgFEH17mhJbd8FeG7gELkQ7iUuherOUO/RbK/sI8vQIjrSNjRwgZiAtPRNFoDySeAym4aOEwAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:26:00.138843Z","bundle_sha256":"73cc3623e978baacde2b116f739073b77dd5cabc62b62b8a254d9650fa561304"}}