{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MW2RPWBK3VUI4WR2HOQ23GAWNR","short_pith_number":"pith:MW2RPWBK","schema_version":"1.0","canonical_sha256":"65b517d82add688e5a3a3ba1ad98166c7dce5368d6bebe18fee4450a3f6b3ca0","source":{"kind":"arxiv","id":"1709.02623","version":1},"attestation_state":"computed","paper":{"title":"Navigability of temporal networks in hyperbolic space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Elisenda Ortiz, M.\\'Angeles Serrano, Michele Starnini","submitted_at":"2017-09-08T09:58:17Z","abstract_excerpt":"Information routing is one of the main tasks in many complex networks with a communication function. Maps produced by embedding the networks in hyperbolic space can assist this task enabling the implementation of efficient navigation strategies. However, only static maps have been considered so far, while navigation in more realistic situations, where the network structure may vary in time, remain largely unexplored. Here, we analyze the navigability of real networks by using greedy routing in hyperbolic space, where the nodes are subject to a stochastic activation-inactivation dynamics. We fi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1709.02623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2017-09-08T09:58:17Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"e27b8651072ae7d3c101a62a4a92543b69b6842d2538d03a7f5a145c383f682b","abstract_canon_sha256":"311f94a2317138ff7bf963e671c0b9978089c166040c662cedea9928a5667bbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:45.205491Z","signature_b64":"vrijblORAoGoPYzthm7s/slYsQfcQF7RkUjpg10Y9zmOhtnLgou9GKKwpKCG5J2Js9+ZJIipl0/wUze4ZX6tDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65b517d82add688e5a3a3ba1ad98166c7dce5368d6bebe18fee4450a3f6b3ca0","last_reissued_at":"2026-05-18T00:35:45.204894Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:45.204894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Navigability of temporal networks in hyperbolic space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Elisenda Ortiz, M.\\'Angeles Serrano, Michele Starnini","submitted_at":"2017-09-08T09:58:17Z","abstract_excerpt":"Information routing is one of the main tasks in many complex networks with a communication function. Maps produced by embedding the networks in hyperbolic space can assist this task enabling the implementation of efficient navigation strategies. However, only static maps have been considered so far, while navigation in more realistic situations, where the network structure may vary in time, remain largely unexplored. Here, we analyze the navigability of real networks by using greedy routing in hyperbolic space, where the nodes are subject to a stochastic activation-inactivation dynamics. We fi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02623","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1709.02623","created_at":"2026-05-18T00:35:45.204984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.02623v1","created_at":"2026-05-18T00:35:45.204984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02623","created_at":"2026-05-18T00:35:45.204984+00:00"},{"alias_kind":"pith_short_12","alias_value":"MW2RPWBK3VUI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MW2RPWBK3VUI4WR2","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MW2RPWBK","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR","json":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR.json","graph_json":"https://pith.science/api/pith-number/MW2RPWBK3VUI4WR2HOQ23GAWNR/graph.json","events_json":"https://pith.science/api/pith-number/MW2RPWBK3VUI4WR2HOQ23GAWNR/events.json","paper":"https://pith.science/paper/MW2RPWBK"},"agent_actions":{"view_html":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR","download_json":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR.json","view_paper":"https://pith.science/paper/MW2RPWBK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.02623&json=true","fetch_graph":"https://pith.science/api/pith-number/MW2RPWBK3VUI4WR2HOQ23GAWNR/graph.json","fetch_events":"https://pith.science/api/pith-number/MW2RPWBK3VUI4WR2HOQ23GAWNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR/action/storage_attestation","attest_author":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR/action/author_attestation","sign_citation":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR/action/citation_signature","submit_replication":"https://pith.science/pith/MW2RPWBK3VUI4WR2HOQ23GAWNR/action/replication_record"}},"created_at":"2026-05-18T00:35:45.204984+00:00","updated_at":"2026-05-18T00:35:45.204984+00:00"}