{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4IBZGDXRHZXZQE5NRBS4HHVGGQ","short_pith_number":"pith:4IBZGDXR","canonical_record":{"source":{"id":"1805.10712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-27T23:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"c8f28a2c16ea8dfd71832463599b0d4b3b8a269a912472527ee01277f12e733b","abstract_canon_sha256":"928fe8ce04c5e57cc1eafb6361273eba683f9f65fa219bd914df2dd3162d96ad"},"schema_version":"1.0"},"canonical_sha256":"e203930ef13e6f9813ad8865c39ea63433c1d9325cfc805173eea6a0ff2c4238","source":{"kind":"arxiv","id":"1805.10712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10712","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10712v2","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10712","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"4IBZGDXRHZXZ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IBZGDXRHZXZQE5N","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IBZGDXR","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4IBZGDXRHZXZQE5NRBS4HHVGGQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-27T23:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"c8f28a2c16ea8dfd71832463599b0d4b3b8a269a912472527ee01277f12e733b","abstract_canon_sha256":"928fe8ce04c5e57cc1eafb6361273eba683f9f65fa219bd914df2dd3162d96ad"},"schema_version":"1.0"},"canonical_sha256":"e203930ef13e6f9813ad8865c39ea63433c1d9325cfc805173eea6a0ff2c4238","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.715669Z","signature_b64":"6LNy1GzWqilziDJcxyS/4h8hTyoX7Yik0H6gX3v39VOwlTBgEbA5q+EoqXaMVwDaNG8Wfuci37uKV693vVu1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e203930ef13e6f9813ad8865c39ea63433c1d9325cfc805173eea6a0ff2c4238","last_reissued_at":"2026-05-18T00:14:43.715217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.715217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10712","source_version":2,"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-05-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ruxYO5//BH2P4If8D/QjBpWDSx0KJjQQ6CULsTv67MtCCsn4bHblkPG1GxeF+uf/V9b2CZZ+sKvDHwQP/zecCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:01:04.308545Z"},"content_sha256":"986382b2ef25c5f5f4f777a9fbfd1d067bfcc568784ff50259f1c66e2156894c","schema_version":"1.0","event_id":"sha256:986382b2ef25c5f5f4f777a9fbfd1d067bfcc568784ff50259f1c66e2156894c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4IBZGDXRHZXZQE5NRBS4HHVGGQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"NetLSD: Hearing the Shape of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Alex Bronstein, Anton Tsitsulin, Davide Mottin, Emmanuel M\\\"uller, Panagiotis Karras","submitted_at":"2018-05-27T23:24:36Z","abstract_excerpt":"Comparison among graphs is ubiquitous in graph analytics. However, it is a hard task in terms of the expressiveness of the employed similarity measure and the efficiency of its computation. Ideally, graph comparison should be invariant to the order of nodes and the sizes of compared graphs, adaptive to the scale of graph patterns, and scalable. Unfortunately, these properties have not been addressed together. Graph comparisons still rely on direct approaches, graph kernels, or representation-based methods, which are all inefficient and impractical for large graph collections.\n  In this paper, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10712","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgKsnvNoTWjjMEjt0qf4bv9IqdaJjrXK1pKJN9kAA8PVDzI6bU7je1Y2uFVGbYF5A6zvoyXFVfSDYeS8AtxwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:01:04.308897Z"},"content_sha256":"5fc77a5c53602669af1d036589066f0e2c4f86c682cac7a0b61b718492b7b024","schema_version":"1.0","event_id":"sha256:5fc77a5c53602669af1d036589066f0e2c4f86c682cac7a0b61b718492b7b024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/bundle.json","state_url":"https://pith.science/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/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-06-24T20:01:04Z","links":{"resolver":"https://pith.science/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ","bundle":"https://pith.science/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/bundle.json","state":"https://pith.science/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IBZGDXRHZXZQE5NRBS4HHVGGQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4IBZGDXRHZXZQE5NRBS4HHVGGQ","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":"928fe8ce04c5e57cc1eafb6361273eba683f9f65fa219bd914df2dd3162d96ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-27T23:24:36Z","title_canon_sha256":"c8f28a2c16ea8dfd71832463599b0d4b3b8a269a912472527ee01277f12e733b"},"schema_version":"1.0","source":{"id":"1805.10712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10712","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10712v2","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10712","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"4IBZGDXRHZXZ","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4IBZGDXRHZXZQE5N","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4IBZGDXR","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:5fc77a5c53602669af1d036589066f0e2c4f86c682cac7a0b61b718492b7b024","target":"graph","created_at":"2026-05-18T00:14:43Z","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"},"paper":{"abstract_excerpt":"Comparison among graphs is ubiquitous in graph analytics. However, it is a hard task in terms of the expressiveness of the employed similarity measure and the efficiency of its computation. Ideally, graph comparison should be invariant to the order of nodes and the sizes of compared graphs, adaptive to the scale of graph patterns, and scalable. Unfortunately, these properties have not been addressed together. Graph comparisons still rely on direct approaches, graph kernels, or representation-based methods, which are all inefficient and impractical for large graph collections.\n  In this paper, ","authors_text":"Alex Bronstein, Anton Tsitsulin, Davide Mottin, Emmanuel M\\\"uller, Panagiotis Karras","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-27T23:24:36Z","title":"NetLSD: Hearing the Shape of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10712","kind":"arxiv","version":2},"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:986382b2ef25c5f5f4f777a9fbfd1d067bfcc568784ff50259f1c66e2156894c","target":"record","created_at":"2026-05-18T00:14:43Z","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":"928fe8ce04c5e57cc1eafb6361273eba683f9f65fa219bd914df2dd3162d96ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-27T23:24:36Z","title_canon_sha256":"c8f28a2c16ea8dfd71832463599b0d4b3b8a269a912472527ee01277f12e733b"},"schema_version":"1.0","source":{"id":"1805.10712","kind":"arxiv","version":2}},"canonical_sha256":"e203930ef13e6f9813ad8865c39ea63433c1d9325cfc805173eea6a0ff2c4238","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e203930ef13e6f9813ad8865c39ea63433c1d9325cfc805173eea6a0ff2c4238","first_computed_at":"2026-05-18T00:14:43.715217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.715217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LNy1GzWqilziDJcxyS/4h8hTyoX7Yik0H6gX3v39VOwlTBgEbA5q+EoqXaMVwDaNG8Wfuci37uKV693vVu1CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.715669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:986382b2ef25c5f5f4f777a9fbfd1d067bfcc568784ff50259f1c66e2156894c","sha256:5fc77a5c53602669af1d036589066f0e2c4f86c682cac7a0b61b718492b7b024"],"state_sha256":"c525cf801d849d270d2eb3b78ddd4b2a054e5667f7302a2928d9d5485605b105"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2tyj9NcCyEj4gMJwjj96SCltnjKKxGVTEvrvEDDldY8UGp591DKXNtOChl8IkxC0PP+IRfrXpPs4mZCRigd4Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:01:04.310845Z","bundle_sha256":"d2ce0c0730dbeb48c37dbb0cf234195d4b72b6f42cbee67c4685e64a7d3cc1b6"}}