{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TQ2EW65BYKDSOFSW6EV7W7EAE2","short_pith_number":"pith:TQ2EW65B","canonical_record":{"source":{"id":"1704.00387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-02T23:32:14Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"e7fe2d02a8c95269527235a8f578029caaa35e1287f47ffad24bbb2798773240","abstract_canon_sha256":"6d169b7b7fa14ec1a4dfdae8728662f964f4609c7d8f0791ae4f32422a9a1fb5"},"schema_version":"1.0"},"canonical_sha256":"9c344b7ba1c287271656f12bfb7c802689c6499352ef62ca3078ef8a72119d1a","source":{"kind":"arxiv","id":"1704.00387","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00387","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00387v1","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00387","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"TQ2EW65BYKDS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TQ2EW65BYKDSOFSW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TQ2EW65B","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TQ2EW65BYKDSOFSW6EV7W7EAE2","target":"record","payload":{"canonical_record":{"source":{"id":"1704.00387","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-02T23:32:14Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"e7fe2d02a8c95269527235a8f578029caaa35e1287f47ffad24bbb2798773240","abstract_canon_sha256":"6d169b7b7fa14ec1a4dfdae8728662f964f4609c7d8f0791ae4f32422a9a1fb5"},"schema_version":"1.0"},"canonical_sha256":"9c344b7ba1c287271656f12bfb7c802689c6499352ef62ca3078ef8a72119d1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:24.604825Z","signature_b64":"7DkBGos4vfTE96SyH1V8uyksJgEEyaltxRPij3DJT4iozWO3toYyDLn7k7mbzHQwnRN9HL4V+dACDQawUYRIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c344b7ba1c287271656f12bfb7c802689c6499352ef62ca3078ef8a72119d1a","last_reissued_at":"2026-05-18T00:47:24.604093Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:24.604093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.00387","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-05-18T00:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHGa5JLxtbjwXzBfqplaWS6i3HSDqlR85c3rARX17xMXUW5r8F3iNdq4h2kcNXxE5bIASTsckNW5AshpQiTRBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:29:39.932660Z"},"content_sha256":"f6d641725ed739a4ea35024436a1eddc92176d416b196509d1dcee70c1e092d6","schema_version":"1.0","event_id":"sha256:f6d641725ed739a4ea35024436a1eddc92176d416b196509d1dcee70c1e092d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TQ2EW65BYKDSOFSW6EV7W7EAE2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Identifying networks with common organizational principles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"stat.ML","authors_text":"Anatol E. Wegner, Charlotte M. Deane, Gesine Reinert, Luis Ospina-Forero, Robert E. Gaunt","submitted_at":"2017-04-02T23:32:14Z","abstract_excerpt":"Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from simply comparing network summary statistics to sophisticated but computationally costly alignment-based approaches. Yet it remains challenging to accurately cluster networks that are of a different size and density, but hypothesized to be structurally similar. In this paper, we address this problem by introducing a new network comparison methodology that is aimed at identifying common organizational principles in ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00387","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":""},"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:47:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hSTR10PqNM6/bsCNmVhp1bEgV9pa0eiXvjCb9zStrPYRkRMlrjSIySELlYMOvyL9ThxtoEx1AtgUWDK4iZz9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:29:39.933012Z"},"content_sha256":"67c4837c7a1e1c17f5950cb3d2bdf9295854c7d9317257fb9b53b746cd05492d","schema_version":"1.0","event_id":"sha256:67c4837c7a1e1c17f5950cb3d2bdf9295854c7d9317257fb9b53b746cd05492d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/bundle.json","state_url":"https://pith.science/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/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-05-21T17:29:39Z","links":{"resolver":"https://pith.science/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2","bundle":"https://pith.science/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/bundle.json","state":"https://pith.science/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TQ2EW65BYKDSOFSW6EV7W7EAE2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TQ2EW65BYKDSOFSW6EV7W7EAE2","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":"6d169b7b7fa14ec1a4dfdae8728662f964f4609c7d8f0791ae4f32422a9a1fb5","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-02T23:32:14Z","title_canon_sha256":"e7fe2d02a8c95269527235a8f578029caaa35e1287f47ffad24bbb2798773240"},"schema_version":"1.0","source":{"id":"1704.00387","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00387","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00387v1","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00387","created_at":"2026-05-18T00:47:24Z"},{"alias_kind":"pith_short_12","alias_value":"TQ2EW65BYKDS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TQ2EW65BYKDSOFSW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TQ2EW65B","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:67c4837c7a1e1c17f5950cb3d2bdf9295854c7d9317257fb9b53b746cd05492d","target":"graph","created_at":"2026-05-18T00:47:24Z","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":"Many complex systems can be represented as networks, and the problem of network comparison is becoming increasingly relevant. There are many techniques for network comparison, from simply comparing network summary statistics to sophisticated but computationally costly alignment-based approaches. Yet it remains challenging to accurately cluster networks that are of a different size and density, but hypothesized to be structurally similar. In this paper, we address this problem by introducing a new network comparison methodology that is aimed at identifying common organizational principles in ne","authors_text":"Anatol E. Wegner, Charlotte M. Deane, Gesine Reinert, Luis Ospina-Forero, Robert E. Gaunt","cross_cats":["cs.SI","physics.soc-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-02T23:32:14Z","title":"Identifying networks with common organizational principles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00387","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:f6d641725ed739a4ea35024436a1eddc92176d416b196509d1dcee70c1e092d6","target":"record","created_at":"2026-05-18T00:47:24Z","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":"6d169b7b7fa14ec1a4dfdae8728662f964f4609c7d8f0791ae4f32422a9a1fb5","cross_cats_sorted":["cs.SI","physics.soc-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-02T23:32:14Z","title_canon_sha256":"e7fe2d02a8c95269527235a8f578029caaa35e1287f47ffad24bbb2798773240"},"schema_version":"1.0","source":{"id":"1704.00387","kind":"arxiv","version":1}},"canonical_sha256":"9c344b7ba1c287271656f12bfb7c802689c6499352ef62ca3078ef8a72119d1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9c344b7ba1c287271656f12bfb7c802689c6499352ef62ca3078ef8a72119d1a","first_computed_at":"2026-05-18T00:47:24.604093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:24.604093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7DkBGos4vfTE96SyH1V8uyksJgEEyaltxRPij3DJT4iozWO3toYyDLn7k7mbzHQwnRN9HL4V+dACDQawUYRIDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:24.604825Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00387","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6d641725ed739a4ea35024436a1eddc92176d416b196509d1dcee70c1e092d6","sha256:67c4837c7a1e1c17f5950cb3d2bdf9295854c7d9317257fb9b53b746cd05492d"],"state_sha256":"cb92f482d00d47e3b49f369f8f81509510b0d4f947bec77109031045a40b3110"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwAvdddJF94Dv2IKnMlkK0BlfCscC+n8S5ItIOhZE+p4PppK7E9LR0aCE6SHO9G7Nl6yuB8MMJz763m8QYDDBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:29:39.935500Z","bundle_sha256":"d7f489028876d2845c95709708312b49568f28c82b04b20b1a6924e1b91a5d29"}}