{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UEVO2G5NZZGALQBA5VSFAOUF5Z","short_pith_number":"pith:UEVO2G5N","canonical_record":{"source":{"id":"1709.07211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-21T08:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"98df731009932a9103652c0b5acd85673ea4107573dd5f12cffc220270fba16e","abstract_canon_sha256":"1d219f149870a499ae0762c1bb84a85094495cdf7fb3da4fa9a17ae119d6b590"},"schema_version":"1.0"},"canonical_sha256":"a12aed1badce4c05c020ed64503a85ee6d233d7879f67823e3e9f52e898864e2","source":{"kind":"arxiv","id":"1709.07211","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07211","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07211v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07211","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"UEVO2G5NZZGA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEVO2G5NZZGALQBA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEVO2G5N","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UEVO2G5NZZGALQBA5VSFAOUF5Z","target":"record","payload":{"canonical_record":{"source":{"id":"1709.07211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-21T08:38:42Z","cross_cats_sorted":[],"title_canon_sha256":"98df731009932a9103652c0b5acd85673ea4107573dd5f12cffc220270fba16e","abstract_canon_sha256":"1d219f149870a499ae0762c1bb84a85094495cdf7fb3da4fa9a17ae119d6b590"},"schema_version":"1.0"},"canonical_sha256":"a12aed1badce4c05c020ed64503a85ee6d233d7879f67823e3e9f52e898864e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:36.297207Z","signature_b64":"bHZJGf7FJYGHP44zu/vn2GED90rp06YbDTTL1JEqk98D+jY1u+n7Ze/i3jkPeO5R5T5k4nD+wDNb4Wj2pERZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a12aed1badce4c05c020ed64503a85ee6d233d7879f67823e3e9f52e898864e2","last_reissued_at":"2026-05-18T00:34:36.296739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:36.296739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.07211","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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0YX/fmUy045KICPWoOzZZG8lTuhhBAcOGArWN3jAXAEGYORGg67JCSKDZErDoVrwWnokGT9q8nSsg0hvlIYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:25:31.467001Z"},"content_sha256":"59fceb245a4813e062c8349060887a29a46ae2d5835db52e570569ae5df4a901","schema_version":"1.0","event_id":"sha256:59fceb245a4813e062c8349060887a29a46ae2d5835db52e570569ae5df4a901"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UEVO2G5NZZGALQBA5VSFAOUF5Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SimiNet: a Novel Method for Quantifying Brain Network Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"q-bio.NC","authors_text":"Ahmad Mheich (LTSI), Fabrice Wendling (LTSI), Mahmoud Hassan (LTSI), Mohamad Khalil, Olivier Dufor, Vincent Gripon (ELEC)","submitted_at":"2017-09-21T08:38:42Z","abstract_excerpt":"Quantifying the similarity between two networks is critical in many applications. A number of algorithms have been proposed to compute graph similarity, mainly based on the properties of nodes and edges. Interestingly, most of these algorithms ignore the physical location of the nodes, which is a key factor in the context of brain networks involving spatially defined functional areas. In this paper, we present a novel algorithm called \"SimiNet\" for measuring similarity between two graphs whose nodes are defined a priori within a 3D coordinate system. SimiNet provides a quantified index (rangin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07211","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:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATY1eCR9Erma38E8BFCEWsp/K3BBwRbuwf7cfKi32iZdtYdIqwTTsLzYIE8Wxo/STRYrahLNw5Er1kZWpEusCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T09:25:31.467372Z"},"content_sha256":"4b46426ca2a3b21e7512a33c34817311ecb02e3c7517fc8b88fdf8dd4dcd21ad","schema_version":"1.0","event_id":"sha256:4b46426ca2a3b21e7512a33c34817311ecb02e3c7517fc8b88fdf8dd4dcd21ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/bundle.json","state_url":"https://pith.science/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/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-29T09:25:31Z","links":{"resolver":"https://pith.science/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z","bundle":"https://pith.science/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/bundle.json","state":"https://pith.science/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UEVO2G5NZZGALQBA5VSFAOUF5Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UEVO2G5NZZGALQBA5VSFAOUF5Z","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":"1d219f149870a499ae0762c1bb84a85094495cdf7fb3da4fa9a17ae119d6b590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-21T08:38:42Z","title_canon_sha256":"98df731009932a9103652c0b5acd85673ea4107573dd5f12cffc220270fba16e"},"schema_version":"1.0","source":{"id":"1709.07211","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.07211","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1709.07211v1","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.07211","created_at":"2026-05-18T00:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"UEVO2G5NZZGA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UEVO2G5NZZGALQBA","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UEVO2G5N","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:4b46426ca2a3b21e7512a33c34817311ecb02e3c7517fc8b88fdf8dd4dcd21ad","target":"graph","created_at":"2026-05-18T00:34:36Z","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":"Quantifying the similarity between two networks is critical in many applications. A number of algorithms have been proposed to compute graph similarity, mainly based on the properties of nodes and edges. Interestingly, most of these algorithms ignore the physical location of the nodes, which is a key factor in the context of brain networks involving spatially defined functional areas. In this paper, we present a novel algorithm called \"SimiNet\" for measuring similarity between two graphs whose nodes are defined a priori within a 3D coordinate system. SimiNet provides a quantified index (rangin","authors_text":"Ahmad Mheich (LTSI), Fabrice Wendling (LTSI), Mahmoud Hassan (LTSI), Mohamad Khalil, Olivier Dufor, Vincent Gripon (ELEC)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-21T08:38:42Z","title":"SimiNet: a Novel Method for Quantifying Brain Network Similarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.07211","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:59fceb245a4813e062c8349060887a29a46ae2d5835db52e570569ae5df4a901","target":"record","created_at":"2026-05-18T00:34:36Z","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":"1d219f149870a499ae0762c1bb84a85094495cdf7fb3da4fa9a17ae119d6b590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.NC","submitted_at":"2017-09-21T08:38:42Z","title_canon_sha256":"98df731009932a9103652c0b5acd85673ea4107573dd5f12cffc220270fba16e"},"schema_version":"1.0","source":{"id":"1709.07211","kind":"arxiv","version":1}},"canonical_sha256":"a12aed1badce4c05c020ed64503a85ee6d233d7879f67823e3e9f52e898864e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a12aed1badce4c05c020ed64503a85ee6d233d7879f67823e3e9f52e898864e2","first_computed_at":"2026-05-18T00:34:36.296739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:36.296739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHZJGf7FJYGHP44zu/vn2GED90rp06YbDTTL1JEqk98D+jY1u+n7Ze/i3jkPeO5R5T5k4nD+wDNb4Wj2pERZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:36.297207Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.07211","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59fceb245a4813e062c8349060887a29a46ae2d5835db52e570569ae5df4a901","sha256:4b46426ca2a3b21e7512a33c34817311ecb02e3c7517fc8b88fdf8dd4dcd21ad"],"state_sha256":"fd005e858d1b81704bb71cae178ddd3d03c3b6eac5019e99902960597221bc5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0//xbplzwawwddpdwULWiHdpBi/fAXEDzHQftKXXWRCS05qKiMxPh5TR9iN5paHezUqTerwAMizj0Dj1IwWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T09:25:31.469292Z","bundle_sha256":"773b0d9068cb44f5325e4cc0555c231524bca8cc9882f4609254eac9b75d8742"}}