{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:E5QV2DY7BOKMDXJ4XIVVQCW3WP","short_pith_number":"pith:E5QV2DY7","canonical_record":{"source":{"id":"2111.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T20:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"34ce4f2d9298d14479b058c4a4b4ef36a33915c98c1faa2199cb1e59f6c3347d","abstract_canon_sha256":"7e4d53030550903f61389d62450441bb2c3caae43be0bb6fe7a4dcf85ba38c52"},"schema_version":"1.0"},"canonical_sha256":"27615d0f1f0b94c1dd3cba2b580adbb3f56b40557985e8d5c58005e7ac2cc3b6","source":{"kind":"arxiv","id":"2111.04826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.04826","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"2111.04826v1","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04826","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"E5QV2DY7BOKM","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_16","alias_value":"E5QV2DY7BOKMDXJ4","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_8","alias_value":"E5QV2DY7","created_at":"2026-07-05T03:30:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:E5QV2DY7BOKMDXJ4XIVVQCW3WP","target":"record","payload":{"canonical_record":{"source":{"id":"2111.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T20:56:37Z","cross_cats_sorted":[],"title_canon_sha256":"34ce4f2d9298d14479b058c4a4b4ef36a33915c98c1faa2199cb1e59f6c3347d","abstract_canon_sha256":"7e4d53030550903f61389d62450441bb2c3caae43be0bb6fe7a4dcf85ba38c52"},"schema_version":"1.0"},"canonical_sha256":"27615d0f1f0b94c1dd3cba2b580adbb3f56b40557985e8d5c58005e7ac2cc3b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:30:18.614904Z","signature_b64":"eb8ZcVnfKDLFinJBqIxZfAPZ/ymzxahP6GPWabhg+W/VSChG4mIEgk4jknbFXHjdhrNllKRix2sFSyBccdPeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27615d0f1f0b94c1dd3cba2b580adbb3f56b40557985e8d5c58005e7ac2cc3b6","last_reissued_at":"2026-07-05T03:30:18.614438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:30:18.614438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2111.04826","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:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQnnd3JCK86HzJ/VvekmLQhqgD7+Ofhp9UMV1WhbUJXUP66IBE0Z6bi+0GBIzeJpLric/DhGggGUIr1+tcepAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:36:31.332082Z"},"content_sha256":"e032ba5ea542ab91bdc3751d1cfde2317af3f346a9acd4f1bade972b39e9a845","schema_version":"1.0","event_id":"sha256:e032ba5ea542ab91bdc3751d1cfde2317af3f346a9acd4f1bade972b39e9a845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:E5QV2DY7BOKMDXJ4XIVVQCW3WP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inferential SIR-GN: Scalable Graph Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Edoardo Serra, Janet Layne","submitted_at":"2021-11-08T20:56:37Z","abstract_excerpt":"Graph representation learning methods generate numerical vector representations for the nodes in a network, thereby enabling their use in standard machine learning models. These methods aim to preserve relational information, such that nodes that are similar in the graph are found close to one another in the representation space. Similarity can be based largely on one of two notions: connectivity or structural role. In tasks where node structural role is important, connectivity based methods show poor performance. Recent work has begun to focus on scalability of learning methods to massive gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04826","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/2111.04826/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:30:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0qmHOB31J/XqTaoEguBWGRYx3E1tRsGlv/YKBZALHy64g6zANWP7Mm1nrwtLBB659y3VkPSWs+EUj41nY9xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T18:36:31.332527Z"},"content_sha256":"1046db1b7c209e9795654b59ef6fc1004017444bf43b7e8bb38cf01cd6e8677d","schema_version":"1.0","event_id":"sha256:1046db1b7c209e9795654b59ef6fc1004017444bf43b7e8bb38cf01cd6e8677d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/bundle.json","state_url":"https://pith.science/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/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-31T18:36:31Z","links":{"resolver":"https://pith.science/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP","bundle":"https://pith.science/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/bundle.json","state":"https://pith.science/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5QV2DY7BOKMDXJ4XIVVQCW3WP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:E5QV2DY7BOKMDXJ4XIVVQCW3WP","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":"7e4d53030550903f61389d62450441bb2c3caae43be0bb6fe7a4dcf85ba38c52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T20:56:37Z","title_canon_sha256":"34ce4f2d9298d14479b058c4a4b4ef36a33915c98c1faa2199cb1e59f6c3347d"},"schema_version":"1.0","source":{"id":"2111.04826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2111.04826","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"arxiv_version","alias_value":"2111.04826v1","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.04826","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_12","alias_value":"E5QV2DY7BOKM","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_16","alias_value":"E5QV2DY7BOKMDXJ4","created_at":"2026-07-05T03:30:18Z"},{"alias_kind":"pith_short_8","alias_value":"E5QV2DY7","created_at":"2026-07-05T03:30:18Z"}],"graph_snapshots":[{"event_id":"sha256:1046db1b7c209e9795654b59ef6fc1004017444bf43b7e8bb38cf01cd6e8677d","target":"graph","created_at":"2026-07-05T03:30: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/2111.04826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph representation learning methods generate numerical vector representations for the nodes in a network, thereby enabling their use in standard machine learning models. These methods aim to preserve relational information, such that nodes that are similar in the graph are found close to one another in the representation space. Similarity can be based largely on one of two notions: connectivity or structural role. In tasks where node structural role is important, connectivity based methods show poor performance. Recent work has begun to focus on scalability of learning methods to massive gra","authors_text":"Edoardo Serra, Janet Layne","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T20:56:37Z","title":"Inferential SIR-GN: Scalable Graph Representation Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.04826","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:e032ba5ea542ab91bdc3751d1cfde2317af3f346a9acd4f1bade972b39e9a845","target":"record","created_at":"2026-07-05T03:30: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":"7e4d53030550903f61389d62450441bb2c3caae43be0bb6fe7a4dcf85ba38c52","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-08T20:56:37Z","title_canon_sha256":"34ce4f2d9298d14479b058c4a4b4ef36a33915c98c1faa2199cb1e59f6c3347d"},"schema_version":"1.0","source":{"id":"2111.04826","kind":"arxiv","version":1}},"canonical_sha256":"27615d0f1f0b94c1dd3cba2b580adbb3f56b40557985e8d5c58005e7ac2cc3b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27615d0f1f0b94c1dd3cba2b580adbb3f56b40557985e8d5c58005e7ac2cc3b6","first_computed_at":"2026-07-05T03:30:18.614438Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:30:18.614438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eb8ZcVnfKDLFinJBqIxZfAPZ/ymzxahP6GPWabhg+W/VSChG4mIEgk4jknbFXHjdhrNllKRix2sFSyBccdPeAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:30:18.614904Z","signed_message":"canonical_sha256_bytes"},"source_id":"2111.04826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e032ba5ea542ab91bdc3751d1cfde2317af3f346a9acd4f1bade972b39e9a845","sha256:1046db1b7c209e9795654b59ef6fc1004017444bf43b7e8bb38cf01cd6e8677d"],"state_sha256":"edd72c452256fa701dd2c4b5f08b1b05a4469b1fb6768ad38486d15e933d7d2d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruZQz63tfIRdqn8myNmhvS65pOR2qnq7TpEQmaDVb+Q4KoW9Eqbb0ZiX0PfbxTZ5nKQWQKmcZmC1R7GVJWduDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T18:36:31.336801Z","bundle_sha256":"7af4ed4e28f1aabd3ceb608269a274577868f9d06312c5412ca97149d1d4c83d"}}