{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YQRW25IKMV7LXO26IC74XEQZHH","short_pith_number":"pith:YQRW25IK","canonical_record":{"source":{"id":"1802.01183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-04T19:37:42Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"3a90cd37a372af141ffac432dce2ed37a7374fdf63fff29be987ded1e00472d0","abstract_canon_sha256":"5c06e5e580cf2414580c4b33ee39372c2958e7b28710a9ac6fe5fc7a3834c695"},"schema_version":"1.0"},"canonical_sha256":"c4236d750a657ebbbb5e40bfcb921939f9515fb26ed08364b75eb1caedbead20","source":{"kind":"arxiv","id":"1802.01183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01183","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01183v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01183","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"YQRW25IKMV7L","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YQRW25IKMV7LXO26","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YQRW25IK","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YQRW25IKMV7LXO26IC74XEQZHH","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-04T19:37:42Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"3a90cd37a372af141ffac432dce2ed37a7374fdf63fff29be987ded1e00472d0","abstract_canon_sha256":"5c06e5e580cf2414580c4b33ee39372c2958e7b28710a9ac6fe5fc7a3834c695"},"schema_version":"1.0"},"canonical_sha256":"c4236d750a657ebbbb5e40bfcb921939f9515fb26ed08364b75eb1caedbead20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:27.107727Z","signature_b64":"9z3YtZDTMYUMN+3zwc0Q9i+VpQHfHybSZcieVxl4ihP9GjHftX7lQUqbuXuzEaYTb5sDrOAXGngS+CvBN9gSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4236d750a657ebbbb5e40bfcb921939f9515fb26ed08364b75eb1caedbead20","last_reissued_at":"2026-05-18T00:24:27.107084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:27.107084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01183","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:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZDQK/xIRtsnPf+3ihiLSXZXqyt/Z5mKnlnuPimMYG27CeDBlaX2kHXCHIc4U+eQl88y4DGsPMQUCQRrxp0MAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:17:00.874057Z"},"content_sha256":"830932d26e9e9aa81bb8c4c6950fba98535c9266f86d0d54e210f60103355db0","schema_version":"1.0","event_id":"sha256:830932d26e9e9aa81bb8c4c6950fba98535c9266f86d0d54e210f60103355db0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YQRW25IKMV7LXO26IC74XEQZHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Alessandro Muscoloni, Carlo Vittorio Cannistraci","submitted_at":"2018-02-04T19:37:42Z","abstract_excerpt":"The idea of minimum curvilinearity (MC) is that the hidden geometry of complex networks, in particular when they are sufficiently sparse, clustered, small-world and heterogeneous, can be efficiently navigated using the minimum spanning tree (MST), which is a greedy navigator. The local topological information drives the global geometrical navigation and the MST can be interpreted as a growing path that greedily maximizes local similarity between the nodes attached at each step by globally minimizing their overall distances in the network. This is also valid in absence of the network structure "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01183","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:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VNEwluOrblMo8W/LkDrQWJ7UQhNf8QejB083kV7nVDqe3jpAqvQmhnoBqi2Ec70gGj4Ks7bZsePX0U936FKFAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:17:00.874778Z"},"content_sha256":"f87cb0f03756c88ca15025cbe1804819aded0f0ea7cb0bfdb6f6ce015dc265f4","schema_version":"1.0","event_id":"sha256:f87cb0f03756c88ca15025cbe1804819aded0f0ea7cb0bfdb6f6ce015dc265f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQRW25IKMV7LXO26IC74XEQZHH/bundle.json","state_url":"https://pith.science/pith/YQRW25IKMV7LXO26IC74XEQZHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQRW25IKMV7LXO26IC74XEQZHH/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-11T08:17:00Z","links":{"resolver":"https://pith.science/pith/YQRW25IKMV7LXO26IC74XEQZHH","bundle":"https://pith.science/pith/YQRW25IKMV7LXO26IC74XEQZHH/bundle.json","state":"https://pith.science/pith/YQRW25IKMV7LXO26IC74XEQZHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQRW25IKMV7LXO26IC74XEQZHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YQRW25IKMV7LXO26IC74XEQZHH","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":"5c06e5e580cf2414580c4b33ee39372c2958e7b28710a9ac6fe5fc7a3834c695","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-04T19:37:42Z","title_canon_sha256":"3a90cd37a372af141ffac432dce2ed37a7374fdf63fff29be987ded1e00472d0"},"schema_version":"1.0","source":{"id":"1802.01183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01183","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01183v1","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01183","created_at":"2026-05-18T00:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"YQRW25IKMV7L","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YQRW25IKMV7LXO26","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YQRW25IK","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:f87cb0f03756c88ca15025cbe1804819aded0f0ea7cb0bfdb6f6ce015dc265f4","target":"graph","created_at":"2026-05-18T00:24:27Z","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":"The idea of minimum curvilinearity (MC) is that the hidden geometry of complex networks, in particular when they are sufficiently sparse, clustered, small-world and heterogeneous, can be efficiently navigated using the minimum spanning tree (MST), which is a greedy navigator. The local topological information drives the global geometrical navigation and the MST can be interpreted as a growing path that greedily maximizes local similarity between the nodes attached at each step by globally minimizing their overall distances in the network. This is also valid in absence of the network structure ","authors_text":"Alessandro Muscoloni, Carlo Vittorio Cannistraci","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-04T19:37:42Z","title":"Minimum curvilinear automata with similarity attachment for network embedding and link prediction in the hyperbolic space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01183","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:830932d26e9e9aa81bb8c4c6950fba98535c9266f86d0d54e210f60103355db0","target":"record","created_at":"2026-05-18T00:24:27Z","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":"5c06e5e580cf2414580c4b33ee39372c2958e7b28710a9ac6fe5fc7a3834c695","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-02-04T19:37:42Z","title_canon_sha256":"3a90cd37a372af141ffac432dce2ed37a7374fdf63fff29be987ded1e00472d0"},"schema_version":"1.0","source":{"id":"1802.01183","kind":"arxiv","version":1}},"canonical_sha256":"c4236d750a657ebbbb5e40bfcb921939f9515fb26ed08364b75eb1caedbead20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4236d750a657ebbbb5e40bfcb921939f9515fb26ed08364b75eb1caedbead20","first_computed_at":"2026-05-18T00:24:27.107084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:27.107084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9z3YtZDTMYUMN+3zwc0Q9i+VpQHfHybSZcieVxl4ihP9GjHftX7lQUqbuXuzEaYTb5sDrOAXGngS+CvBN9gSCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:27.107727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:830932d26e9e9aa81bb8c4c6950fba98535c9266f86d0d54e210f60103355db0","sha256:f87cb0f03756c88ca15025cbe1804819aded0f0ea7cb0bfdb6f6ce015dc265f4"],"state_sha256":"9c40e50365737e1fdf2e1792d888aa23ce3c2b69ca91c03e962dc791541f069c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UC7Lg/odYKWSeTOi8hZNJMoNiRRvRMtKG9PPYXY+PBM7GavN2FKkOJwbPgpXrl6dsCTYQ21GLb0ZDTnNKhL0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:17:00.879454Z","bundle_sha256":"bbe23170f29f3a73aaae745b9630231f3c2ac4b4ec01e6e8691826edfef5f515"}}