{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ESC7FA7STGIHZQHA6ECSNMDK3M","short_pith_number":"pith:ESC7FA7S","schema_version":"1.0","canonical_sha256":"2485f283f299907cc0e0f10526b06adb2d3a5ad852f5fcae46ceb026b5736173","source":{"kind":"arxiv","id":"1306.0493","version":1},"attestation_state":"computed","paper":{"title":"Graph Metrics for Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Cecilia Mascolo, Giovanni Russo, John Tang, Mirco Musolesi, Vincenzo Nicosia, Vito Latora","submitted_at":"2013-06-03T16:35:54Z","abstract_excerpt":"Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causa"},"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":"1306.0493","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2013-06-03T16:35:54Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"35ce44d91317c68c81ddf7f6c7dd489623ec99f2516c41c931e38a363caf752d","abstract_canon_sha256":"993318181a69a6994e3716d2f3769c6faeb1812ba125f9a399de0fc5347e340d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:55.192715Z","signature_b64":"XQwCChxdFl46sceIwF1vnsOhoiRvuVn4pGJ0+IKgQD/aDOBi2VmZDgClVRzDIM2EpadXaaB7Kw5tSRoWEoqoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2485f283f299907cc0e0f10526b06adb2d3a5ad852f5fcae46ceb026b5736173","last_reissued_at":"2026-05-18T03:21:55.192243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:55.192243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graph Metrics for Temporal Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"Cecilia Mascolo, Giovanni Russo, John Tang, Mirco Musolesi, Vincenzo Nicosia, Vito Latora","submitted_at":"2013-06-03T16:35:54Z","abstract_excerpt":"Temporal networks, i.e., networks in which the interactions among a set of elementary units change over time, can be modelled in terms of time-varying graphs, which are time-ordered sequences of graphs over a set of nodes. In such graphs, the concepts of node adjacency and reachability crucially depend on the exact temporal ordering of the links. Consequently, all the concepts and metrics proposed and used for the characterisation of static complex networks have to be redefined or appropriately extended to time-varying graphs, in order to take into account the effects of time ordering on causa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0493","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":"1306.0493","created_at":"2026-05-18T03:21:55.192313+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0493v1","created_at":"2026-05-18T03:21:55.192313+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0493","created_at":"2026-05-18T03:21:55.192313+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESC7FA7STGIH","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESC7FA7STGIHZQHA","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESC7FA7S","created_at":"2026-05-18T12:27:43.054852+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/ESC7FA7STGIHZQHA6ECSNMDK3M","json":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M.json","graph_json":"https://pith.science/api/pith-number/ESC7FA7STGIHZQHA6ECSNMDK3M/graph.json","events_json":"https://pith.science/api/pith-number/ESC7FA7STGIHZQHA6ECSNMDK3M/events.json","paper":"https://pith.science/paper/ESC7FA7S"},"agent_actions":{"view_html":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M","download_json":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M.json","view_paper":"https://pith.science/paper/ESC7FA7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0493&json=true","fetch_graph":"https://pith.science/api/pith-number/ESC7FA7STGIHZQHA6ECSNMDK3M/graph.json","fetch_events":"https://pith.science/api/pith-number/ESC7FA7STGIHZQHA6ECSNMDK3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M/action/storage_attestation","attest_author":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M/action/author_attestation","sign_citation":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M/action/citation_signature","submit_replication":"https://pith.science/pith/ESC7FA7STGIHZQHA6ECSNMDK3M/action/replication_record"}},"created_at":"2026-05-18T03:21:55.192313+00:00","updated_at":"2026-05-18T03:21:55.192313+00:00"}